-
Notifications
You must be signed in to change notification settings - Fork 0
/
SpreadsheetUtilities.XML
97 lines (93 loc) · 4.18 KB
/
SpreadsheetUtilities.XML
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
<?xml version="1.0"?>
<doc>
<assembly>
<name>SpreadsheetUtilities</name>
</assembly>
<members>
<member name="T:SpreadsheetUtilities.DependencyGraph">
<summary>
A DependencyGraph can be modeled as a set of ordered pairs of strings. Two ordered pairs
(s1,t1) and (s2,t2) are considered equal if and only if s1 equals s2 and t1 equals t2.
(Recall that sets never contain duplicates. If an attempt is made to add an element to a
set, and the element is already in the set, the set remains unchanged.)
Given a DependencyGraph DG:
(1) If s is a string, the set of all strings t such that (s,t) is in DG is called dependents(s).
(2) If s is a string, the set of all strings t such that (t,s) is in DG is called dependees(s).
For example, suppose DG = {("a", "b"), ("a", "c"), ("b", "d"), ("d", "d")}
dependents("a") = {"b", "c"}
dependents("b") = {"d"}
dependents("c") = {}
dependents("d") = {"d"}
dependees("a") = {}
dependees("b") = {"a"}
dependees("c") = {"a"}
dependees("d") = {"b", "d"}
</summary>
</member>
<member name="M:SpreadsheetUtilities.DependencyGraph.#ctor">
<summary>
Creates an empty DependencyGraph.
</summary>
</member>
<member name="M:SpreadsheetUtilities.DependencyGraph.HasDependents(System.String)">
<summary>
Reports whether dependents(s) is non-empty.
</summary>
</member>
<member name="M:SpreadsheetUtilities.DependencyGraph.HasDependees(System.String)">
<summary>
Reports whether dependees(s) is non-empty.
</summary>
</member>
<member name="M:SpreadsheetUtilities.DependencyGraph.GetDependents(System.String)">
<summary>
Enumerates dependents(s).
</summary>
</member>
<member name="M:SpreadsheetUtilities.DependencyGraph.GetDependees(System.String)">
<summary>
Enumerates dependees(s).
</summary>
</member>
<member name="M:SpreadsheetUtilities.DependencyGraph.AddDependency(System.String,System.String)">
<summary>
Adds the ordered pair (s,t), if it doesn't exist
</summary>
<param name="s"></param>
<param name="t"></param>
</member>
<member name="M:SpreadsheetUtilities.DependencyGraph.RemoveDependency(System.String,System.String)">
<summary>
Removes the ordered pair (s,t), if it exists
</summary>
<param name="s"></param>
<param name="t"></param>
</member>
<member name="M:SpreadsheetUtilities.DependencyGraph.ReplaceDependents(System.String,System.Collections.Generic.IEnumerable{System.String})">
<summary>
Removes all existing ordered pairs of the form (s,r). Then, for each
t in newDependents, adds the ordered pair (s,t).
</summary>
</member>
<member name="M:SpreadsheetUtilities.DependencyGraph.ReplaceDependees(System.String,System.Collections.Generic.IEnumerable{System.String})">
<summary>
Removes all existing ordered pairs of the form (r,s). Then, for each
t in newDependees, adds the ordered pair (t,s).
</summary>
</member>
<member name="P:SpreadsheetUtilities.DependencyGraph.Size">
<summary>
The number of ordered pairs in the DependencyGraph.
</summary>
</member>
<member name="P:SpreadsheetUtilities.DependencyGraph.Item(System.String)">
<summary>
The size of dependees(s).
This property is an example of an indexer. If dg is a DependencyGraph, you would
invoke it like this:
dg["a"]
It should return the size of dependees("a")
</summary>
</member>
</members>
</doc>