/** * Checks for the present of <tt>key</tt> in the keys of the map. * * @param key an <code>Object</code> value * @return a <code>boolean</code> value */ public boolean containsKey(Object key) { return _map.containsKey(unwrapKey(key)); }
public void preProcess(FeatureVector fv) { cache.resetQuick(); int fi; // cache constrained input features for (int loc = 0; loc < fv.numLocations(); loc++) { fi = fv.indexAtLocation(loc); if (constraints.containsKey(fi)) { cache.add(fi); } } }
public void addConstraint(int fi, int li, double lower, double upper, double weight) { if (!constraints.containsKey(fi)) { constraints.put(fi,new MaxEntL2IndGEConstraint()); } constraints.get(fi).add(li, lower, upper, weight); }
public void preProcess(FeatureVector fv) { cache.resetQuick(); int fi; // cache constrained input features for (int loc = 0; loc < fv.numLocations(); loc++) { fi = fv.indexAtLocation(loc); if (constraints.containsKey(fi)) { cache.add(fi); } } }
public void preProcess(FeatureVector fv) { cache.resetQuick(); int fi; // cache constrained input features for (int loc = 0; loc < fv.numLocations(); loc++) { fi = fv.indexAtLocation(loc); if (constraints.containsKey(fi)) { cache.add(fi); } } }
public void addConstraint(int fi, int li, double lower, double upper, double weight) { if (!constraints.containsKey(fi)) { constraints.put(fi,new OneLabelL2IndGEConstraint()); } constraints.get(fi).add(li, lower, upper, weight); }
public void addConstraint(int fi, int li, double lower, double upper, double weight) { if (!constraints.containsKey(fi)) { constraints.put(fi,new OneLabelL2IndGEConstraint()); } constraints.get(fi).add(li, lower, upper, weight); }
public Object put (int key1, int key2, Object value) { TIntObjectHashMap inner; if (backing.containsKey (key1)) { inner = (TIntObjectHashMap) backing.get (key1); } else { inner = new TIntObjectHashMap (); backing.put (key1, inner); } return inner.put (key2, value); }
public void preProcess(FeatureVector fv) { cache.resetQuick(); int fi; // cache constrained input features for (int loc = 0; loc < fv.numLocations(); loc++) { fi = fv.indexAtLocation(loc); if (constraints.containsKey(fi)) { cache.add(fi); } } }
public void addConstraint(int fi, int li, double lower, double upper, double weight) { if (!constraints.containsKey(fi)) { constraints.put(fi,new MaxEntL2IndGEConstraint()); } constraints.get(fi).add(li, lower, upper, weight); }
public Object put (int key1, int key2, Object value) { TIntObjectHashMap inner; if (backing.containsKey (key1)) { inner = (TIntObjectHashMap) backing.get (key1); } else { inner = new TIntObjectHashMap (); backing.put (key1, inner); } return inner.put (key2, value); }
public void preProcess(FeatureVector fv) { cache.resetQuick(); int fi; // cache constrained input features for (int loc = 0; loc < fv.numLocations(); loc++) { fi = fv.indexAtLocation(loc); if (constraints.containsKey(fi)) { cache.add(fi); } } }
public void addConstraint(int fi, int li, double lower, double upper, double weight) { if (!constraints.containsKey(fi)) { constraints.put(fi,new OneLabelL2IndGEConstraint()); } constraints.get(fi).add(li, lower, upper, weight); }
public void addConstraint(int fi, int li, double lower, double upper, double weight) { if (!constraints.containsKey(fi)) { constraints.put(fi,new MaxEntL2IndGEConstraint()); } constraints.get(fi).add(li, lower, upper, weight); }
public Object put (int key1, int key2, Object value) { TIntObjectHashMap inner; if (backing.containsKey (key1)) { inner = (TIntObjectHashMap) backing.get (key1); } else { inner = new TIntObjectHashMap (); backing.put (key1, inner); } return inner.put (key2, value); }
public void addConstraint(int fi, int li, double target, double weight) { if (!constraints.containsKey(fi)) { constraints.put(fi,new OneLabelL2IndPRConstraint()); } constraints.get(fi).add(li, target, weight, numDimensions); numDimensions++; }
/** * Add posting to inverted file. */ public void add(int ptr, int docid, int freq) { if (postings.containsKey(ptr)) ((BasicMemoryPostingList)postings.get(ptr)).add(docid, freq); else postings.put(ptr, new BasicMemoryPostingList(docid, freq)); }
public void addConstraint(int fi, int li, double target, double weight) { if (!constraints.containsKey(fi)) { constraints.put(fi,new OneLabelL2IndPRConstraint()); } constraints.get(fi).add(li, target, weight, numDimensions); numDimensions++; }
public void addConstraint(int fi, int li, double target, double weight) { if (!constraints.containsKey(fi)) { constraints.put(fi,new OneLabelL2IndPRConstraint()); } constraints.get(fi).add(li, target, weight, numDimensions); numDimensions++; }
/** {@inheritDoc} */ @Override public IterablePosting getPostings(Pointer _termid) throws IOException { MemoryPointer termid = (MemoryPointer)_termid; FieldsMemoryPostingList pl; if (postings.containsKey(termid.getPointer())) pl = (FieldsMemoryPostingList) postings.get(termid.getPointer()); else pl = new FieldsMemoryPostingList(); return new MemoryFieldsIterablePosting(doi, pl.docids(), pl.freqs(), pl.fields()); }