PointArray -- a container for numerical points

Description

PointArray is a data structure that organizes the solutions found by a solver. Each HomotopyNode object V has an associated PointArray accessed via V.PartialSols. A "fingerprinting" scheme allows for equality of points to be checked quickly.

i1 : A = pointArray {}

o1 = {}

o1 : PointArray

i2 : p = point {{0,0}}

o2 = p

o2 : Point

i3 : q = point {{1,0}}

o3 = q

o3 : Point

i4 : r = point {{0,1}}

o4 = r

o4 : Point

i5 : appendPoint(A,p)

o5 = p

o5 : Point

i6 : length A

o6 = 1

i7 : appendPoints(A,{q,r})

i8 : net A

o8 = {PointArray( 3 points: 0 2 1 ), p, q, r}

i9 : length A

o9 = 3

i10 : indices A

o10 = {0, 1, 2}

o10 : List

i11 : member(q,A)

o11 = true

Methods that use an object of class PointArray:

isMember(AbstractPoint,PointArray,FunctionClosure) (missing documentation)
appendPoint(PointArray,AbstractPoint)
appendPoints(PointArray,List)
indices(PointArray)
isMember(AbstractPoint,PointArray)
length(PointArray)
net(PointArray)

For the programmer

The object PointArray is a type, with ancestor classes MutableHashTable < HashTable < Thing.

The source of this document is in /build/reproducible-path/macaulay2-1.26.06+ds/M2/Macaulay2/packages/MonodromySolver/Documentation.m2:711:0.