| /external/chromium_org/third_party/WebKit/Source/platform/fonts/ |
| GlyphPageTreeNode.cpp | 45 HashMap<int, GlyphPageTreeNode*>* GlyphPageTreeNode::roots = 0;
53 roots = new HashMap<int, GlyphPageTreeNode*>;
60 if (GlyphPageTreeNode* foundNode = roots->get(pageNumber))
67 roots->set(pageNumber, node);
74 if (roots) {
75 HashMap<int, GlyphPageTreeNode*>::iterator end = roots->end();
76 for (HashMap<int, GlyphPageTreeNode*>::iterator it = roots->begin(); it != end; ++it)
98 // Enumerate all the roots and prune any tree that contains our custom font data.
99 if (roots) {
100 HashMap<int, GlyphPageTreeNode*>::iterator end = roots->end()
[all...] |
| GlyphPageTreeNode.h | 47 // GlyphPageTreeNode for each glyph page number. The roots do not have a
113 static HashMap<int, GlyphPageTreeNode*>* roots; member in class:blink::GlyphPageTreeNode
|
| /external/jarjar/src/main/com/tonicsystems/jarjar/ |
| KeepProcessor.java | 31 private final List<String> roots = new ArrayList<String>(); field in class:KeepProcessor
44 closureHelper(closure, roots);
68 roots.add(name);
|
| /external/chromium_org/tools/gyp/pylib/gyp/generator/ |
| analyzer.py | 296 roots = set()
305 roots.add(target)
344 roots.discard(dep_target)
349 return targets, matching_targets, roots & build_file_targets
397 def _AddBuildTargets(target, roots, add_if_no_ancestor, result):
399 that need to be built (and are in |roots|) to |result|.
400 roots: set of root targets.
402 |target| to |result|. |target| must still be in |roots|.
408 target.in_roots = not target.back_deps and target in roots
411 _AddBuildTargets(back_dep_target, roots, False, result
[all...] |
| /external/fonttools/Lib/fontTools/misc/ |
| bezierTools.py | 36 roots = []
38 roots.append(-bx/ax2)
40 roots.append(-by/ay2)
41 points = [(ax*t*t + bx*t + cx, ay*t*t + by*t + cy) for t in roots if 0 <= t < 1] + [pt1, pt3]
64 roots = xRoots + yRoots
66 points = [(ax*t*t*t + bx*t*t + cx * t + dx, ay*t*t*t + by*t*t + cy * t + dy) for t in roots] + [pt1, pt4]
260 This function returns a list of roots. Note that the returned list
266 roots = []
269 roots = [-c/b]
271 # We have a true quadratic equation. Apply the quadratic formula to find two roots
[all...] |
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| CubicReduceOrder.cpp | 36 int roots = findExtrema(cubic[0].y, cubic[1].y, cubic[2].y, cubic[3].y, tValues); local
37 for (int index = 0; index < roots; ++index) {
59 int roots = findExtrema(cubic[0].x, cubic[1].x, cubic[2].x, cubic[3].x, tValues); local
60 for (int index = 0; index < roots; ++index) {
128 int roots; local
130 roots = findExtrema(cubic[0].x, cubic[1].x, cubic[2].x, cubic[3].x, tValues);
132 roots = findExtrema(cubic[0].y, cubic[1].y, cubic[2].y, cubic[3].y, tValues);
134 for (int index = 0; index < roots; ++index) {
|
| QuadraticImplicit.cpp | 27 static int findRoots(const QuadImplicitForm& i, const Quadratic& q2, double roots[4],
55 int rootCount = reducedQuarticRoots(t4, t3, t2, t1, t0, oneHint, roots);
59 return quarticRootsReal(firstCubicRoot, t4, t3, t2, t1, t0, roots);
62 static int addValidRoots(const double roots[4], const int count, double valid[4]) {
66 if (!approximately_zero_or_more(roots[index]) || !approximately_one_or_less(roots[index])) {
69 double t = 1 - roots[index];
137 int roots = intersect(q1, line, rootTs); local
138 if (roots == 0) {
144 if (roots == 2)
166 int roots = intersect(q2, *testLines[index], rootTs); local
[all...] |
| /external/compiler-rt/test/BlocksRuntime/ |
| makefile | 55 ditto $(RootsDirectory)/libclosure.roots/libclosure~dst/usr/local/lib/system $(ALTUSRLOCALLIBSYSTEM)
67 LibsystemRootPath ?= $(RootsDirectory)/Libsystem-$(LibsystemVersion).roots/Libsystem-$(LibsystemVersion)~dst/usr/lib/
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkGeometry.cpp | 119 int SkFindUnitQuadRoots(SkScalar A, SkScalar B, SkScalar C, SkScalar roots[2]) {
120 SkASSERT(roots);
123 return valid_unit_divide(-C, B, roots);
126 SkScalar* r = roots;
129 if (R < 0 || SkScalarIsNaN(R)) { // complex roots
137 if (r - roots == 2) {
138 if (roots[0] > roots[1])
139 SkTSwap<SkScalar>(roots[0], roots[1])
[all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| org.eclipse.equinox.p2.director.app_1.0.201.R36x_v20100823.jar | |
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkDQuadIntersection.cpp | 21 static int findRoots(const SkDQuadImplicit& i, const SkDQuad& quad, double roots[4],
51 int rootCount = SkReducedQuarticRoots(t4, t3, t2, t1, t0, oneHint, roots);
53 rootCount = SkQuarticRootsReal(firstCubicRoot, t4, t3, t2, t1, t0, roots);
57 roots[index] = 1 - roots[index];
63 static int addValidRoots(const double roots[4], const int count, double valid[4]) {
67 if (!approximately_zero_or_more(roots[index]) || !approximately_one_or_less(roots[index])) {
70 double t = 1 - roots[index];
130 int roots = rootTs.intersect(q1, line) local
158 int roots = rootTs.intersect(q2, *testLines[index]); local
[all...] |
| SkPathOpsCubic.cpp | 186 // cubic roots
255 double* roots = s; local
256 if (R2MinusQ3 < 0) { // we have 3 real roots
261 *roots++ = r;
265 *roots++ = r;
268 if (!AlmostDequalUlps(s[0], r) && (roots - s == 1 || !AlmostDequalUlps(s[1], r))) {
269 *roots++ = r;
282 *roots++ = r;
286 *roots++ = r;
290 return static_cast<int>(roots - s)
379 int roots = FindExtrema(sub[0].fY, sub[1].fY, sub[2].fY, sub[3].fY, extremeTs); local
[all...] |
| /external/chromium_org/chrome/browser/media_galleries/ |
| media_folder_finder.cc | 32 typedef base::Callback<void(const std::vector<base::FilePath>& /*roots*/)>
144 std::vector<base::FilePath> roots; local
156 roots.push_back(path);
161 roots.push_back(platform_root);
162 callback.Run(roots);
359 const std::vector<base::FilePath>& roots) {
364 roots_for_testing_ = roots;
368 const std::vector<base::FilePath>& roots) {
372 for (size_t i = 0; i < roots.size(); ++i) {
374 const base::FilePath& path = roots[i]
[all...] |
| /external/chromium_org/third_party/skia/src/effects/gradients/ |
| SkTwoPointConicalGradient.cpp | 32 // Return the number of distinct real roots, and write them into roots[] in
34 static int find_quad_roots(float A, float B, float C, float roots[2], bool descendingOrder = false) {
35 SkASSERT(roots);
38 return valid_divide(-C, B, roots);
60 roots[0] = 0;
66 roots[0] = r0 < r1 ? r0 : r1;
67 roots[1] = r0 > r1 ? r0 : r1;
69 SkTSwap(roots[0], roots[1])
108 float roots[2]; local
[all...] |
| /development/perftests/panorama/feature_stab/db_vlvm/ |
| db_image_homography.cpp | 119 double roots[3]; local
162 db_SolveCubic(roots,&nr_roots,p9[4],p9[3],p9[2],p9[1]);
166 if(roots[i]>0)
168 if((!signed_disambiguation) || (db_PolyEval1(p1,roots[i])*db_PolyEval1(p4,roots[i])>0))
170 fsol[j++]=db_SafeSqrtReciprocal(roots[i]);
|
| db_utilities_poly.h | 39 inline void db_SolveQuadratic(double *roots,int *nr_roots,double a,double b,double c)
50 roots[0]= -c/b;
62 roots[0]=q/a;
66 else roots[1]=c/q;
76 For a non-degenerate cubic with two roots, the first root is the single root and
79 DB_API void db_SolveCubic(double *roots,int *nr_roots,double a,double b,double c,double d);
84 DB_API void db_SolveQuartic(double *roots,int *nr_roots,double a,double b,double c,double d,double e);
89 DB_API void db_SolveQuarticForced(double *roots,int *nr_roots,double a,double b,double c,double d,double e);
|
| /external/chromium_org/components/bookmarks/browser/ |
| bookmark_codec.cc | 22 const char* BookmarkCodec::kRootsKey = "roots";
70 base::DictionaryValue* roots = new base::DictionaryValue(); local
71 roots->Set(kRootFolderNameKey, EncodeNode(bookmark_bar_node));
72 roots->Set(kOtherBookmarkFolderNameKey, EncodeNode(other_folder_node));
73 roots->Set(kMobileBookmarkFolderNameKey, EncodeNode(mobile_folder_node));
75 roots->Set(kMetaInfo, EncodeMetaInfo(*model_meta_info_map));
78 roots->SetString(kSyncTransactionVersion,
88 main->Set(kRootsKey, roots);
182 const base::Value* roots; local
183 if (!d_value.Get(kRootsKey, &roots))
[all...] |
| /external/chromium_org/third_party/skia/tests/ |
| PathOpsCubicLineIntersectionTest.cpp | 46 int roots = i.intersect(cubic, line); local
47 REPORTER_ASSERT(reporter, roots == 0);
138 int roots = doIntersect(i, cubic, line); local
139 for (int pt = 0; pt < roots; ++pt) {
|
| /external/chromium_org/chrome/browser/resources/chromeos/chromevox/tools/ |
| check_chromevox.py | 73 roots = [CVoxPath(),
79 sources = ReadSources(roots, need_source_text=True,
|
| /developers/build/ |
| build.gradle | 52 * @param roots
55 Map<String,String> collapsePaths(FileTree path, List<String> roots) {
80 // won't return the proper value from a call to roots.contains(String)!
81 // I'm using roots.sum here instead of tracking down why a list of
86 && (roots.sum {String r-> return r.equals(current.absolutePath) ? 1 : 0 } == 0)) {
|
| /external/opencv/cxcore/src/ |
| cxutils.cpp | 243 Finds real roots of cubic, quadratic or linear equation.
266 cvSolveCubic( const CvMat* coeffs, CvMat* roots )
281 if( !CV_IS_MAT(roots) )
282 CV_ERROR( !roots ? CV_StsNullPtr : CV_StsBadArg, "Output parameter is not a valid matrix" );
285 (CV_MAT_TYPE(roots->type) != CV_32FC1 && CV_MAT_TYPE(roots->type) != CV_64FC1) )
295 if( (roots->rows != 1 && roots->cols != 1) ||
296 roots->rows + roots->cols - 1 != 3
[all...] |
| /external/chromium_org/chrome/browser/ui/views/tabs/ |
| tab_drag_controller_interactive_uitest.cc | 1520 aura::Window::Windows roots = ash::Shell::GetAllRootWindows(); local
1572 aura::Window::Windows roots = ash::Shell::GetAllRootWindows(); local
1622 aura::Window::Windows roots = ash::Shell::GetAllRootWindows(); local
1681 aura::Window::Windows roots = ash::Shell::GetAllRootWindows(); local
1752 aura::Window::Windows roots = ash::Shell::GetAllRootWindows(); local
1902 aura::Window::Windows roots = ash::Shell::GetAllRootWindows(); local
1998 aura::Window::Windows roots = ash::Shell::GetAllRootWindows(); local
2029 aura::Window::Windows roots = ash::Shell::GetAllRootWindows(); local
[all...] |
| /external/chromium_org/chrome/browser/extensions/api/media_galleries/ |
| media_galleries_apitest.cc | 404 void SetRootsForFolderFinder(const std::vector<base::FilePath>& roots) {
409 roots));
414 const std::vector<base::FilePath>& roots,
417 finder->SetRootsForTesting(roots);
619 std::vector<base::FilePath> roots; local
620 roots.push_back(scan_root.path());
621 SetRootsForFolderFinder(roots);
|
| /external/chromium_org/net/spdy/ |
| spdy_priority_forest.h | 423 std::map<uint64, NodeId> roots; // maps cumulative weight to root node ID local
433 roots[total_weight] = root_id;
446 DCHECK(roots.empty());
449 DCHECK(!roots.empty());
454 roots.upper_bound(base::RandGenerator(total_weight));
455 DCHECK(root_iter != roots.end());
|
| /external/chromium_org/tools/clang/blink_gc_plugin/ |
| process-graph.py | 18 help='Detect cycles containing GC roots')
51 roots = [] variable
228 roots.append(edge)
256 for root_edge in roots:
318 global roots
322 roots = dump[1]
326 dump = (graph, roots)
454 log("Detecting cycles containg GC roots")
|
