Search

»

Data Structures

In all the previous pages we have been extending many of the collections provided by .Net Framework. It's time to create our own!

Our design goals with our custom data structures are the same as for any other part of Signum Utilities: Useful for a real life application, clean and simple API, and encourage a functional style of programming.

These are the data structures provided by Sigum.Utilities:

• Tuple: Just another read-only immutable structure to return simple pair and trios of objects when you don't want to spend your time writing a tiny class for it.
  

• Graphs: DirectedGraph and DirectedEdgedGraph make it easy to use common graph algorithms over any classes that have some kind of graph structure without implementing an interface.
  

• Interval Dictionaries: Dictionaries that allow a 1D, 2D, and 3D Range to be the key.
  

• PriorityQueue: An implementation of a priority queue using a binary heap.
  

• RecentDictionary: Dictionary where the least recently used items are removed to save memory
  

• Immutable Data Structures: A immutable stack, queue and AVL Tree. Usefull in concurrent scenarios.