| /external/webkit/WebCore/platform/graphics/ |
| D | GlyphPageTreeNode.cpp | 43 HashMap<int, GlyphPageTreeNode*>* GlyphPageTreeNode::roots = 0; member in WebCore::GlyphPageTreeNode
51 roots = new HashMap<int, GlyphPageTreeNode*>; in getRoot()
55 GlyphPageTreeNode* node = pageNumber ? roots->get(pageNumber) : pageZeroRoot; in getRoot()
62 roots->set(pageNumber, node); in getRoot()
72 if (roots) { in treeGlyphPageCount()
73 HashMap<int, GlyphPageTreeNode*>::iterator end = roots->end(); in treeGlyphPageCount()
74 for (HashMap<int, GlyphPageTreeNode*>::iterator it = roots->begin(); it != end; ++it) in treeGlyphPageCount()
97 if (roots) { in pruneTreeCustomFontData()
98 HashMap<int, GlyphPageTreeNode*>::iterator end = roots->end(); in pruneTreeCustomFontData()
99 for (HashMap<int, GlyphPageTreeNode*>::iterator it = roots->begin(); it != end; ++it) in pruneTreeCustomFontData()
[all …]
|
| D | GlyphPageTreeNode.h | 185 static HashMap<int, GlyphPageTreeNode*>* roots; variable
|
| /external/skia/src/core/ |
| D | SkGeometry.cpp | 87 int SkFindUnitQuadRoots(SkScalar A, SkScalar B, SkScalar C, SkScalar roots[2]) in SkFindUnitQuadRoots()
89 SkASSERT(roots); in SkFindUnitQuadRoots()
92 return valid_unit_divide(-C, B, roots); in SkFindUnitQuadRoots()
94 SkScalar* r = roots; in SkFindUnitQuadRoots()
116 if (r - roots == 2) in SkFindUnitQuadRoots()
118 if (roots[0] > roots[1]) in SkFindUnitQuadRoots()
119 SkTSwap<SkScalar>(roots[0], roots[1]); in SkFindUnitQuadRoots()
120 else if (roots[0] == roots[1]) // nearly-equal? in SkFindUnitQuadRoots()
123 return (int)(r - roots); in SkFindUnitQuadRoots()
130 static int Sk64FindFixedQuadRoots(const Sk64& A, const Sk64& B, const Sk64& C, SkFixed roots[2]) in Sk64FindFixedQuadRoots()
[all …]
|
| D | SkQuadClipper.cpp | 29 SkScalar roots[2]; // we only expect one, but make room for 2 for safety in chopMonoQuadAtY() local
30 int count = SkFindUnitQuadRoots(A, B, C, roots); in chopMonoQuadAtY()
32 *t = roots[0]; in chopMonoQuadAtY()
|
| /external/junit/src/junit/runner/ |
| D | ClassPathTestCollector.java | 35 Hashtable collectFilesInRoots(Vector roots) { in collectFilesInRoots() argument
37 Enumeration e= roots.elements(); in collectFilesInRoots()
|
| /external/blktrace/btt/ |
| D | devs.c | 45 static void __destroy_heads(struct rb_root *roots) in __destroy_heads() argument
50 __destroy(roots[i].rb_node); in __destroy_heads()
52 free(roots); in __destroy_heads()
|
| D | inlines.h | 287 struct rb_root *roots = dip->heads; in __get_root() local
288 return &roots[type]; in __get_root()
|
| /external/webkit/V8Binding/v8/src/ |
| D | serialize.h | 141 int roots() { return roots_; } in roots() function
282 int roots() { return roots_; } in roots() function
|
| /external/speex/libspeex/ |
| D | lsp.c | 241 int roots=0; /* DR 8/2/94: number of roots found */ in lpc_to_lsp() local
355 roots++; in lpc_to_lsp()
387 return(roots); in lpc_to_lsp()
|
| D | sb_celp.c | 307 int i, roots, sub; in sb_encode() local
411 roots=lpc_to_lsp (lpc, st->lpcSize, lsp, 10, LSP_DELTA1, stack); in sb_encode()
412 if (roots!=st->lpcSize) in sb_encode()
414 roots = lpc_to_lsp (lpc, st->lpcSize, lsp, 10, LSP_DELTA2, stack); in sb_encode()
415 if (roots!=st->lpcSize) { in sb_encode()
|
| D | nb_celp.c | 255 int i, sub, roots; in nb_encode() local
322 roots=lpc_to_lsp (lpc, st->lpcSize, lsp, 10, LSP_DELTA1, stack); in nb_encode()
324 if (roots!=st->lpcSize) in nb_encode()
|
| /external/skia/include/core/ |
| D | SkGeometry.h | 26 int SkFindUnitQuadRoots(SkScalar A, SkScalar B, SkScalar C, SkScalar roots[2]);
|
| /external/qemu/distrib/sdl-1.2.12/ |
| D | COPYING | 183 (For example, a function in a library to compute square roots has
188 root function must still compute square roots.)
|
| /external/webkit/ |
| D | NOTICE | 219 (For example, a function in a library to compute square roots has
224 root function must still compute square roots.)
713 (For example, a function in a library to compute square roots has
718 root function must still compute square roots.)
|
| /external/webkit/WebKitTools/mangleme/ |
| D | LICENSE | 183 (For example, a function in a library to compute square roots has
188 root function must still compute square roots.)
|
| /external/webkit/WebCore/ |
| D | LICENSE-LGPL-2.1 | 183 (For example, a function in a library to compute square roots has
188 root function must still compute square roots.)
|
| D | LICENSE-LGPL-2 | 170 (For example, a function in a library to compute square roots has
175 root function must still compute square roots.)
|
| /external/jdiff/ |
| D | NOTICE.txt | 183 (For example, a function in a library to compute square roots has
188 root function must still compute square roots.)
|
| /external/bluetooth/glib/ |
| D | COPYING | 170 (For example, a function in a library to compute square roots has
175 root function must still compute square roots.)
|
| /external/bluetooth/glib/gmodule/ |
| D | COPYING | 170 (For example, a function in a library to compute square roots has
175 root function must still compute square roots.)
|
| /external/qemu/tcg/ |
| D | README | 6 compiler. It was simplified to be used in QEMU. It also has its roots
|
| /external/dropbear/libtommath/ |
| D | bn.tex | 1578 …000 bits) I'd avoid $b > 3$ situations. Will return a positive root only for even roots and return
1579 a root with the sign of the input for odd roots. For example, performing $4^{1/2}$ will return $2$…
1583 the algorithm requires raising $a$ to the power of $b$ it is not ideal to attempt to find roots for…
1584 values of $b$. If particularly large roots are required then a factor method could be used instead…
|
| /external/zlib/win32/ |
| D | DLL_FAQ.txt | 164 The roots of the problem reside deep inside the unsafety of
|
| /external/e2fsprogs/ |
| D | COPYING | 538 (For example, a function in a library to compute square roots has
543 root function must still compute square roots.)
|
| /external/webkit/V8Binding/v8/ |
| D | ChangeLog | 1093 full garbage collection and by changing the way we mark roots.
|