Macaulay2 » Documentation
Packages » MonodromySolver :: PointArray
next | previous | forward | backward | up | index | toc

# PointArray -- a container for solutions

## 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.

## Methods that use an object of class PointArray:

- `appendPoint(PointArray,AbstractPoint)` -- see appendPoint -- append a point at the end of a PointArray
- `appendPoints(PointArray,List)` -- see appendPoints -- append a list of points at the end of a PointArray
- indices(PointArray) -- returns indices of a PointArray
- isMember(AbstractPoint,PointArray) -- test point membership in a PointArray
- isMember(AbstractPoint,PointArray,FunctionClosure) (missing documentation)
- length(PointArray) -- number of items stored in a PointArray
- net(PointArray) -- pretty printing

## For the programmer

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

The source of this document is in /build/macaulay2-88fgJW/macaulay2-1.25.11+ds/M2/Macaulay2/packages/MonodromySolver/Documentation.m2:704:0.