HomeSort by relevance Sort by last modified time
    Searched full:adjacency (Results 1 - 25 of 42) sorted by null

1 2

  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/
d3dx9shape.h 30 float depth, struct ID3DXMesh **mesh, struct ID3DXBuffer **adjacency);
32 float length, UINT slices, UINT stacks, struct ID3DXMesh **mesh, struct ID3DXBuffer **adjacency);
34 UINT stacks, struct ID3DXMesh **mesh, struct ID3DXBuffer **adjacency);
36 struct ID3DXMesh **mesh, struct ID3DXBuffer **adjacency);
38 float extrusion, struct ID3DXMesh **mesh, struct ID3DXBuffer **adjacency, GLYPHMETRICSFLOAT *glyphmetrics);
40 FLOAT extrusion, struct ID3DXMesh **mesh, struct ID3DXBuffer **adjacency, GLYPHMETRICSFLOAT *glyphmetrics);
d3dx9mesh.h 335 STDMETHOD(ConvertPointRepsToAdjacency)(THIS_ CONST DWORD* point_reps, DWORD* adjacency) PURE;
336 STDMETHOD(ConvertAdjacencyToPointReps)(THIS_ CONST DWORD* adjacency, DWORD* point_reps) PURE;
337 STDMETHOD(GenerateAdjacency)(THIS_ FLOAT epsilon, DWORD* adjacency) PURE;
369 STDMETHOD(ConvertPointRepsToAdjacency)(THIS_ CONST DWORD* point_reps, DWORD* adjacency) PURE;
370 STDMETHOD(ConvertAdjacencyToPointReps)(THIS_ CONST DWORD* adjacency, DWORD* point_reps) PURE;
371 STDMETHOD(GenerateAdjacency)(THIS_ FLOAT epsilon, DWORD* adjacency) PURE;
411 STDMETHOD(ConvertPointRepsToAdjacency)(THIS_ CONST DWORD* point_reps, DWORD* adjacency) PURE;
412 STDMETHOD(ConvertAdjacencyToPointReps)(THIS_ CONST DWORD* adjacency, DWORD* point_reps) PURE;
413 STDMETHOD(GenerateAdjacency)(THIS_ FLOAT epsilon, DWORD* adjacency) PURE;
432 STDMETHOD(GetAdjacency)(THIS_ DWORD* adjacency) PURE
    [all...]
d3dx9anim.h 178 DWORD num_materials, const DWORD *adjacency, ID3DXSkinInfo *skin_info,
  /external/clang/test/Driver/
rewrite-objc.m 5 // FIXME: CHECK-NOT is broken somehow, it doesn't work here. Check adjacency instead.
rewrite-legacy-objc.m 5 // FIXME: CHECK-NOT is broken somehow, it doesn't work here. Check adjacency instead.
  /external/deqp/framework/referencerenderer/
rrPrimitiveTypes.hpp 44 PRIMITIVETYPE_LINES_ADJACENCY, //!< Separate lines (adjacency)
45 PRIMITIVETYPE_LINE_STRIP_ADJACENCY, //!< Line strip (adjacency)
46 PRIMITIVETYPE_TRIANGLES_ADJACENCY, //!< Separate triangles (adjacency)
47 PRIMITIVETYPE_TRIANGLE_STRIP_ADJACENCY, //!< Triangle strip (adjacency)
rrRenderer.cpp     [all...]
  /external/bison/src/
relation.h 24 /* Performing operations on graphs coded as list of adjacency.
  /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/
u_split_prim.h 105 /* TODO: implement adjacency primitives */
  /external/mesa3d/src/gallium/auxiliary/util/
u_split_prim.h 105 /* TODO: implement adjacency primitives */
  /frameworks/compile/mclinker/include/mcld/ADT/GraphLite/
ListDigraph.h 29 * Query adjacency | O(E) | O(#(fan-in) + #(fan-out))
  /external/eigen/Eigen/src/MetisSupport/
MetisSupport.h 68 // Now compute the real adjacency list of each column/row
133 IndexVector m_innerIndices; // Adjacency list
  /external/chromium_org/third_party/mesa/src/src/mesa/program/
register_allocate.c 121 GLboolean *adjacency; member in struct:ra_node
133 * set, the adjacency to this node is ignored, to implement the
298 g->nodes[n1].adjacency[n2] = GL_TRUE;
317 g->nodes[i].adjacency = rzalloc_array(g, GLboolean, count);
338 if (!g->nodes[n1].adjacency[n2]) {
  /external/mesa3d/src/mesa/program/
register_allocate.c 121 GLboolean *adjacency; member in struct:ra_node
133 * set, the adjacency to this node is ignored, to implement the
298 g->nodes[n1].adjacency[n2] = GL_TRUE;
317 g->nodes[i].adjacency = rzalloc_array(g, GLboolean, count);
338 if (!g->nodes[n1].adjacency[n2]) {
  /external/llvm/include/llvm/CodeGen/PBQP/
Graph.h 224 // Add the edge to the adjacency sets of its nodes.
513 /// Removes the given edge from the adjacency list of the given node.
522 /// to restore the edge in the named node's adjacency list.
554 /// adjacency set of the nodes that the edge connects.
  /external/compiler-rt/lib/sanitizer_common/
sanitizer_deadlock_detector1.cc 10 // Deadlock detector implementation based on NxN adjacency bit matrix.
sanitizer_deadlock_detector2.cc 10 // Deadlock detector implementation based on adjacency lists.
  /external/compiler-rt/lib/tsan/rtl/
tsan_mutex.cc 51 // Build the "can lock" adjacency matrix.
  /external/openssl/crypto/x509v3/
v3_asid.c 343 * Calculate a_max + 1 to check for adjacency.
457 * Calculate a_max + 1 to check for adjacency.
v3_addr.c 799 * Punt if adjacent or overlapping. Check for adjacency by
879 * adjacency by subtracting one from b_min first.
    [all...]
  /external/opencv/cxcore/include/
cxtypes.h     [all...]
  /external/opencv/cvaux/src/
cvtexture.cpp 336 // normalize matrices. each element is a probability of gray value i,j adjacency in direction/magnitude k
  /external/chromium_org/third_party/WebKit/PerformanceTests/Dromaeo/resources/dromaeo/web/tests/
v8-raytrace.html     [all...]
cssquery-dojo.html     [all...]
  /external/tcpdump/
print-isoclns.c 187 { ISIS_TLV_PTP_ADJ, "Point-to-point Adjacency State"},
546 * Katz's point to point adjacency TLV uses codes to tell us the state of
547 * the remote adjacency. Enumerate them.
606 { 0x4, "Suppress adjacency advertisement"},
    [all...]

Completed in 1633 milliseconds

1 2