Package com.vividsolutions.jump.feature

Examples of com.vividsolutions.jump.feature.Feature

102
103
104
105
106
107
108
109
110
111
112
    int featuresProcessed = 0;
    int totalFeatures = featureToMatchesMap.size();
    HashMap newMap = new HashMap();
    if (featureToMatchesMap.isEmpty()) { return newMap; }
    for (Iterator i = featureToMatchesMap.keySet().iterator(); i.hasNext() && ! monitor.isCancelRequested(); ) {
      Feature feature = (Feature) i.next();
      featuresProcessed++;
      monitor.report(featuresProcessed, totalFeatures, "features filtered");
      Matches oldMatches = (Matches) featureToMatchesMap.get(feature);
      if (oldMatches.isEmpty()) { continue; }
      Matches newMatches = new Matches(oldMatches.getFeatureSchema());
View Full Code Here
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
    int featuresProcessed = 0;
    int totalFeatures = featureToMatchesMap.size();
    HashMap newMap = new HashMap();
    if (featureToMatchesMap.isEmpty()) { return newMap; }
    for (Iterator i = featureToMatchesMap.keySet().iterator(); i.hasNext() && ! monitor.isCancelRequested(); ) {
      Feature oldKey = (Feature) i.next();
      featuresProcessed++;
      monitor.report(featuresProcessed, totalFeatures, "features inverted");
      Matches oldMatches = (Matches) featureToMatchesMap.get(oldKey);
      for (int j = 0; j < oldMatches.size(); j++) {
        Feature newKey = (Feature) oldMatches.getFeature(j);
        Matches newMatches = (Matches) newMap.get(newKey);
        if (newMatches == null) {
          newMatches = new Matches(oldKey.getSchema());
        }
        newMatches.add(oldKey, oldMatches.getScore(j));
View Full Code Here
50
51
52
53
54
55
56
57
58
59
60
    @Override
  public Matches match(Feature target, FeatureCollection candidates) {
    Matches matches = new Matches(candidates.getFeatureSchema());
    for (Iterator i = candidates.iterator(); i.hasNext(); ) {
      Feature candidate = (Feature) i.next();
      double score = match(target.getGeometry(), candidate.getGeometry());
      if (score > 0) { matches.add(candidate, score); }
    }
    return matches;
  }
View Full Code Here
67
68
69
70
71
72
73
74
75
76
77
        int featuresProcessed = 0;
        int totalFeatures = targetFC.size();
        for (Iterator i = targetFC.iterator();
            i.hasNext() && !monitor.isCancelRequested();
            ) {
            Feature subjectFeature = (Feature) i.next();
            featuresProcessed++;
            monitor.report(featuresProcessed, totalFeatures, "features");
            map.put(subjectFeature, matcher.match(subjectFeature, candidateFC));
        }
        return map;
View Full Code Here
76
77
78
79
80
81
82
83
84
     * @param features added to the Matches, each with the max score (1.0)
     */
    public Matches(FeatureSchema schema, List features) {
        this(schema);
        for (Iterator i = features.iterator(); i.hasNext();) {
            Feature match = (Feature) i.next();
            add(match, 1);
        }
    }
View Full Code Here
TOP

Related Classes of com.vividsolutions.jump.feature.Feature

  • com.vividsolutions.jcs.conflate.polygonmatch.BasicFCMatchFinder
  • com.vividsolutions.jcs.conflate.polygonmatch.DisambiguationMatch
  • com.vividsolutions.jcs.conflate.polygonmatch.FeatureCollectionMatcher
  • com.vividsolutions.jcs.conflate.polygonmatch.IndependentCandidateMatcher
  • com.vividsolutions.jcs.conflate.polygonmatch.Matches
  • com.vividsolutions.jcs.conflate.polygonmatch.OneToOneFCMatchFinder
  • com.vividsolutions.jcs.conflate.polygonmatch.TopMatchDisambiguatingFCMatchFinder
  • com.vividsolutions.jcs.conflate.polygonmatch.TopScoreFilter
  • com.vividsolutions.jcs.conflate.polygonmatch.TopScoreMatcher
  • com.vividsolutions.jcs.conflate.polygonmatch.WeightedMatcher
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.