From 2fb94e3c4c4ade042fc1944f1bfa64609bff40b4 Mon Sep 17 00:00:00 2001 From: "Kartik K. Agaram" Date: Fri, 24 Apr 2015 17:09:17 -0700 Subject: 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. --- cpp/.traces/next_ingredient_missing | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'cpp/.traces/next_ingredient_missing') diff --git a/cpp/.traces/next_ingredient_missing b/cpp/.traces/next_ingredient_missing index 07d681ca..385f047b 100644 --- a/cpp/.traces/next_ingredient_missing +++ b/cpp/.traces/next_ingredient_missing @@ -2,10 +2,10 @@ parse/0: instruction: 1001 parse/0: instruction: 25 parse/0: product: {name: "_", value: 0, type: 0, properties: ["_": "dummy"]} parse/0: product: {name: "12", value: 0, type: 1, properties: ["12": "integer"]} -after-brace/0: recipe f -after-brace/0: next-ingredient ... after-brace/0: recipe main after-brace/0: f ... +after-brace/0: recipe f +after-brace/0: next-ingredient ... run/0: instruction main/0 run/0: instruction f/0 mem/0: storing 0 in location 12 -- cgit 1.4.1-2-gfad0