Examples of keySet()

Examples of edu.brown.designer.IndexPlan.keySet()

132
133
134
135
136
137
138
139
140
141
142
        //
        // We now need to consolidate overlapping indexes for each table if they
        // are
        // used in the same procedure
        //
        for (Table catalog_tbl : indexPlan.keySet()) {
            Iterator<IndexPlan.Entry> it0 = indexPlan.get(catalog_tbl).iterator();
            while (it0.hasNext()) {
                IndexPlan.Entry index0 = it0.next();
                //
                // Look for another index that has all our columns
View Full Code Here

Examples of edu.brown.markov.containers.MarkovGraphsContainer.keySet()

49
50
51
52
53
54
55
56
57
58
59
        // Now read it back in make sure everything is there
        MarkovGraphsContainer clone = new MarkovGraphsContainer();
        clone.load(tempFile, catalog_db);
        assertNotNull(clone);
        assertEquals(markovs.size(), clone.size());
        assert(markovs.keySet().containsAll(clone.keySet()));
        for (Integer id : markovs.keySet()) {
            MarkovGraph clone_m = clone.get(id, catalog_proc);
            assertNotNull(clone_m);
        } // FOR
    }
View Full Code Here

Examples of edu.byu.ece.rapidSmith.device.helper.WireHashMap.keySet()

404
405
406
407
408
409
410
411
412
413
414
      WireHashMap whm = new WireHashMap(tile.getWireHashMap());

      // Traverse all non-PIP wire connections starting at this source wire.  If any
      // such wire connections lead to a sink wire that is not already a connection of
      // the source wire, mark it to be added as a connection
      for (Integer wire : whm.keySet()) {
        Set<WireConnection> wcToAdd = new HashSet<>();
        Set<WireConnection> checkedConnections = new HashSet<>();
        Queue<WireConnection> connectionsToFollow = new LinkedList<>();

        // Add the wire to prevent building a connection back to itself
View Full Code Here

Examples of edu.cornell.med.icb.identifier.IndexedIdentifier.keySet()

94
95
96
97
98
99
100
101
102
103
104
        isIndexed = reader.isIndexed();
        // reader.close();
        // reader = null;

        targetSequenceNames = new ArrayList();
        for (MutableString ms : identifiers.keySet()) {
            targetSequenceNames.add(ms.toString());
        }


    }
View Full Code Here

Examples of edu.stanford.nlp.ling.CoreLabel.keySet()

93
94
95
96
97
98
99
100
101
102
103
            if(!l.containsKey(PatternsAnnotations.MatchedPatterns.class) || l.get(PatternsAnnotations.MatchedPatterns.class) == null)
              l.set(PatternsAnnotations.MatchedPatterns.class, new HashSet<Pattern>());

            SurfacePattern pSur = (SurfacePattern) pEn.getValue();
            assert pSur != null : "Why is " + pEn.getValue() + " not present in the index?!";
            assert l.get(PatternsAnnotations.MatchedPatterns.class) != null : "How come MatchedPatterns class is null for the token. The classes in the key set are " + l.keySet();
            l.get(PatternsAnnotations.MatchedPatterns.class).add(pSur);

            for (Entry<Class, Object> ig : constVars.getIgnoreWordswithClassesDuringSelection()
                .get(label).entrySet()) {
              if (l.containsKey(ig.getKey())
View Full Code Here

Examples of edu.stanford.nlp.ling.CyclicCoreLabel.keySet()

387
388
389
390
391
392
393
394
395
396
397
   *         label arcs between this node and <code>destNode</code>
   */
  public Set<Class<? extends GrammaticalRelationAnnotation>> arcLabelsToNode(TreeGraphNode destNode) {
    Set<Class<? extends GrammaticalRelationAnnotation>> arcLabels = Generics.newHashSet();
    CyclicCoreLabel cl = label();
    for (Iterator<Class<?>> it = cl.keySet().iterator(); it.hasNext();) {
      Class<? extends CoreAnnotation> key = (Class<? extends CoreAnnotation>) it.next();//javac doesn't compile properly if generics are fully specified (but eclipse does...)
      Object val = cl.get(key);
      if (val != null && val instanceof Set) {
        if (((Set) val).contains(destNode)) {
          if (key != null) {
View Full Code Here

Examples of edu.stanford.nlp.neural.Embedding.keySet()

390
391
392
393
394
395
396
397
398
399
400
  void readWordVectors() {
    Embedding embedding = new Embedding(op.wordVectors, op.numHid);
    this.wordVectors = Generics.newTreeMap();
//    Map<String, SimpleMatrix> rawWordVectors = NeuralUtils.readRawWordVectors(op.wordVectors, op.numHid);
//    for (String word : rawWordVectors.keySet()) {
    for (String word : embedding.keySet()) {
      // TODO: factor out unknown word vector code from DVParser
      wordVectors.put(word, embedding.get(word));
    }

    String unkWord = op.unkWord;
View Full Code Here

Examples of edu.stanford.nlp.util.CoreMap.keySet()

95
96
97
98
99
100
101
102
103
104
105
  public CoreLabel(Label label) {
    super(0);
    if (label instanceof CoreMap) {
      CoreMap cl = (CoreMap) label;
      setCapacity(cl.size());
      for (Class key : cl.keySet()) {
        set(key, cl.get(key));
      }
    } else {
      if (label instanceof HasWord) {
         setWord(((HasWord)label).word());
View Full Code Here

Examples of edu.stanford.ppl.concurrent.SnapTreeMap.keySet()

129
130
131
132
133
134
135
136
137
138
139
    /**
     *  keySet.toArray returns contains all keys
     */
    public void testKeySetToArray() {
        SnapTreeMap map = map5();
        Set s = map.keySet();
        Object[] ar = s.toArray();
        assertTrue(s.containsAll(Arrays.asList(ar)));
        assertEquals(5, ar.length);
        ar[0] = m10;
        assertFalse(s.containsAll(Arrays.asList(ar)));
View Full Code Here

Examples of edu.umd.cloud9.io.map.HMapIDW.keySet()

500
501
502
503
504
505
506
507
508
509
510
      // double logNormalizer = Math.log(hashMap.getNormalizeFactor());

      // logNormalizer = LogMath.add(pairOfIntFloat.getRightElement(),
      // Settings.DEFAULT_LOG_ETA + Math.log(numberOfTerms));

      Iterator<Integer> itr = hashMap.keySet().iterator();
      while (itr.hasNext()) {
        int termIndex = itr.next();
        double logBetaValue = hashMap.get(termIndex);
        // double logBetaValue = Math.log(hashMap.get(termIndex));
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.