X-Git-Url: http://git.scottworley.com/tablify/blobdiff_plain/116fc215a7f859e20b60e91bcb24d314a9d911f9..9a6260204a9a4bfa4254719c30710ea827212877:/src/lib.rs?ds=inline
diff --git a/src/lib.rs b/src/lib.rs
index 199b8ab..bad71d0 100644
--- a/src/lib.rs
+++ b/src/lib.rs
@@ -1,13 +1,16 @@
-use std::collections::{HashMap, HashSet};
+use std::borrow::ToOwned;
+use std::collections::HashMap;
use std::fmt::Write;
use std::io::BufRead;
use std::iter::Iterator;
-const HEADER: &str = "
+pub struct Config {}
+
+const HEADER: &str = r#"
-
-
+
+
@@ -32,7 +35,7 @@ const HEADER: &str = "
-";
+"#;
const FOOTER: &str = "
@@ -75,37 +78,39 @@ impl std::fmt::Display for HTML {
}
}
-#[derive(Debug, PartialEq, Eq, Hash)]
-struct Entry<'a> {
- col: &'a str,
- instance: Option<&'a str>,
+#[derive(Debug, PartialEq, Eq)]
+enum InputLine<'a> {
+ Blank,
+ RowHeader(&'a str),
+ Entry(&'a str, Option<&'a str>),
}
-impl<'a> From<&'a str> for Entry<'a> {
- fn from(value: &'a str) -> Entry<'a> {
- match value.split_once(':') {
- None => Entry {
- col: value,
- instance: None,
- },
- Some((col, instance)) => Entry {
- col: col.trim(),
- instance: Some(instance.trim()),
- },
+impl<'a> From<&'a str> for InputLine<'a> {
+ fn from(value: &'a str) -> InputLine<'a> {
+ let trimmed = value.trim_end();
+ if trimmed.is_empty() {
+ InputLine::Blank
+ } else if !trimmed.starts_with(' ') {
+ InputLine::RowHeader(value.trim())
+ } else {
+ match value.split_once(':') {
+ None => InputLine::Entry(value.trim(), None),
+ Some((col, instance)) => InputLine::Entry(col.trim(), Some(instance.trim())),
+ }
}
}
}
#[derive(Debug, PartialEq, Eq)]
-struct RowInput<'a> {
- label: &'a str,
- entries: Vec>,
+struct Row {
+ label: String,
+ entries: HashMap>>,
}
-struct Reader<'a, Input: Iterator- >> {
+struct Reader>> {
input: std::iter::Enumerate,
- row: Option>,
+ row: Option
,
}
-impl<'a, Input: Iterator- >> Reader<'a, Input> {
+impl>> Reader {
fn new(input: Input) -> Self {
Self {
input: input.enumerate(),
@@ -113,64 +118,58 @@ impl<'a, Input: Iterator
- >> Reader<'a, Inpu
}
}
}
-impl<'a, Input: Iterator
- >> Iterator for Reader<'a, Input> {
- type Item = Result, std::io::Error>;
+impl>> Iterator for Reader {
+ type Item = Result
;
fn next(&mut self) -> Option {
loop {
- match self
- .input
- .next()
- // TODO: Don't leak
- .map(|(n, r)| (n, r.map(|line| String::from(line).leak().trim_end())))
- {
+ match self.input.next() {
None => return Ok(std::mem::take(&mut self.row)).transpose(),
Some((_, Err(e))) => return Some(Err(e)),
- Some((_, Ok(line))) if line.is_empty() && self.row.is_some() => {
- return Ok(std::mem::take(&mut self.row)).transpose()
- }
- Some((_, Ok(line))) if line.is_empty() => {}
- Some((n, Ok(line))) if line.starts_with(' ') => match &mut self.row {
- None => {
- return Some(Err(std::io::Error::other(format!(
- "{}: Entry with no header",
- n + 1
- ))))
+ Some((n, Ok(line))) => match InputLine::from(line.as_ref()) {
+ InputLine::Blank if self.row.is_some() => {
+ return Ok(std::mem::take(&mut self.row)).transpose()
}
- Some(ref mut row) => row.entries.push(Entry::from(line.trim())),
- },
- Some((_, Ok(line))) => {
- let prev = std::mem::take(&mut self.row);
- self.row = Some(RowInput {
- label: line,
- entries: vec![],
- });
- if prev.is_some() {
- return Ok(prev).transpose();
+ InputLine::Blank => {}
+ InputLine::Entry(col, instance) => match &mut self.row {
+ None => {
+ return Some(Err(std::io::Error::other(format!(
+ "{}: Entry with no header",
+ n + 1
+ ))))
+ }
+ Some(ref mut row) => {
+ row.entries
+ .entry(col.to_owned())
+ .and_modify(|is| is.push(instance.map(ToOwned::to_owned)))
+ .or_insert_with(|| vec![instance.map(ToOwned::to_owned)]);
+ }
+ },
+ InputLine::RowHeader(row) => {
+ let prev = std::mem::take(&mut self.row);
+ self.row = Some(Row {
+ label: row.to_owned(),
+ entries: HashMap::new(),
+ });
+ if prev.is_some() {
+ return Ok(prev).transpose();
+ }
}
- }
+ },
}
}
}
}
-fn read_rows(
- input: impl std::io::Read,
-) -> impl Iterator- , std::io::Error>> {
+fn read_rows(input: impl std::io::Read) -> impl Iterator
- > {
Reader::new(std::io::BufReader::new(input).lines())
}
-fn column_counts(rows: &[RowInput]) -> Vec<(usize, String)> {
+fn column_counts(rows: &[Row]) -> Vec<(usize, String)> {
let mut counts: Vec<_> = rows
.iter()
- .flat_map(|r| {
- r.entries
- .iter()
- .map(|e| &e.col)
- .collect::>()
- .into_iter()
- })
+ .flat_map(|r| r.entries.keys())
.fold(HashMap::new(), |mut cs, col| {
- cs.entry(String::from(*col))
+ cs.entry(col.to_owned())
.and_modify(|n| *n += 1)
.or_insert(1);
cs
@@ -181,63 +180,96 @@ fn column_counts(rows: &[RowInput]) -> Vec<(usize, String)> {
counts.sort_unstable_by(|(an, acol), (bn, bcol)| bn.cmp(an).then(acol.cmp(bcol)));
counts
}
-fn column_order(rows: &[RowInput]) -> Vec {
+fn column_order(rows: &[Row]) -> Vec {
column_counts(rows)
.into_iter()
.map(|(_, col)| col)
.collect()
}
-fn render_instance(entry: &Entry) -> HTML {
- match &entry.instance {
+fn render_one_instance(instance: &Option) -> HTML {
+ match instance {
None => HTML::from("â"),
Some(instance) => HTML::escape(instance.as_ref()),
}
}
-fn render_cell(col: &str, row: &RowInput) -> HTML {
- let row_label = HTML::escape(row.label.as_ref());
- let col_label = HTML::escape(col);
- let entries: Vec<&Entry> = row.entries.iter().filter(|e| e.col == col).collect();
- let class = HTML::from(if entries.is_empty() { "" } else { "yes" });
- let all_empty = entries.iter().all(|e| e.instance.is_none());
- let contents = if entries.is_empty() || (all_empty && entries.len() == 1) {
+fn render_instances(instances: &[Option]) -> HTML {
+ let all_empty = instances.iter().all(Option::is_none);
+ if all_empty && instances.len() == 1 {
HTML::from("")
} else if all_empty {
- HTML(format!("{}", entries.len()))
+ HTML(format!("{}", instances.len()))
} else {
HTML(
- entries
+ instances
.iter()
- .map(|i| render_instance(i))
+ .map(render_one_instance)
.map(|html| html.0) // Waiting for slice_concat_trait to stabilize
.collect::>()
.join(" "),
)
+ }
+}
+
+fn render_cell(col: &str, row: &mut Row) -> HTML {
+ let row_label = HTML::escape(row.label.as_ref());
+ let col_label = HTML::escape(col);
+ let instances: Option<&Vec