/external/v8/src/compiler/ |
H A D | escape-analysis-reducer.cc | 200 for (Edge edge : node->use_edges()) { 201 PrintF(" #%d", edge.from()->id());
|
/external/ImageMagick/www/api/ |
H A D | morphology.php | 107 <p>AcquireKernelBuiltIn() returned one of the 'named' built-in types of kernels used for special purposes such as gaussian blurring, skeleton pruning, and edge distance determination.</p> 142 <dd> LoG:{radius},{sigma} "Laplacian of a Gaussian" or "Mexician Hat" Kernel. The supposed ideal edge detection, zero-summing kernel. </dd> 168 <dd> Laplacian:{type} Discrete Lapacian Kernels, (without normalization) Type 0 : 3x3 with center:8 surounded by -1 (8 neighbourhood) Type 1 : 3x3 with center:4 edge:-1 corner:0 (4 neighbourhood) Type 2 : 3x3 with center:4 edge:1 corner:-2 Type 3 : 3x3 with center:4 edge:-2 corner:1 Type 5 : 5x5 laplacian Type 7 : 7x7 laplacian Type 15 : 5x5 LoG (sigma approx 1.4) Type 19 : 9x9 LoG (sigma approx 1.4) </dd> 194 <dd> However this kernel is als at the heart of the FreiChen Edge Detection Process which uses a set of 9 specially weighted kernel. These 9 kernels not be normalized, but directly applied to the image. The results is then added together, to produce the intensity of an edge in a specific direction. The square root of the pixel value can then be taken as the cosine of the edge, and at least 2 such runs at 90 degrees from each other, both the direction and the strength of the edge can be determined. </dd> 216 <dd> The first 4 are for edge detection, the next 4 are for line detection and the last is to add a average component to the results. </dd> 250 <dd> Ring:{radius1},{radius2}[,{scale}] A ring of the values given that falls between the two radii. Defaults to a ring of approximataly 3 radius in a 7x7 kernel. This is the 'edge' pixel [all...] |
H A D | decorate.php | 129 <p>RaiseImage() creates a simulated three-dimensional button-like effect by lightening and darkening the edges of the image. Members width and height of raise_info define the width of the vertical and horizontal edge of the effect.</p>
|
/external/antlr/antlr-3.4/runtime/C/include/ |
H A D | antlr3collections.h | 424 * A vector used to detect cycles in the edge dependecies. It is used 463 * A method that adds an edge from one node to another. An edge 475 void (*addEdge) (struct ANTLR3_TOPO_struct * topo, ANTLR3_UINT32 edge, ANTLR3_UINT32 dependency); 481 * is only as large as the largest node index you created an edge for. This means 482 * that if you had an input of 32 nodes, but that largest node with an edge 496 * on the previously supplied edge data.
|
/external/deqp/framework/common/ |
H A D | tcuVectorUtil.hpp | 70 inline float step (float edge, float x) { return (x < edge) ? 0.0f : 1.0f; } argument 80 inline double step (double edge, double x) { return (x < edge) ? 0.0 : 1.0; } argument
|
/external/swiftshader/src/Shader/ |
H A D | SetupRoutine.cpp | 247 edge(primitive, data, Xq[i + 1 - d], Yq[i + 1 - d], Xq[i + d], Yq[i + d], q); 560 void SetupRoutine::edge(Pointer<Byte> &primitive, Pointer<Byte> &data, const Int &Xa, const Int &Ya, const Int &Xb, const Int &Yb, Int &q) function in class:sw::SetupRoutine 581 Pointer<Byte> edge = IfThenElse(swap, rightEdge, leftEdge); local 608 *Pointer<Short>(edge + y * sizeof(Primitive::Span)) = Short(Clamp(x, xMin, xMax));
|
/external/tensorflow/tensorflow/core/common_runtime/ |
H A D | shape_refiner.h | 222 Status TryToInferTensorOutputFromInputShapes(const Edge* edge, Tensor* output,
|
/external/antlr/antlr-3.4/runtime/C/src/ |
H A D | antlr3collections.c | 116 static void addEdge (pANTLR3_TOPO topo, ANTLR3_UINT32 edge, ANTLR3_UINT32 dependency); 2316 addEdge (pANTLR3_TOPO topo, ANTLR3_UINT32 edge, ANTLR3_UINT32 dependency) argument 2322 if (edge>dependency) 2324 maxEdge = edge; 2330 // We need to add an edge to says that the node indexed by 'edge' is 2334 // First see if we have enough room in the edges array to add the edge? 2372 // If the edge was flagged as depending on itself, then we just 2376 if (edge == dependency) 2381 // Pick up the bit map for the requested edge [all...] |
/external/opencv/cxcore/include/ |
H A D | cxcore.h | 1171 are not connected or return pointer to already existing edge 1173 Functions return 1 if a new edge was created, 0 otherwise */ 1176 const CvGraphEdge* edge CV_DEFAULT(NULL), 1181 const CvGraphEdge* edge CV_DEFAULT(NULL), 1184 /* Remove edge connecting two vertices */ 1189 /* Find edge connecting two vertices */ 1212 /* Retrieves index of a graph edge given its pointer */ 1213 #define cvGraphEdgeIdx( graph, edge ) ((edge)->flags & CV_SET_ELEM_IDX_MASK) 1234 #define CV_IS_GRAPH_EDGE_VISITED(edge) \ 1243 CvGraphEdge* edge; /* current edge */ member in struct:CvGraphScanner [all...] |
H A D | cxtypes.h | 1270 outcoming edge (or 0 if isolated vertex)). Edges are stored in another set. 1273 Each edge consists of 1282 next[0] points to the next edge in the vtx[0] adjacency list and 1283 next[1] points to the next edge in the vtx[1] adjacency list. 1617 /* Return next graph edge for given vertex: */ 1618 #define CV_NEXT_GRAPH_EDGE( edge, vertex ) \ 1619 (assert((edge)->vtx[0] == (vertex) || (edge)->vtx[1] == (vertex)), \ 1620 (edge)->next[(edge) [all...] |
/external/tensorflow/tensorflow/core/kernels/hexagon/ |
H A D | graph_transferer.cc | 389 // Unused edge will be removed when removing node. 724 const Edge* edge = nullptr; local 725 TF_CHECK_OK(node.input_edge(1, &edge)); 726 const Node* input_node = edge->src(); 867 const Edge* edge = nullptr; local 868 TF_CHECK_OK(node.input_edge(idx, &edge)); 869 const Node* input_node = edge->src(); 871 const int port = edge->src_output();
|
/external/deqp/external/openglcts/modules/gl/ |
H A D | gl4cShaderImageLoadStoreTests.cpp | 7192 TextureShapeDefinition(GLuint edge, GLuint n_elements, GLenum type) argument 7193 : m_edge(edge), m_n_elements(n_elements), m_type(type) 7268 TextureShapeDefinition(texture_edge /* edge */, 6 /* n_elements */, GL_TEXTURE_2D_ARRAY)); 7270 TextureShapeDefinition(texture_edge /* edge */, 6 /* n_elements */, GL_TEXTURE_3D)); 7272 TextureShapeDefinition(texture_edge /* edge */, 1 /* n_elements */, GL_TEXTURE_CUBE_MAP)); 7274 TextureShapeDefinition(texture_edge /* edge */, 3 /* n_elements */, GL_TEXTURE_CUBE_MAP_ARRAY)); 7456 * @param edge Length of texture edge 7462 bool CompareRGBA8Textures(GLuint left_texture_id, GLuint right_texture_id, GLuint edge, GLuint n_layers, argument 7466 const GLuint texture_data_size = edge * edg 7559 CreateRGBA8DestinationTexture(GLuint edge, GLuint n_elements, GLenum target, GLuint& out_texture_id) argument 7590 CreateRGBA8SourceTexture(GLuint edge, GLuint n_elements, GLenum target, GLuint& out_texture_id) argument 7645 CreateRGBA8Texture(GLuint edge, GLenum target, GLuint n_layers, const std::vector<GLubyte>& texture_data, GLuint& out_texture_id) argument 7725 ExtractTextureData(GLuint texture_id, GLuint edge, GLuint n_layers, GLenum target, std::vector<GLubyte>& texture_data) argument [all...] |
/external/tensorflow/tensorflow/core/grappler/costs/ |
H A D | graph_properties.cc | 1058 for (const auto& edge : node->in_edges()) { 1059 if (edge->IsControlEdge()) { 1062 if (!edge->src()->IsConstant()) { 1065 const int input_id = edge->dst_input(); 1069 const NodeDef& node = edge->src()->def();
|
/external/ImageMagick/MagickCore/ |
H A D | feature.c | 127 % o lower_precent: percentage of edge pixels in the lower threshold. 129 % o upper_percent: percentage of edge pixels in the upper threshold. 164 edge, 183 if (GetMatrixElement(canny_cache,0,0,&edge) == MagickFalse) 185 edge.x=x; 186 edge.y=y; 187 if (SetMatrixElement(canny_cache,0,0,&edge) == MagickFalse) 195 status=GetMatrixElement(canny_cache,i,0,&edge); 207 if (IsAuthenticPixel(edge_image,edge.x+u,edge 162 edge, local [all...] |
/external/libpcap/ |
H A D | optimize.c | 141 struct edge **edges; 311 propedom(opt_state_t *opt_state, struct edge *ep) 321 * Compute edge dominators. 1184 struct edge *p; 1211 * first edge leading to this node. 1216 * If, for the predecessor along that edge, a register 1301 fold_edge(struct block *child, struct edge *ep) 1353 opt_j(opt_state_t *opt_state, struct edge *ep) 1372 * For each edge dominator that matches the successor of this 1373 * edge, promot [all...] |
/external/mesa3d/src/gallium/drivers/softpipe/ |
H A D | sp_setup.c | 51 * Triangle edge info 53 struct edge { struct 58 int lines; /**< number of lines on this edge */ 86 struct edge ebot; 87 struct edge etop; 88 struct edge emaj; 284 * edge fields (ebot, emaj, etop). 711 struct edge *eleft, 712 struct edge *eright, 792 /* edge vector [all...] |
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
H A D | dot.rb | 77 | edge [arrowsize=.5];
|
/external/libavc/common/arm/ |
H A D | ih264_deblk_chroma_a9.s | 25 @/* edge. Functions are coded in NEON assembly and can */ 61 @* Performs filtering of a chroma block horizontal edge when the 137 @* Performs filtering of a chroma block vertical edge when the 231 @* Performs filtering of a chroma block horizontal edge for cases where the 333 @* Performs filtering of a chroma block vertical edge for cases where the 472 @* Performs filtering of a chroma block vertical edge when the 550 @* Performs filtering of a chroma block vertical edge for cases where the 663 @* Performs filtering of a chroma block horizontal edge when the 750 @* Performs filtering of a chroma block vertical edge when the 855 @* Performs filtering of a chroma block horizontal edge fo [all...] |
/external/owasp/sanitizer/tools/findbugs/lib/ |
H A D | findbugs.jar | META-INF/ META-INF/MANIFEST.MF default.xsl edu/ edu/umd/ edu/umd/cs/ edu/ ... |
/external/python/cpython2/Lib/test/ |
H A D | test_set.py | 1744 for edge in g.values(): 1745 self.assertEqual(len(edge), 3) # each vertex connects to three edges 1747 self.assertEqual(vertices1, vertices2) # edge vertices in original set 1767 othervertices = set(edge for edges in cuboctahedron.values() for edge in edges) 1768 self.assertEqual(vertices, othervertices) # edge vertices in original set 1778 edge = vertex # Cuboctahedron vertices are edges in Cube 1779 self.assertEqual(len(edge), 2) # Two cube vertices define an edge 1780 for cubevert in edge [all...] |
/external/python/cpython3/Lib/test/ |
H A D | test_set.py | 1860 for edge in g.values(): 1861 self.assertEqual(len(edge), 3) # each vertex connects to three edges 1863 self.assertEqual(vertices1, vertices2) # edge vertices in original set 1883 othervertices = set(edge for edges in cuboctahedron.values() for edge in edges) 1884 self.assertEqual(vertices, othervertices) # edge vertices in original set 1894 edge = vertex # Cuboctahedron vertices are edges in Cube 1895 self.assertEqual(len(edge), 2) # Two cube vertices define an edge 1896 for cubevert in edge [all...] |
/external/tensorflow/tensorflow/compiler/jit/ |
H A D | encapsulate_subgraphs_pass_test.cc | 589 for (const Edge* edge : graph.edges()) { 590 if (edge->src()->IsSource() || edge->dst()->IsSink()) continue; 592 strings::StrCat(edge->src()->name(), ":", edge->src_output()), 593 strings::StrCat(edge->dst()->name(), ":", edge->dst_input()));
|
/external/libvpx/libvpx/vp8/common/x86/ |
H A D | loopfilter_sse2.asm | 248 pandn xmm4, xmm5 ; high edge variance additive 312 ; calculate breakout conditions and high edge variance 364 ; calculate breakout conditions and high edge variance 586 ; calculate breakout conditions and high edge variance 636 ; calculate breakout conditions and high edge variance 957 ; calculate filter mask and high edge variance 1022 ; calculate filter mask and high edge variance 1171 ; calculate filter mask and high edge variance 1238 ; calculate filter mask and high edge variance
|
/external/ImageMagick/Magick++/demo/ |
H A D | demo.cpp | 168 cout << " edge ..." << endl; 171 example.edge( );
|
/external/syslinux/gpxe/src/drivers/net/ath5k/ |
H A D | eeprom.h | 365 u16 edge; /* in half dBm */ member in struct:ath5k_edge_power
|