HomeSort by relevance Sort by last modified time
    Searched refs:neighbor (Results 1 - 18 of 18) sorted by null

  /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/Camera2/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 169 for (IntSet::const_iterator neighbor = neighbors.begin();
170 neighbor != neighbors.end();
171 ++neighbor) {
173 FindWithDefault(view_to_canonical_view_similarity_, *neighbor, 0.0);
174 const double new_similarity = graph_->EdgeWeight(*neighbor, candidate);
196 for (IntSet::const_iterator neighbor = neighbors.begin();
197 neighbor != neighbors.end();
198 ++neighbor) {
200 FindWithDefault(view_to_canonical_view_similarity_, *neighbor, 0.0);
202 graph_->EdgeWeight(*neighbor, canonical_view)
    [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 136 { 0, "Not-Neighbor" },
143 u_int8_t neighbor[4]; member in struct:olsr_lq_neighbor
158 * print a neighbor list with LQ extensions.
169 printf("\n\t neighbor %s, link-quality %.2lf%%"
170 ", neighbor-link-quality %.2lf%%",
171 ipaddr_string(lq_neighbor->neighbor),
181 * print a neighbor list.
186 int neighbor; local
188 printf("\n\t neighbor\n\t\t");
189 neighbor = 1
    [all...]
  /external/oprofile/opjitconv/
opjitconv.h 82 struct list_head neighbor; member in struct:pathname
opjitconv.c 93 list_add(&pn->neighbor, names);
99 list_del(&pname->neighbor);
109 neighbor);
152 list_entry(pos, struct pathname, neighbor);
444 neighbor);
455 list_del(&pname->neighbor);
557 list_entry(pos1, struct pathname, neighbor);
  /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 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])
  /external/chromium_org/tools/gyp/pylib/gyp/
common.py 492 for neighbor in get_edges(node):
493 Visit(neighbor)
  /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 290 * When overlapping with neighbor, split difference and push label.
317 // when offsetting label, neighbor probably needs to offset too
438 // ignore event when closer to a neighbor
439 for (ChartSweepView neighbor : mNeighbors) {
440 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/pts/deviceTests/browserbench/assets/octane/
pdfjs.js     [all...]

Completed in 360 milliseconds