/// Aliases added through `#[doc(alias = "...")]`. Since a few items can have the same alias,
/// we need the alias element to have an array of items.
- pub(super) aliases: FxHashMap<String, Vec<usize>>,
+ pub(super) aliases: BTreeMap<String, Vec<usize>>,
}
impl Cache {
for alias in item.attrs.get_doc_aliases() {
self.aliases
.entry(alias.to_lowercase())
- .or_insert(Vec::with_capacity(1))
+ .or_insert(Vec::new())
.push(self.search_index.len() - 1);
}
}
parent_idx: None,
search_type: get_index_search_type(&item),
});
- for alias in item.attrs.get_doc_aliases().into_iter() {
+ for alias in item.attrs.get_doc_aliases() {
aliases
.entry(alias.to_lowercase())
- .or_insert(Vec::with_capacity(1))
+ .or_insert(Vec::new())
.push(search_index.len() - 1);
}
}
.map(|module| shorten(plain_summary_line(module.doc_value())))
.unwrap_or(String::new());
- let crate_aliases =
- aliases.iter().map(|(k, values)| (k.clone(), values.clone())).collect::<Vec<_>>();
-
#[derive(Serialize)]
struct CrateData<'a> {
doc: String,
//
// To be noted: the `usize` elements are indexes to `items`.
#[serde(rename = "a")]
- aliases: Option<Vec<(String, Vec<usize>)>>,
+ #[serde(skip_serializing_if = "BTreeMap::is_empty")]
+ aliases: &'a BTreeMap<String, Vec<usize>>,
}
// Collect the index into a string
doc: crate_doc,
items: crate_items,
paths: crate_paths,
- aliases: if crate_aliases.is_empty() { None } else { Some(crate_aliases) },
+ aliases,
})
.expect("failed serde conversion")
// All these `replace` calls are because we have to go through JS string for JSON content.
if (aliases) {
ALIASES[crate] = {};
var j, local_aliases;
- for (i = 0; i < aliases.length; ++i) {
- var alias_name = aliases[i][0];
+ for (var alias_name in aliases) {
+ if (!aliases.hasOwnProperty(alias_name)) { continue; }
+
if (!ALIASES[crate].hasOwnProperty(alias_name)) {
ALIASES[crate][alias_name] = [];
}
- local_aliases = aliases[i][1];
+ local_aliases = aliases[alias_name];
for (j = 0; j < local_aliases.length; ++j) {
ALIASES[crate][alias_name].push(local_aliases[j] + currentIndex);
}