Searched defs:matches (Results 226 - 250 of 407) sorted by relevance

1234567891011>>

/external/icu/icu4j/main/tests/framework/src/com/ibm/icu/dev/util/
H A DCollectionUtilities.java195 boolean matches(T o); method in interface:CollectionUtilities.ObjectMatcher
212 public boolean matches(T value) { method in class:CollectionUtilities.InverseMatcher
213 return !other.matches(value);
228 if (f.matches(item)) it.remove();
244 if (!f.matches(item)) it.remove();
544 return matcher.reset((String)item).matches();
/external/jsilver/src/com/google/clearsilver/jsilver/data/
H A DNewHdfParser.java218 if (matches(seq, 0, INCLUDE_WS)) {
668 private static boolean matches(String seq, int start, String match) { method in class:NewHdfParser
/external/opencv3/3rdparty/zlib/
H A Ddeflate.h119 * bytes. With this organization, matches are limited to a distance of
249 uInt matches; /* number of string matches in current block */ member in struct:internal_state
/external/opencv3/modules/features2d/misc/java/src/cpp/
H A Dfeatures2d_manual.hpp203 CV_OUT std::vector<DMatch>& matches, const Mat& mask=Mat() ) const
204 { return wrapped->match(queryDescriptors, trainDescriptors, matches, mask); }
207 CV_OUT std::vector<std::vector<DMatch> >& matches, int k,
209 { return wrapped->knnMatch(queryDescriptors, trainDescriptors, matches, k, mask, compactResult); }
212 CV_OUT std::vector<std::vector<DMatch> >& matches, float maxDistance,
214 { return wrapped->radiusMatch(queryDescriptors, trainDescriptors, matches, maxDistance, mask, compactResult); }
216 CV_WRAP void match( const Mat& queryDescriptors, CV_OUT std::vector<DMatch>& matches, argument
218 { return wrapped->match(queryDescriptors, matches, masks); }
220 CV_WRAP void knnMatch( const Mat& queryDescriptors, CV_OUT std::vector<std::vector<DMatch> >& matches, int k, argument
222 { return wrapped->knnMatch(queryDescriptors, matches,
202 match( const Mat& queryDescriptors, const Mat& trainDescriptors, CV_OUT std::vector<DMatch>& matches, const Mat& mask=Mat() ) const argument
206 knnMatch( const Mat& queryDescriptors, const Mat& trainDescriptors, CV_OUT std::vector<std::vector<DMatch> >& matches, int k, const Mat& mask=Mat(), bool compactResult=false ) const argument
211 radiusMatch( const Mat& queryDescriptors, const Mat& trainDescriptors, CV_OUT std::vector<std::vector<DMatch> >& matches, float maxDistance, const Mat& mask=Mat(), bool compactResult=false ) const argument
224 radiusMatch( const Mat& queryDescriptors, CV_OUT std::vector<std::vector<DMatch> >& matches, float maxDistance, const std::vector<Mat>& masks=std::vector<Mat>(), bool compactResult=false ) argument
[all...]
/external/opencv3/modules/features2d/test/
H A Dtest_rotation_and_scale_invariance.cpp151 vector<DMatch>& matches)
161 matches.clear();
183 matches.push_back(DMatch(i0, nearestPointIndex, maxIntersectRatio));
230 vector<DMatch> matches; local
231 matchKeyPoints(keypoints0, H, keypoints1, matches);
237 for(size_t m = 0; m < matches.size(); m++)
239 if(matches[m].distance < minIntersectRatio)
246 float angle0 = keypoints0[matches[m].queryIdx].angle;
247 float angle1 = keypoints1[matches[m].trainIdx].angle;
443 vector<DMatch> matches; local
149 matchKeyPoints(const vector<KeyPoint>& keypoints0, const Mat& H, const vector<KeyPoint>& keypoints1, vector<DMatch>& matches) argument
[all...]
/external/opencv3/modules/stitching/src/
H A Dmatchers.cpp93 for (size_t j = 0; j < pairwise_matches[dual_pair_idx].matches.size(); ++j)
94 std::swap(pairwise_matches[dual_pair_idx].matches[j].queryIdx,
95 pairwise_matches[dual_pair_idx].matches[j].trainIdx);
114 // These two classes are aimed to find features matches only, not to
155 matches_info.matches.clear();
178 MatchesSet matches; local
180 // Find 1->2 matches
190 matches_info.matches.push_back(m0);
191 matches.insert(std::make_pair(m0.queryIdx, m0.trainIdx));
194 LOG("\n1->2 matches
225 MatchesSet matches; local
[all...]
/external/opencv3/modules/ts/src/
H A Dcuda_test.cpp520 int getMatchedPointsCount(const std::vector<cv::KeyPoint>& keypoints1, const std::vector<cv::KeyPoint>& keypoints2, const std::vector<cv::DMatch>& matches) argument
524 for (size_t i = 0; i < matches.size(); ++i)
526 const cv::DMatch& m = matches[i];
/external/pcre/dist/
H A Dpcrecpp.cc335 int matches = TryMatch(*str, 0, UNANCHORED, true, vec, kVecSize); local
336 if (matches == 0)
340 if (!Rewrite(&s, rewrite, *str, vec, matches))
394 // and with a flag saying that this time, ignore empty matches.
400 int matches; local
402 matches = TryMatch(*str, start, ANCHOR_START, false, vec, kVecSize);
403 if (matches <= 0) {
432 matches = TryMatch(*str, start, UNANCHORED, true, vec, kVecSize);
433 if (matches <= 0)
440 Rewrite(&out, rewrite, *str, vec, matches);
459 int matches = TryMatch(text, 0, UNANCHORED, true, vec, kVecSize); local
568 int matches = TryMatch(text, 0, anchor, true, vec, vecsize); local
[all...]
/external/pdfium/third_party/zlib_v128/
H A Ddeflate.h119 * bytes. With this organization, matches are limited to a distance of
249 uInt matches; /* number of string matches in current block */ member in struct:internal_state
/external/regex-re2/util/
H A Dpcre.cc330 int matches = pattern.TryMatch(*str, 0, UNANCHORED, true, vec, kVecSize); local
331 if (matches == 0)
335 if (!pattern.Rewrite(&s, rewrite, *str, vec, matches))
358 // and with a flag saying that this time, ignore empty matches.
364 int matches; local
366 matches = pattern.TryMatch(*str, start, ANCHOR_START, false,
368 if (matches <= 0) {
376 matches = pattern.TryMatch(*str, start, UNANCHORED, true, vec, kVecSize);
377 if (matches <= 0)
385 pattern.Rewrite(&out, rewrite, *str, vec, matches);
405 int matches = pattern.TryMatch(text, 0, UNANCHORED, true, vec, kVecSize); local
561 int matches = TryMatch(text, 0, anchor, true, vec, vecsize); local
[all...]
/external/selinux/sepolgen/src/sepolgen/
H A Drefpolicy.py766 def matches(self, other): member in class:InterfaceCall
/external/sl4a/Common/src/com/googlecode/android_scripting/facade/bluetooth/
H A DBluetoothLeScanFacade.java803 @Rpc(description = "Set the scan setting's number of matches")
805 @RpcParameter(name = "matches") Integer matches) {
806 mScanSettingsBuilder.setNumOfMatches(matches);
809 @Rpc(description = "Get the scan setting's number of matches")
804 bleSetScanSettingsNumOfMatches( @pcParametername = �) Integer matches) argument
/external/v8/src/compiler/
H A Dnode-matchers.h188 // For shorter pattern matching code, this struct matches the inputs to
206 // For shorter pattern matching code, this struct matches both the left and
301 bool matches() const { return scale_ != -1; } function in struct:v8::internal::compiler::ScaleMatcher
349 if (left_matcher.matches()) {
360 if (right_matcher.matches()) {
403 bool matches() const { return matches_; } function in struct:v8::internal::compiler::BaseWithIndexAndDisplacementMatcher
/external/valgrind/coregrind/
H A Dm_options.c334 // see if the exe name matches any of the patterns specified
340 Bool matches; local
352 matches = VG_(string_match)(patt, name);
354 if (matches)
365 Bool matches; local
378 matches = VG_(string_match)(patt, child_argv[i]);
379 if (matches) {
/external/zlib/src/
H A Ddeflate.h119 * bytes. With this organization, matches are limited to a distance of
249 uInt matches; /* number of string matches in current block */ member in struct:internal_state
/external/robolectric/v3/
H A Dshadows-httpclient-3.1-SNAPSHOT.jar ... .lang.String) String name String value public boolean matches (org.apache.http.HttpRequest) java.util ...
/external/deqp/framework/common/
H A DtcuCommandLine.cpp532 bool matches (const string& caseName, bool allowPrefix=false) const;
580 // component may contain *-wildcards. A pattern component "**" matches zero or
614 bool CasePaths::matches (const string& caseName, bool allowPrefix) const function in class:tcu::CasePaths
895 return m_casePaths->matches(groupName, true);
905 return m_casePaths->matches(caseName, false);
/external/doclava/src/com/google/doclava/
H A DMethodInfo.java431 * actually matches one of the method parameters. */
468 // there's an @param tag that matches the current parameter name, get the
780 public boolean matches(MethodInfo other) { method in class:MethodInfo
/external/iproute2/lib/
H A Dutils.c632 int matches(const char *cmd, const char *pattern) function
/external/iptables/iptables/
H A Dip6tables.c193 exit_printhelp(const struct xtables_rule_match *matches) argument
269 print_extension_helps(xtables_targets, matches);
721 make_delete_mask(const struct xtables_rule_match *matches, argument
730 for (matchp = matches; matchp; matchp = matchp->next)
740 for (matchp = matches; matchp; matchp = matchp->next) {
765 struct xtables_rule_match *matches,
772 mask = make_delete_mask(matches, target);
795 struct xtables_rule_match *matches,
802 mask = make_delete_mask(matches, target);
1008 /* some matches do
755 delete_entry(const xt_chainlabel chain, struct ip6t_entry *fw, unsigned int nsaddrs, const struct in6_addr saddrs[], const struct in6_addr smasks[], unsigned int ndaddrs, const struct in6_addr daddrs[], const struct in6_addr dmasks[], int verbose, struct xtc_handle *handle, struct xtables_rule_match *matches, const struct xtables_target *target) argument
790 check_entry(const xt_chainlabel chain, struct ip6t_entry *fw, unsigned int nsaddrs, const struct in6_addr *saddrs, const struct in6_addr *smasks, unsigned int ndaddrs, const struct in6_addr *daddrs, const struct in6_addr *dmasks, bool verbose, struct xtc_handle *handle, struct xtables_rule_match *matches, const struct xtables_target *target) argument
1187 generate_entry(const struct ip6t_entry *fw, struct xtables_rule_match *matches, struct xt_entry_target *target) argument
[all...]
H A Diptables.c187 exit_printhelp(const struct xtables_rule_match *matches) argument
263 print_extension_helps(xtables_targets, matches);
706 make_delete_mask(const struct xtables_rule_match *matches, argument
715 for (matchp = matches; matchp; matchp = matchp->next)
725 for (matchp = matches; matchp; matchp = matchp->next) {
750 struct xtables_rule_match *matches,
757 mask = make_delete_mask(matches, target);
780 struct xtables_rule_match *matches,
787 mask = make_delete_mask(matches, target);
999 /* some matches do
740 delete_entry(const xt_chainlabel chain, struct ipt_entry *fw, unsigned int nsaddrs, const struct in_addr saddrs[], const struct in_addr smasks[], unsigned int ndaddrs, const struct in_addr daddrs[], const struct in_addr dmasks[], int verbose, struct xtc_handle *handle, struct xtables_rule_match *matches, const struct xtables_target *target) argument
775 check_entry(const xt_chainlabel chain, struct ipt_entry *fw, unsigned int nsaddrs, const struct in_addr *saddrs, const struct in_addr *smasks, unsigned int ndaddrs, const struct in_addr *daddrs, const struct in_addr *dmasks, bool verbose, struct xtc_handle *handle, struct xtables_rule_match *matches, const struct xtables_target *target) argument
1178 generate_entry(const struct ipt_entry *fw, struct xtables_rule_match *matches, struct xt_entry_target *target) argument
[all...]
/external/javassist/src/main/javassist/bytecode/
H A DCodeIterator.java1200 int[] matches = new int[npairs];
1203 matches[j] = ByteArray.read32bit(code, i0);
1208 jumps.add(new Lookup(i, defaultbyte, matches, offsets));
1549 int[] matches; field in class:CodeIterator.Lookup
1551 Lookup(int pos, int defaultByte, int[] matches, int[] offsets) { argument
1553 this.matches = matches;
1557 int n = matches.length;
1561 ByteArray.write32bit(matches[i], newcode, dest);
1569 int tableSize() { return 4 + 8 * matches
[all...]
/external/mesa3d/src/egl/drivers/dri2/
H A Degl_dri2.c335 struct dri2_extension_match *matches,
343 for (j = 0; matches[j].name; j++) {
344 if (strcmp(extensions[i]->name, matches[j].name) == 0 &&
345 extensions[i]->version >= matches[j].version) {
346 field = ((char *) dri2_dpy + matches[j].offset);
354 for (j = 0; matches[j].name; j++) {
355 field = ((char *) dri2_dpy + matches[j].offset);
358 matches[j].name, matches[j].version);
334 dri2_bind_extensions(struct dri2_egl_display *dri2_dpy, struct dri2_extension_match *matches, const __DRIextension **extensions) argument
/external/opencv3/modules/calib3d/test/
H A Dtest_homography.cpp649 std::vector< DMatch > matches; local
650 matcher.match( descriptors_1, descriptors_2, matches );
656 double dist = matches[i].distance;
661 //-- Draw only "good" matches (i.e. whose distance is less than 3*min_dist )
665 if( matches[i].distance <= 100 )
666 good_matches.push_back( matches[i]);
674 //-- Get the keypoints from the good matches
698 printf("nfeatures1 = %d, nfeatures2=%d, matches=%d, ninliers(RANSAC)=%d, "
/external/opencv3/modules/features2d/src/
H A Dmatchers.cpp117 static bool ocl_matchConvert(const Mat &trainIdx, const Mat &distance, std::vector< std::vector<DMatch> > &matches) argument
127 matches.clear();
128 matches.reserve(nQuery);
145 matches.push_back(temp);
150 static bool ocl_matchDownload(const UMat &trainIdx, const UMat &distance, std::vector< std::vector<DMatch> > &matches) argument
158 return ocl_matchConvert(trainIdxCPU, distanceCPU, matches);
217 static bool ocl_knnMatchConvert(const Mat &trainIdx, const Mat &distance, std::vector< std::vector<DMatch> > &matches, bool compactResult) argument
230 matches.clear();
231 matches.reserve(nQuery);
238 matches
262 ocl_knnMatchDownload(const UMat &trainIdx, const UMat &distance, std::vector< std::vector<DMatch> > &matches, bool compactResult) argument
330 ocl_radiusMatchConvert(const Mat &trainIdx, const Mat &distance, const Mat &_nMatches, std::vector< std::vector<DMatch> > &matches, bool compactResult) argument
381 ocl_radiusMatchDownload(const UMat &trainIdx, const UMat &distance, const UMat &nMatches, std::vector< std::vector<DMatch> > &matches, bool compactResult) argument
589 match( InputArray queryDescriptors, std::vector<DMatch>& matches, InputArrayOfArrays masks ) argument
619 knnMatch( InputArray queryDescriptors, std::vector<std::vector<DMatch> >& matches, int knn, InputArrayOfArrays masks, bool compactResult ) argument
633 radiusMatch( InputArray queryDescriptors, std::vector<std::vector<DMatch> >& matches, float maxDistance, InputArrayOfArrays masks, bool compactResult ) argument
696 ocl_match(InputArray query, InputArray _train, std::vector< std::vector<DMatch> > &matches, int dstType) argument
706 ocl_knnMatch(InputArray query, InputArray _train, std::vector< std::vector<DMatch> > &matches, int k, int dstType, bool compactResult) argument
718 knnMatchImpl( InputArray _queryDescriptors, std::vector<std::vector<DMatch> >& matches, int knn, InputArrayOfArrays _masks, bool compactResult ) argument
854 ocl_radiusMatch(InputArray query, InputArray _train, std::vector< std::vector<DMatch> > &matches, float maxDistance, int dstType, bool compactResult) argument
865 radiusMatchImpl( InputArray _queryDescriptors, std::vector<std::vector<DMatch> >& matches, float maxDistance, InputArrayOfArrays _masks, bool compactResult ) argument
[all...]

Completed in 1033 milliseconds

1234567891011>>