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/calling_recipe | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'cpp/.traces/calling_recipe') diff --git a/cpp/.traces/calling_recipe b/cpp/.traces/calling_recipe index cb35c59d..763acb53 100644 --- a/cpp/.traces/calling_recipe +++ b/cpp/.traces/calling_recipe @@ -3,10 +3,10 @@ parse/0: instruction: 2 parse/0: ingredient: {name: "2", value: 0, type: 0, properties: ["2": "literal"]} parse/0: ingredient: {name: "2", value: 0, type: 0, properties: ["2": "literal"]} parse/0: product: {name: "3", value: 0, type: 1, properties: ["3": "integer"]} -after-brace/0: recipe f -after-brace/0: add ... after-brace/0: recipe main after-brace/0: f ... +after-brace/0: recipe f +after-brace/0: add ... run/0: instruction main/0 run/0: instruction f/0 run/0: ingredient 0 is 2 -- cgit 1.4.1-2-gfad0