HomeSort by relevance Sort by last modified time
    Searched refs:depth (Results 51 - 75 of 3356) sorted by null

1 23 4 5 6 7 8 91011>>

  /external/elfutils/libdw/
dwarf_getscopes_die.c 37 scope_visitor (unsigned int depth, struct Dwarf_Die_Chain *die, void *arg)
42 Dwarf_Die *scopes = malloc (depth * sizeof scopes[0]);
56 assert (i == depth);
59 return depth;
  /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/NarrowPhaseCollision/
btDiscreteCollisionDetectorInterface.h 24 /// This interface allows to query for closest points and penetration depth between two (convex) objects
39 virtual void addContactPoint(const btVector3& normalOnBInWorld,const btVector3& pointInWorld,btScalar depth)=0;
76 virtual void addContactPoint(const btVector3& normalOnBInWorld,const btVector3& pointInWorld,btScalar depth)
78 if (depth < m_distance)
82 m_distance = depth;
  /external/mesa3d/src/gallium/include/state_tracker/
xlib_sw_winsys.h 18 int depth; member in struct:xlib_drawable
  /prebuilts/go/darwin-x86/test/bench/shootout/
binary-tree-freelist.go 44 var n = flag.Int("n", 15, "depth")
84 func bottomUpTree(item, depth int) *Node {
85 if depth <= 0 {
88 return arena.New(item, bottomUpTree(2*item-1, depth-1), bottomUpTree(2*item, depth-1))
110 fmt.Printf("stretch tree of depth %d\t check: %d\n", stretchDepth, check)
114 for depth := minDepth; depth <= maxDepth; depth += 2 {
115 iterations := 1 << uint(maxDepth-depth+minDepth
    [all...]
  /prebuilts/go/linux-x86/test/bench/shootout/
binary-tree-freelist.go 44 var n = flag.Int("n", 15, "depth")
84 func bottomUpTree(item, depth int) *Node {
85 if depth <= 0 {
88 return arena.New(item, bottomUpTree(2*item-1, depth-1), bottomUpTree(2*item, depth-1))
110 fmt.Printf("stretch tree of depth %d\t check: %d\n", stretchDepth, check)
114 for depth := minDepth; depth <= maxDepth; depth += 2 {
115 iterations := 1 << uint(maxDepth-depth+minDepth
    [all...]
  /external/deqp/modules/glshared/
glsFragmentOpUtil.hpp 54 float depth[4]; member in struct:deqp::gls::FragmentOpUtil::Quad
60 for (int i = 0; i < DE_LENGTH_OF_ARRAY(depth); i++)
61 depth[i] = 0.0f;
90 // Viewport coordinates (depth in range [0, 1]).
94 float depth[4]; member in struct:deqp::gls::FragmentOpUtil::IntegerQuad
100 for (int i = 0; i < DE_LENGTH_OF_ARRAY(depth); i++)
101 depth[i] = 0.0f;
108 for (int i = 0; i < DE_LENGTH_OF_ARRAY(depth); i++)
109 depth[i] = 0.0f;
  /external/ImageMagick/PerlMagick/t/ttf/
read.t 22 q/size=>'512x512', depth=>8/,
32 q!font=>'input.ttf', fill=>'#0000FF', pointsize=>14, size=>'245x16', depth=>8!,
41 q!size=>'250x20', depth=>8!,
  /external/libunwind/tests/
Gtest-exc.c 46 int depth = 13; variable
66 for (i = 0; i < depth + 2; ++i)
113 if (n == depth)
141 depth = atol (argv[1]);
142 if (depth < 1)
144 fprintf (stderr, "Usage: %s depth\n"
145 " depth must be >= 1\n", argv[0]);
150 result = a (depth);
  /prebuilts/go/darwin-x86/src/strings/
export_test.go 16 func (r *genericReplacer) printNode(t *trieNode, depth int) (s string) {
25 s += Repeat(".", depth) + t.prefix
26 s += r.printNode(t.next, depth+len(t.prefix))
30 s += Repeat(".", depth) + string([]byte{byte(b)})
31 s += r.printNode(t.table[m], depth+1)
  /prebuilts/go/linux-x86/src/strings/
export_test.go 16 func (r *genericReplacer) printNode(t *trieNode, depth int) (s string) {
25 s += Repeat(".", depth) + t.prefix
26 s += r.printNode(t.next, depth+len(t.prefix))
30 s += Repeat(".", depth) + string([]byte{byte(b)})
31 s += r.printNode(t.table[m], depth+1)
  /libcore/xml/src/main/java/org/kxml2/io/
KXmlSerializer.java 40 private int depth; field in class:KXmlSerializer
90 depth++;
93 if (indent.length <= depth) {
94 boolean[] hlp = new boolean[depth + 4];
95 System.arraycopy(indent, 0, hlp, 0, depth);
98 indent[depth] = indent[depth - 1];
100 for (int i = nspCounts[depth - 1]; i < nspCounts[depth]; i++) {
113 if (nspCounts.length <= depth + 1)
    [all...]
  /external/ImageMagick/PerlMagick/t/
read.t 185 testReadCompare('xc:black', 'reference/read/input_xc_black.miff', q/size=>"70x46",, depth=>8/, 0.0, 0.0);
197 q/size=>"140x92", depth=>8/, 0.0, 0.0);
202 q/size=>"70x46", depth=>8/, 0.0, 0.0);
207 q/size=>"70x46", depth=>8/, 0.0, 0.0);
212 q/size=>"70x46", depth=>8/, 0.0, 0.0);
217 q/size=>"70x46", depth=>8/, 0.0, 0.0);
222 q/size=>"70x46", depth=>8/, 0.0, 0.0);
  /external/opencv3/modules/viz/src/vtk/
vtkCloudMatSource.cpp 71 CV_Assert(_cloud.depth() == CV_32F || _cloud.depth() == CV_64F);
76 int total = _cloud.depth() == CV_32F ? filterNanCopy<float>(cloud) : filterNanCopy<double>(cloud);
94 CV_Assert(_colors.depth() == CV_8U && _colors.channels() <= 4 && _colors.channels() != 2);
100 if (cloud.depth() == CV_32F)
102 else if (cloud.depth() == CV_64F)
115 CV_Assert(_normals.depth() == CV_32F || _normals.depth() == CV_64F);
122 if (n.depth() == CV_32F && c.depth() == CV_32F
    [all...]
  /frameworks/base/sax/java/android/sax/
RootElement.java 100 int depth = -1; field in class:RootElement.Handler
112 int depth = ++this.depth; local
114 if (depth == 0) {
128 if (depth == current.depth + 1) {
183 if (depth == current.depth) {
204 depth--;
  /external/dbus/tools/
dbus-print-message.c 50 indent (int depth)
52 while (depth-- > 0)
57 print_hex (unsigned char *bytes, unsigned int len, int depth)
63 indent (depth + 1);
66 columns = (80 - ((depth + 1) * INDENT)) / 3;
83 indent (depth + 1);
93 indent (depth);
100 print_ay (DBusMessageIter *iter, int depth)
139 print_hex (bytes, len, depth);
146 print_iter (DBusMessageIter *iter, dbus_bool_t literal, int depth)
    [all...]
  /external/mesa3d/src/gallium/auxiliary/util/
u_box.h 16 box->depth = 1;
31 box->depth = 1;
44 box->depth = 1;
60 box->depth = 1;
77 box->depth = d;
u_clear.h 43 const union pipe_color_union *color, double depth, unsigned stencil)
56 depth, stencil,
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vpx_mem/memory_manager/include/
cavl_impl.h 106 /* The maximum depth may be greater than the number of bits in a long,
108 ** depth. */
325 /* Zero-based depth in tree. */
326 unsigned depth = 0, unbal_depth = 0; variable
342 unbal_depth = depth;
355 L_BIT_ARR_1(branch, depth)
358 L_BIT_ARR_0(branch, depth)
362 depth++;
371 depth = unbal_depth;
376 cmp = L_BIT_ARR_VAL(branch, depth) ? 1 : -1
516 unsigned depth = 0, rm_depth; variable
780 unsigned depth = 0; variable
    [all...]
  /external/opencv3/modules/cudaarithm/test/
test_element_operations.cpp 56 std::pair<MatDepth, MatDepth> depth; local
67 depth = GET_PARAM(2);
73 stype = CV_MAKE_TYPE(depth.first, channels);
74 dtype = CV_MAKE_TYPE(depth.second, channels);
83 if ((depth.first == CV_64F || depth.second == CV_64F) && !supportFeature(devInfo, cv::cuda::NATIVE_DOUBLE))
88 cv::cuda::add(loadMat(mat1), loadMat(mat2), dst, cv::cuda::GpuMat(), depth.second);
99 cv::cuda::add(loadMat(mat1, useRoi), loadMat(mat2, useRoi), dst, cv::cuda::GpuMat(), depth.second);
102 cv::add(mat1, mat2, dst_gold, cv::noArray(), depth.second);
104 EXPECT_MAT_NEAR(dst_gold, dst, depth.first >= CV_32F || depth.second >= CV_32F ? 1e-4 : 0.0)
119 std::pair<MatDepth, MatDepth> depth; local
183 std::pair<MatDepth, MatDepth> depth; local
271 std::pair<MatDepth, MatDepth> depth; local
359 std::pair<MatDepth, MatDepth> depth; local
422 std::pair<MatDepth, MatDepth> depth; local
486 std::pair<MatDepth, MatDepth> depth; local
574 std::pair<MatDepth, MatDepth> depth; local
662 std::pair<MatDepth, MatDepth> depth; local
855 std::pair<MatDepth, MatDepth> depth; local
942 std::pair<MatDepth, MatDepth> depth; local
1029 std::pair<MatDepth, MatDepth> depth; local
1222 std::pair<MatDepth, MatDepth> depth; local
1308 std::pair<MatDepth, MatDepth> depth; local
1364 int depth; local
1478 int depth; local
1517 int depth; local
1587 int depth; local
1657 int depth; local
1737 int depth; local
1780 int depth; local
1842 int depth; local
2082 int depth; local
2180 int depth; local
2260 int depth; local
2305 int depth; local
2388 int depth; local
    [all...]
  /external/opencv3/modules/core/test/
test_hal_core.cpp 58 int depth = hcase % 2 == 0 ? CV_32F : CV_64F; local
59 double eps = depth == CV_32F ? 1e-5 : 1e-10;
63 Mat src(1, n, depth), dst(1, n, depth), dst0(1, n, depth);
74 if( depth == CV_32F )
80 if( depth == CV_32F )
86 if( depth == CV_32F )
120 n, (depth == CV_32F ? "f32" : "f64"), min_hal_t*1e6/freq, min_ocv_t*1e6/freq);
134 int depth = hcase % 2 == 0 ? CV_32F : CV_64F local
    [all...]
  /external/owasp/sanitizer/src/main/org/owasp/html/
Trie.java 57 private Trie(List<Map.Entry<String, Integer>> elements, int depth) {
58 this(elements, depth, 0, elements.size());
63 * @param depth the depth in the tree.
70 List<Map.Entry<String, Integer>> elements, int depth,
72 this.terminal = depth == elements.get(start).getKey().length();
89 char ch = elements.get(i).getKey().charAt(depth);
100 char lastCh = elements.get(start).getKey().charAt(depth);
102 char ch = elements.get(i).getKey().charAt(depth);
106 elements, depth + 1, childStart, i)
    [all...]
  /external/opencv3/modules/imgproc/test/
test_thresh.cpp 78 int depth = cvtest::randInt(rng) % 3, cn = cvtest::randInt(rng) % 4 + 1; local
80 depth = depth == 0 ? CV_8U : depth == 1 ? CV_16S : CV_32F;
82 types[INPUT][0] = types[OUTPUT][0] = types[REF_OUTPUT][0] = CV_MAKETYPE(depth,cn);
85 if( depth == CV_8U )
92 else if( depth == CV_16S )
126 int depth = _src.depth(), cn = _src.channels(); local
131 if( depth == CV_8U
    [all...]
  /external/opencv3/modules/superres/src/
input_array_utility.cpp 201 void convertToDepth(InputArray src, OutputArray dst, int depth)
203 CV_Assert( src.depth() <= CV_64F );
204 CV_Assert( depth == CV_8U || depth == CV_32F );
217 const double scale = maxVals[depth] / maxVals[src.depth()];
222 src.getGpuMat().convertTo(dst.getGpuMatRef(), depth, scale);
226 src.getUMat().convertTo(dst, depth, scale);
230 src.getMat().convertTo(dst, depth, scale);
241 const int depth = CV_MAT_DEPTH(type) local
266 const int depth = CV_MAT_DEPTH(type); local
291 const int depth = CV_MAT_DEPTH(type); local
    [all...]
  /external/libchrome/base/json/
json_writer.h 56 bool BuildJSONString(const Value& node, size_t depth);
59 void IndentLine(size_t depth);
  /external/libweave/third_party/chromium/base/json/
json_writer.h 56 bool BuildJSONString(const Value& node, size_t depth);
59 void IndentLine(size_t depth);

Completed in 502 milliseconds

1 23 4 5 6 7 8 91011>>