/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | TriangleUtilities.h | 10 bool pointInTriangle(const Triangle& triangle, const _Point& pt);
|
H A D | TriangleUtilities.cpp | 11 bool pointInTriangle(const Triangle& triangle, const _Point& pt) { argument 13 _Vector v0 = triangle[2] - triangle[0]; 14 _Vector v1 = triangle[1] - triangle[0]; 15 _Vector v2 = pt - triangle[0]; 29 // Check if point is in triangle
|
/external/skia/experimental/Intersection/ |
H A D | TriangleUtilities.h | 10 bool pointInTriangle(const Triangle& triangle, const _Point& pt);
|
H A D | TriangleUtilities.cpp | 11 bool pointInTriangle(const Triangle& triangle, const _Point& pt) { argument 13 _Vector v0 = triangle[2] - triangle[0]; 14 _Vector v1 = triangle[1] - triangle[0]; 15 _Vector v2 = pt - triangle[0]; 29 // Check if point is in triangle
|
/external/chromium_org/third_party/WebKit/Source/platform/geometry/ |
H A D | FloatPolygonTest.cpp | 77 * Checks a right triangle. This test covers all of the trivial FloatPolygon accessors. 90 const FloatPolygon& triangle = triangleTestValue.polygon(); local 92 EXPECT_EQ(RULE_NONZERO, triangle.fillRule()); 93 EXPECT_FALSE(triangle.isEmpty()); 95 EXPECT_EQ(3u, triangle.numberOfVertices()); 96 EXPECT_EQ(FloatPoint(200, 100), triangle.vertexAt(0)); 97 EXPECT_EQ(FloatPoint(200, 200), triangle.vertexAt(1)); 98 EXPECT_EQ(FloatPoint(100, 200), triangle.vertexAt(2)); 100 EXPECT_EQ(3u, triangle.numberOfEdges()); 101 EXPECT_EQ(FloatPoint(200, 100), triangle 186 const FloatPolygon& triangle = triangleTestValue.polygon(); local 213 const FloatPolygon& triangle = triangleTestValue.polygon(); local [all...] |
/external/chromium_org/third_party/skia/tests/ |
H A D | PathOpsDTriangleTest.cpp | 33 const SkDTriangle& triangle = tests[index]; local 34 SkASSERT(ValidTriangle(triangle)); 35 bool result = triangle.contains(inPoint[index]); 37 SkDebugf("%s [%d] expected point in triangle\n", __FUNCTION__, index); 40 result = triangle.contains(outPoint[index]); 42 SkDebugf("%s [%d] expected point outside triangle\n", __FUNCTION__, index); 60 const SkDTriangle& triangle = oneOff[index]; local 61 SkASSERT(ValidTriangle(triangle)); 63 bool result = triangle.contains(triangle [all...] |
H A D | PathOpsTestCommon.h | 24 bool ValidTriangle(const SkDTriangle& triangle);
|
/external/skia/tests/ |
H A D | PathOpsDTriangleTest.cpp | 33 const SkDTriangle& triangle = tests[index]; local 34 SkASSERT(ValidTriangle(triangle)); 35 bool result = triangle.contains(inPoint[index]); 37 SkDebugf("%s [%d] expected point in triangle\n", __FUNCTION__, index); 40 result = triangle.contains(outPoint[index]); 42 SkDebugf("%s [%d] expected point outside triangle\n", __FUNCTION__, index); 60 const SkDTriangle& triangle = oneOff[index]; local 61 SkASSERT(ValidTriangle(triangle)); 63 bool result = triangle.contains(triangle [all...] |
H A D | PathOpsTestCommon.h | 24 bool ValidTriangle(const SkDTriangle& triangle);
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/llvmpipe/ |
H A D | lp_rast.h | 106 * Rasterization information for a triangle known to be in this bin, 153 } triangle; member in union:lp_rast_cmd_arg 177 lp_rast_arg_triangle( const struct lp_rast_triangle *triangle, argument 181 arg.triangle.tri = triangle; 182 arg.triangle.plane_mask = plane_mask; 187 * Build argument for a contained triangle. 190 * left coordinates of the a block that fully encloses the triangle. 193 lp_rast_arg_triangle_contained( const struct lp_rast_triangle *triangle, argument 197 arg.triangle [all...] |
H A D | lp_setup_vbuf.c | 187 setup->triangle( setup, 197 /* emit first triangle vertex as first triangle vertex */ 198 setup->triangle( setup, 207 /* emit last triangle vertex as last triangle vertex */ 208 setup->triangle( setup, 220 setup->triangle( setup, 229 setup->triangle( setup, 240 /* emit last quad vertex as first triangle verte [all...] |
H A D | lp_rast_tri.c | 120 arg2.triangle.tri = arg.triangle.tri; 121 arg2.triangle.plane_mask = (1<<3)-1; 130 arg2.triangle.tri = arg.triangle.tri; 131 arg2.triangle.plane_mask = (1<<4)-1; 255 const struct lp_rast_triangle *tri = arg.triangle.tri; 257 int x = (arg.triangle.plane_mask & 0xff) + task->x; 258 int y = (arg.triangle.plane_mask >> 8) + task->y; 369 const struct lp_rast_triangle *tri = arg.triangle [all...] |
H A D | lp_rast_tri_tmp.h | 66 * of the triangle's bounds. 152 * for this triangle. 158 const struct lp_rast_triangle *tri = arg.triangle.tri; 159 unsigned plane_mask = arg.triangle.plane_mask; 168 /* This triangle was partially binned and has been disabled */ 260 const struct lp_rast_triangle *tri = arg.triangle.tri; 262 unsigned mask = arg.triangle.plane_mask; 333 const struct lp_rast_triangle *tri = arg.triangle.tri; 335 unsigned mask = arg.triangle.plane_mask;
|
/external/mesa3d/src/gallium/drivers/llvmpipe/ |
H A D | lp_rast.h | 106 * Rasterization information for a triangle known to be in this bin, 153 } triangle; member in union:lp_rast_cmd_arg 177 lp_rast_arg_triangle( const struct lp_rast_triangle *triangle, argument 181 arg.triangle.tri = triangle; 182 arg.triangle.plane_mask = plane_mask; 187 * Build argument for a contained triangle. 190 * left coordinates of the a block that fully encloses the triangle. 193 lp_rast_arg_triangle_contained( const struct lp_rast_triangle *triangle, argument 197 arg.triangle [all...] |
H A D | lp_setup_vbuf.c | 187 setup->triangle( setup, 197 /* emit first triangle vertex as first triangle vertex */ 198 setup->triangle( setup, 207 /* emit last triangle vertex as last triangle vertex */ 208 setup->triangle( setup, 220 setup->triangle( setup, 229 setup->triangle( setup, 240 /* emit last quad vertex as first triangle verte [all...] |
H A D | lp_rast_tri.c | 120 arg2.triangle.tri = arg.triangle.tri; 121 arg2.triangle.plane_mask = (1<<3)-1; 130 arg2.triangle.tri = arg.triangle.tri; 131 arg2.triangle.plane_mask = (1<<4)-1; 255 const struct lp_rast_triangle *tri = arg.triangle.tri; 257 int x = (arg.triangle.plane_mask & 0xff) + task->x; 258 int y = (arg.triangle.plane_mask >> 8) + task->y; 369 const struct lp_rast_triangle *tri = arg.triangle [all...] |
H A D | lp_rast_tri_tmp.h | 66 * of the triangle's bounds. 152 * for this triangle. 158 const struct lp_rast_triangle *tri = arg.triangle.tri; 159 unsigned plane_mask = arg.triangle.plane_mask; 168 /* This triangle was partially binned and has been disabled */ 260 const struct lp_rast_triangle *tri = arg.triangle.tri; 262 unsigned mask = arg.triangle.plane_mask; 333 const struct lp_rast_triangle *tri = arg.triangle.tri; 335 unsigned mask = arg.triangle.plane_mask;
|
/external/chromium_org/third_party/angle/src/libGLESv2/renderer/d3d/d3d11/shaders/compiled/ |
H A D | passthrough3d11gs.h | 30 dcl_inputprimitive triangle
|
/external/chromium_org/ui/file_manager/file_manager/foreground/css/ |
H A D | tree.css | 23 background-image: -webkit-canvas(tree-triangle); 39 background-image: -webkit-canvas(tree-triangle);
|
/external/chromium_org/chrome/browser/resources/ntp4/ |
H A D | new_tab_theme.css | 79 .bare-minimum .disclosure-triangle { 89 .bare-minimum .footer-menu-button:hover .disclosure-triangle, 90 .bare-minimum .footer-menu-button[menu-shown] .disclosure-triangle {
|
H A D | footer_menu.css | 29 .footer-menu-button:hover:not([menu-shown]) .disclosure-triangle { 37 .footer-menu-button[menu-shown] .disclosure-triangle { 149 .disclosure-triangle {
|
/external/chromium_org/third_party/mesa/src/src/mesa/swrast_setup/ |
H A D | ss_tritmp.h | 33 static void TAG(triangle)(struct gl_context *ctx, GLuint e0, GLuint e1, GLuint e2 ) function 225 TAG(triangle)( ctx, v0, v1, v3 ); 228 TAG(triangle)( ctx, v1, v2, v3 ); 232 TAG(triangle)( ctx, v0, v1, v3 ); 233 TAG(triangle)( ctx, v1, v2, v3 ); 242 tri_tab[IND] = TAG(triangle);
|
/external/mesa3d/src/mesa/swrast_setup/ |
H A D | ss_tritmp.h | 33 static void TAG(triangle)(struct gl_context *ctx, GLuint e0, GLuint e1, GLuint e2 ) function 225 TAG(triangle)( ctx, v0, v1, v3 ); 228 TAG(triangle)( ctx, v1, v2, v3 ); 232 TAG(triangle)( ctx, v0, v1, v3 ); 233 TAG(triangle)( ctx, v1, v2, v3 ); 242 tri_tab[IND] = TAG(triangle);
|
/external/pdfium/core/src/fpdfapi/fpdf_render/ |
H A D | fpdf_render_pattern.cpp | 304 static void _DrawGouraud(CFX_DIBitmap* pBitmap, int alpha, CPDF_MeshVertex triangle[3])
argument 306 FX_FLOAT min_y = triangle[0].y, max_y = triangle[0].y;
308 if (min_y > triangle[i].y) {
309 min_y = triangle[i].y;
311 if (max_y < triangle[i].y) {
312 max_y = triangle[i].y;
329 CPDF_MeshVertex& vertex1 = triangle[i];
330 CPDF_MeshVertex& vertex2 = triangle[(i + 1) % 3];
391 CPDF_MeshVertex triangle[ local 439 CPDF_MeshVertex triangle[3]; local [all...] |
/external/chromium_org/third_party/flot/ |
H A D | jquery.flot.symbol.min.js | 10 symbol: "square" // or "diamond", "triangle", "cross" 14 */(function(e){function t(e,t,n){var r={square:function(e,t,n,r,i){var s=r*Math.sqrt(Math.PI)/2;e.rect(t-s,n-s,s+s,s+s)},diamond:function(e,t,n,r,i){var s=r*Math.sqrt(Math.PI/2);e.moveTo(t-s,n),e.lineTo(t,n-s),e.lineTo(t+s,n),e.lineTo(t,n+s),e.lineTo(t-s,n)},triangle:function(e,t,n,r,i){var s=r*Math.sqrt(2*Math.PI/Math.sin(Math.PI/3)),o=s*Math.sin(Math.PI/3);e.mov (…) method
|