cc.redberry.core.transformations.factor.jasfactor.edu.jas.poly.PolynomialList Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of core Show documentation
Show all versions of core Show documentation
Redberry is an open source computer algebra system designed for tensor
manipulation. It implements basic computer algebra system routines as well as
complex tools for real computations in physics.
This is Redberry core, which contains the implementation of the basic
computer algebra routines and general-purpose transformations.
The newest version!
/*
* JAS: Java Algebra System.
*
* Copyright (c) 2000-2014:
* Heinz Kredel
*
* This file is part of Java Algebra System (JAS).
*
* JAS is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 2 of the License, or
* (at your option) any later version.
*
* JAS is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with JAS. If not, see >
implements Comparable>, Serializable {
/**
* The factory for the solvable polynomial ring.
*/
public final GenPolynomialRing ring;
/**
* The data structure is a List of polynomials.
*/
public final List> list;
/**
* Constructor.
*
* @param r polynomial ring factory.
* @param l list of polynomials.
*/
public PolynomialList(GenPolynomialRing r,
List> l) {
ring = r;
list = l;
}
/**
* Copy this.
*
* @return a copy of this.
*/
public PolynomialList copy() {
return new PolynomialList<>(ring, new ArrayList<>(list));
}
/**
* Comparison with any other object.
*
* @see java.lang.Object#equals(java.lang.Object)
*/
@Override
@SuppressWarnings("unchecked")
public boolean equals(Object p) {
if (!(p instanceof PolynomialList)) {
return false;
}
PolynomialList pl = null;
try {
pl = (PolynomialList) p;
} catch (ClassCastException ignored) {
}
if (pl == null) {
return false;
}
if (!ring.equals(pl.ring)) {
return false;
}
return (compareTo(pl) == 0);
// otherwise tables may be different
}
/**
* Polynomial list comparison.
*
* @param L other PolynomialList.
* @return lexicographical comparison, sign of first different polynomials.
*/
public int compareTo(PolynomialList L) {
int si = L.list.size();
if (list.size() < si) { // minimum
si = list.size();
}
int s = 0;
List> l1 = OrderedPolynomialList.sort(ring, list);
List> l2 = OrderedPolynomialList.sort(ring, L.list);
for (int i = 0; i < si; i++) {
GenPolynomial a = l1.get(i);
GenPolynomial b = l2.get(i);
s = a.compareTo(b);
if (s != 0) {
return s;
}
}
if (list.size() > si) {
return 1;
}
if (L.list.size() > si) {
return -1;
}
return s;
}
/**
* Hash code for this polynomial list.
*
* @see java.lang.Object#hashCode()
*/
@Override
public int hashCode() {
int h;
h = ring.hashCode();
h = 37 * h + (list == null ? 0 : list.hashCode());
return h;
}
/**
* String representation of the polynomial list.
*
* @see java.lang.Object#toString()
*/
@Override
public String toString() {
StringBuilder erg = new StringBuilder();
String[] vars = null;
if (ring != null) {
erg.append(ring.toString());
vars = ring.getVars();
}
boolean first = true;
erg.append("\n(\n");
String sa = null;
for (GenPolynomial oa : list) {
if (vars != null) {
sa = oa.toString(vars);
} else {
sa = oa.toString();
}
if (first) {
first = false;
} else {
erg.append(", ");
if (sa.length() > 10) {
erg.append("\n");
}
}
erg.append("( ").append(sa).append(" )");
}
erg.append("\n)");
return erg.toString();
}
}