Parsing Engine

Uses of Interface
danbikel.util.MapToPrimitive.Entry

Packages that use MapToPrimitive.Entry
danbikel.parser Provides the core framework of this extensible statistical parsing engine. 
danbikel.util Provides some basic utility classes. 
 

Uses of MapToPrimitive.Entry in danbikel.parser
 

Classes in danbikel.parser that implement MapToPrimitive.Entry
static class Trainer.EventEntry
          Class to represent a MapToPrimitive.Entry object for use by the Trainer.getEventIterator(danbikel.lisp.SexpTokenizer, danbikel.lisp.Symbol) method.
 

Methods in danbikel.parser that return MapToPrimitive.Entry
 MapToPrimitive.Entry FileBackedTrainerEventMap.getEntry(Object key)
          Uses an Ο(n) algorithm to retrieve the map entry for the specified key.
 MapToPrimitive.Entry FileBackedTrainerEventMap.getEntry(Object key, int hashCode)
          Simply invokes getEntry(key), returning the map entry for the specified key.
 MapToPrimitive.Entry FileBackedTrainerEventMap.getEntryMRU(Object key)
          Throws an UnsupportedOperationException because this is an unmodifiable map.
 MapToPrimitive.Entry FileBackedTrainerEventMap.getEntryMRU(Object key, int hashCode)
          Throws an UnsupportedOperationException because this is an unmodifiable map.
 MapToPrimitive.Entry ProbabilityCache.getProb(K key)
          Returns the Double containing the probability of the specified key, or null if the specified key is not in this cache.
 

Methods in danbikel.parser with parameters of type MapToPrimitive.Entry
protected  void InterpolatedKnesserNeyModel.precomputeProbs(MapToPrimitive.Entry transEntry, double[] lambdas, double[] estimates, Transition[] transitions, Event[] histories, int lastLevel)
           
protected  void Model.precomputeProbs(MapToPrimitive.Entry transEntry, double[] lambdas, double[] estimates, Transition[] transitions, Event[] histories, int lastLevel)
          Precomputes the probabilities and smoothing values for the Transition object contained as a key within the specified map entry, where the value is the count of the transition.
 

Uses of MapToPrimitive.Entry in danbikel.util
 

Classes in danbikel.util that implement MapToPrimitive.Entry
static class AbstractMapToPrimitive.Entry<K>
          Provides convenient abstract implementation of the MapToPrimitive.Entry interface: all primitive-specific methods are implemented to throw an UnsupportedOperationException.
protected static class HashMapDouble.Entry<K>
          A map entry for this type of map, containing a key and a double.
protected static class HashMapInt.Entry<K>
          A map entry for this type of map, containing a key and an int.
static class HashMapPrimitive.Entry<K>
          A still-abstract extension of the AbstractMapToPrimitive.Entry that adds a next pointer and an int to cache the hash value of the key held by this entry.
protected static class HashMapTwoDoubles.Entry<K>
          A map entry for this type of map, containing a key and a pair of doubles.
protected static class HashMapTwoInts.Entry<K>
          A map entry for this type of map, containing a key and a pair of ints.
 

Methods in danbikel.util that return MapToPrimitive.Entry
abstract  MapToPrimitive.Entry AbstractMapToPrimitive.getEntry(K key)
          Gets the map entry associated with the specified key, or null if this map does not contain such a mapping.
 MapToPrimitive.Entry<K> HashMapPrimitive.getEntry(K key)
          Gets the map entry associated with the specified key, or null if this map does not contain such a mapping.
 MapToPrimitive.Entry MapToPrimitive.getEntry(K key)
          Gets the map entry associated with the specified key, or null if this map does not contain such a mapping.
 MapToPrimitive.Entry<K> HashMapPrimitive.getEntry(K key, int hashCode)
          Returns the entry associated with the specified key, or null if no such entry exists.
 MapToPrimitive.Entry MapToPrimitive.getEntry(K key, int hashCode)
           
abstract  MapToPrimitive.Entry AbstractMapToPrimitive.getEntryMRU(K key)
          Gets the map entry for the specified key and, as a side-effect, puts the map entry at the front of the bucket list, indicating that it is the most-recently used entry (useful for caches implementing a bucket-LRU replacement scheme).
 MapToPrimitive.Entry<K> HashMapPrimitive.getEntryMRU(K key)
          Gets the map entry for the specified key and, as a side-effect, puts the map entry at the front of the bucket list, indicating that it is the most-recently used entry (useful for caches implementing a bucket-LRU replacement scheme).
 MapToPrimitive.Entry MapToPrimitive.getEntryMRU(K key)
          Returns the map entry for the specified key and, as a side-effect, puts the map entry at the front of the bucket list, indicating that it is the most-recently used entry (useful for caches implementing a bucket-LRU replacement scheme).
 MapToPrimitive.Entry<K> HashMapPrimitive.getEntryMRU(K key, int hashCode)
           
 MapToPrimitive.Entry MapToPrimitive.getEntryMRU(K key, int hashCode)
           
protected  MapToPrimitive.Entry<K> HashMapPrimitive.getOrCreateEntry(K key)
          Returns the entry associated with the specified key, or, if no such entry exists, creates one and returns it.
protected  MapToPrimitive.Entry HashMapPrimitive.removeLRU(int hashCode)
          Removes the last entry at the specified bucket index, if that bucket contains at least one entry.
protected  MapToPrimitive.Entry HashMapPrimitive.removeLRU(K key)
           
 


Parsing Engine

Author: Dan Bikel.