| /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; }
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/shortest_paths/ |
| astar.py | 108 for neighbor, w in G[curnode].items():
109 if neighbor in explored:
112 if neighbor in enqueued:
113 qcost, h = enqueued[neighbor]
114 # if qcost < ncost, a longer path to neighbor remains
121 h = heuristic(neighbor, target)
122 enqueued[neighbor] = ncost, h
123 heappush(queue, (ncost + h, hash(neighbor), neighbor,
|
| /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...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/isomorphism/ |
| vf2userfunc.py | 63 for neighbor in G1_adj[G1_node]:
65 if neighbor == G1_node:
69 elif neighbor in core_1:
70 if not edge_match(G1_adj[G1_node][neighbor],
71 G2_adj[G2_node][core_1[neighbor]]):
|
| isomorphvf2.py | 414 # For each neighbor n' of n in the partial mapping, the corresponding
415 # node m' is a neighbor of m, and vice versa. Also, the number of
417 for neighbor in self.G1[G1_node]:
418 if neighbor in self.core_1:
419 if not (self.core_1[neighbor] in self.G2[G2_node]):
421 elif self.G1.number_of_edges(neighbor, G1_node) != self.G2.number_of_edges(self.core_1[neighbor], G2_node):
423 for neighbor in self.G2[G2_node]:
424 if neighbor in self.core_2:
425 if not (self.core_2[neighbor] in self.G1[G1_node])
[all...] |
| /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/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...] |
| /external/opencv/cv/src/ |
| cvcalibinit.cpp | 103 int count; // Number of neighbor corners
104 struct CvCBCorner* neighbors[4]; // Neighbor corners
118 // neighbors and corners are synced, i.e., neighbor 0 shares corner 0
490 // of the neighbor corners in the same row/column.
597 CvCBQuad *neighbor = q->neighbors[i]; local
611 if (neighbor && neighbor->ordered == false && neighbor->count == 4)
614 icvOrderQuad(neighbor, q->corners[i], (i+2)%4); // set in order
615 neighbor->ordered = true
707 CvCBQuad *neighbor = quads[i]->neighbors[j]; local
1166 CvCBQuad *neighbor = q->neighbors[i]; local
[all...] |
| /external/libvpx/libvpx/vp8/decoder/ |
| error_concealment.c | 416 static void assign_neighbor(EC_BLOCK *neighbor, MODE_INFO *mi, int block_idx)
419 neighbor->ref_frame = mi->mbmi.ref_frame;
420 neighbor->mv = mi->bmi[block_idx].mv.as_mv;
426 * The neighbors are enumerated with the upper-left neighbor as the first
427 * element, the second element refers to the neighbor to right of the previous
428 * neighbor, and so on. The last element refers to the neighbor below the first
429 * neighbor.
503 * neighbor and going to the right.
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/decoder/ |
| error_concealment.c | 418 static void assign_neighbor(EC_BLOCK *neighbor, MODE_INFO *mi, int block_idx)
421 neighbor->ref_frame = mi->mbmi.ref_frame;
422 neighbor->mv = mi->bmi[block_idx].mv.as_mv;
428 * The neighbors are enumerated with the upper-left neighbor as the first
429 * element, the second element refers to the neighbor to right of the previous
430 * neighbor, and so on. The last element refers to the neighbor below the first
431 * neighbor.
505 * neighbor and going to the right.
|
| /external/libvorbis/doc/ |
| 09-helper.tex | 81 \subsubsection{low_neighbor} \label{vorbis:spec:low:neighbor}
88 \subsubsection{high_neighbor} \label{vorbis:spec:high:neighbor}
|
| 07-floor1.tex | 266 7) [low_neighbor_offset] = \link{vorbis:spec:low:neighbor}{low_neighbor}([floor1_X_list],[i])
267 8) [high_neighbor_offset] = \link{vorbis:spec:high:neighbor}{high_neighbor}([floor1_X_list],[i])
|
| /packages/apps/Calendar/src/com/android/calendar/ |
| DayView.java | 3076 Event neighbor = mSelectedEvents.get(jj); local
3311 Event neighbor = mSelectedEvents.get(jj); local
[all...] |
| /packages/apps/Settings/src/com/android/settings/widget/ |
| ChartSweepView.java | 294 * When overlapping with neighbor, split difference and push label.
321 // when offsetting label, neighbor probably needs to offset too
446 // ignore event when closer to a neighbor
447 for (ChartSweepView neighbor : mNeighbors) {
448 if (isTouchCloserTo(eventInParent, neighbor)) {
|
| /external/robolectric/lib/main/ |
| javassist-3.14.0-GA.jar | |
| /external/iproute2/doc/ |
| ip-cref.tex | 834 \paragraph{Abbreviations:} \verb|neighbour|, \verb|neighbor|, \verb|neigh|,
[all...] |
| /cts/suite/cts/deviceTests/browserbench/assets/octane/ |
| pdfjs.js | [all...] |
