/external/eigen/unsupported/Eigen/src/BVH/ |
BVAlgorithms.h | 28 std::vector<Index> todo(1, root); 30 while(!todo.empty()) { 31 tree.getChildren(todo.back(), vBegin, vEnd, oBegin, oEnd); 32 todo.pop_back(); 36 todo.push_back(*vBegin); 93 void BVIntersect(const BVH1 &tree1, const BVH2 &tree2, Intersector &intersector) //TODO: tandem descent when it makes sense 109 std::vector<std::pair<Index1, Index2> > todo(1, std::make_pair(tree1.getRootIndex(), tree2.getRootIndex())); 111 while(!todo.empty()) { 112 tree1.getChildren(todo.back().first, vBegin1, vEnd1, oBegin1, oEnd1); 113 tree2.getChildren(todo.back().second, vBegin2, vEnd2, oBegin2, oEnd2) 159 std::priority_queue<QueueElement, std::vector<QueueElement>, std::greater<QueueElement> > todo; \/\/smallest is at the top local 252 std::priority_queue<QueueElement, std::vector<QueueElement>, std::greater<QueueElement> > todo; \/\/smallest is at the top local [all...] |
/external/chromium_org/third_party/openssl/openssl/crypto/chacha/ |
chacha_enc.c | 135 size_t todo, i; local 169 todo = sizeof(buf); 170 if (in_len < todo) 171 todo = in_len; 174 for (i = 0; i < todo; i++) 177 out += todo; 178 in += todo; 179 in_len -= todo;
|
/external/openssl/crypto/bn/ |
bn_rand.c | 323 unsigned done, todo; local 335 todo = sizeof(priv->d[0])*priv->top; 336 if (todo > sizeof(private_bytes)) 344 memcpy(private_bytes, priv->d, todo); 345 memset(private_bytes + todo, 0, sizeof(private_bytes) - todo); 357 todo = num_k_bytes - done; 358 if (todo > SHA512_DIGEST_LENGTH) 359 todo = SHA512_DIGEST_LENGTH; 360 memcpy(k_bytes + done, digest, todo); [all...] |
/external/antlr/antlr-3.4/runtime/Python/unittests/ |
testbase.py | 23 replacement.todo = reason
|
/external/chromium_org/ppapi/ |
PRESUBMIT.py | 43 # Verify that the files do not contain a 'TODO' in them. 48 todo = [] 72 todo.append(filename) 74 if todo: 77 long_text='\n'.join(todo))] 85 todo = [] 105 todo.append(filename) 107 if todo: 110 long_text='\n'.join(todo))]
|
/external/chromium_org/third_party/openssl/openssl/crypto/poly1305/ |
poly1305.c | 278 unsigned int todo = 16 - state->buf_used; local 279 if (todo > in_len) 280 todo = in_len; 281 for (i = 0; i < todo; i++) 283 state->buf_used += todo; 284 in_len -= todo; 285 in += todo; 296 size_t todo = in_len & ~0xf; local 297 poly1305_update(state, in, todo); 298 in += todo; [all...] |
poly1305_arm.c | 244 unsigned int todo = 32 - st->buf_used; local 245 if (todo > in_len) 246 todo = in_len; 247 for (i = 0; i < todo; i++) 249 st->buf_used += todo; 250 in_len -= todo; 251 in += todo;
|
/external/chromium_org/third_party/skia/gm/rebaseline_server/static/ |
view.css | 2 .todo-div {
|
/external/libvorbis/ |
Makefile.am | 19 todo.txt autogen.sh \
|
/external/skia/gm/rebaseline_server/static/ |
view.css | 2 .todo-div {
|
/external/qemu/distrib/sdl-1.2.15/src/video/gem/ |
SDL_gemvideo.c | 1146 short todo[4]; local 1154 if (wind_get(winhandle, WF_FIRSTXYWH, &todo[0], &todo[1], &todo[2], &todo[3])!=0) { 1156 while (todo[2] && todo[3]) { 1158 if (rc_intersect((GRECT *)inside,(GRECT *)todo)) { 1159 todo[2] += todo[0]-1 [all...] |
/art/build/ |
Android.cpplint.mk | 20 ART_CPPLINT_FILTER := --filter=-whitespace/line_length,-build/include,-readability/function,-readability/streams,-readability/todo,-runtime/references,-runtime/sizeof,-runtime/threadsafe_fn,-runtime/printf
|
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
ast.py | 210 todo = deque([node]) 211 while todo: 212 node = todo.popleft() 213 todo.extend(iter_child_nodes(node))
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
ast.py | 210 todo = deque([node]) 211 while todo: 212 node = todo.popleft() 213 todo.extend(iter_child_nodes(node))
|
/external/chromium_org/third_party/jinja2/ |
nodes.py | 200 todo = deque([self]) 201 while todo: 202 node = todo.popleft() 205 todo.extend(node.iter_child_nodes()) 210 todo = deque([self]) 211 while todo: 212 node = todo.popleft() 216 todo.extend(node.iter_child_nodes()) 221 todo = deque([self]) 222 while todo [all...] |
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/pgen2/ |
pgen.py | 207 todo = [start] 208 for i, state in enumerate(todo): 211 if next in todo: 212 j = todo.index(next) 214 j = len(todo) 215 todo.append(next)
|
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/plat-mac/ |
buildtools.py | 401 todo = os.listdir(srctree) 402 while todo: 403 this, todo = todo[0], todo[1:] 410 todo.append(os.path.join(this, t))
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/pgen2/ |
pgen.py | 207 todo = [start] 208 for i, state in enumerate(todo): 211 if next in todo: 212 j = todo.index(next) 214 j = len(todo) 215 todo.append(next)
|
/external/chromium_org/tools/code_coverage/ |
croc_html.py | 333 # TODO: if file doesn't have a local path, try to find it by 435 # TODO: switch to depth-first and sort values - makes nicer output? 436 todo = [self.cov.tree] 437 while todo: 438 cov_dir = todo.pop(0) 440 # Append subdirs to todo list 441 todo += cov_dir.subdirs.values()
|
/cts/suite/cts/deviceTests/browserbench/assets/octane/ |
deltablue.js | 654 var todo = sources; 655 while (todo.size() > 0) { 656 var c = todo.removeFirst(); 660 this.addConstraintsConsumingTo(c.output(), todo); 695 var todo = new OrderedCollection(); 696 todo.add(c); 697 while (todo.size() > 0) { 698 var d = todo.removeFirst(); 704 this.addConstraintsConsumingTo(d.output(), todo); 720 var todo = new OrderedCollection() [all...] |
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v4/ |
v8-deltablue.js | 645 var todo = sources; 646 while (todo.size() > 0) { 647 var c = todo.removeFirst(); 651 this.addConstraintsConsumingTo(c.output(), todo); 686 var todo = new OrderedCollection(); 687 todo.add(c); 688 while (todo.size() > 0) { 689 var d = todo.removeFirst(); 695 this.addConstraintsConsumingTo(d.output(), todo); 711 var todo = new OrderedCollection() [all...] |
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v5/ |
v8-deltablue.js | 645 var todo = sources; 646 while (todo.size() > 0) { 647 var c = todo.removeFirst(); 651 this.addConstraintsConsumingTo(c.output(), todo); 686 var todo = new OrderedCollection(); 687 todo.add(c); 688 while (todo.size() > 0) { 689 var d = todo.removeFirst(); 695 this.addConstraintsConsumingTo(d.output(), todo); 711 var todo = new OrderedCollection() [all...] |
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v6/ |
v8-deltablue.js | 645 var todo = sources; 646 while (todo.size() > 0) { 647 var c = todo.removeFirst(); 651 this.addConstraintsConsumingTo(c.output(), todo); 686 var todo = new OrderedCollection(); 687 todo.add(c); 688 while (todo.size() > 0) { 689 var d = todo.removeFirst(); 695 this.addConstraintsConsumingTo(d.output(), todo); 711 var todo = new OrderedCollection() [all...] |
/external/chromium_org/v8/benchmarks/ |
deltablue.js | 651 var todo = sources; 652 while (todo.size() > 0) { 653 var c = todo.removeFirst(); 657 this.addConstraintsConsumingTo(c.output(), todo); 692 var todo = new OrderedCollection(); 693 todo.add(c); 694 while (todo.size() > 0) { 695 var d = todo.removeFirst(); 701 this.addConstraintsConsumingTo(d.output(), todo); 717 var todo = new OrderedCollection() [all...] |
/external/llvm/lib/CodeGen/ |
MachineVerifier.cpp | 1159 SmallPtrSet<const MachineBasicBlock*, 8> todo; local 1194 SmallPtrSet<const MachineBasicBlock*, 8> todo; local [all...] |