diff options
| author | Daniel Micay <danielmicay@gmail.com> | 2013-03-21 17:49:55 -0400 |
|---|---|---|
| committer | Daniel Micay <danielmicay@gmail.com> | 2013-03-21 17:50:12 -0400 |
| commit | 5d4063083bc366d1423572855f6320bb964d2a22 (patch) | |
| tree | 64867ad9a60f652c563364e30d6b307d9089f812 | |
| parent | 9814d0d4128b07d4c40dc721c977f9216fd55e91 (diff) | |
| download | rust-5d4063083bc366d1423572855f6320bb964d2a22.tar.gz rust-5d4063083bc366d1423572855f6320bb964d2a22.zip | |
trie: make impl pub
| -rw-r--r-- | src/libcore/trie.rs | 4 |
1 files changed, 1 insertions, 3 deletions
diff --git a/src/libcore/trie.rs b/src/libcore/trie.rs index 6b2f2bb6a7d..3b9d3ad4b73 100644 --- a/src/libcore/trie.rs +++ b/src/libcore/trie.rs @@ -136,15 +136,13 @@ impl<T> Map<uint, T> for TrieMap<T> { } } -impl<T> TrieMap<T> { +pub impl<T> TrieMap<T> { /// Create an empty TrieMap #[inline(always)] static pure fn new() -> TrieMap<T> { TrieMap{root: TrieNode::new(), length: 0} } -} -impl<T> TrieMap<T> { /// Visit all keys in reverse order #[inline(always)] pure fn each_key_reverse(&self, f: &fn(&uint) -> bool) { |