Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(35)

Side by Side Diff: pkg/barback/lib/src/multiset.dart

Issue 261823008: Reorganize barback's source files. (Closed) Base URL: https://dart.googlecode.com/svn/branches/bleeding_edge/dart
Patch Set: re-add barback/lib/src/internal_asset.dart Created 6 years, 7 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch | Annotate | Revision Log
« no previous file with comments | « pkg/barback/lib/src/log.dart ('k') | pkg/barback/lib/src/node_status.dart » ('j') | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
OLDNEW
(Empty)
1 // Copyright (c) 2013, the Dart project authors. Please see the AUTHORS file
2 // for details. All rights reserved. Use of this source code is governed by a
3 // BSD-style license that can be found in the LICENSE file.
4
5 library barback.multiset;
6
7 import 'dart:collection';
8
9 /// A set of objects where each object can appear multiple times.
10 ///
11 /// Like a set, this has amortized O(1) insertion, removal, and
12 /// existence-checking of elements. Counting the number of copies of an element
13 /// in the set is also amortized O(1).
14 ///
15 /// Distinct elements retain insertion order. Additional copies of an element
16 /// beyond the first are grouped with the original element.
17 ///
18 /// If multiple equal elements are added, only the first actual object is
19 /// retained.
20 class Multiset<E> extends IterableBase<E> {
21 /// A map from each element in the set to the number of copies of that element
22 /// in the set.
23 final _map = new Map<E, int>();
24
25 Iterator<E> get iterator {
26 return _map.keys.expand((element) {
27 return new Iterable.generate(_map[element], (_) => element);
28 }).iterator;
29 }
30
31 Multiset()
32 : super();
33
34 /// Creates a multi-set and initializes it using the contents of [other].
35 Multiset.from(Iterable<E> other)
36 : super() {
37 other.forEach(add);
38 }
39
40 /// Adds [value] to the set.
41 void add(E value) {
42 _map.putIfAbsent(value, () => 0);
43 _map[value] += 1;
44 }
45
46 /// Removes one copy of [value] from the set.
47 ///
48 /// Returns whether a copy of [value] was removed, regardless of whether more
49 /// copies remain.
50 bool remove(E value) {
51 if (!_map.containsKey(value)) return false;
52
53 _map[value] -= 1;
54 if (_map[value] == 0) _map.remove(value);
55 return true;
56 }
57
58 /// Returns whether [value] is in the set.
59 bool contains(E value) => _map.containsKey(value);
60
61 /// Returns the number of copies of [value] in the set.
62 int count(E value) => _map.containsKey(value) ? _map[value] : 0;
63 }
OLDNEW
« no previous file with comments | « pkg/barback/lib/src/log.dart ('k') | pkg/barback/lib/src/node_status.dart » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698