PolygonLikeDbl2PairArr

The final type of this object.

Returns the specialist sequence collection for the A1s. Probably not required most of the time but the method is included for completeness.

Backing Array for the A1 components of the pairs. In this case the elements of that array are themselves Arrays of Doubles.

Treats this PairArrFinalA1 as a Map with the A1 values as a the key. Returns None if the key value is absent. If you are certain that this pair sequence contains the A1 key, use the a1GetA2 method.

Constructs a value of type A1 from an Array[Double]

Treats this PairArrFinalA1 as a Map with the A1 values as a the key. Will throw an exception if the given A1 value is not found. If you are uncertain whether this pair sequence contains the A1 key value, use the safe a1FindA2 method.

Indexes the first component of the pair.

Maps the first component of the pairs, dropping the second.

Returns the specialist sequence collection for the A2s, as determined by implicit look up. Probably not required most of the time but the method is included for completeness.

The Array for the A2 components of the pairs. Should be rarely reuired by end user. The a2Arr and the a2RArr methods are generally preferred.

Treats this PairArrFinalA1 as a Map with the A2 values as a the key. Returns None if the key value is absent. If you are certain that this pair sequence contains the A2 key, use the a2GetA1 method.

Treats this PairArrFinalA1 as a Map with the A2 values as a the key. Will throw an exception if the given A2 value is not found. If you are uncertain whether this pair sequence contains the A2 key, use the safe a2FindA1 method.

Indexes the second component of the pair.

Maps the second component of the pairs, dropping the first.

Returns an RArr of the A2s, even if a better more specialist collection exists for the type. Probably not required most of the time but the method is included for completeness.

Accesses the defining sequence element by a 0 based index.

Collects values of B by applying partial function to only those elements of A, for which the PartialFunction is defined.

Returns true if this sequence contains a value equal to the parameter value. The passed vvalue for equivlence testing an be a super type of the collection type.

Applies an index to this ArrayLike collection which cycles back to element 0, when it reaches the end of the collection. Accepts even negative integers as an index value without throwing an exception.

The element String allows the composition of toString for the whole collection. The syntax of the output will be reworked.

Is this sequence empty?

Tests if the condition exists for any element of this sequence.

Counts the number of elements that fulfil the condition A => Boolean

Gives the maximum value of type B, produced by applying the function from A to B on each element of this collection, or the default value if the collection is empty.

Gives the minimum value of type B, produced by applying the function from A to B on each element of this collection, or the default value if the collection is empty.

filters this sequence using a predicate upon the A1 components of the pairs.

Tries to find te first element of this sequence conforming to the predicate.

Takes a function that returns an EMon and returns the first Good.

Specialised flatMap to a Arr.

Maps each A1 to an Arr[B1] combines each of those new B1s with the same old A2 to produce a PairArrFinalA1 of PairFinalA1Elem[B1, A2]. Then flattens these new PairArrFinalA1s to make a single PairArrFinalA1

Maps over a function from A to any Iterable and flattens the result into an RArr[A].

Folds over this sequence starting with the initial value

Folds left to a String accumulator with an initial value of the empty string. The first parameter is a function from A tp String. The second parameter is a separator String the 2nd and subsequent A => String values.

Returns true if the predicate holds true for all values of this sequence, else retruns false.

Performs a side effecting function on each element of this sequence in order. The function may return Unit. If it does return a non Unit value it is discarded. The [U] type parameter is there just to avoid warnings about discarded values and can be ignored by method users.

The first element of this sequence.

Returns the Some of the first element unless the sequence is empty in which case it returns None.

Folds over the non existence / existence of a head element. The first parameter is a value for an empty sequence, the second parameter passed as a separate parameter list is a function on the head element.

Folds over the non existence / existence of a head element. If the sequence is nonEmpty applies toString to head element else returns the noHead parameter string.

Index with element flatMap. Applies the parameter function to the index and each respective element of this sequence. The function returns a Arr of elements of type B and the method as a whole flattens and then returns the specialised Arr of type B. The method has 2 versions / name overloads. The default start for the index is 0 if just the function parameter is passed. The second version name overload takes an Int for the first parameter list, to set the start value of the index. Note the function signature follows the foreach based convention of putting the collection element 2nd or last as seen for example in fold methods' (accumulator, element) => B signature. Ideally this method should be overridden in sub classes.

Index with element flatMap. Applies the parameter function to the index and each respective element of this sequence. The function returns a Arr of elements of type B and the method as a whole flattens and then returns the specialised Arr of type B. The method has 2 versions / name overloads. The default start for the index is 0 if just the function parameter is passed. The second version name overload takes an Int for the first parameter list, to set the start value of the index. Note the function signature follows the foreach based convention of putting the collection element 2nd or last as seen for example in fold methods' (accumulator, element) => B signature. Ideally this method should be overridden in sub classes.

Note the function signature follows the foreach based convention of putting the collection element 2nd or last as seen for example in fold methods' (accumulator, element) => B signature.

Index with foreach. Performs a side effecting function on the index and each element of this sequence. It takes a function as a parameter. The function may return Unit. If it does return a non Unit value it is discarded. The [U] type parameter is there just to avoid warnings about discarded values and can be ignored by method users. The method has 2 versions / name overloads. The default start for the index is 0 if just the function parameter is passed. The second version name overload takes an Int for the first parameter list, to set the start value of the index. Note the function signature follows the foreach based convention of putting the collection element 2nd or last as seen for example in fold methods' (accumulator, element) => B signature.

Index with foreach. Performs a side effecting function on the index and each element of this sequence. It takes a function as a parameter. The function may return Unit. If it does return a non Unit value it is discarded. The [U] type parameter is there just to avoid warnings about discarded values and can be ignored by method users. The method has 2 versions / name overloads. The default start for the index is 0 if just the function parameter is passed. The second version name overload takes an Int for the first parameter list, to set the start value of the index. Note the function signature follows the foreach based convention of putting the collection element 2nd or last as seen for example in fold methods' (accumulator, element) => B signature.

Index with element map. Applies the parameter function to the index and each respective element of this sequence. The function returns an element of type B and the method as a whole returns the specialised Arr of type B. The method has 2 versions / name overloads. The default start for the index is 0 if just the function parameter is passed. The second version name overload takes an Int for the first parameter list, to set the start value of the index. Note the function signature follows the foreach based convention of putting the collection element 2nd or last as seen for example in fold methods' (accumulator, element) => B signature. Ideally this method should be overridden in sub classes.

Index with element map. Applies the parameter function to the index and each respective element of this sequence. The function returns an element of type B and the method as a whole returns the specialised Arr of type B. The method has 2 versions / name overloads. The default start for the index is 0 if just the function parameter is passed. The second version name overload takes an Int for the first parameter list, to set the start value of the index. Note the function signature follows the foreach based convention of putting the collection element 2nd or last as seen for example in fold methods' (accumulator, element) => B signature. This method should be overridden in sub classes.

if this Sequ is nonEmpty performs the side effecting function on the head. If empty procedure is applied.

like the apply method accesses the defining sequence element by a 0 based index, but cycles around for indexes less that 0 and equal or greater than index length.

A map operation on the range of indexed values, where the return type of the SeqLike is explicitly given by the the first parameter.

Performs a side effecting function on each element of the range of index values for this sequence in order. The function may return Unit. If it does return a non Unit value it is discarded. The [U] type parameter is there just to avoid warnings about discarded values and can be ignored by method users.

Return the index of the first element where predicate is true, or -1 if predicate not true forall.

Performs a side effecting function on each element of this sequence excluding the last. The function may return Unit. If it does return a non Unit value it is discarded. The [U] type parameter is there just to avoid warnings about discarded values and can be ignored by method users.

The last element of this sequence.

Returns the Some of the last element unless the sequence is empty in which case it returns None.

Folds over the non existence / existence of a last element. The first parameter is a value for an empty sequence, the second parameter passed as a separate parameter list is a function on the last element.

Just a handy short cut to give the length of this collection as a string.

The length of this Sequence. This will have the same value as the dataLength property inherited from SeqLike[A].

Specialised map to an immutable Arr of B. Applies the supplied function to every element of this sequence.

map 2 elements of A to 1 element of B. Ignores the last element on a collection of odd numbered length.

Maps to an Array.

maps from A to EMon[B], collects the good values.

Map from A => EMon[B]. There is a name overload that implicitly takes a narrower BuilderArrMap as the second parameter list.

Map from A => EMon[B]. implicitly takes a BuilderArrMap. There is a name overload that explicitly takes a more flexible BuilderCollMap as the first parameter list.

Map from A => B, retuening an EMon of List.

maps ValueProduct collection to List

Maps the sequence of pairs to a new sequence of pairs, but leaving the second component of the pairs unchanged.

Specialised map to an immutable PairArrFinalA1 of B. Applies the supplied function to every element of this sequence.

A map operation where the return type of the SeqLike is explicitly given by the the second type parameter.

Takes a function from A to EMon[B]. If the function applied to eqch element produces a single Good, it is returned else returns Bad.

Gives the maximum value of this sequence according to the implicit ordering type class instance, which can be passed explicitly.

Gives the minimum value of this sequence according to the implicit ordering type class instance, which can be passed explicitly.

Not sure about this method.

Constructs a new instance of the class's final type from an Array of Array[Double]s and an Array of type A2.

Is this sequence non empty?

Takes a map function from A to Option[B] but only returns the [[Arr] of B if all the elements map to a Some. Hence the ArrB if returned will be the same length as this sequence.

Specialised opt map to an immutable Arr of B. Applies the supplied function to every element of this sequence.

Takes a function from A1 to Option[B1]. The None results are filtered out the B1 values of the sum are paired with their old corresponding A2 values to make the new pairs of type PairFinalA1Elem[B1, A2]. For an RPairArr return type use the optMapRefOnA1 method.

Just a flatMap method that avoids unnecessarily constructing the pairs and takes a function from the components to te parameter type ArrB.

Just a map method that avoids unnecessarily constructing the pairs and takes a function from the components to te parameter type B.

Maps this to a new [PolygonLikePairArr]] by mapping PolygonLikes to new PolygonLikes of type B1 leaving the second parts of the pairs unchanged.

Returns a copy of this PairArrFinalA1 where the A1 component is replaced for any pairs where the A2 value matches the given parameter. this method treats the PairArrFinalA1 as a Scala Map class with the A2s as the keys and the A1s as the values.

Method for keeping the typer happy when returning this as an instance of ThisT.

Performs a side effecting function on each element of this sequence in reverse order. The function may return Unit. If it does return a non Unit value it is discarded. The [U] type parameter is there just to avoid warnings about discarded values and can be ignored by method users.

Note the function signature follows the foreach based convention of putting the collection element 2nd or last as seen for example in fold methods' (accumulator, element) => B signature.

Sets / mutates an element in the Arr. This method should rarely be needed by end users, but is used by the initialisation and factory methods.

Sets / mutates elements in the Arr. This method should rarely be needed by end users, but is used by the initialisation and factory methods.

Returns a new Arr sorted from least to greatest. Takes a function detrmining if the first value is greater than the second.

Performs a side effecting function on each element of the specifying sequence in order.

Sums aaccumulating the results of the A => Int function.

Foreachs over the tail of this sequence. Performs a side effecting function on each element of this sequence excluding the first.

foldLeft over the tail of this sequence.

Converts this SeqGen to a list.

Returns a string representation of the object.

The default representation is platform dependent.

String specifying the type of this object.

Returns a new uninitialised PairArrFinalA1 of the same final type.

Sets / mutates the head element in the Arr. This method should rarely be needed by end users, but is used by initialisation and factory methods.

Sets / mutates the last element in the Arr. This method should rarely be needed by end users, but is used by initialisation and factory methods.

Takes a second collection as a parameter and zips the elements of this collection and the operand collection and applies the specialised map function from type A and type B to type C.

Takes a second collection and third collections as parameters and zips the elements of this collection and the operand collections and applies the specialised map function from type A and type B and type C to type D.