| /external/markdown/tests/misc/ |
| russian.html | 6 <p>? ???? ???? ???????? ???????? ????????? «?????», «?????» ? ?????? ????????????? ????? ? ???? ????? ??? ?????????, ????????: «Hi-diddly-ho, neighbor-ino» («????????, ?????????»). ??? ????????? ?????????? ??? ??????, ????????? ???????????? ?????, ? (…)
|
| /development/perftests/panorama/feature_mos/src/mosaic/ |
| CSite.h | 42 SEdgeVector *neighbor; member in class:CSite
51 inline SEdgeVector* getNeighbor() { return neighbor; }
59 inline void setNeighbor(SEdgeVector *nb) { neighbor = nb; }
|
| /packages/apps/Camera/jni/feature_mos/src/mosaic/ |
| CSite.h | 42 SEdgeVector *neighbor; member in class:CSite
51 inline SEdgeVector* getNeighbor() { return neighbor; }
59 inline void setNeighbor(SEdgeVector *nb) { neighbor = nb; }
|
| /packages/apps/LegacyCamera/jni/feature_mos/src/mosaic/ |
| CSite.h | 42 SEdgeVector *neighbor; member in class:CSite
51 inline SEdgeVector* getNeighbor() { return neighbor; }
59 inline void setNeighbor(SEdgeVector *nb) { neighbor = nb; }
|
| /external/ceres-solver/internal/ceres/ |
| canonical_views_clustering.cc | 172 for (IntSet::const_iterator neighbor = neighbors.begin();
173 neighbor != neighbors.end();
174 ++neighbor) {
176 FindWithDefault(view_to_canonical_view_similarity_, *neighbor, 0.0);
177 const double new_similarity = graph_->EdgeWeight(*neighbor, candidate);
199 for (IntSet::const_iterator neighbor = neighbors.begin();
200 neighbor != neighbors.end();
201 ++neighbor) {
203 FindWithDefault(view_to_canonical_view_similarity_, *neighbor, 0.0);
205 graph_->EdgeWeight(*neighbor, canonical_view)
[all...] |
| /libcore/luni/src/main/java/java/math/ |
| RoundingMode.java | 60 * Rounding mode where values are rounded towards the nearest neighbor. Ties
66 * Rounding mode where values are rounded towards the nearest neighbor. Ties
72 * Rounding mode where values are rounded towards the nearest neighbor. Ties
73 * are broken by rounding to the even neighbor.
|
| /external/iptables/extensions/ |
| libip6t_REJECT.c | 30 {"icmp6-not-neighbor", "not-neighbor"},
31 IP6T_ICMP6_NOT_NEIGHBOR, "ICMPv6 not a neighbor"},
|
| libip6t_DNPT.man | 24 You may need to enable IPv6 neighbor proxy:
|
| libip6t_SNPT.man | 24 You may need to enable IPv6 neighbor proxy:
|
| /external/javassist/src/main/javassist/bytecode/stackmap/ |
| TypeData.java | 33 public abstract void merge(TypeData neighbor);
85 public void merge(TypeData neighbor) {}
137 public void merge(TypeData neighbor) {
138 if (this == neighbor)
141 if (!(neighbor instanceof TypeName))
142 return; // neighbor might be UninitData
144 TypeName neighbor2 = (TypeName)neighbor;
453 public void merge(TypeData neighbor) {}
|
| /external/libnl/include/linux/ |
| neighbour.h | 30 * Neighbor Cache Entry Flags
37 * Neighbor Cache Entry States.
|
| /external/tcpdump/ |
| print-olsr.c | 153 { 0, "Not-Neighbor" },
160 u_int8_t neighbor[4]; member in struct:olsr_lq_neighbor4
167 u_int8_t neighbor[16]; member in struct:olsr_lq_neighbor6
182 * print a neighbor list with LQ extensions.
193 printf("\n\t neighbor %s, link-quality %.2lf%%"
194 ", neighbor-link-quality %.2lf%%",
195 ipaddr_string(lq_neighbor->neighbor),
214 printf("\n\t neighbor %s, link-quality %.2lf%%"
215 ", neighbor-link-quality %.2lf%%",
216 ip6addr_string(lq_neighbor->neighbor),
232 int neighbor; local
[all...] |
| icmp6.h | 108 #define ND_NEIGHBOR_SOLICIT 135 /* neighbor solicitation */
109 #define ND_NEIGHBOR_ADVERT 136 /* neighbor advertisement */
120 #define IND_SOLICIT 141 /* inverse neighbor solicitation */
121 #define IND_ADVERT 142 /* inverse neighbor advertisement */
137 #define ICMP6_DST_UNREACH_NOTNEIGHBOR 2 /* not a neighbor(obsolete) */
185 * Neighbor Discovery
227 struct nd_neighbor_solicit { /* neighbor solicitation */
238 struct nd_neighbor_advert { /* neighbor advertisement */
265 struct nd_opt_hdr { /* Neighbor discovery option header */
|
| /frameworks/av/media/libstagefright/codecs/avc/enc/src/ |
| motion_est.cpp | 196 /* top neighbor */
204 /* left neighbor */
[all...] |
| /external/deqp/doc/testspecs/GLES2/ |
| performance.texture.format.txt | 28 + Nearest neighbor -filtering and clamp to edge -wrap mode
37 filtering (nearest neighbor mode). Shader body is populated with one or
|
| /external/iproute2/include/linux/ |
| neighbour.h | 29 * Neighbor Cache Entry Flags
37 * Neighbor Cache Entry States.
|
| /external/kernel-headers/original/uapi/linux/ |
| neighbour.h | 33 * Neighbor Cache Entry Flags
44 * Neighbor Cache Entry States.
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/sysroot/usr/include/linux/ |
| neighbour.h | 31 * Neighbor Cache Entry Flags
39 * Neighbor Cache Entry States.
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/linux/ |
| neighbour.h | 31 * Neighbor Cache Entry Flags
39 * Neighbor Cache Entry States.
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkMatrixUtils.h | 28 * round-to-nearest behavior (e.g. nearest neighbor sampling). Pass the number
|
| /external/libvpx/libvpx/third_party/libyuv/include/libyuv/ |
| scale.h | 30 // If filtering is kFilterNone, a simple nearest-neighbor algorithm is
|
| /external/skia/src/core/ |
| SkMatrixUtils.h | 28 * round-to-nearest behavior (e.g. nearest neighbor sampling). Pass the number
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/third_party/libyuv/include/libyuv/ |
| scale.h | 30 // If filtering is kFilterNone, a simple nearest-neighbor algorithm is
|
| /pdk/apps/TestingCamera/src/com/android/testingcamera/ |
| callback.rs | 111 // Converts semiplanar YVU to interleaved YUV, nearest neighbor
130 // Converts planar YVU to interleaved YUV, nearest neighbor
148 // Converts interleaved 4:2:2 YUV to interleaved YUV, nearest neighbor
|
| /external/libhevc/common/arm/ |
| ihevc_intra_ref_substitution_a9q.c | 88 * WORD32 neighbor availability flags
122 /* Neighbor Flag Structure*/
128 /* If no neighbor flags are present, fill the neighbor samples with DC value */
297 /* To Obtain the next unavailable idx flag after reverse neighbor substitution */
364 /* To Obtain the next unavailable idx flag after reverse neighbor substitution */
423 /* Neighbor Flag Structure*/
428 /* If no neighbor flags are present, fill the neighbor samples with DC value */
635 /* To Obtain the next unavailable idx flag after reverse neighbor substitution *
[all...] |
