diff options
| author | Kartik K. Agaram <vc@akkartik.com> | 2015-04-24 17:09:17 -0700 |
|---|---|---|
| committer | Kartik K. Agaram <vc@akkartik.com> | 2015-04-24 17:09:17 -0700 |
| commit | 2fb94e3c4c4ade042fc1944f1bfa64609bff40b4 (patch) | |
| tree | a3b649a53a0b634d3110daf2f8357d372a560841 /cpp/.traces/closure | |
| parent | 544a1f1e17d909673f08a50b97fc9d00df431eb4 (diff) | |
| download | mu-2fb94e3c4c4ade042fc1944f1bfa64609bff40b4.tar.gz | |
1166
Why did I think STL's map wasn't efficient? It has logarithmic complexity (maintains a tree internally) and is faster than hashing for small containers. It's the more portable solution and should be what I turn to by default.
Diffstat (limited to 'cpp/.traces/closure')
| -rw-r--r-- | cpp/.traces/closure | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/cpp/.traces/closure b/cpp/.traces/closure index 73ba0a6e..f8bd5a9a 100644 --- a/cpp/.traces/closure +++ b/cpp/.traces/closure @@ -39,11 +39,16 @@ parse/0: instruction: 28 parse/0: ingredient: {name: "y", value: 0, type: 1, properties: ["y": "integer", "space": "1"]} name/0: recipe increment-counter is surrounded by init-counter new/0: location -> 1 +new/0: location -> 1 name/0: assign x 1 name/0: assign y 2 new/0: space -> 0 name/0: assign y 1 -new/0: location -> 1 +after-brace/0: recipe main +after-brace/0: new ... +after-brace/0: init-counter ... +after-brace/0: increment-counter ... +after-brace/0: increment-counter ... after-brace/0: recipe init-counter after-brace/0: new ... after-brace/0: copy ... @@ -55,11 +60,6 @@ after-brace/0: next-ingredient ... after-brace/0: add ... after-brace/0: copy ... after-brace/0: reply ... -after-brace/0: recipe main -after-brace/0: new ... -after-brace/0: init-counter ... -after-brace/0: increment-counter ... -after-brace/0: increment-counter ... run/0: instruction main/0 mem/0: new alloc: 1000 mem/0: array size is 30 |