ObjectGraphUtils Methods |
The ObjectGraphUtils type exposes the following members.
Methods| Name | Description | |
|---|---|---|
 | DetermineActionQueues<TEntity>(TEntity, List<ActionQueueElement<TEntity>>, List<ActionQueueElement<TEntity>>) |
Determines the action queues for the entity passed in. The action queues contain the entities to process in the right order.
|
| DetermineActionQueues<TEntity>(TEntity, IPredicate, List<ActionQueueElement<TEntity>>, List<ActionQueueElement<TEntity>>) |
Determines the action queues for the entity passed in. The action queues contain the entities to process in the right order.
|
| DetermineActionQueues<TEntity>(TEntity, List<ActionQueueElement<TEntity>>, List<ActionQueueElement<TEntity>>, Boolean) |
Determines the action queues for the entity passed in. The action queues contain the entities to process in the right order.
|
| DetermineActionQueues<TEntity>(TEntity, IPredicate, List<ActionQueueElement<TEntity>>, List<ActionQueueElement<TEntity>>, Boolean) |
Determines the action queues for the entity passed in. The action queues contain the entities to process in the right order.
|
| DetermineActionQueues<TEntity, TCollection>(TCollection, List<ActionQueueElement<TEntity>>, List<ActionQueueElement<TEntity>>) |
Determines the action queues for the entity collection passed in. The action queues contain the entities to process in the right order.
|
| DetermineActionQueues<TEntity, TCollection>(TCollection, List<ActionQueueElement<TEntity>>, List<ActionQueueElement<TEntity>>, Boolean) |
Determines the action queues for the entity collection passed in. The action queues contain the entities to process in the right order.
|
| Equals | Determines whether the specified object is equal to the current object. (Inherited from Object.) |
 | Finalize | Allows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection. (Inherited from Object.) |
| GetHashCode | Serves as the default hash function. (Inherited from Object.) |
| GetType | Gets the Type of the current instance. (Inherited from Object.) |
| MemberwiseClone | Creates a shallow copy of the current Object. (Inherited from Object.) |
| PerformTopologySort(Type, MultiValueDictionary<Type, Type>, HashSet<Type>, List<Type>) |
Performs the topology sort for the adjacencylists and the type given. Adds the type to the list passed in which represents the right ordered queue.
|
| PerformTopologySort<TEntity>(TEntity, Dictionary<Guid, Dictionary<Guid, TEntity>>, Dictionary<Guid, TEntity>, List<TEntity>) |
Performs the topology sort for the adjacencylists and the entity given. Adds the entity to the list passed in which represents the right ordered queue.
|
| ProduceAdjacencyLists<TEntity> |
Produces adjancency lists for the entities in the complete graph reachable from the entity passed in, using a non-recursive search algorithm. This routine figures out
the graph to process by walking it, using a hashtable (recursed) to take note which nodes are already processed.
When it finds an entity A and an entity B having a relation in the graph (have 'an edge'), and A is depending on B, we add B to the
adjacency list of A, though we don't add A to the adjacency list of B.
Additionally, it adds the type of B to the adjacency list of the type of A. This way we can determine the order of types.
|
| ProduceCollectionsPerTypeFromGraph<TCollection>(TCollection) |
Produces the collections per type from the graph specified
|
| ProduceCollectionsPerTypeFromGraph<TCollection>(TCollection[]) |
Produces the collections per type from the graph specified
|
| ProduceTopologyOrderedList<TEntity> |
Produces the topology ordered list for the graph rooted by the entity passed in. Uses topological sort of a directed graph using a non-recursive implementation of Tarjan's
algorithm using an in-line stack.
|
| ToString | Returns a string that represents the current object. (Inherited from Object.) |
See Also