graph, any
Source: /avail/Avail/Data Abstractions/Graphs/Abstract Graphs
Categories: Data Abstractions, Graphs
Position | Name | Type | Description | |
---|---|---|---|---|
Parameters | ||||
1 | aGraph | graph | A graph. | |
2 | aVertex | any | A vertex. | |
Returns | graph | A graph based on aGraph that definitely contains aVertex. |
extended integer's type, extended integer's type
Source: /avail/Avail/Foundation/Math
Categories: Mathematics, Integers, Types
Compute and answer the integer range type of the sum of the argument types.
Position | Name | Type | Description | |
---|---|---|---|---|
Parameters | ||||
1 | a | extended integer's type | ||
2 | b | extended integer's type | ||
Returns | extended integer's type | The narrowest integer range type general enough to hold all possible sums of the arguments' instances. |
number, number
Source: /avail/Avail/Foundation/Bootstrap/Fallible Primitives
Categories: Primitives, Numbers, Mathematics
Compute and answer the sum of the arguments.
Position | Name | Type | Description | |
---|---|---|---|---|
Parameters | ||||
1 | augend | number | The augend. | |
2 | addend | number | The addend. | |
Returns | number | The sum of the augend and the addend. | Raises | |
cannot-add-unlike-infinities exception |
labeled graph, edge
Source: /avail/Avail/Data Abstractions/Graphs/Abstract Graphs
Categories: Data Abstractions, Graphs
Compute and answer a graph that differs from aGraph at most by the addition of anEdge. If anEdge is already present, then answer aGraph.
Position | Name | Type | Description | |
---|---|---|---|---|
Parameters | ||||
1 | aGraph | labeled graph | A graph. | |
2 | anEdge | edge | An edge. | |
Returns | graph | A graph based on aGraph that definitely contains anEdge. | Raises | |
incorrect-argument-type exception | If anEdge is not a labeled edge. | |||
no-such-vertex exception | If anEdge references vertices that are not present in aGraph. |
graph, edge
Source: /avail/Avail/Data Abstractions/Graphs/Abstract Graphs
Categories: Data Abstractions, Graphs
Compute and answer a graph that differs from aGraph at most by the addition of anEdge. If anEdge is already present, then answer aGraph.
Position | Name | Type | Description | |
---|---|---|---|---|
Parameters | ||||
1 | aGraph | graph | A graph. | |
2 | anEdge | edge | An edge. | |
Returns | graph | A graph based on aGraph that definitely contains anEdge. | Raises | |
no-such-vertex exception | If anEdge references vertices that are not present in aGraph. |
graph, any
Source: /avail/Avail/Data Abstractions/Graphs/Abstract Graphs
Categories: Data Abstractions, Graphs
Position | Name | Type | Description | |
---|---|---|---|---|
Parameters | ||||
1 | aGraph | graph | A graph. | |
2 | aVertex | any | A vertex. | |
Returns | graph | A graph based on aGraph that definitely does not contain aVertex. |
set, any
Source: /avail/Avail/Foundation/Bootstrap/Infallible Primitives
Categories: Primitives, Sets, Mathematics
Compute and answer the set union of the specified set and a set containing the supplied element.
Position | Name | Type | Description | |
---|---|---|---|---|
Parameters | ||||
1 | aSet | set | A set. | |
2 | newElement | any | The element that must be present in the resultant set. | |
Returns | {any|1..∞} | A set that contains the same elements as aSet but also contains newElement. |