T - public abstract class Functions<T> extends HashMap<T,Integer> implements Map<T,Integer>
AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>| Constructor and Description |
|---|
Functions() |
| Modifier and Type | Method and Description |
|---|---|
boolean |
containsKey(Object key)
checks whether the key is present in the entry-set of the map
|
boolean |
containsValue(Object value)
checks whether the value is present in the entry-set of the map
|
abstract PreferenceOrder<T> |
generatePreferenceOrder()
this method returns a preference order made out of an ranking function
|
Integer |
get(Object key)
returns the value to a given key
|
Set<Map.Entry<T,Integer>> |
getElementsByValue(int val)
returns an entry set of all elements in this ranking function with the same rank (= value)
|
Map<T,Integer> |
getLevelingFunction()
returns the ranking function
|
Set<Map.Entry<T,Integer>> |
getPredecessors(Map.Entry<T,Integer> element)
returns a set of predecessor elements for the given entry
|
Set<Map.Entry<T,Integer>> |
getSuccessors(Map.Entry<T,Integer> element)
returns a set of successor elements for the given entry
|
abstract void |
strengthenElement(T element)
strengthens the given element in the function
|
String |
toString()
returns a string representation for this ranking function
|
Collection<Integer> |
values()
returns a collection containing all values of the map
|
abstract void |
weakenElement(T element)
weakens the given element in the function
|
clear, clone, compute, computeIfAbsent, computeIfPresent, entrySet, forEach, getOrDefault, isEmpty, keySet, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAll, sizeequals, hashCodefinalize, getClass, notify, notifyAll, wait, wait, waitclear, compute, computeIfAbsent, computeIfPresent, entrySet, equals, forEach, getOrDefault, hashCode, isEmpty, keySet, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAll, sizepublic String toString()
toString in class AbstractMap<T,Integer>public Map<T,Integer> getLevelingFunction()
public abstract PreferenceOrder<T> generatePreferenceOrder()
public boolean containsKey(Object key)
containsKey in interface Map<T,Integer>containsKey in class HashMap<T,Integer>public boolean containsValue(Object value)
containsValue in interface Map<T,Integer>containsValue in class HashMap<T,Integer>public Collection<Integer> values()
public Set<Map.Entry<T,Integer>> getElementsByValue(int val)
val - the rank of the elements searchedpublic Set<Map.Entry<T,Integer>> getPredecessors(Map.Entry<T,Integer> element)
element - the given entrypublic Set<Map.Entry<T,Integer>> getSuccessors(Map.Entry<T,Integer> element)
element - the given entrypublic abstract void weakenElement(T element)
element - the element being weakenedpublic abstract void strengthenElement(T element)
element - the element being strengthenedCopyright © 2018. All rights reserved.