| /prebuilts/go/darwin-x86/test/chan/ |
| goroutines.go | 31 leftmost := make(chan int)
32 right := leftmost
33 left := leftmost
40 <-leftmost
|
| /prebuilts/go/linux-x86/test/chan/ |
| goroutines.go | 31 leftmost := make(chan int)
32 right := leftmost
33 left := leftmost
40 <-leftmost
|
| /prebuilts/go/darwin-x86/misc/cgo/stdio/ |
| chain.go | 35 leftmost := make(chan int)
37 right := leftmost
44 x := <-leftmost
|
| /prebuilts/go/linux-x86/misc/cgo/stdio/ |
| chain.go | 35 leftmost := make(chan int)
37 right := leftmost
44 x := <-leftmost
|
| /prebuilts/go/darwin-x86/src/crypto/rsa/ |
| pss.go | 81 // 11. Set the leftmost 8 * emLen - emBits bits of the leftmost octet in
116 // 5. Let maskedDB be the leftmost emLen - hLen - 1 octets of EM, and
121 // 6. If the leftmost 8 * emLen - emBits bits of the leftmost octet in
133 // 9. Set the leftmost 8 * emLen - emBits bits of the leftmost octet in DB
153 // 10. If the emLen - hLen - sLen - 2 leftmost octets of DB are not zero
154 // or if the octet at position emLen - hLen - sLen - 1 (the leftmost
|
| /prebuilts/go/linux-x86/src/crypto/rsa/ |
| pss.go | 81 // 11. Set the leftmost 8 * emLen - emBits bits of the leftmost octet in
116 // 5. Let maskedDB be the leftmost emLen - hLen - 1 octets of EM, and
121 // 6. If the leftmost 8 * emLen - emBits bits of the leftmost octet in
133 // 9. Set the leftmost 8 * emLen - emBits bits of the leftmost octet in DB
153 // 10. If the emLen - hLen - sLen - 2 leftmost octets of DB are not zero
154 // or if the octet at position emLen - hLen - sLen - 1 (the leftmost
|
| /external/valgrind/none/tests/s390x/ |
| tmll.c | 68 /* test #5: selected bits are mixed, leftmost bit is 0 */
73 /* test #6: selected bits are mixed, leftmost bit is 1 */
|
| /hardware/bsp/intel/peripheral/libupm/src/nrf8001/ |
| dtm.h | 43 #define DTM_LE_PKT_0X0F 0x01 /**< Bit pattern 11110000 (LSB is the leftmost bit). */
44 #define DTM_LE_PKT_0X55 0x02 /**< Bit pattern 10101010 (LSB is the leftmost bit). */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/splay_tree_/ |
| erase_fn_imps.hpp | 131 node_pointer p_target_r = leftmost(p_r);
151 leftmost(node_pointer p_nd) function in class:PB_DS_CLASS_C_DEC
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/splay_tree_/ |
| erase_fn_imps.hpp | 131 node_pointer p_target_r = leftmost(p_r);
151 leftmost(node_pointer p_nd) function in class:PB_DS_CLASS_C_DEC
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/splay_tree_/ |
| erase_fn_imps.hpp | 131 node_pointer p_target_r = leftmost(p_r);
151 leftmost(node_pointer p_nd) function in class:PB_DS_CLASS_C_DEC
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/ |
| bisect.py | 50 If x is already in a, insert it to the left of the leftmost x.
72 insert just before the leftmost x already there.
|
| /prebuilts/gdb/linux-x86/lib/python2.7/ |
| bisect.py | 50 If x is already in a, insert it to the left of the leftmost x.
72 insert just before the leftmost x already there.
|
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/splay_tree_/ |
| erase_fn_imps.hpp | 131 node_pointer p_target_r = leftmost(p_r);
151 leftmost(node_pointer p_nd) function in class:PB_DS_CLASS_C_DEC
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| bisect.py | 50 If x is already in a, insert it to the left of the leftmost x.
72 insert just before the leftmost x already there.
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| bisect.py | 50 If x is already in a, insert it to the left of the leftmost x.
72 insert just before the leftmost x already there.
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib-dynload/ |
| _bisect.so | |
| /prebuilts/go/darwin-x86/src/regexp/ |
| regexp.go | 111 // begins as early as possible in the input (leftmost), and among those
113 // This so-called leftmost-first matching is the same semantics
116 // For POSIX leftmost-longest matching, see CompilePOSIX.
123 // leftmost-longest.
126 // begins as early as possible in the input (leftmost), and among those
128 // This so-called leftmost-longest matching is the same semantics
132 // However, there can be multiple leftmost-longest matches, with different
134 // Among the possible leftmost-longest matches, this package chooses
144 // Longest makes future searches prefer the leftmost-longest match.
146 // begins as early as possible in the input (leftmost), and among thos
[all...] |
| /prebuilts/go/linux-x86/src/regexp/ |
| regexp.go | 111 // begins as early as possible in the input (leftmost), and among those
113 // This so-called leftmost-first matching is the same semantics
116 // For POSIX leftmost-longest matching, see CompilePOSIX.
123 // leftmost-longest.
126 // begins as early as possible in the input (leftmost), and among those
128 // This so-called leftmost-longest matching is the same semantics
132 // However, there can be multiple leftmost-longest matches, with different
134 // Among the possible leftmost-longest matches, this package chooses
144 // Longest makes future searches prefer the leftmost-longest match.
146 // begins as early as possible in the input (leftmost), and among thos
[all...] |
| /frameworks/base/core/java/android/net/ |
| network-policy-restrictions.md | 8 The 2 leftmost columns define the Data Saver mode and whether the app is whitelisted, not whitelisted, or blacklisted for it.
|
| /libcore/ojluni/src/main/java/java/util/ |
| DualPivotQuicksort.java | 212 * @param leftmost indicates if this part is the leftmost in the range
214 private static void sort(int[] a, int left, int right, boolean leftmost) {
219 if (leftmost) {
223 * the leftmost part.
399 sort(a, left, less - 2, leftmost);
539 sort(a, left, less - 1, leftmost);
660 * @param leftmost indicates if this part is the leftmost in the range
662 private static void sort(long[] a, int left, int right, boolean leftmost) {
[all...] |
| /external/curl/lib/ |
| objnames.inc | 54 # 2) Leftmost dot character and any other char following it are removed.
58 # 6) Five leftmost substrings which end in an underscore character are
|
| /external/opencv3/doc/py_tutorials/py_imgproc/py_contours/py_contour_properties/ |
| py_contour_properties.markdown | 103 Extreme Points means topmost, bottommost, rightmost and leftmost points of the object.
105 leftmost = tuple(cnt[cnt[:,:,0].argmin()][0])
|
| /external/vulkan-validation-layers/libs/glm/detail/ |
| type_half.inl | 219 // the sign bit and the 10 leftmost bits of the
221 // leftmost bits are all zero, the NAN would turn
|
| /external/opencv3/modules/imgproc/src/ |
| lsd.cpp | 1002 edge* leftmost = 0; local
[all...] |
