Packages of Mallory Dessaintes
| Recommend this page to a friend! |
| All class groups | > | All authors | > | Packages of Mallory Dessaintes (3) | > | Mission progress status | > | Reputation |
|
||||||||||||||||||||||||||||||
| A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z |
| ||||
| This class can find best route using the Dijkstra algorithm. There is an auxiliary class that encapsulates the functionality of a node through which a route may pass. Links may be added between each node with the information of distance and whether there is a reciprocal link in the opposite direction. The main class may the best routes between two nodes returning the information of the path nodes and associated costs. |
| ||||
| This class implements a template engine that supports template inheritance. It can process templates with support for variables that are set as class variables It also supports multiple template inheritance so a template can be based on another and the definition of some its blocks can be redefined in child template. |
| ||||
| This class can be used to read, add, modify and delete lines from text files. It can open an existing file or create a new one. The class can retrieve the file lines into an array, optionally keeping only those that match a given content criteria. It can also sort the returned lines or limit the number of lines that are returned just like with SQL database queries. The class can also modify or delete the file lines according to a content condition. |
| A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z |
