/external/opencv3/modules/ml/src/ |
H A D | kdtree.hpp | 43 Node() : idx(-1), left(-1), right(-1), boundary(0.f) {} 45 : idx(_idx), left(_left), right(_right), boundary(_boundary) {} 49 //! node indices of the left and the right branches 50 int left, right; member in struct:cv::ml::KDTree::Node 51 //! go to the left if query_vec[node.idx]<=node.boundary, otherwise go to the right
|
/external/skia/tests/ |
H A D | CanvasStateHelpers.cpp | 16 void complex_layers_draw(SkCanvas* canvas, float left, float top, argument 22 SkRect rect = SkRect::MakeLTRB(left, top, right, bottom); 29 float left, float top, float right, float bottom, int32_t spacer) { 34 complex_layers_draw(canvas, left, top, right, bottom, spacer); 39 void complex_clips_draw(SkCanvas* canvas, int32_t left, int32_t top, argument 42 SkRect clipRect = SkRect::MakeLTRB(SkIntToScalar(left), SkIntToScalar(top), 53 int32_t left, int32_t top, int32_t right, int32_t bottom, int32_t clipOp, 67 complex_clips_draw(canvas, left, top, right, bottom, clipOp, localRegion); 28 complex_layers_draw_from_canvas_state(SkCanvasState* state, float left, float top, float right, float bottom, int32_t spacer) argument 52 complex_clips_draw_from_canvas_state(SkCanvasState* state, int32_t left, int32_t top, int32_t right, int32_t bottom, int32_t clipOp, int32_t regionRects, int32_t* rectCoords) argument
|
/external/toybox/toys/lsb/ |
H A D | seq.c | 63 int i, len, dot, left = 0, right = 0; local 71 if (left<dot) left = dot; 74 } else if (len>left) left = len; 77 sprintf(fmt_str = toybuf, "%%0%d.%df", left+right+!!right, right);
|
/external/toybox/toys/other/ |
H A D | inotifyd.c | 86 int left = len - (((char *)event)-(char *)buf), local 90 if (left >= size) size += event->len; 91 if (left < size) break;
|
/external/v8/test/cctest/ |
H A D | test-elements-kind.cc | 43 bool EQUALS(Handle<T> left, Handle<M> right) { argument 44 if (*left == *right) return true; 45 return JSObject::Equals(Handle<Object>::cast(left), 52 bool EQUALS(Handle<T> left, M right) { argument 53 return EQUALS(left, handle(right)); 58 bool EQUALS(T left, Handle<M> right) { argument 59 return EQUALS(handle(left), right);
|
/external/webrtc/webrtc/modules/utility/source/ |
H A D | audio_frame_operations_unittest.cc | 30 void SetFrameData(AudioFrame* frame, int16_t left, int16_t right) { argument 32 frame->data_[i] = left;
|
/external/webrtc/webrtc/modules/video_render/linux/ |
H A D | video_x11_render.cc | 65 const float left, 89 renderChannel->Init(_window, left, top, right, bottom); 129 float& left, 143 renderChannel->GetStreamProperties(zOrder, left, top, right, bottom); 62 CreateX11RenderChannel( int32_t streamId, int32_t zOrder, const float left, const float top, const float right, const float bottom) argument 126 GetIncomingStreamProperties( int32_t streamId, uint32_t& zOrder, float& left, float& top, float& right, float& bottom) argument
|
/external/zxing/qr_scanner/src/com/google/zxing/client/android/ |
H A D | PlanarYUVLuminanceSource.java | 38 private final int left; field in class:PlanarYUVLuminanceSource 41 public PlanarYUVLuminanceSource(byte[] yuvData, int dataWidth, int dataHeight, int left, int top, argument 45 if (left + width > dataWidth || top + height > dataHeight) { 52 this.left = left; 68 int offset = (y + top) * dataWidth + left; 86 int inputOffset = top * dataWidth + left; 114 int inputOffset = top * dataWidth + left; 132 for (int y = 0, rowStart = top * dataWidth + left; y < height; y++, rowStart += dataWidth) {
|
/external/android-clat/ |
H A D | checksum.c | 36 int left = len; local 39 while(left > 1) { 42 left -= 2; 44 if(left) {
|
/external/autotest/frontend/client/src/autotest/common/ui/ |
H A D | ContextMenu.java | 70 public void showAt(int left, int top) { argument 71 popup.setPopupPosition(left, top); 75 public void showAtWindow(int left, int top) { argument 76 showAt(left + Window.getScrollLeft(), top + Window.getScrollTop());
|
/external/blktrace/ |
H A D | rbtree.c | 50 struct rb_node *left = node->rb_left; local 53 if ((node->rb_left = left->rb_right)) 54 rb_set_parent(left->rb_right, node); 55 left->rb_right = node; 57 rb_set_parent(left, parent); 62 parent->rb_right = left; 64 parent->rb_left = left; 67 root->rb_node = left; 68 rb_set_parent(node, left); 233 struct rb_node *old = node, *left; local [all...] |
/external/clang/include/clang/Analysis/Analyses/ |
H A D | ThreadSafetyLogical.h | 62 const LExpr *left() const { return LHS; } function in class:clang::threadSafety::lexpr::BinOp 63 LExpr *left() { return LHS; } function in class:clang::threadSafety::lexpr::BinOp
|
/external/clang/test/CodeGenCXX/ |
H A D | microsoft-abi-multiple-nonvirtual-inheritance.cpp | 4 virtual void left(); 15 virtual void left(); 25 child->left(); 36 void ChildOverride::left() { function in class:ChildOverride 37 // CHECK: define x86_thiscallcc void @"\01?left@ChildOverride@@UAEXXZ"(%struct.ChildOverride* %[[THIS:.*]]) 54 child->left(); 186 virtual void left();
|
/external/clang/test/CodeGenObjC/Inputs/ |
H A D | nsvalue-boxed-expressions-support.h | 49 CGFloat left; member in struct:NSEdgeInsets
|
/external/fio/lib/ |
H A D | prio_tree.h | 8 struct prio_tree_node *left; member in struct:prio_tree_node 48 (ptr)->left = (ptr)->right = (ptr)->parent = (ptr); \ 74 return node->left == node;
|
H A D | rbtree.c | 50 struct rb_node *left = node->rb_left; local 53 if ((node->rb_left = left->rb_right)) 54 rb_set_parent(left->rb_right, node); 55 left->rb_right = node; 57 rb_set_parent(left, parent); 62 parent->rb_right = left; 64 parent->rb_left = left; 67 root->rb_node = left; 68 rb_set_parent(node, left); 233 struct rb_node *old = node, *left; local [all...] |
/external/guava/guava/src/com/google/common/collect/ |
H A D | ReverseNaturalOrdering.java | 33 @Override public int compare(Comparable left, Comparable right) { argument 34 checkNotNull(left); // right null is caught later 35 if (left == right) { 39 return right.compareTo(left);
|
/external/guava/guava/src/com/google/common/primitives/ |
H A D | SignedBytes.java | 191 public int compare(byte[] left, byte[] right) { argument 192 int minLength = Math.min(left.length, right.length); 194 int result = SignedBytes.compare(left[i], right[i]); 199 return left.length - right.length;
|
/external/guava/guava-gwt/test-super/com/google/common/primitives/super/com/google/common/primitives/ |
H A D | ByteArrayAsListTest.java | 79 private static Byte[] concat(Byte[] left, Byte[] right) { argument 80 Byte[] result = new Byte[left.length + right.length]; 81 System.arraycopy(left, 0, result, 0, left.length); 82 System.arraycopy(right, 0, result, left.length, right.length);
|
H A D | CharArrayAsListTest.java | 79 private static Character[] concat(Character[] left, Character[] right) { argument 80 Character[] result = new Character[left.length + right.length]; 81 System.arraycopy(left, 0, result, 0, left.length); 82 System.arraycopy(right, 0, result, left.length, right.length);
|
H A D | DoubleArrayAsListTest.java | 79 private static Double[] concat(Double[] left, Double[] right) { argument 80 Double[] result = new Double[left.length + right.length]; 81 System.arraycopy(left, 0, result, 0, left.length); 82 System.arraycopy(right, 0, result, left.length, right.length);
|
H A D | FloatArrayAsListTest.java | 79 private static Float[] concat(Float[] left, Float[] right) { argument 80 Float[] result = new Float[left.length + right.length]; 81 System.arraycopy(left, 0, result, 0, left.length); 82 System.arraycopy(right, 0, result, left.length, right.length);
|
H A D | IntArrayAsListTest.java | 80 private static Integer[] concat(Integer[] left, Integer[] right) { argument 81 Integer[] result = new Integer[left.length + right.length]; 82 System.arraycopy(left, 0, result, 0, left.length); 83 System.arraycopy(right, 0, result, left.length, right.length);
|
H A D | LongArrayAsListTest.java | 79 private static Long[] concat(Long[] left, Long[] right) { argument 80 Long[] result = new Long[left.length + right.length]; 81 System.arraycopy(left, 0, result, 0, left.length); 82 System.arraycopy(right, 0, result, left.length, right.length);
|
H A D | ShortArrayAsListTest.java | 79 private static Short[] concat(Short[] left, Short[] right) { argument 80 Short[] result = new Short[left.length + right.length]; 81 System.arraycopy(left, 0, result, 0, left.length); 82 System.arraycopy(right, 0, result, left.length, right.length);
|