| | Name | Description |
|---|
  | AddAllK(DictionaryK, SetValueType, DictionaryK, SetValueType) | |
| AddAllT(ListT, ListT) | |
| And(IList) | |
| And(ListBoolean) | |
| ArrayAsDeque(IList) |
Creates a new deque containing all values from the given list.
|
| ArrayAsDequeV(ListV) |
Creates a new deque containing all values from the given list.
|
| ArrayAsMap(IList) |
Creates a new dictionary representing a map containing all values from the given list, mapped to by their index.
|
| ArrayAsMapV(ListV) |
Creates a new dictionary representing a map containing all values from the given list, mapped to by their index.
|
| ArrayAsSetV |
Creates a new dictionary representing a set containing all values from the given list.
|
| ArrayAsString(IList, String) | |
| ArrayAsString(ListString, String) | |
| ArrayGroup(IList) |
Creates a new array containing the content of the old array with equal elements grouped together.
|
| ArrayGroupV(ListV) |
Creates a new array containing the content of the old array with equal elements grouped together.
|
| ArrayKeepOneForEach(IList) |
Creates a new array containing the content of the old array but freed of duplicates.
|
| ArrayKeepOneForEachV(ListV) |
Creates a new array containing the content of the old array but freed of duplicates.
|
| ArrayOrDequeAsSet |
Creates a new dictionary representing a set containing all values from the given list or deque.
|
| ArrayOrderAscending(IList) |
Creates a new array containing the content of the old array but sorted.
|
| ArrayOrderAscending(ListString) |
Creates a new array containing the content of the old array but sorted.
|
| ArrayOrderAscendingV(ListV) |
Creates a new array containing the content of the old array but sorted.
|
| ArrayOrderDescending(IList) |
Creates a new array containing the content of the old array but sorted.
|
| ArrayOrderDescending(ListString) |
Creates a new array containing the content of the old array but sorted.
|
| ArrayOrderDescendingV(ListV) |
Creates a new array containing the content of the old array but sorted.
|
| ArrayReverse(IList) |
Creates a new array containing the content of the old array but reversed.
|
| ArrayReverseV(ListV) |
Creates a new array containing the content of the old array but reversed.
|
| AsArray |
Creates a new list containing all values from the given dictionary representing a set.
|
| AssignAttribute | |
| AssignAttributeIndexed | |
| Avg(IList) | |
| Avg(ListDouble) | |
| Avg(ListInt16) | |
| Avg(ListInt32) | |
| Avg(ListInt64) | |
| Avg(ListSByte) | |
| Avg(ListSingle) | |
| Clone |
Creates a shallow clone of the given container.
|
| ConcatenateV(DequeV, DequeV) |
Creates a new deque and appends all values first from
a and then from b.
|
| ConcatenateV(ListV, ListV) |
Creates a new dynamic array and appends all values first from
a and then from b.
|
| ConcatenateChangedV(DequeV, DequeV) |
Appends all values from deque b to a.
|
| ConcatenateChangedV(ListV, ListV) |
Appends all values from dynamic array b to a.
|
| ConcatenateChangedV(DequeV, DequeV, IGraph, IEdge, AttributeType) |
Appends all values from deque b to a.
|
| ConcatenateChangedV(DequeV, DequeV, IGraph, INode, AttributeType) |
Appends all values from deque b to a.
|
| ConcatenateChangedV(ListV, ListV, IGraph, IEdge, AttributeType) |
Appends all values from dynamic array b to a.
|
| ConcatenateChangedV(ListV, ListV, IGraph, INode, AttributeType) |
Appends all values from dynamic array b to a.
|
| ConcatenateIDeque | |
| ConcatenateIList | |
| ContainerAccess | |
| ContainerAddAll | |
| ContainerEmpty | |
| ContainerSize | |
| ConvertIfEmptyT | |
| Copy(IDeque, IGraph, IDictionaryObject, Object) | |
| Copy(IDictionary, IGraph, IDictionaryObject, Object) | |
| Copy(IList, IGraph, IDictionaryObject, Object) | |
| Copy(Object, IGraph, IDictionaryObject, Object) |
Creates a deep copy of the given container.
|
| CopyT(DequeT, IGraph, IDictionaryObject, Object) | |
| CopyT(ListT, IGraph, IDictionaryObject, Object) | |
| CopyK, V(DictionaryK, V, IGraph, IDictionaryObject, Object) | |
| DeeplyEqual(IAttributeBearer, IAttributeBearer, IDictionaryObject, Object) | |
| DeeplyEqual(IDeque, IDeque, IDictionaryObject, Object) | |
| DeeplyEqual(IDictionary, IDictionary, IDictionaryObject, Object) | |
| DeeplyEqual(IList, IList, IDictionaryObject, Object) | |
| DeeplyEqualArrayAttributeBearerV | |
| DeeplyEqualArrayObjectV | |
| DeeplyEqualDequeAttributeBearerV | |
| DeeplyEqualDequeObjectV | |
| DeeplyEqualMap(IDictionary, IDictionary, IDictionaryObject, Object, IDictionaryIAttributeBearer, Object, IDictionaryIAttributeBearer, Object) | |
| DeeplyEqualMap(IDictionary, IDictionary, IDictionaryObject, Object, IDictionaryObject, Object, IDictionaryObject, Object) | |
| DeeplyEqualMapK, V(DictionaryK, V, DictionaryK, V, IDictionaryObject, Object, IDictionaryIAttributeBearer, Object, IDictionaryIAttributeBearer, Object) | |
| DeeplyEqualMapK, V(DictionaryK, V, DictionaryK, V, IDictionaryObject, Object, IDictionaryObject, Object, IDictionaryObject, Object) | |
| DeeplyEqualSet(IDictionary, IDictionary, IDictionaryObject, Object, IDictionaryIAttributeBearer, Object, IDictionaryIAttributeBearer, Object) | |
| DeeplyEqualSet(IDictionary, IDictionary, IDictionaryObject, Object, IDictionaryObject, Object, IDictionaryObject, Object) | |
| DeeplyEqualSetV(DictionaryV, SetValueType, DictionaryV, SetValueType, IDictionaryObject, Object, IDictionaryIAttributeBearer, Object, IDictionaryIAttributeBearer, Object) | |
| DeeplyEqualSetV(DictionaryV, SetValueType, DictionaryV, SetValueType, IDictionaryObject, Object, IDictionaryObject, Object, IDictionaryObject, Object) | |
| DequeAsArray(IDeque) |
Creates a new list representing an array containing all values from the given deque.
|
| DequeAsArrayV(DequeV) |
Creates a new list representing an array containing all values from the given deque.
|
| DequeAsSetV |
Creates a new dictionary representing a set containing all values from the given list.
|
| Dev(IList) | |
| Dev(ListDouble) | |
| Dev(ListInt16) | |
| Dev(ListInt32) | |
| Dev(ListInt64) | |
| Dev(ListSByte) | |
| Dev(ListSingle) | |
| Domain(IDictionary) | |
| DomainK, V(DictionaryK, V) |
Creates a new dictionary representing a set,
containing all keys from the given dictionary representing a map map.
|
| EqualV(DequeV, DequeV) |
Checks if Deque a equals Deque b.
Requires same values at same position for being true.
|
| EqualV(ListV, ListV) |
Checks if List a equals List b.
Requires same values at same index for being true.
|
| EqualK, V(DictionaryK, V, DictionaryK, V) |
Checks if set/map a equals set/map b.
For a map, key and value must be same to be equal.
|
| EqualIDeque | |
| EqualIDictionary |
Checks if set/map a equals set/map b.
For a map, key and value must be same to be equal.
|
| EqualIList | |
| Except(IDictionary, IDictionary) | |
| ExceptK, V, W(DictionaryK, V, DictionaryK, W) |
Creates a new dictionary containing all key/value pairs from
a whose keys are not contained in b.
|
| ExceptChangedK, W(DictionaryK, SetValueType, DictionaryK, W, IGraph, IEdge, AttributeType) |
Removes all key/value pairs from set a whose keys are contained in b.
|
| ExceptChangedK, W(DictionaryK, SetValueType, DictionaryK, W, IGraph, INode, AttributeType) |
Removes all key/value pairs from set a whose keys are contained in b.
|
| ExceptChangedK, V, W(DictionaryK, V, DictionaryK, W) |
Removes all key/value pairs from set/map a whose keys are contained in b.
|
| ExceptChangedK, V, W(DictionaryK, V, DictionaryK, W, IGraph, IEdge, AttributeType) |
Removes all key/value pairs from map a whose keys are contained in b.
|
| ExceptChangedK, V, W(DictionaryK, V, DictionaryK, W, IGraph, INode, AttributeType) |
Removes all key/value pairs from map a whose keys are contained in b.
|
| Extract | |
| FillArray(IList, String, IList, IGraphModel) | |
| FillArray(IList, String, Object, IGraphModel) | |
| FillArrayK(ListK, String, IList, IGraphModel) | |
| FillArrayK(ListK, String, Object, IGraphModel) | |
| FillArrayWithEdge(IList, EdgeType, IList) | |
| FillArrayWithEdgeK(ListK, EdgeType, IList) | |
| FillArrayWithNode(IList, NodeType, IList) | |
| FillArrayWithNodeK(ListK, NodeType, IList) | |
| FillArrayWithVar(IList, Type, IList) | |
| FillArrayWithVarK(ListK, Type, IList) | |
| FillDeque(IDeque, String, IDeque, IGraphModel) | |
| FillDeque(IDeque, String, Object, IGraphModel) | |
| FillDequeK(DequeK, String, IDeque, IGraphModel) | |
| FillDequeK(DequeK, String, Object, IGraphModel) | |
| FillDequeWithEdge(IDeque, EdgeType, IDeque) | |
| FillDequeWithEdgeK(DequeK, EdgeType, IDeque) | |
| FillDequeWithNode(IDeque, NodeType, IDeque) | |
| FillDequeWithNodeK(DequeK, NodeType, IDeque) | |
| FillDequeWithVar(IDeque, Type, IDeque) | |
| FillDequeWithVarK(DequeK, Type, IDeque) | |
| FillMap(IDictionary, String, String, IDictionary, IGraphModel) | |
| FillMap(IDictionary, String, String, Object, IGraphModel) | |
| FillMapK, V(DictionaryK, V, String, String, IDictionary, IGraphModel) | |
| FillMapK, V(DictionaryK, V, String, String, Object, IGraphModel) | |
| FillMapWithKeyEdge(IDictionary, EdgeType, String, IDictionary, IGraphModel) | |
| FillMapWithKeyEdgeK, V(DictionaryK, V, EdgeType, String, IDictionary, IGraphModel) | |
| FillMapWithKeyEdgeValueEdge(IDictionary, EdgeType, EdgeType, IDictionary) | |
| FillMapWithKeyEdgeValueEdgeK, V(DictionaryK, V, EdgeType, EdgeType, IDictionary) | |
| FillMapWithKeyEdgeValueNode(IDictionary, EdgeType, NodeType, IDictionary) | |
| FillMapWithKeyEdgeValueNodeK, V(DictionaryK, V, EdgeType, NodeType, IDictionary) | |
| FillMapWithKeyEdgeValueVar(IDictionary, EdgeType, Type, IDictionary) | |
| FillMapWithKeyEdgeValueVarK, V(DictionaryK, V, EdgeType, Type, IDictionary) | |
| FillMapWithKeyNode(IDictionary, NodeType, String, IDictionary, IGraphModel) | |
| FillMapWithKeyNodeK, V(DictionaryK, V, NodeType, String, IDictionary, IGraphModel) | |
| FillMapWithKeyNodeValueEdge(IDictionary, NodeType, EdgeType, IDictionary) | |
| FillMapWithKeyNodeValueEdgeK, V(DictionaryK, V, NodeType, EdgeType, IDictionary) | |
| FillMapWithKeyNodeValueNode(IDictionary, NodeType, NodeType, IDictionary) | |
| FillMapWithKeyNodeValueNodeK, V(DictionaryK, V, NodeType, NodeType, IDictionary) | |
| FillMapWithKeyNodeValueVar(IDictionary, NodeType, Type, IDictionary) | |
| FillMapWithKeyNodeValueVarK, V(DictionaryK, V, NodeType, Type, IDictionary) | |
| FillMapWithKeyVar(IDictionary, Type, String, IDictionary, IGraphModel) | |
| FillMapWithKeyVarK, V(DictionaryK, V, Type, String, IDictionary, IGraphModel) | |
| FillMapWithKeyVarValueEdge(IDictionary, Type, EdgeType, IDictionary) | |
| FillMapWithKeyVarValueEdgeK, V(DictionaryK, V, Type, EdgeType, IDictionary) | |
| FillMapWithKeyVarValueNode(IDictionary, Type, NodeType, IDictionary) | |
| FillMapWithKeyVarValueNodeK, V(DictionaryK, V, Type, NodeType, IDictionary) | |
| FillMapWithKeyVarValueVar(IDictionary, Type, Type, IDictionary) | |
| FillMapWithKeyVarValueVarK, V(DictionaryK, V, Type, Type, IDictionary) | |
| FillSet(IDictionary, String, IDictionary, IGraphModel) | |
| FillSet(IDictionary, String, Object, IGraphModel) | |
| FillSetK(DictionaryK, SetValueType, String, IDictionary, IGraphModel) | |
| FillSetK(DictionaryK, SetValueType, String, Object, IGraphModel) | |
| FillSetWithEdge(IDictionary, EdgeType, IDictionary) | |
| FillSetWithEdgeK(DictionaryK, SetValueType, EdgeType, IDictionary) | |
| FillSetWithNode(IDictionary, NodeType, IDictionary) | |
| FillSetWithNodeK(DictionaryK, SetValueType, NodeType, IDictionary) | |
| FillSetWithVar(IDictionary, Type, IDictionary) | |
| FillSetWithVarK(DictionaryK, SetValueType, Type, IDictionary) | |
| GetAttributeOrElementOfMatch | |
| GetDequeType(Object, Type) |
If deque is Deque, the Deque is returned together with its value type
|
| GetDequeType(Type, Type) |
The value type of the Deque is returned
|
| GetDictionaryTypes(Object, Type, Type) |
If dict is dictionary, the dictionary is returned together with its key and value type
|
| GetDictionaryTypes(Type, Type, Type) |
The key and value types are returned of the dictionary
|
| GetListType(Object, Type) |
If array is List, the List is returned together with its value type
|
| GetListType(Type, Type) |
The value type of the List is returned
|
| GreaterOrEqualV(DequeV, DequeV) |
Checks if Deque a is a superdeque of b.
Requires a to contain more or same number of entries than b and same values at same position for being true.
|
| GreaterOrEqualV(ListV, ListV) |
Checks if List a is a superlist of b.
Requires a to contain more or same number of entries than b and same values at same index for being true.
|
| GreaterOrEqualK, V(DictionaryK, V, DictionaryK, V) |
Checks if set/map a is a superset/map of b.
For a map, key and value must be same to be equal.
|
| GreaterOrEqualIDeque | |
| GreaterOrEqualIDictionary | |
| GreaterOrEqualIList | |
| GreaterThanV(DequeV, DequeV) |
Checks if Deque a is a proper superdeque of b.
Requires a to contain more entries than b and same values at same position for being true.
|
| GreaterThanV(ListV, ListV) |
Checks if List a is a proper superlist of b.
Requires a to contain more entries than b and same values at same index for being true.
|
| GreaterThanK, V(DictionaryK, V, DictionaryK, V) |
Checks if set/map a is a proper superset/map of b.
For a map, key and value must be same to be equal.
|
| GreaterThanIDeque | |
| GreaterThanIDictionary | |
| GreaterThanIList | |
| GroupBy | |
| IfAttributeOfElementIsContainerThenCloneContainer(IAttributeBearer, String, Object) |
If the attribute of the given name of the given element is a conatiner attribute
then return a clone of the given container value, otherwise just return the original value
|
| IfAttributeOfElementIsContainerThenCloneContainer(IGraphElement, String, Object) |
If the attribute of the given name of the given element is a conatiner attribute
then return a clone of the given container value, otherwise just return the original value
|
| IfAttributeOfElementIsContainerThenCloneContainer(IObject, String, Object) |
If the attribute of the given name of the given element is a conatiner attribute
then return a clone of the given container value, otherwise just return the original value
|
| IfAttributeOfElementIsContainerThenCloneContainer(IGraphElement, String, Object, AttributeType) |
If the attribute of the given name of the given element is a container attribute
then return a clone of the given container value, otherwise just return the original value;
additionally returns the AttributeType of the attribute of the element.
|
| IfAttributeOfElementIsContainerThenCloneContainer(IObject, String, Object, AttributeType) |
If the attribute of the given name of the given element is a container attribute
then return a clone of the given container value, otherwise just return the original value;
additionally returns the AttributeType of the attribute of the element.
|
| InContainerOrString | |
| IndexOf(Object, Object) | |
| IndexOf(Object, Object, Int32) | |
| IndexOfV(DequeV, V) |
Returns the first position of entry in the deque a
|
| IndexOfV(ListV, V) |
Returns the first position of entry in the array a
|
| IndexOfV(DequeV, V, Int32) | |
| IndexOfV(ListV, V, Int32) | |
| IndexOfBy(Object, String, Object, IGraphProcessingEnvironment) | |
| IndexOfBy(Object, String, Object, Int32, IGraphProcessingEnvironment) | |
| IndexOfOrdered(IList, Object) |
Returns the first position of entry in the array a with a binary search - thus the array must be ordered.
|
| IndexOfOrdered(ListString, String) | |
| IndexOfOrderedV(ListV, V) |
Returns the first position of entry in the array a with a binary search - thus the array must be ordered.
|
| IndexOfOrderedBy | |
| Intersect(IDictionary, IDictionary) | |
| IntersectK, V(DictionaryK, V, DictionaryK, V) |
Creates a new dictionary containing all key/value pairs from
a whose keys are also contained in b.
If both dictionaries contain one key, the value from a takes precedence, in contrast to union.
|
| IntersectChangedK(DictionaryK, SetValueType, DictionaryK, SetValueType, IGraph, IEdge, AttributeType) |
Removes all key/value pairs from set a whose keys are not also contained in b.
|
| IntersectChangedK(DictionaryK, SetValueType, DictionaryK, SetValueType, IGraph, INode, AttributeType) |
Removes all key/value pairs from set a whose keys are not also contained in b.
|
| IntersectChangedK, V(DictionaryK, V, DictionaryK, V) |
Removes all key/value pairs from set/map a whose keys are not also contained in b.
If both dictionaries contain one key, the value from a takes precedence, in contrast to union.
|
| IntersectChangedK, V(DictionaryK, V, DictionaryK, V, IGraph, IEdge, AttributeType) |
Removes all key/value pairs from map a whose keys are not also contained in b.
If both dictionaries contain one key, the value from a takes precedence, in contrast to union.
|
| IntersectChangedK, V(DictionaryK, V, DictionaryK, V, IGraph, INode, AttributeType) |
Removes all key/value pairs from map a whose keys are not also contained in b.
If both dictionaries contain one key, the value from a takes precedence, in contrast to union.
|
| IsEqual(IObject, IObject) | |
| IsEqual(ITransientObject, ITransientObject) | |
| KeepOneForEach | |
| LastIndexOf(Object, Object) | |
| LastIndexOf(Object, Object, Int32) | |
| LastIndexOfV(DequeV, V) |
Returns the first position from the end inwards of entry in the deque a
|
| LastIndexOfV(ListV, V) |
Returns the first position from the end inwards of entry in the array a
|
| LastIndexOfV(ListV, V, Int32) | |
| LastIndexOfBy(Object, String, Object, IGraphProcessingEnvironment) | |
| LastIndexOfBy(Object, String, Object, Int32, IGraphProcessingEnvironment) | |
| LessOrEqualV(DequeV, DequeV) |
Checks if Deque a is a subdeque of b.
Requires a to contain less or same number of entries than b and same values at same positions for being true.
|
| LessOrEqualV(ListV, ListV) |
Checks if List a is a sublist of b.
Requires a to contain less or same number of entries than b and same values at same index for being true.
|
| LessOrEqualK, V(DictionaryK, V, DictionaryK, V) |
Checks if set/map a is a subset/map of b.
For a map, key and value must be same to be equal.
|
| LessOrEqualIDeque | |
| LessOrEqualIDictionary | |
| LessOrEqualIList | |
| LessThanV(DequeV, DequeV) |
Checks if Deque a is a proper subseque of b.
Requires a to contain less entries than b and same values at same position for being true.
|
| LessThanV(ListV, ListV) |
Checks if List a is a proper sublist of b.
Requires a to contain less entries than b and same values at same index for being true.
|
| LessThanK, V(DictionaryK, V, DictionaryK, V) |
Checks if set/map a is a proper subset/map of b.
For a map, key and value must be same to be equal.
|
| LessThanIDeque | |
| LessThanIDictionary | |
| LessThanIList | |
| MapAsArray(IDictionary, IGraphModel) |
Creates a new list representing an array,
containing all values from the given dictionary representing a map map from int to some values.
|
| MapAsArrayV(DictionaryInt32, V) |
Creates a new list representing an array,
containing all values from the given dictionary representing a map map from int to some values.
|
| MappingClone(IDeque, IDictionaryIGraphElement, IGraphElement) | |
| MappingClone(IDictionary, IDictionaryIGraphElement, IGraphElement) | |
| MappingClone(IList, IDictionaryIGraphElement, IGraphElement) | |
| MappingClone(Object, IDictionaryIGraphElement, IGraphElement) |
Creates a shallow clone of the given container, mapping the contained elements according to the input new to old elements map
(clones a container, transplanting contained graph elements from an old to a new graph).
|
| MappingCloneT(DequeT, IDictionaryIGraphElement, IGraphElement) | |
| MappingCloneT(ListT, IDictionaryIGraphElement, IGraphElement) | |
| MappingCloneK, V(DictionaryK, V, IDictionaryIGraphElement, IGraphElement) | |
| Max(IList) | |
| Max(ListDouble) | |
| Max(ListInt16) | |
| Max(ListInt32) | |
| Max(ListInt64) | |
| Max(ListSByte) | |
| Max(ListSingle) | |
| Med(IList) | |
| Med(ListDouble) | |
| Med(ListInt16) | |
| Med(ListInt32) | |
| Med(ListInt64) | |
| Med(ListSByte) | |
| Med(ListSingle) | |
| MedUnordered(IList) | |
| MedUnordered(ListDouble) | |
| MedUnordered(ListInt16) | |
| MedUnordered(ListInt32) | |
| MedUnordered(ListInt64) | |
| MedUnordered(ListSByte) | |
| MedUnordered(ListSingle) | |
| Min(IList) | |
| Min(ListDouble) | |
| Min(ListInt16) | |
| Min(ListInt32) | |
| Min(ListInt64) | |
| Min(ListSByte) | |
| Min(ListSingle) | |
| NewDeque(Type) |
Creates a new Deque of the given value type
|
| NewDeque(Type, Object) |
Creates a new Deque of the given value type,
initialized with the content of the old Deque (clones the old Deque)
|
| NewDictionary(Type, Type) |
Creates a new dictionary of the given key type and value type
|
| NewDictionary(Type, Type, Object) |
Creates a new dictionary of the given key type and value type,
initialized with the content of the old dictionary (clones the old dictionary)
|
| NewList(Type) |
Creates a new List of the given value type
|
| NewList(Type, Int32) |
Creates a new List of the given value type,
initialized with the given capacity
|
| NewList(Type, Object) |
Creates a new List of the given value type,
initialized with the content of the old List (clones the old List)
|
| NotEqualV(DequeV, DequeV) |
Checks if Deque a is not equal Deque b.
|
| NotEqualV(ListV, ListV) |
Checks if List a is not equal List b.
|
| NotEqualK, V(DictionaryK, V, DictionaryK, V) |
Checks if set/map a is not equal to set/map b.
For a map, key and value must be same to be equal.
|
| NotEqualIDeque | |
| NotEqualIDictionary | |
| NotEqualIList | |
| Or(IList) | |
| Or(ListBoolean) | |
| OrderAscendingBy | |
| OrderDescendingBy | |
| Peek(Object) |
Returns the value from the deque begin or array end.
|
| Peek(Object, Int32) |
Returns the value from the dictionary or list or deque at the nth position as defined by the iterator of the dictionary or the index of the list or the iterator of the deque.
|
| PeekT(DequeT) | |
| PeekT(ListT) | |
| PeekT(DequeT, Int32) | |
| PeekT(ListT, Int32) | |
| PeekK, V(DictionaryK, V, Int32) |
Returns the value from the dictionary at the nth position as defined by the iterator of the dictionary.
|
| Prod(IList) | |
| Prod(ListDouble) | |
| Prod(ListInt16) | |
| Prod(ListInt32) | |
| Prod(ListInt64) | |
| Prod(ListSByte) | |
| Prod(ListSingle) | |
| Range(IDictionary) | |
| RangeK, V(DictionaryK, V) |
Creates a new dictionary representing a set,
containing all values from the given dictionary representing a map map.
|
| SetAsArray(IDictionary) |
Creates a new list containing all values from the given dictionary representing a set.
|
| SetAsArrayV(DictionaryV, SetValueType) |
Creates a new list containing all values from the given dictionary representing a set.
|
| Shuffle(IList) | |
| Shuffle(ListString) | |
| ShuffleV(ListV) |
Creates a new dynamic array with permuted content.
|
| StringAsArray | |
| StructurallyEqual |
Returns whether the input values are structurally equal according to the ~~ operator, beside attribute bearers and graphs, this esp. includes containers,
then it returns whether this container and that container are memberwise deeply equal,
which means the scalar members are equal, and object attributes are deeply equal.
(If types are unequal the result is false. For graphs, it returns whether they are structurally equal.)
|
| Subarray(IList, Int32, Int32) | |
| SubarrayV(ListV, Int32, Int32) |
Creates a new dynamic array with length values copied from a from index start on.
|
| Subdeque(IDeque, Int32, Int32) | |
| SubdequeV(DequeV, Int32, Int32) |
Creates a new deque with length values copied from a from index start on.
|
| Sum(IList) | |
| Sum(ListDouble) | |
| Sum(ListInt16) | |
| Sum(ListInt32) | |
| Sum(ListInt64) | |
| Sum(ListSByte) | |
| Sum(ListSingle) | |
| Union(IDictionary, IDictionary) | |
| UnionK, V(DictionaryK, V, DictionaryK, V) |
Creates a new dictionary and fills in all key/value pairs from
a and b.
If both dictionaries contain one key, the value from b takes precedence
(this way the common case a = a | map<int, int> { 7 -> 13 }; would update an existing entry
with key 7 to 13).
|
| UnionChangedK(DictionaryK, SetValueType, DictionaryK, SetValueType, IGraph, IEdge, AttributeType) |
Adds all key/value pairs from set b to a.
|
| UnionChangedK(DictionaryK, SetValueType, DictionaryK, SetValueType, IGraph, INode, AttributeType) |
Adds all key/value pairs from set b to a.
|
| UnionChangedK, V(DictionaryK, V, DictionaryK, V) |
Adds all key/value pairs from set/map b to a.
If both dictionaries contain one key, the value from b takes precedence
(this way the common case a = a | map<int, int> { 7 -> 13 }; would update an existing entry
with key 7 to 13).
|
| UnionChangedK, V(DictionaryK, V, DictionaryK, V, IGraph, IEdge, AttributeType) |
Adds all key/value pairs from map b to a.
If both dictionaries contain one key, the value from b takes precedence
(this way the common case a = a | map<int, int> { 7 -> 13 }; would update an existing entry
with key 7 to 13).
|
| UnionChangedK, V(DictionaryK, V, DictionaryK, V, IGraph, INode, AttributeType) |
Adds all key/value pairs from map b to a.
If both dictionaries contain one key, the value from b takes precedence
(this way the common case a = a | map<int, int> { 7 -> 13 }; would update an existing entry
with key 7 to 13).
|
| Var(IList) | |
| Var(ListDouble) | |
| Var(ListInt16) | |
| Var(ListInt32) | |
| Var(ListInt64) | |
| Var(ListSByte) | |
| Var(ListSingle) | |
Methods