Skip to content

Commit 3acc3c4

Browse files
committed
Make std::map require const keys.
1 parent f394933 commit 3acc3c4

File tree

2 files changed

+10
-8
lines changed

2 files changed

+10
-8
lines changed

src/libstd/map.rs

Lines changed: 5 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -282,7 +282,7 @@ Parameters:
282282
hasher - The hash function for key type K
283283
eqer - The equality function for key type K
284284
*/
285-
fn hashmap<K: copy, V: copy>(hasher: hashfn<K>, eqer: eqfn<K>)
285+
fn hashmap<K: const copy, V: copy>(hasher: hashfn<K>, eqer: eqfn<K>)
286286
-> hashmap<K, V> {
287287
chained::mk(hasher, eqer)
288288
}
@@ -316,7 +316,9 @@ fn uint_hash<V: copy>() -> hashmap<uint, V> {
316316
#[doc = "
317317
Convenience function for adding keys to a hashmap with nil type keys
318318
"]
319-
fn set_add<K: copy>(set: set<K>, key: K) -> bool { ret set.insert(key, ()); }
319+
fn set_add<K: const copy>(set: set<K>, key: K) -> bool {
320+
ret set.insert(key, ());
321+
}
320322

321323
#[doc = "
322324
Convert a set into a vector.
@@ -331,7 +333,7 @@ fn vec_from_set<T: copy>(s: set<T>) -> [T] {
331333
}
332334

333335
#[doc = "Construct a hashmap from a vector"]
334-
fn hash_from_vec<K: copy, V: copy>(hasher: hashfn<K>, eqer: eqfn<K>,
336+
fn hash_from_vec<K: const copy, V: copy>(hasher: hashfn<K>, eqer: eqfn<K>,
335337
items: [(K, V)]) -> hashmap<K, V> {
336338
let map = hashmap(hasher, eqer);
337339
vec::iter(items) { |item|

src/libsyntax/util/interner.rs

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -5,18 +5,18 @@ import std::map;
55
import std::map::{hashmap, hashfn, eqfn};
66
import dvec::{dvec, extensions};
77

8-
type interner<T> =
8+
type interner<T: const> =
99
{map: hashmap<T, uint>,
1010
vect: dvec<T>,
1111
hasher: hashfn<T>,
1212
eqer: eqfn<T>};
1313

14-
fn mk<T: copy>(hasher: hashfn<T>, eqer: eqfn<T>) -> interner<T> {
14+
fn mk<T: const copy>(hasher: hashfn<T>, eqer: eqfn<T>) -> interner<T> {
1515
let m = map::hashmap::<T, uint>(hasher, eqer);
1616
ret {map: m, vect: dvec(), hasher: hasher, eqer: eqer};
1717
}
1818

19-
fn intern<T: copy>(itr: interner<T>, val: T) -> uint {
19+
fn intern<T: const copy>(itr: interner<T>, val: T) -> uint {
2020
alt itr.map.find(val) {
2121
some(idx) { ret idx; }
2222
none {
@@ -31,10 +31,10 @@ fn intern<T: copy>(itr: interner<T>, val: T) -> uint {
3131
// |get| isn't "pure" in the traditional sense, because it can go from
3232
// failing to returning a value as items are interned. But for typestate,
3333
// where we first check a pred and then rely on it, ceasing to fail is ok.
34-
pure fn get<T: copy>(itr: interner<T>, idx: uint) -> T {
34+
pure fn get<T: const copy>(itr: interner<T>, idx: uint) -> T {
3535
unchecked {
3636
itr.vect.get_elt(idx)
3737
}
3838
}
3939

40-
fn len<T>(itr: interner<T>) -> uint { ret itr.vect.len(); }
40+
fn len<T: const>(itr: interner<T>) -> uint { ret itr.vect.len(); }

0 commit comments

Comments
 (0)