99 | | Date | ${datetimeFormat(t.run.date)} |
100 | | Rev | ${t.run.branch} @ ${link(t.run.url, t.run.shortrev)} |
101 | | Suite | ${link(t.suite.url, t.suite.name)} |
102 | | Test | ${t.data.name} |
103 | | n | ${t.data.times.length} |
104 | | avg | ${t.avg_time()} |
105 |
106 | `;
107 | }
108 | });
109 |
110 |
111 | // Add the X Axis
112 | svg
113 | .append("g")
114 | .attr("transform", `translate(0, ${height})`)
115 | .call(d3.axisBottom(x));
116 |
117 | // Add the Y Axis
118 | svg.append("g").call(d3.axisLeft(y));
119 |
120 | // svg
121 | // .selectAll(".text")
122 | // .data(data)
123 | // .enter()
124 | // .append("text") // Uses the enter().append() method
125 | // .attr("class", "label") // Assign a class for styling
126 | // .attr("x", d => x(d.run.date))
127 | // .attr("y", d => y(d.data.times[0]))
128 | // .attr("dy", "-5")
129 | // .text(() => "label");
130 |
131 | }
132 |
133 | class Run {
134 | constructor(dirname) {
135 | let match = DIR_REGEX.exec(dirname);
136 | this.path = DATA_DIR + dirname + "/";
137 | this.name = dirname;
138 | this.date = new Date(match[1]);
139 | this.branch = match[2];
140 | this.describe = match[3];
141 | this.tag = match[4];
142 | this.commitsAhead = +match[5];
143 | this.rev = match[6];
144 | this.dirty = !!match[7];
145 |
146 | this.suites = null;
147 | this.url = `${REPO}/tree/${this.rev}`;
148 | this.shortrev = this.rev.slice(0,7)
149 | }
150 |
151 | async load(depth = 1) {
152 | let suites = await get(this.path);
153 | this.suites = await Promise.all(
154 | suites
155 | .filter(s => s.type == "directory")
156 | .map(async s => {
157 | let suite = new Suite(this, s.name);
158 | if (depth > 0) {
159 | await suite.load(depth - 1);
160 | }
161 | return suite;
162 | })
163 | );
164 | return this;
165 | }
166 | }
167 |
168 | class Suite {
169 | constructor(run, name) {
170 | this.run = run;
171 | this.name = name;
172 | this.path = run.path + name + "/";
173 |
174 | this.tests = null;
175 | this.url = `${REPO}/blob/${run.rev}/tests/${name}.rs`;
176 | }
177 |
178 | async load(depth = 0) {
179 | let tests = await get(this.path);
180 | this.tests = await Promise.all(
181 | tests
182 | .filter(t => t.type == "file")
183 | .map(async t => {
184 | let test = new Test(this.run, this, t.name);
185 | if (depth > 0) {
186 | await test.load();
187 | }
188 | return test;
189 | })
190 | );
191 | return this;
192 | }
193 | }
194 |
195 | class Test {
196 | constructor(run, suite, name) {
197 | this.run = run;
198 | this.suite = suite;
199 | this.name = name;
200 | this.path = suite.path + name;
201 | this.data = null;
202 | }
203 |
204 | async load() {
205 | this.data = await get(this.path);
206 | }
207 |
208 | avg_time() {
209 | var total = 0;
210 | for (let t of this.data.times) total += t;
211 | return total / this.data.times.length;
212 | }
213 | }
214 |
215 | async function fetchRuns() {
216 | let runsListing = await d3.json(DATA_DIR);
217 | console.log("Got the listing", runsListing);
218 | let runs = runsListing
219 | .filter(i => i.type == "directory")
220 | .map(i => new Run(i.name));
221 | console.log("Runs: ", runs);
222 | return runs;
223 | }
224 |
225 | let RUNS = null;
226 |
227 | async function init() {
228 | let runs = await fetchRuns();
229 | RUNS = runs;
230 |
231 | runList
232 | .data(runs)
233 | .join("li")
234 | .text(run => `${run.branch} ${datetimeFormat(run.date)}`);
235 |
236 | updatePlot(runs);
237 | }
238 |
239 | init()
240 | .then(() => console.log("Successful init"))
241 | .catch(e => console.error("Failed init", e));
242 |
--------------------------------------------------------------------------------
/src/eggstentions/reconstruct.rs:
--------------------------------------------------------------------------------
1 | use std::collections::{HashMap, HashSet};
2 |
3 | use crate::{EGraph, Id, Language, SymbolLang, RecExpr, EClass, ColorId};
4 | use indexmap::IndexMap;
5 | use itertools::Itertools;
6 | use crate::eggstentions::tree::Tree;
7 |
8 | /// Reconstructs a RecExpr from an eclass.
9 | pub fn reconstruct(graph: &EGraph
Easter Egg: Colored E-Graphs
2 |
3 | [](https://github.com/eytans/egg/actions)
4 | [](https://crates.io/crates/egg)
5 | [](https://docs.rs/egg/)
6 | [](https://egraphs-good.github.io/egg/egg/)
7 |
8 | Easter Egg is an extension of the egg library that implements colored e-graphs, enabling efficient representation of multiple congruence relations in a single e-graph structure.
9 |
10 | ## Features
11 |
12 | - Support for multiple congruence relations (colors) in a single e-graph
13 | - Memory-efficient representation of coarsened equality relations
14 | - Optimized algorithms for colored e-graph operations
15 | - Compatible with existing egg functionality
16 | - Has a parallel backoff schedular to run search of rules in parallel.
17 | - Machine has early stop as it is no longer recursive, but stack based machine (I think this could be parallel if we wished)
18 |
19 | ## Using Easter Egg
20 |
21 | Add `easter_egg` to your `Cargo.toml` like this:
22 | ```toml
23 | [dependencies]
24 | easter_egg = { git = "https://github.com/eytans/egg.git" }
25 | ```
26 |
27 | ## Developing
28 | Easter Egg is written in Rust.
29 | Typically, you install Rust using rustup.
30 | Run cargo doc --open to build and open the documentation in a browser.
31 | Before committing/pushing, make sure to run cargo test, which runs all the tests.
32 | You should also run cargo fmt to format your code and a linter.
33 |
34 | ## Tests
35 | You will need graphviz to run the tests.
36 | Running cargo test will run the tests.
37 | Some tests may time out; try cargo test --release if that happens.
38 | There are several interesting tests in the tests directory:
39 |
40 | egraph.rs implements basic functionality tests for colored e-graphs.
41 |
42 | ## Key Concepts
43 |
44 | Colored E-Graphs: An extension of e-graphs that efficiently represents multiple congruence relations.
45 | Colored E-Classes: E-classes associated with specific colors, representing coarsened equality relations.
46 | Colored Operations: Modified e-graph operations (merge, rebuild, e-matching) that work with colored e-graphs.
47 |
48 | ## Performance
49 | Colored e-graphs offer significant memory savings compared to maintaining separate e-graphs for different assumptions, with a slight trade-off in performance for some operations.
50 |
51 | ## Contributing
52 | Contributions to Easter Egg are welcome! Please feel free to submit issues, pull requests, or reach out with any questions or suggestions.
53 |
54 |
55 | ## Differences from egg
56 |
57 | Easter Egg extends the functionality of egg while maintaining a similar API. However, there are some key differences to be aware of:
58 |
59 | ### API and Stability
60 |
61 | - Easter Egg provides a similar API to egg, but it is currently less stable as it's a newer extension.
62 | - A new "colored" API has been added, allowing users to create colors and perform searches with colors.
63 |
64 | ### Multi-Pattern Handling
65 |
66 | Easter Egg handles multi-patterns slightly differently from egg:
67 |
68 | - The "=" operator is not allowed inside patterns as an operation.
69 | - Instead, we introduce "|=" and "!=" as replacements for conditions.
70 | - These new operators represent new machine operations used during search.
71 |
72 | ### Example Usage
73 |
74 | ```rust
75 | use egg::{EGraph, Rewrite, Runner, Symbol};
76 |
77 | // Create a new colored e-graph
78 | let mut egraph = EGraph::new(());
79 |
80 | // Create a new color
81 | let blue_color = egraph.add_color();
82 |
83 | // Add a term to the e-graph
84 | let x = egraph.add(Symbol::new("x"));
85 | let y = egraph.add(Symbol::new("y"));
86 |
87 | // Perform a colored merge
88 | egraph.colored_union(blue_color, x, y);
89 | let runner = ....
90 | ```
--------------------------------------------------------------------------------
/src/lib.rs:
--------------------------------------------------------------------------------
1 |
2 | /*!
3 |
4 | `easter-egg` is a colored e-graphs implementation on top of egg (https://github.com/mwillsey/egg)
5 | (**e**-**g**raphs **g**ood) is a e-graph library optimized for equality saturation.
6 |
7 | This is the API documentation.
8 |
9 | The [tutorial](tutorials/index.html) is a good starting point if you're new to
10 | e-graphs, equality saturation, or Rust.
11 |
12 | The [tests](https://github.com/eytans/easter-egg/tree/master/tests)
13 | on Github provide some more elaborate examples.
14 |
15 | There is also a [paper](https://arxiv.org/abs/2004.03082)
16 | describing `egg` and some of its technical novelties, and a paper on easter egg can be found
17 | [here](https://repositum.tuwien.at/bitstream/20.500.12708/200780/1/Singher-2024-Easter%20Egg%20Equality%20Reasoning%20Based%20on%20E-Graphs%20with%20Multipl...-vor.pdf).
18 |
19 | !*/
20 |
21 | /* needs to be public for trait `GetOp` */
22 | pub mod macros;
23 | pub mod explanation;
24 |
25 | #[macro_use]
26 | extern crate global_counter;
27 |
28 | pub mod tutorials;
29 |
30 | mod dot;
31 | mod eclass;
32 | mod egraph;
33 | mod extract;
34 | mod language;
35 | mod machine;
36 | mod pattern;
37 | mod rewrite;
38 | mod run;
39 | mod subst;
40 | mod unionfind;
41 | mod util;
42 |
43 | /// A key to identify [`EClass`](struct.EClass.html)es within an
44 | /// [`EGraph`](struct.EGraph.html).
45 | #[derive(Clone, Copy, Default, Ord, PartialOrd, Eq, PartialEq, Hash)]
46 | #[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))]
47 | pub struct Id(pub u32);
48 |
49 |
50 | #[derive(Clone, Copy, Default, Ord, PartialOrd, Eq, PartialEq, Hash)]
51 | #[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))]
52 | pub struct ColorId(usize);
53 |
54 |
55 | impl From