Accueil > Term: bag
bag
An unordered collection of values that may have duplicates. Formal Definition: A bag has a single query function, numberIn(v, B), which tells how many copies of an element are in the bag, and two modifier functions, add(v, B) and remove(v, B). These may be defined with axiomatic semantics as follows.
- new() returns a bag
- numberIn(v, new()) = 0
- numberIn(v, add(v, B)) = 1 + numberIn(v, B)
- numberIn(v, add(u, B)) = numberIn(v, B) if v ≠ u
- remove(v, new()) = new()
- remove(v, add(v, B)) = B
- remove(v, add(u, B)) = add(u, remove(v, B)) if v ≠ u
- Partie du discours : noun
- Secteur d’activité/Domaine : Informatique
- Catégorie : Algorithms & data structures
- Government Agency: NIST
0
Créateur
- GeorgeV
- 100% positive feedback