-
Notifications
You must be signed in to change notification settings - Fork 115
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
7 changed files
with
924 additions
and
733 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,81 @@ | ||
| use std::collections::BTreeMap; | ||
| use std::str; | ||
|
|
||
| use webidl::{self, ast}; | ||
|
|
||
| /// Helper method for inserting into a BTreeMap-based multi-map | ||
| pub fn multimap_insert<K: Ord, V: PartialEq>(m: &mut BTreeMap<K, Vec<V>>, key: K, value: V) { | ||
| let v = m.entry(key).or_insert_with(Vec::new); | ||
| if !v.contains(&value) { | ||
| v.push(value); | ||
| } | ||
| } | ||
|
|
||
| /// Helper method for appending to a BTreeMap-based multi-map | ||
| pub fn multimap_append<K: Ord + Clone, V: PartialEq>(m: &mut BTreeMap<K, Vec<V>>, other: BTreeMap<K, Vec<V>>) { | ||
| for (k, v) in other { | ||
| for value in v { | ||
| multimap_insert(m, k.clone(), value); | ||
| } | ||
| } | ||
| } | ||
|
|
||
| /// Best-effort attempt to render HTML into a doc-comment which can | ||
| /// be placed in the generated code. | ||
| pub fn convert_html_to_doc_comment(html: &str) -> String { | ||
| use regex::RegexBuilder; | ||
| use html2runes; | ||
|
|
||
| // Create doc comments | ||
| let doc_comment_regex = RegexBuilder::new("^").multi_line(true).build().unwrap(); | ||
|
|
||
| let md = html2runes::markdown::convert_string(html); | ||
| let mut doc = doc_comment_regex.replace_all(md.trim_right(), "/// ").into(); | ||
| doc += "\n"; | ||
| doc | ||
| } | ||
|
|
||
| /// Appends an underscore to a name if it conflicts with a reserved word. | ||
| pub fn unreserve<S: Into<String>>(name: S) -> String { | ||
| const RESERVED_WORDS: &'static [&'static str] = &[ | ||
| "as", "break", "const", "continue", "crate", "else", "enum", "extern", "false", "fn", "for", | ||
| "if", "impl", "in", "let", "loop", "match", "mod", "move", "mut", "pub", "ref", "return", | ||
| "Self", "self", "static", "struct", "super", "trait", "true", "type", "unsafe", "use", "where", | ||
| "while", "abstract", "alignof", "become", "box", "do", "final", "macro", "offsetof", | ||
| "override", "priv", "proc", "pure", "sizeof", "typeof", "unsized", "virtual", "yield" | ||
| ]; | ||
|
|
||
| let mut s = name.into(); | ||
| if RESERVED_WORDS.contains(&&*s) { | ||
| s += "_"; | ||
| } | ||
| s | ||
| } | ||
|
|
||
| /// Converts to lower snake-case | ||
| pub fn snake(name: &str) -> String { | ||
| use heck::SnakeCase; | ||
| name.to_snake_case() | ||
| } | ||
|
|
||
| /// Converts to upper snake-case | ||
| pub fn shouty_snake(name: &str) -> String { | ||
| use heck::ShoutySnakeCase; | ||
| name.to_shouty_snake_case() | ||
| } | ||
|
|
||
| /// Converts to upper camel case | ||
| pub fn camel(name: &str) -> String { | ||
| use heck::CamelCase; | ||
| name.to_camel_case() | ||
| } | ||
|
|
||
| /// Parse WebIDL content into an AST | ||
| pub fn parse_defs(src: &[u8]) -> Vec<ast::Definition> { | ||
| let src = str::from_utf8(src) | ||
| .expect("IDL contained invalid UTF-8"); | ||
|
|
||
| let parser = webidl::Parser::new(); | ||
| parser.parse_string(src) | ||
| .expect("Failed to parse IDL") | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.