Uses of Class
de.dfki.mycbr.core.model.SymbolDesc

Packages that use SymbolDesc
de.dfki.mycbr.core.casebase Contains classes for the basic definition of DefaultCaseBase objects. 
de.dfki.mycbr.core.model Contains classes for the basic definition of the project's model. 
de.dfki.mycbr.core.similarity Contains standard classes to maintain similarity functions for attribute descriptions (local similarity functions) and concepts (amalgamation functions). 
 

Uses of SymbolDesc in de.dfki.mycbr.core.casebase
 

Constructors in de.dfki.mycbr.core.casebase with parameters of type SymbolDesc
SpecialRange(Project prj, SymbolDesc desc, java.util.Collection<java.lang.String> allowedValues)
           
SymbolAttribute(SymbolDesc desc, java.lang.String v)
          Creates new symbol with the specified value for the specified description.
SymbolRange(Project prj, SymbolDesc description, java.util.Collection<java.lang.String> allowedValues)
          Creates one SymbolAttribute object for each String specified by allowedValues.
 

Uses of SymbolDesc in de.dfki.mycbr.core.model
 

Subclasses of SymbolDesc in de.dfki.mycbr.core.model
 class BooleanDesc
          Description for boolean attributes.
 class SpecialDesc
          Special values are values that can be used for any attribute description.
 

Uses of SymbolDesc in de.dfki.mycbr.core.similarity
 

Methods in de.dfki.mycbr.core.similarity that return SymbolDesc
 SymbolDesc SymbolFct.getDesc()
          Gets the symbol description of the attributes this function is defined on
 

Constructors in de.dfki.mycbr.core.similarity with parameters of type SymbolDesc
OrderedSymbolFct(Project prj, SymbolDesc desc, java.lang.String name)
          Initializes this with the given description.
SymbolFct(Project prj, SymbolDesc desc, java.lang.String name)
          Initializes this by asking the given description for the number of allowed symbols.
TaxonomyFct(Project prj, SymbolDesc topSymbol, java.util.List<SymbolAttribute> values, java.lang.String name)
          Initializes this with a new taxonomy as internal data structure.