object GF2_192_Poly
- Alphabetic
- By Inheritance
- GF2_192_Poly
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
fromByteArray(coeff0: Array[Byte], moreCoeffs: Array[Byte]): GF2_192_Poly
Factory constructor -- same as GF2_192_Poly(coeff0, moreCoeffs)
Factory constructor -- same as GF2_192_Poly(coeff0, moreCoeffs)
- coeff0
byte array representing lowest coefficient (24 bytes)
- moreCoeffs
byte array with concatenation of byte-converted coefficients (24 bytes each) from degree 1 to the highest
- returns
new polynomial with the given coefficients
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
interpolate(points: Array[Byte], values: Array[GF2_192], valueAt0: GF2_192): GF2_192_Poly
Interpolates the polynomial at given points (and at point 0, if valueAt0!=null).
Interpolates the polynomial at given points (and at point 0, if valueAt0!=null). If points are not all distinct, or if 0 is in the points array and valueAt0!=null, behavior is undefined. valueAt0 is separated only for efficiency reason; the caller can treat 0 like any other point instead (i.e., the points array can include 0 if valueAt0==null, but computation will be slightly less efficient). If points is null, or values is null, or if lengths of points and values arrays differ, or if the arrays are 0 length and valueAt0 is null, returns null.
- points
the set of distinct inputs to the returned polynomial (last byte of the field element only; all other bits are assumed to be 0)
- values
values[i] will be the result evaluating the returned polynomial at points[i]. values[i] must not be null.
- valueAt0
if not null, then valueAt0 will be the result of evaluating the returned polynomial at 0
- returns
the unique lowest-degree polynomial p such that for every i, p(points[i]) = values[i] and p(0)=valueAt0 (if valueAt0!=null)
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()