https://sourceforge.net/p/spargel/wiki/util/Recent changes to utilenTue, 23 Apr 2013 10:10:23 -0000https://sourceforge.net/p/spargel/wiki/util/<div class="markdown_content"><pre>--- v1 +++ v2 @@ -1,15 +1,33 @@ Utilities ========= - -The util package contains helper functions for often used operations. Included are the **Traverse** and **Join** classes. - -Traverse --------- - -Includes the depth-first-search. It uses a **DFSVisitor** interface as argument which can perform several actions depending on what kind of edges are being found. - Join ---- The join class includes a method to join vertices of a graph. A **JoinVerticeVisitor** will be taken as argument that can perform actions depending on what kind of edges from the the joined vertices are being transformed. + +Views +----- + + +We have included some collections utilities for creating sub collection or transformed collections. Classes having the suffix 'View' are wrappers around a collection that will not allocate new memory for the transformed collection, but with the addAll method of a Java collection the view can be cached for efficiency. + +All collection views can be found in the util package which contains, as for now: + +* **BiTransformedCollectionView** - an one-to-one transformed collection +* **TransformedCollecionView** - an one-to-one transformed collection, that allows no modification. +* **BiTransformedSetView** - an one-to-one transformed set +* **DifferenceSetView** - a difference set. +* **IntersectionSetView** - an intersection of two sets. +* **SubCollectionView** - uses a method to filter out elements +* **SubSetView** - uses a method to filter out elements + +Also there are maps that uses a map function with a key set to evaluate its values. + +* **FunctionMap** - the whole key set will be mapped +* **FunctionalMap** - allows an exclusion of keys + +Also: + +* **Sub(Bi/U)GraphView** - allow a view of a portion of a given graph. This abstract class uses an evaluate method to filter out vertices and edges. +* **Intersection(Bi/U)GraphView** - is a special subgraph that includes only vertices or edges that are in a given vertice or edge set. </pre> </div>Philipp HülsdunkTue, 23 Apr 2013 10:10:23 -0000https://sourceforge.net9d11b872ff8e7e74ab9a14fe392c34f1db5ceefdhttps://sourceforge.net/p/spargel/wiki/util/<div class="markdown_content"><h1 id="utilities">Utilities</h1> <p>The util package contains helper functions for often used operations. Included are the <strong>Traverse</strong> and <strong>Join</strong> classes.</p> <h2 id="traverse">Traverse</h2> <p>Includes the depth-first-search. It uses a <strong>DFSVisitor</strong> interface as argument which can perform several actions depending on what kind of edges are being found.</p> <h2 id="join">Join</h2> <p>The join class includes a method to join vertices of a graph. A <strong>JoinVerticeVisitor</strong> will be taken as argument that can perform actions depending on what kind of edges from the the joined vertices are being transformed.</p></div>Philipp HülsdunkWed, 03 Apr 2013 18:01:35 -0000https://sourceforge.net4b6ea3e4dac97df2c20975ad7cd972a29a657e45