/*
 * $Id$
 */

package edu.jas.poly;


import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.List;

import edu.jas.structure.RingElem;


/**
 * Ordered list of vectors of polynomials. Mainly for storage and printing /
 * toString and conversions to other representations. Lists of polynomials in
 * this list are sorted according to the head terms of the first column.
 * @author Heinz Kredel
 */

public class OrderedModuleList> extends ModuleList {


    /**
     * Constructor.
     * @param r polynomial ring factory.
     * @param l list of list of polynomials.
     */
    public OrderedModuleList(GenPolynomialRing r, List>> l) {
        super(r, sort(r, ModuleList.padCols(r, l)));
    }


    /**
     * Comparison with any other object.
     * @see java.lang.Object#equals(java.lang.Object)
     */
    @Override
    @SuppressWarnings("unchecked")
    // not jet working
    public boolean equals(Object m) {
        if (!super.equals(m)) {
            return false;
        }
        OrderedModuleList ml = null;
        try {
            ml = (OrderedModuleList) m;
        } catch (ClassCastException ignored) {
        }
        if (ml == null) {
            return false;
        }
        // compare sorted lists
        // done already in super.equals()
        return true;
    }


    /**
     * Hash code for OrderedModuleList.
     * @see java.lang.Object#hashCode()
     */
    @Override
    public int hashCode() {
        return super.hashCode();
    }


    /**
     * Sort a list of vectors of polynomials with respect to the ascending order
     * of the leading Exponent vectors of the first column. The term order is
     * taken from the ring.
     * @param r polynomial ring factory.
     * @param l list of polynomial lists.
     * @return sorted list of polynomial lists from l.
     */
    @SuppressWarnings("unchecked")
    public static > List>> sort(GenPolynomialRing r,
                    List>> l) {
        if (l == null) {
            return l;
        }
        if (l.size() <= 1) { // nothing to sort
            return l;
        }
        final Comparator evc = r.tord.getAscendComparator();
        Comparator>> cmp = new Comparator>>() {


            public int compare(List> l1, List> l2) {
                int c = 0;
                for (int i = 0; i < l1.size(); i++) {
                    GenPolynomial p1 = l1.get(i);
                    GenPolynomial p2 = l2.get(i);
                    ExpVector e1 = p1.leadingExpVector();
                    ExpVector e2 = p2.leadingExpVector();
                    if (e1 == e2) {
                        continue;
                    }
                    if (e1 == null && e2 != null) {
                        return -1;
                    }
                    if (e1 != null && e2 == null) {
                        return 1;
                    }
                    if (e1 == null || e2 == null) { // for findbugs
                        continue; // cannot happen
                    }
                    if (e1.length() != e2.length()) {
                        if (e1.length() > e2.length()) {
                            return 1;
                        }
                        return -1;
                    }
                    c = evc.compare(e1, e2);
                    if (c != 0) {
                        return c;
                    }
                }
                return c;
            }
        };

        List>[] s = null;
        try {
            s = (List>[]) new List[l.size()];
            //System.out.println("s.length = " + s.length );
            //s = l.toArray(s); does not work
            //for ( int i = 0; i < l.size(); i++ ) {
            //    s[i] = l.get(i);
            //}
            int i = 0;
            for (List> p : l) {
                s[i++] = p;
            }
            Arrays.>> sort(s, cmp);
            return new ArrayList>>(Arrays.>> asList(s));
        } catch (ClassCastException ok) {
            System.out.println("Warning: polynomials not sorted");
        }
        return l; // unsorted
    }

}

 

Ads help maintain this website.