1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231
use crate::categories::CategoryId;
use crate::crates::CrateId;
use crate::keywords::KeywordId;
use crate::teams::TeamId;
use crate::users::UserId;
use crate::versions::VersionId;
use crate::DbDump;
use fnv::FnvHashMap as Map;
use once_cell::sync::OnceCell;
impl DbDump {
/// Create a lazy index of those tables that have a unique ID column as
/// primary key.
///
/// This call does no work up front. Each index is built lazily upon first
/// access through one of the `Index` struct's methods.
pub fn index<'a>(&'a self) -> Index<'a> {
Index::new(self)
}
}
/// Lazy index of those tables that have a unique ID column as primary key.
///
/// # Example
///
/// This example prints the top 5 most downloaded crates in each of the top 20
/// most popular categories.
///
/// ```no_run
/// use db_dump::categories::CategoryId;
/// use db_dump::crates::CrateId;
/// use db_dump::DbDump;
/// use std::cmp::Reverse;
/// use std::collections::BTreeMap as Map;
///
/// fn main() -> db_dump::Result<()> {
/// let mut db = DbDump::default();
/// let ref mut crates = db.crates;
/// let mut categories = Vec::new();
/// let mut crates_by_category = Map::<CategoryId, Vec<CrateId>>::new();
/// db_dump::Loader::new()
/// .crates(|row| crates.push(row))
/// .categories(|row| categories.push(row))
/// .crates_categories(|row| {
/// crates_by_category
/// .entry(row.category_id)
/// .or_default()
/// .push(row.crate_id)
/// })
/// .load("./db-dump.tar.gz")?;
///
/// // Lazy index to perform lookups by crate id.
/// let index = db.index();
///
/// // Sort categories descending by number of crates, to print most popular
/// // categories first.
/// categories.sort_unstable_by_key(|category| Reverse(category.crates_cnt));
///
/// for category in categories.iter().take(20) {
/// // Get the list of crates in this category.
/// let mut crates = crates_by_category.remove(&category.id).unwrap_or_default();
///
/// // Sort crates list by download count descending.
/// crates.sort_unstable_by_key(|&id| Reverse(index.krate(id).downloads));
///
/// // Print top 5 most downloaded crates in category.
/// print!("{}", category.slug);
/// for crate_id in crates.into_iter().take(5) {
/// print!(",{}", index.krate(crate_id).name);
/// }
/// println!();
/// }
///
/// Ok(())
/// }
/// ```
pub struct Index<'a> {
db: &'a DbDump,
categories: OnceCell<Map<CategoryId, u32>>,
crates: OnceCell<Map<CrateId, u32>>,
keywords: OnceCell<Map<KeywordId, u32>>,
teams: OnceCell<Map<TeamId, u32>>,
users: OnceCell<Map<UserId, u32>>,
versions: OnceCell<Map<VersionId, u32>>,
}
impl<'a> Index<'a> {
/// This call does no work up front. Each index is built lazily upon first
/// access through one of the methods below.
pub fn new(db: &'a DbDump) -> Self {
Index {
db,
categories: OnceCell::new(),
crates: OnceCell::new(),
keywords: OnceCell::new(),
teams: OnceCell::new(),
users: OnceCell::new(),
versions: OnceCell::new(),
}
}
pub fn category(&self, id: CategoryId) -> &'a crate::categories::Row {
&self.db.categories[*self
.categories
.get_or_init(|| {
self.db
.categories
.iter()
.enumerate()
.map(|(i, row)| (row.id, i as u32))
.collect()
})
.get(&id)
.unwrap_or_else(|| panic!("no such category id={}", id.0))
as usize]
}
pub fn krate(&self, id: CrateId) -> &'a crate::crates::Row {
&self.db.crates[*self
.crates
.get_or_init(|| {
self.db
.crates
.iter()
.enumerate()
.map(|(i, row)| (row.id, i as u32))
.collect()
})
.get(&id)
.unwrap_or_else(|| panic!("no such crate id={}", id.0))
as usize]
}
pub fn keyword(&self, id: KeywordId) -> &'a crate::keywords::Row {
&self.db.keywords[*self
.keywords
.get_or_init(|| {
self.db
.keywords
.iter()
.enumerate()
.map(|(i, row)| (row.id, i as u32))
.collect()
})
.get(&id)
.unwrap_or_else(|| panic!("no such keyword id={}", id.0))
as usize]
}
pub fn team(&self, id: TeamId) -> &'a crate::teams::Row {
&self.db.teams[*self
.teams
.get_or_init(|| {
self.db
.teams
.iter()
.enumerate()
.map(|(i, row)| (row.id, i as u32))
.collect()
})
.get(&id)
.unwrap_or_else(|| panic!("no such team id={}", id.0)) as usize]
}
pub fn user(&self, id: UserId) -> &'a crate::users::Row {
&self.db.users[*self
.users
.get_or_init(|| {
self.db
.users
.iter()
.enumerate()
.map(|(i, row)| (row.id, i as u32))
.collect()
})
.get(&id)
.unwrap_or_else(|| panic!("no such user id={}", id.0)) as usize]
}
pub fn version(&self, id: VersionId) -> &'a crate::versions::Row {
&self.db.versions[*self
.versions
.get_or_init(|| {
self.db
.versions
.iter()
.enumerate()
.map(|(i, row)| (row.id, i as u32))
.collect()
})
.get(&id)
.unwrap_or_else(|| panic!("no such version id={}", id.0))
as usize]
}
}
impl CategoryId {
pub fn lookup<'a>(self, index: &Index<'a>) -> &'a crate::categories::Row {
index.category(self)
}
}
impl CrateId {
pub fn lookup<'a>(self, index: &Index<'a>) -> &'a crate::crates::Row {
index.krate(self)
}
}
impl KeywordId {
pub fn lookup<'a>(self, index: &Index<'a>) -> &'a crate::keywords::Row {
index.keyword(self)
}
}
impl TeamId {
pub fn lookup<'a>(self, index: &Index<'a>) -> &'a crate::teams::Row {
index.team(self)
}
}
impl UserId {
pub fn lookup<'a>(self, index: &Index<'a>) -> &'a crate::users::Row {
index.user(self)
}
}
impl VersionId {
pub fn lookup<'a>(self, index: &Index<'a>) -> &'a crate::versions::Row {
index.version(self)
}
}