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/reply_container | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'cpp/.traces/reply_container') diff --git a/cpp/.traces/reply_container b/cpp/.traces/reply_container index 9a5d430f..10cc9548 100644 --- a/cpp/.traces/reply_container +++ b/cpp/.traces/reply_container @@ -8,12 +8,12 @@ parse/0: ingredient: {name: "35", value: 0, type: 0, properties: ["35": "liter parse/0: product: {name: "13", value: 0, type: 1, properties: ["13": "integer"]} parse/0: instruction: 28 parse/0: ingredient: {name: "12", value: 0, type: 6, properties: ["12": "point"]} +after-brace/0: recipe main +after-brace/0: f ... after-brace/0: recipe f after-brace/0: next-ingredient ... after-brace/0: copy ... after-brace/0: reply ... -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 -- cgit 1.4.1-2-gfad0 '>refs log blame commit diff stats
path: root/examples/vim_file_chooser.vim
blob: df3f50e556b8f1f45aa3505ed7c95c941b357d63 (plain) (tree)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15