| /external/ceres-solver/internal/ceres/ |
| D | canonical_views_clustering.cc | 172 for (IntSet::const_iterator neighbor = neighbors.begin(); in ComputeClusteringQualityDifference() local
173 neighbor != neighbors.end(); in ComputeClusteringQualityDifference()
174 ++neighbor) { in ComputeClusteringQualityDifference()
176 FindWithDefault(view_to_canonical_view_similarity_, *neighbor, 0.0); in ComputeClusteringQualityDifference()
177 const double new_similarity = graph_->EdgeWeight(*neighbor, candidate); in ComputeClusteringQualityDifference()
199 for (IntSet::const_iterator neighbor = neighbors.begin(); in UpdateCanonicalViewAssignments() local
200 neighbor != neighbors.end(); in UpdateCanonicalViewAssignments()
201 ++neighbor) { in UpdateCanonicalViewAssignments()
203 FindWithDefault(view_to_canonical_view_similarity_, *neighbor, 0.0); in UpdateCanonicalViewAssignments()
205 graph_->EdgeWeight(*neighbor, canonical_view); in UpdateCanonicalViewAssignments()
[all …]
|
| /external/opencv3/modules/videostab/src/ |
| D | deblurring.cpp | 94 const Mat &neighbor = at(k, *frames_); in deblur() local
107 if (x1 >= 0 && x1 < neighbor.cols && y1 >= 0 && y1 < neighbor.rows) in deblur()
110 const Point3_<uchar> &p1 = neighbor.at<Point3_<uchar> >(y1,x1); in deblur()
|
| D | inpainting.cpp | 368 int neighbor = neighbors.top().second; in inpaint() local
371 Mat motion1to0 = vmotions[radius_ + neighbor - idx].inv(); in inpaint()
375 frame1_ = at(neighbor, *frames_); in inpaint()
|
| /external/javassist/src/main/javassist/bytecode/stackmap/ |
| D | TypeData.java | 33 public abstract void merge(TypeData neighbor); in merge() argument
85 public void merge(TypeData neighbor) {} in merge() argument
137 public void merge(TypeData neighbor) { in merge() argument
138 if (this == neighbor) in merge()
141 if (!(neighbor instanceof TypeName)) in merge()
144 TypeName neighbor2 = (TypeName)neighbor; in merge()
453 public void merge(TypeData neighbor) {} in merge() argument
|
| /external/tcpdump/ |
| D | print-olsr.c | 157 uint8_t neighbor[4]; member
164 uint8_t neighbor[16]; member
195 ipaddr_string(ndo, lq_neighbor->neighbor), in olsr_print_lq_neighbor4()
220 ip6addr_string(ndo, lq_neighbor->neighbor), in olsr_print_lq_neighbor6()
238 int neighbor; in olsr_print_neighbor() local
241 neighbor = 1; in olsr_print_neighbor()
250 neighbor % 4 == 0 ? "\n\t\t" : " ")); in olsr_print_neighbor()
|
| /external/tcpdump/tests/ |
| D | ipv6-bad-version.out | 1 IP6 :: > ff02::1:ff76:6c14: ICMP6, neighbor solicitation, who has fe80::20c:29ff:fe76:6c14, length …
3 IP6 :: > ff02::1:ff76:6c14: ICMP6, neighbor solicitation, who has 1111:2222:3333:4444:20c:29ff:fe76…
|
| D | pimv2_sm-v.out | 17 Join / Prune, cksum 0x5ae5 (correct), upstream-neighbor: 10.0.0.13
51 Join / Prune, cksum 0x5ae5 (correct), upstream-neighbor: 10.0.0.13
87 Join / Prune, cksum 0x5ae5 (correct), upstream-neighbor: 10.0.0.13
121 Join / Prune, cksum 0x5ae5 (correct), upstream-neighbor: 10.0.0.13
157 Join / Prune, cksum 0x5ae5 (correct), upstream-neighbor: 10.0.0.13
193 Join / Prune, cksum 0x5ae5 (correct), upstream-neighbor: 10.0.0.13
227 Join / Prune, cksum 0x5ae5 (correct), upstream-neighbor: 10.0.0.13
263 Join / Prune, cksum 0x5ae5 (correct), upstream-neighbor: 10.0.0.13
283 Join / Prune, cksum 0x5ae5 (correct), upstream-neighbor: 10.0.0.13
|
| D | pimv2_dm-v.out | 19 Join / Prune, cksum 0x8fd8 (correct), upstream-neighbor: 10.0.0.1
127 Join / Prune, cksum 0x8fd8 (correct), upstream-neighbor: 10.0.0.1
221 Join / Prune, cksum 0x8fd8 (correct), upstream-neighbor: 10.0.0.1
|
| D | dcb_ets.out | 106 … (58) payload length: 24) :: > ff02::1:ff46:e884: [icmp6 sum ok] ICMP6, neighbor solicitation, len…
167 … (58) payload length: 24) :: > ff02::1:ff42:ba59: [icmp6 sum ok] ICMP6, neighbor solicitation, len…
275 … (58) payload length: 24) :: > ff02::1:ff46:e884: [icmp6 sum ok] ICMP6, neighbor solicitation, len…
770 … (58) payload length: 24) :: > ff02::1:ff46:e884: [icmp6 sum ok] ICMP6, neighbor solicitation, len…
|
| D | dcb_qcn.out | 204 … (58) payload length: 24) :: > ff02::1:ff46:e884: [icmp6 sum ok] ICMP6, neighbor solicitation, len…
|
| /external/opencv3/modules/calib3d/src/ |
| D | calibinit.cpp | 677 CvCBQuad *neighbor = q->neighbors[i]; in icvOrderFoundConnectedQuads() local
691 if (neighbor && neighbor->ordered == false && neighbor->count == 4) in icvOrderFoundConnectedQuads()
694 icvOrderQuad(neighbor, q->corners[i], (i+2)%4); // set in order in icvOrderFoundConnectedQuads()
695 neighbor->ordered = true; in icvOrderFoundConnectedQuads()
696 neighbor->row = row; in icvOrderFoundConnectedQuads()
697 neighbor->col = col; in icvOrderFoundConnectedQuads()
698 cvSeqPush( stack, &neighbor ); in icvOrderFoundConnectedQuads()
785 CvCBQuad *neighbor = quads[i]->neighbors[j]; in icvOrderFoundConnectedQuads() local
786 if (neighbor && !neighbor->ordered && // is it an inner quad? in icvOrderFoundConnectedQuads()
793 icvOrderQuad(neighbor, quads[i]->corners[j], (j+2)%4); in icvOrderFoundConnectedQuads()
[all …]
|
| /external/opencv/cv/src/ |
| D | cvcalibinit.cpp | 597 CvCBQuad *neighbor = q->neighbors[i]; in icvOrderFoundConnectedQuads() local
611 if (neighbor && neighbor->ordered == false && neighbor->count == 4) in icvOrderFoundConnectedQuads()
614 icvOrderQuad(neighbor, q->corners[i], (i+2)%4); // set in order in icvOrderFoundConnectedQuads()
615 neighbor->ordered = true; in icvOrderFoundConnectedQuads()
616 neighbor->row = row; in icvOrderFoundConnectedQuads()
617 neighbor->col = col; in icvOrderFoundConnectedQuads()
618 cvSeqPush( stack, &neighbor ); in icvOrderFoundConnectedQuads()
707 CvCBQuad *neighbor = quads[i]->neighbors[j]; in icvOrderFoundConnectedQuads() local
708 if (neighbor && !neighbor->ordered && // is it an inner quad? in icvOrderFoundConnectedQuads()
715 icvOrderQuad(neighbor, quads[i]->corners[j], (j+2)%4); in icvOrderFoundConnectedQuads()
[all …]
|
| /external/markdown/tests/misc/ |
| D | russian.txt | 13 …ессмысленные слова в свои фразы при разговоре, например: «Hi-diddly-ho, neighbor-ino» («Приветик, …
|
| /external/deqp/doc/testspecs/GLES2/ |
| D | 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
|
| D | functional.texture.teximage.txt | 52 resulting images are compared against the reference. Nearest-neighbor -filtering
|
| /external/libvpx/libvpx/vp8/decoder/ |
| D | error_concealment.c | 417 static void assign_neighbor(EC_BLOCK *neighbor, MODE_INFO *mi, int block_idx) in assign_neighbor() argument
420 neighbor->ref_frame = mi->mbmi.ref_frame; in assign_neighbor()
421 neighbor->mv = mi->bmi[block_idx].mv.as_mv; in assign_neighbor()
|
| /external/testng/src/main/java/org/testng/internal/ |
| D | Graph.java | 267 public void addNeighbor(Node<T> neighbor) { in addNeighbor() argument
268 m_neighbors.add(neighbor); in addNeighbor()
|
| /external/iptables/extensions/ |
| D | libip6t_DNPT.man | 24 You may need to enable IPv6 neighbor proxy:
|
| D | libip6t_SNPT.man | 24 You may need to enable IPv6 neighbor proxy:
|
| /external/libvorbis/doc/ |
| D | 09-helper.tex | 81 \subsubsection{low_neighbor} \label{vorbis:spec:low:neighbor}
88 \subsubsection{high_neighbor} \label{vorbis:spec:high:neighbor}
|
| D | 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/deqp/doc/testspecs/GLES3/ |
| D | functional.texture.mipmap.txt | 52 a 3x3 neighbor around the pixel.
|
| D | functional.texture.format.txt | 39 - Nearest-neighbor filtering
|
| /external/opencv3/doc/tutorials/core/ |
| D | table_of_content_core.markdown | 32 You'll find out how to scan images with neighbor access and use the @ref cv::filter2D
|
| /external/opencv3/doc/py_tutorials/py_feature2d/py_matcher/ |
| D | py_matcher.markdown | 142 algorithms optimized for fast nearest neighbor search in large datasets and for high dimensional
|