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/ingredient | |
| 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/ingredient')
| -rw-r--r-- | cpp/.traces/ingredient | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/cpp/.traces/ingredient b/cpp/.traces/ingredient index 4b028b84..0d8fbf96 100644 --- a/cpp/.traces/ingredient +++ b/cpp/.traces/ingredient @@ -7,11 +7,11 @@ parse/0: product: {name: "12", value: 0, type: 1, properties: ["12": "integer" parse/0: instruction: 25 parse/0: product: {name: "13", value: 0, type: 1, properties: ["13": "integer"]} parse/0: product: {name: "1", value: 0, type: 3, properties: ["1": "boolean"]} +after-brace/0: recipe main +after-brace/0: f ... after-brace/0: recipe f after-brace/0: ingredient ... after-brace/0: next-ingredient ... -after-brace/0: recipe main -after-brace/0: f ... run/0: instruction main/0 run/0: instruction f/0 run/0: product 0 is 2 |