From 112c8a966fbdb52ff2a535dc8e6df3a8b3cb8fb2 Mon Sep 17 00:00:00 2001 From: Alexis Beingessner Date: Thu, 30 Oct 2014 21:25:08 -0400 Subject: refactor libcollections as part of collection reform * Moves multi-collection files into their own directory, and splits them into seperate files * Changes exports so that each collection has its own module * Adds underscores to public modules and filenames to match standard naming conventions (that is, treemap::{TreeMap, TreeSet} => tree_map::TreeMap, tree_set::TreeSet) * Renames PriorityQueue to BinaryHeap * Renames SmallIntMap to VecMap * Miscellanious fallout fixes [breaking-change] --- src/libtest/stats.rs | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) (limited to 'src/libtest/stats.rs') diff --git a/src/libtest/stats.rs b/src/libtest/stats.rs index 2cc694176de..8c184ccbe43 100644 --- a/src/libtest/stats.rs +++ b/src/libtest/stats.rs @@ -10,8 +10,8 @@ #![allow(missing_docs)] -use std::collections::hashmap; -use std::collections::hashmap::{Occupied, Vacant}; +use std::collections::hash_map; +use std::collections::hash_map::{Occupied, Vacant}; use std::fmt::Show; use std::hash::Hash; use std::io; @@ -440,8 +440,8 @@ pub fn write_boxplot( /// Returns a HashMap with the number of occurrences of every element in the /// sequence that the iterator exposes. -pub fn freq_count, U: Eq+Hash>(mut iter: T) -> hashmap::HashMap { - let mut map: hashmap::HashMap = hashmap::HashMap::new(); +pub fn freq_count, U: Eq+Hash>(mut iter: T) -> hash_map::HashMap { + let mut map: hash_map::HashMap = hash_map::HashMap::new(); for elem in iter { match map.entry(elem) { Occupied(mut entry) => { *entry.get_mut() += 1; }, -- cgit 1.4.1-3-g733a5