;\\n\\n\\n\\n program = spacing expression\\n\\n\\n\\n expression\\n\\n = term (term_op term)* > fold_left\\n\\n\\n\\n term\\n\\n = exponent (factor_op exponent)* > fold_left\\n\\n\\n\\n exponent\\n\\n = (factor exponent_op)* factor > fold_right\\n\\n\\n\\n factor: PExpr\\n\\n = number > box Number\\n\\n / identifier > box Variable\\n\\n / let_expr > box LetIn\\n\\n / lparen expression rparen\\n\\n\\n\\n let_expr = let_kw let_binding in_kw expression\\n\\n let_binding = identifier bind_op expression\\n\\n\\n\\n term_op: BinOp\\n\\n = add_op > Add\\n\\n / sub_op > Sub\\n\\n\\n\\n factor_op: BinOp\\n\\n = mul_op > Mul\\n\\n / div_op > Div\\n\\n\\n\\n exponent_op: BinOp = exp_op > Exp\\n\\n\\n\\n identifier = !digit !keyword ident_char+ spacing > to_string\\n\\n ident_char = [\\\"a-zA-Z0-9_\\\"]\\n\\n\\n\\n digit = [\\\"0-9\\\"]\\n\\n number = digit+ spacing > to_number\\n\\n spacing = [\\\" \\\\n\\\\r\\\\t\\\"]*:(^)\\n\\n\\n\\n kw_tail = !ident_char spacing\\n\\n\\n\\n keyword = let_kw / in_kw\\n\\n let_kw = \\\"let\\\" kw_tail\\n\\n in_kw = \\\"in\\\" kw_tail\\n\\n\\n\\n bind_op = \\\"=\\\" spacing\\n\\n add_op = \\\"+\\\" spacing\\n\\n sub_op = \\\"-\\\" spacing\\n\\n mul_op = \\\"*\\\" spacing\\n\\n div_op = \\\"/\\\" spacing\\n\\n exp_op = \\\"^\\\" spacing\\n\\n lparen = \\\"(\\\" spacing\\n\\n rparen = \\\")\\\" spacing\\n\\n\\n\\n fn to_number(raw_text: Vec<char>) -> u32 {\\n\\n u32::from_str(&*to_string(raw_text)).unwrap()\\n\\n }\\n\\n\\n\\n fn to_string(raw_text: Vec<char>) -> String {\\n\\n raw_text.into_iter().collect()\\n\\n }\\n\\n\\n\\n fn fold_left(head: PExpr, rest: Vec<(BinOp, PExpr)>) -> PExpr {\\n\\n rest.into_iter().fold(head,\\n\\n |accu, (op, expr)| Box::new(BinaryExpr(op, accu, expr)))\\n\",\n \"file_path\": \"doc/src/full-calc-grammar.md\",\n \"rank\": 73,\n \"score\": 48660.22116083296\n },\n {\n \"content\": \"Operator\",\n \"file_path\": \"data/test/type_name/run-pass/simple_name.rs\",\n \"rank\": 74,\n \"score\": 41573.809710597\n },\n {\n \"content\": \"Operator(Sum, Plus, Minus, Div)\",\n \"file_path\": \"data/test/type_name/run-pass/name_list.rs\",\n \"rank\": 75,\n \"score\": 41573.809710597\n },\n {\n \"content\": \"_(Plus, Minus)\",\n \"file_path\": \"data/test/type_name/run-pass/infer_name_list_head.rs\",\n \"rank\": 76,\n \"score\": 39826.26012808076\n },\n {\n \"content\": \" u32::from_str(&*to_string(raw_text)).unwrap()\\n\\n }\\n\\n\\n\\n\\n\\n fn to_string(raw_text: Vec<char>) -> String {\\n\\n raw_text.into_iter().collect()\\n\\n }\\n\\n\\n\\n}\\n\\n\\n\\n\\n\\n// fn analyse_state(state: ParseState<StrStream, json::PExpr>) {\\n\\n// use oak_runtime::parse_state::ParseResult::*;\\n\\n// match state.into_result() {\\n\\n// Success(data) => println!(\\\"Full match: {:?}\\\", data),\\n\\n// Partial(data, expectation) => {\\n\\n// println!(\\\"Partial match: {:?} because {:?}\\\", data, expectation);\\n\\n// }\\n\\n// Failure(expectation) => {\\n\\n// println!(\\\"Failure: {:?}\\\", expectation);\\n\",\n \"file_path\": \"tests/grammars/json.rs\",\n \"rank\": 77,\n \"score\": 36549.61266752591\n },\n {\n \"content\": \" Variable(String),\\n\\n Number(u32),\\n\\n BinaryExpr(BinOp, PExpr, PExpr),\\n\\n LetIn(String, PExpr, PExpr)\\n\\n }\\n\\n\\n\\n #[derive(Debug)]\\n\\n pub enum BinOp {\\n\\n Add, Sub, Mul, Div, Exp\\n\\n }\\n\\n\\n\\n fn to_number(raw_text: Vec<char>) -> u32 {\\n\\n u32::from_str(&*to_string(raw_text)).unwrap()\\n\\n }\\n\\n\\n\\n fn number_expr(value: u32) -> PExpr {\\n\\n Box::new(Number(value))\\n\\n }\\n\\n\\n\\n fn variable_expr(ident: String) -> PExpr {\\n\",\n \"file_path\": \"tests/grammars/calc.rs\",\n \"rank\": 78,\n \"score\": 36545.90664621128\n },\n {\n \"content\": \" lbracket = \\\"[\\\" spacing\\n\\n rbracket = \\\"]\\\" spacing\\n\\n lbrace = \\\"{\\\" spacing\\n\\n rbrace = \\\"}\\\" spacing\\n\\n\\n\\n use std::str::FromStr;\\n\\n\\n\\n pub type PExpr = Box<JSONExpr>;\\n\\n\\n\\n //Enums\\n\\n #[derive(Debug)]\\n\\n pub enum JSONExpr {\\n\\n Str(String),\\n\\n Number(u32),\\n\\n Array(Vec<Box<JSONExpr>>),\\n\\n Object(Option<Box<JSONPair>>)\\n\\n }\\n\\n\\n\\n #[derive(Debug)]\\n\\n pub enum JSONPair {\\n\",\n \"file_path\": \"tests/grammars/json.rs\",\n \"rank\": 79,\n \"score\": 36544.7109507986\n },\n {\n \"content\": \" Box::new(Variable(ident))\\n\\n }\\n\\n\\n\\n fn to_string(raw_text: Vec<char>) -> String {\\n\\n raw_text.into_iter().collect()\\n\\n }\\n\\n\\n\\n fn fold_left(head: PExpr, rest: Vec<(BinOp, PExpr)>) -> PExpr {\\n\\n rest.into_iter().fold(head,\\n\\n |accu, (op, expr)| Box::new(BinaryExpr(op, accu, expr)))\\n\\n }\\n\\n\\n\\n fn fold_right(front: Vec<(PExpr, BinOp)>, last: PExpr) -> PExpr {\\n\\n front.into_iter().rev().fold(last,\\n\\n |accu, (expr, op)| Box::new(BinaryExpr(op, expr, accu)))\\n\\n }\\n\\n\\n\\n fn let_in_expr(var: String, value: PExpr, expr: PExpr) -> PExpr {\\n\\n Box::new(LetIn(var, value, expr))\\n\\n }\\n\\n\\n\\n fn add_bin_op() -> BinOp { Add }\\n\\n fn sub_bin_op() -> BinOp { Sub }\\n\\n fn mul_bin_op() -> BinOp { Mul }\\n\\n fn div_bin_op() -> BinOp { Div }\\n\\n fn exp_bin_op() -> BinOp { Exp }\\n\\n}\\n\",\n \"file_path\": \"tests/grammars/calc.rs\",\n \"rank\": 80,\n \"score\": 36542.45401625896\n },\n {\n \"content\": \"// Copyright 2014 Pierre Talbot (IRCAM)\\n\\n\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n\\n\\nuse oak::oak;\\n\\nuse self::Expression::*;\\n\\nuse self::BinOp::*;\\n\\nuse grammars::calc2;\\n\\n\\n\\npub type PExpr = Box<Expression>;\\n\",\n \"file_path\": \"tests/grammars/calc3.rs\",\n \"rank\": 81,\n \"score\": 36541.92842668877\n },\n {\n \"content\": \"\\n\\n#[derive(Debug)]\\n\\npub enum Expression {\\n\\n Variable(String),\\n\\n Number(u32),\\n\\n BinaryExpr(BinOp, PExpr, PExpr),\\n\\n LetIn(String, PExpr, PExpr)\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub enum BinOp {\\n\\n Add, Sub, Mul, Div, Exp\\n\\n}\\n\\n\\n\\noak! {\\n\\n // Optional stream declaration.\\n\\n type Stream<'a> = StrStream<'a>;\\n\\n\\n\\n program = spacing expression\\n\\n\\n\",\n \"file_path\": \"tests/grammars/calc2.rs\",\n \"rank\": 82,\n \"score\": 36541.63441434693\n },\n {\n \"content\": \"\\n\\n#[derive(Debug)]\\n\\npub enum Expression {\\n\\n Variable(String),\\n\\n Number(u32),\\n\\n BinaryExpr(BinOp, PExpr, PExpr),\\n\\n LetIn(String, PExpr, PExpr)\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub enum BinOp {\\n\\n Add, Sub, Mul, Div, Exp\\n\\n}\\n\\n\\n\\noak! {\\n\\n // Optional stream declaration.\\n\\n type Stream<'a> = StrStream<'a>;\\n\\n\\n\\n program = spacing expression\\n\\n\\n\",\n \"file_path\": \"tests/grammars/calc3.rs\",\n \"rank\": 83,\n \"score\": 36541.63441434693\n },\n {\n \"content\": \" let_kw = \\\"let\\\" kw_tail\\n\\n in_kw = \\\"in\\\" kw_tail\\n\\n\\n\\n bind_op = \\\"=\\\" spacing\\n\\n add_op = \\\"+\\\" spacing\\n\\n sub_op = \\\"-\\\" spacing\\n\\n mul_op = \\\"*\\\" spacing\\n\\n div_op = \\\"/\\\" spacing\\n\\n exp_op = \\\"^\\\" spacing\\n\\n lparen = \\\"(\\\" spacing\\n\\n rparen = \\\")\\\" spacing\\n\\n\\n\\n use std::str::FromStr;\\n\\n use self::Expression::*;\\n\\n use self::BinOp::*;\\n\\n\\n\\n pub type PExpr = Box<Expression>;\\n\\n\\n\\n #[derive(Debug)]\\n\\n pub enum Expression {\\n\",\n \"file_path\": \"tests/grammars/calc.rs\",\n \"rank\": 84,\n \"score\": 36540.85362228853\n },\n {\n \"content\": \"// Copyright 2021 Pierre Talbot\\n\\n\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n\\n\\nuse oak::oak;\\n\\n\\n\\noak! {\\n\\n underscore = \\\"_\\\"\\n\\n digits = (underscore* digit)+ > id\\n\\n digit = [\\\"0-9\\\"]\\n\\n\\n\\n fn id(v: Vec<char>) -> Vec<char> {\\n\\n v\\n\\n }\\n\\n}\",\n \"file_path\": \"tests/grammars/issue94.rs\",\n \"rank\": 85,\n \"score\": 36540.7242140231\n },\n {\n \"content\": \"// {\\n\\n// \\\"servlet-name\\\": \\\"cofaxTools\\\",\\n\\n// \\\"servlet-class\\\": \\\"org.cofax.cms.CofaxToolsServlet\\\",\\n\\n// \\\"init-param\\\": {\\n\\n// \\\"templatePath\\\": \\\"toolstemplates/\\\",\\n\\n// \\\"log\\\": 1,\\n\\n// \\\"logLocation\\\": \\\"/usr/local/tomcat/logs/CofaxTools.log\\\",\\n\\n// \\\"logMaxSize\\\": \\\"\\\",\\n\\n// \\\"dataLog\\\": 1,\\n\\n// \\\"dataLogLocation\\\": \\\"/usr/local/tomcat/logs/dataLog.log\\\",\\n\\n// \\\"dataLogMaxSize\\\": \\\"\\\",\\n\\n// \\\"removePageCache\\\": \\\"/content/admin/remove?cache=pages&id=\\\",\\n\\n// \\\"removeTemplateCache\\\": \\\"/content/admin/remove?cache=templates&id=\\\",\\n\\n// \\\"fileTransferFolder\\\": \\\"/usr/local/tomcat/webapps/content/fileTransferFolder\\\",\\n\\n// \\\"lookInContext\\\": 1,\\n\\n// \\\"adminGroupID\\\": 4,\\n\\n// \\\"betaServer\\\": \\\"true\\\"}}],\\n\\n// \\\"servlet-mapping\\\": {\\n\\n// \\\"cofaxCDS\\\": \\\"/\\\",\\n\\n// \\\"cofaxEmail\\\": \\\"/cofaxutil/aemail/*\\\",\\n\",\n \"file_path\": \"tests/grammars/json.rs\",\n \"rank\": 86,\n \"score\": 36540.69718554007\n },\n {\n \"content\": \"use oak::*;\\n\\n\\n\\n\\n\\noak! {\\n\\n ra = \\\"a\\\" ra / \\\"b\\\" .\\n\\n // rb = \\\"a\\\" rb . / \\\"b\\\" .\\n\\n // rc = ra . / .\\n\\n\\n\\n rd = \\\"a\\\" rd // debatable to allow this rule. However, with Partial match it can make sense...\\n\\n\\n\\n re = . re\\n\\n\\n\\n factor: Expr\\n\\n = number > Expr::Number\\n\\n / identifier > Expr::Variable\\n\\n / lparen factor rparen\\n\\n\\n\\n lparen = \\\"(\\\"\\n\\n rparen = \\\")\\\"\\n\\n number = [\\\"0-9\\\"]+\\n\",\n \"file_path\": \"tests/grammars/typing.rs\",\n \"rank\": 87,\n \"score\": 36540.643880223455\n },\n {\n \"content\": \" identifier = [\\\"a-z\\\"]+\\n\\n\\n\\n pub enum Expr {\\n\\n Number(Vec<char>),\\n\\n Variable(Vec<char>)\\n\\n }\\n\\n\\n\\n rule1 = \\\"a\\\" > test2\\n\\n // rule2 = \\\"a\\\" > test3 // Fail due to unit type\\n\\n // rule3 = \\\"a\\\" > test4 // Fail due to unit type\\n\\n\\n\\n type MyUnit = ();\\n\\n fn test2() -> MyUnit {}\\n\\n fn test3() -> () {}\\n\\n fn test4() {}\\n\\n\\n\\n rule4 = r#\\\"\\\"foo\\\"\\\"#\\n\\n rule5 = r##\\\"foo #\\\"# bar\\\"##\\n\\n}\\n\",\n \"file_path\": \"tests/grammars/typing.rs\",\n \"rank\": 88,\n \"score\": 36540.50630024001\n },\n {\n \"content\": \"// Copyright 2014 Pierre Talbot (IRCAM)\\n\\n\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n\\n\\nuse oak::oak;\\n\\nuse self::Expression::*;\\n\\nuse self::BinOp::*;\\n\\nuse std::str::FromStr;\\n\\n\\n\\npub type PExpr = Box<Expression>;\\n\",\n \"file_path\": \"tests/grammars/calc2.rs\",\n \"rank\": 89,\n \"score\": 36539.3493983688\n },\n {\n \"content\": \"// Copyright 2015 Pierre Talbot (IRCAM)\\n\\n\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n\\n\\n#![allow(dead_code)]\\n\\n\\n\\npub mod ntcc;\\n\\npub mod type_name;\\n\\npub mod calc;\\n\\npub mod calc2;\\n\",\n \"file_path\": \"tests/grammars/mod.rs\",\n \"rank\": 90,\n \"score\": 36539.34791942514\n },\n {\n \"content\": \" Pair(String, Box<JSONExpr>),\\n\\n Json(Vec<Box<JSONPair>>)\\n\\n }\\n\\n\\n\\n //Functions\\n\\n\\n\\n fn make_json_number(number:u32)-> Box<JSONExpr> {\\n\\n Box::new(JSONExpr::Number(number))\\n\\n }\\n\\n\\n\\n fn make_json_string(string:String) -> Box<JSONExpr> {\\n\\n Box::new(JSONExpr::Str(string))\\n\\n }\\n\\n\\n\\n fn make_json_pair(string:String, expr:Box<JSONExpr>) -> Box<JSONPair> {\\n\\n Box::new(JSONPair::Pair(string,expr))\\n\\n }\\n\\n\\n\\n fn make_json_array(array:Vec<Box<JSONExpr>>, front:Box<JSONExpr>) -> Box<JSONExpr> {\\n\\n let mut vector = Vec::new();\\n\",\n \"file_path\": \"tests/grammars/json.rs\",\n \"rank\": 91,\n \"score\": 36538.81653812832\n },\n {\n \"content\": \"\\n\\n bind_op = \\\"=\\\" spacing\\n\\n add_op = \\\"+\\\" spacing\\n\\n sub_op = \\\"-\\\" spacing\\n\\n mul_op = \\\"*\\\" spacing\\n\\n div_op = \\\"/\\\" spacing\\n\\n exp_op = \\\"^\\\" spacing\\n\\n lparen = \\\"(\\\" spacing\\n\\n rparen = \\\")\\\" spacing\\n\\n\\n\\n fn to_number(raw_text: Vec<char>) -> u32 {\\n\\n u32::from_str(&*to_string(raw_text)).unwrap()\\n\\n }\\n\\n\\n\\n fn to_string(raw_text: Vec<char>) -> String {\\n\\n raw_text.into_iter().collect()\\n\\n }\\n\\n\\n\\n fn fold_left(head: PExpr, rest: Vec<(BinOp, PExpr)>) -> PExpr {\\n\\n rest.into_iter().fold(head,\\n\\n |accu, (op, expr)| Box::new(BinaryExpr(op, accu, expr)))\\n\\n }\\n\\n\\n\\n fn fold_right(front: Vec<(PExpr, BinOp)>, last: PExpr) -> PExpr {\\n\\n front.into_iter().rev().fold(last,\\n\\n |accu, (expr, op)| Box::new(BinaryExpr(op, expr, accu)))\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"tests/grammars/calc2.rs\",\n \"rank\": 92,\n \"score\": 36538.778651639266\n },\n {\n \"content\": \" div_op = \\\"/\\\" spacing\\n\\n exp_op = \\\"^\\\" spacing\\n\\n lparen = \\\"(\\\" spacing\\n\\n rparen = \\\")\\\" spacing\\n\\n\\n\\n fn fold_left(head: PExpr, rest: Vec<(BinOp, PExpr)>) -> PExpr {\\n\\n rest.into_iter().fold(head,\\n\\n |accu, (op, expr)| Box::new(BinaryExpr(op, accu, expr)))\\n\\n }\\n\\n\\n\\n fn fold_right(front: Vec<(PExpr, BinOp)>, last: PExpr) -> PExpr {\\n\\n front.into_iter().rev().fold(last,\\n\\n |accu, (expr, op)| Box::new(BinaryExpr(op, expr, accu)))\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"tests/grammars/calc3.rs\",\n \"rank\": 93,\n \"score\": 36538.49262100548\n },\n {\n \"content\": \"pub mod calc3;\\n\\npub mod recursive_type;\\n\\npub mod combinators;\\n\\npub mod well_formedness;\\n\\npub mod useless_chaining;\\n\\npub mod unreachable_rule;\\n\\npub mod issue94;\\n\\nmod stream_span;\\n\\nmod typing;\\n\",\n \"file_path\": \"tests/grammars/mod.rs\",\n \"rank\": 94,\n \"score\": 36538.341435245464\n },\n {\n \"content\": \" for i in array{\\n\\n vector.push(i);\\n\\n }\\n\\n vector.push(front);\\n\\n Box::new(JSONExpr::Array(vector))\\n\\n }\\n\\n\\n\\n fn make_json_member(pair: Box<JSONPair>, rest: Vec<Box<JSONPair>>) -> Box<JSONPair> {\\n\\n let mut vector = vec![pair];\\n\\n for i in rest{\\n\\n vector.push(i);\\n\\n }\\n\\n Box::new(JSONPair::Json(vector))\\n\\n }\\n\\n\\n\\n fn make_json_object(m: Option<Box<JSONPair>>) -> Box<JSONExpr> {\\n\\n Box::new(JSONExpr::Object(m))\\n\\n }\\n\\n\\n\\n fn to_number(raw_text: Vec<char>) -> u32 {\\n\",\n \"file_path\": \"tests/grammars/json.rs\",\n \"rank\": 95,\n \"score\": 36538.07892077982\n },\n {\n \"content\": \"// \\\"cachePackageTagsStore\\\": 200,\\n\\n// \\\"cachePackageTagsRefresh\\\": 60,\\n\\n// \\\"cacheTemplatesTrack\\\": 100,\\n\\n// \\\"cacheTemplatesStore\\\": 50,\\n\\n// \\\"cacheTemplatesRefresh\\\": 15,\\n\\n// \\\"cachePagesTrack\\\": 200,\\n\\n// \\\"cachePagesStore\\\": 100,\\n\\n// \\\"cachePagesRefresh\\\": 10,\\n\\n// \\\"cachePagesDirtyRead\\\": 10,\\n\\n// \\\"searchEngineListTemplate\\\": \\\"forSearchEnginesList.htm\\\",\\n\\n// \\\"searchEngineFileTemplate\\\": \\\"forSearchEngines.htm\\\",\\n\\n// \\\"searchEngineRobotsDb\\\": \\\"WEB-INF/robots.db\\\",\\n\\n// \\\"useDataStore\\\": \\\"true\\\",\\n\\n// \\\"dataStoreClass\\\": \\\"org.cofax.SqlDataStore\\\",\\n\\n// \\\"redirectionClass\\\": \\\"org.cofax.SqlRedirection\\\",\\n\\n// \\\"dataStoreName\\\": \\\"cofax\\\",\\n\\n// \\\"dataStoreDriver\\\": \\\"com.microsoft.jdbc.sqlserver.SQLServerDriver\\\",\\n\\n// \\\"dataStoreUrl\\\": \\\"jdbc:microsoft:sqlserver://LOCALHOST:1433;DatabaseName=goon\\\",\\n\\n// \\\"dataStoreUser\\\": \\\"sa\\\",\\n\\n// \\\"dataStorePassword\\\": \\\"dataStoreTestQuery\\\",\\n\",\n \"file_path\": \"tests/grammars/json.rs\",\n \"rank\": 96,\n \"score\": 36537.10359575255\n },\n {\n \"content\": \" expression\\n\\n = term (term_op term)* > fold_left\\n\\n\\n\\n term\\n\\n = exponent (factor_op exponent)* > fold_left\\n\\n\\n\\n exponent\\n\\n = (factor exponent_op)* factor > fold_right\\n\\n\\n\\n factor: PExpr\\n\\n = number > box Number\\n\\n / identifier > box Variable\\n\\n / let_expr > box LetIn\\n\\n / lparen expression rparen\\n\\n\\n\\n let_expr = let_kw let_binding in_kw expression\\n\\n let_binding = identifier bind_op expression\\n\\n\\n\\n term_op: BinOp\\n\\n = add_op > Add\\n\",\n \"file_path\": \"tests/grammars/calc2.rs\",\n \"rank\": 97,\n \"score\": 36536.90314038821\n },\n {\n \"content\": \" expression\\n\\n = term (term_op term)* > fold_left\\n\\n\\n\\n term\\n\\n = exponent (factor_op exponent)* > fold_left\\n\\n\\n\\n exponent\\n\\n = (factor exponent_op)* factor > fold_right\\n\\n\\n\\n factor: Box<Expression>\\n\\n = calc2::number > box Number\\n\\n / calc2::identifier > box Variable\\n\\n / let_expr > box LetIn\\n\\n / lparen expression rparen\\n\\n\\n\\n let_expr = let_kw let_binding in_kw expression\\n\\n let_binding = (calc2::identifier:String) bind_op expression\\n\\n\\n\\n term_op: BinOp\\n\\n = add_op > Add\\n\",\n \"file_path\": \"tests/grammars/calc3.rs\",\n \"rank\": 98,\n \"score\": 36536.28239586621\n },\n {\n \"content\": \"// Copyright 2018 Chao Lin & William Sergeant (Sorbonne University)\\n\\n\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n\\n\\nextern crate oak_runtime;\\n\\nuse oak_runtime::*;\\n\\nuse oak::oak;\\n\\n\\n\\noak! {\\n\\n program = spacing json_expr spacing\\n\",\n \"file_path\": \"tests/grammars/json.rs\",\n \"rank\": 99,\n \"score\": 36536.27190575664\n }\n]","isConversational":false}}},{"rowIdx":1379,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"dpx/src/dpx_dpxconf.rs"},"repo_name":{"kind":"string","value":"mulimoen/tectonic"},"commit":{"kind":"string","value":"bea4516e2c7b253bc92dbd0b744a233635db7b0b"},"file_code":{"kind":"string","value":"/* This is dvipdfmx, an eXtended version of dvipdfm by Mark A. Wicks.\n\n Copyright (C) 2002-2016 by Jin-Hwan Cho and Shunsaku Hirata,\n the dvipdfmx project team.\n\n Copyright (C) 1998, 1999 by Mark A. Wicks <mwicks@kettering.edu>\n\n This program is free software; you can redistribute it and/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation; either version 2 of the License, or\n (at your option) any later version.\n\n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with this program; if not, write to the Free Software\n Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.\n*/\n#![allow(\n mutable_transmutes,\n non_camel_case_types,\n non_snake_case,\n non_upper_case_globals,\n unused_mut\n)]\n\nuse crate::streq_ptr;\n\npub type __off_t = i64;\npub type __off64_t = i64;\npub type size_t = u64;\n#[derive(Copy, Clone)]\n#[repr(C)]\npub struct paper {\n pub name: *const i8,\n pub pswidth: f64,\n pub psheight: f64,\n}\n#[no_mangle]\npub static mut paperspecs: [paper; 22] = [\n {\n let mut init = paper {\n name: b\"letter\\x00\" as *const u8 as *const i8,\n pswidth: 612.00f64,\n psheight: 792.00f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"legal\\x00\" as *const u8 as *const i8,\n pswidth: 612.00f64,\n psheight: 1008.00f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"ledger\\x00\" as *const u8 as *const i8,\n pswidth: 1224.00f64,\n psheight: 792.00f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"tabloid\\x00\" as *const u8 as *const i8,\n pswidth: 792.00f64,\n psheight: 1224.00f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"a6\\x00\" as *const u8 as *const i8,\n pswidth: 297.638f64,\n psheight: 419.528f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"a5\\x00\" as *const u8 as *const i8,\n pswidth: 419.528f64,\n psheight: 595.276f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"a4\\x00\" as *const u8 as *const i8,\n pswidth: 595.276f64,\n psheight: 841.890f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"a3\\x00\" as *const u8 as *const i8,\n pswidth: 841.890f64,\n psheight: 1190.550f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"b6\\x00\" as *const u8 as *const i8,\n pswidth: 364.25f64,\n psheight: 515.91f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"b5\\x00\" as *const u8 as *const i8,\n pswidth: 515.91f64,\n psheight: 728.50f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"b4\\x00\" as *const u8 as *const i8,\n pswidth: 728.50f64,\n psheight: 1031.81f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"b3\\x00\" as *const u8 as *const i8,\n pswidth: 1031.81f64,\n psheight: 1457.00f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"b5var\\x00\" as *const u8 as *const i8,\n pswidth: 515.91f64,\n psheight: 651.97f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"jisb6\\x00\" as *const u8 as *const i8,\n pswidth: 364.25f64,\n psheight: 515.91f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"jisb5\\x00\" as *const u8 as *const i8,\n pswidth: 515.91f64,\n psheight: 728.50f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"jisb4\\x00\" as *const u8 as *const i8,\n pswidth: 728.50f64,\n psheight: 1031.81f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"jisb3\\x00\" as *const u8 as *const i8,\n pswidth: 1031.81f64,\n psheight: 1457.00f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"isob6\\x00\" as *const u8 as *const i8,\n pswidth: 354.331f64,\n psheight: 498.898f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"isob5\\x00\" as *const u8 as *const i8,\n pswidth: 498.898f64,\n psheight: 708.661f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"isob4\\x00\" as *const u8 as *const i8,\n pswidth: 708.661f64,\n psheight: 1000.630f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"isob3\\x00\" as *const u8 as *const i8,\n pswidth: 1000.630f64,\n psheight: 1417.320f64,\n };\n init\n },\n {\n let mut init = paper {\n name: 0 as *const i8,\n pswidth: 0i32 as f64,\n psheight: 0i32 as f64,\n };\n init\n },\n];\n#[no_mangle]\npub unsafe extern \"C\" fn paperinfo(mut ppformat: *const i8) -> *const paper {\n if ppformat.is_null() {\n return 0 as *const paper;\n }\n let mut ppinfo = &*paperspecs.as_ptr().offset(0) as *const paper;\n while !ppinfo.is_null()\n && !(if !ppinfo.is_null() && !(*ppinfo).name.is_null() {\n (*ppinfo).name\n } else {\n 0 as *const i8\n })\n .is_null()\n {\n if streq_ptr(ppformat, (*ppinfo).name) {\n break;\n }\n ppinfo = if !ppinfo.offset(1).is_null() && !(*ppinfo.offset(1)).name.is_null() {\n ppinfo.offset(1)\n } else {\n 0 as *const paper\n }\n }\n return if !ppinfo.is_null()\n && !(if !ppinfo.is_null() && !(*ppinfo).name.is_null() {\n (*ppinfo).name\n } else {\n 0 as *const i8\n })\n .is_null()\n {\n ppinfo\n } else {\n 0 as *const paper\n };\n}\n/* HAVE_LIBPAPER */\n/* HAVE_LIBPAPER */\n#[no_mangle]\npub unsafe extern \"C\" fn dumppaperinfo() {\n let mut ppinfo = &*paperspecs.as_ptr().offset(0) as *const paper;\n while !ppinfo.is_null()\n && !(if !ppinfo.is_null() && !(*ppinfo).name.is_null() {\n (*ppinfo).name\n } else {\n 0 as *const i8\n })\n .is_null()\n {\n let wd = if !ppinfo.is_null() && !(*ppinfo).name.is_null() {\n (*ppinfo).pswidth\n } else {\n 0.0f64\n };\n let ht = if !ppinfo.is_null() && !(*ppinfo).name.is_null() {\n (*ppinfo).psheight\n } else {\n 0.0f64\n };\n println!(\n \"{}: {:.2} {:.2} ({:.2}mm {:.2}mm)\",\n if !ppinfo.is_null() && !(*ppinfo).name.is_null() {\n use std::ffi::CStr;\n let name = CStr::from_ptr((*ppinfo).name);\n name.to_string_lossy()\n } else {\n use std::borrow::Cow;\n Cow::Borrowed(\"(null)\")\n },\n wd,\n ht,\n 25.4f64 * wd / 72.0f64,\n 25.4f64 * ht / 72.0f64,\n );\n ppinfo = if !ppinfo.offset(1).is_null() && !(*ppinfo.offset(1)).name.is_null() {\n ppinfo.offset(1)\n } else {\n 0 as *const paper\n }\n }\n}\n"},"prefix":{"kind":"string","value":"/* This is dvipdfmx, an eXtended version of dvipdfm by Mark A. Wicks.\n\n Copyright (C) 2002-2016 by Jin-Hwan Cho and Shunsaku Hirata,\n the dvipdfmx project team.\n\n Copyright (C) 1998, 1999 by Mark A. Wicks <mwicks@kettering.edu>\n\n This program is free software; you can redistribute it and/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation; either version 2 of the License, or\n (at your option) any later version.\n\n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with this program; if not, write to the Free Software\n Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.\n*/\n#![allow(\n mutable_transmutes,\n non_camel_case_types,\n non_snake_case,\n non_upper_case_globals,\n unused_mut\n)]\n\nuse crate::streq_ptr;\n\npub type __off_t = i64;\npub type __off64_t = i64;\npub type size_t = u64;\n#[derive(Copy, Clone)]\n#[repr(C)]\npub struct paper {\n pub name: *const i8,\n pub pswidth: f64,\n pub psheight: f64,\n}\n#[no_mangle]\npub static mut paperspecs: [paper; 22] = [\n {\n let mut init = paper {\n name: b\"letter\\x00\" as *const u8 as *const i8,\n pswidth: 612.00f64,\n psheight: 792.00f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"legal\\x00\" as *const u8 as *const i8,\n pswidth: 612.00f64,\n psheight: 1008.00f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"ledger\\x00\" as *const u8 as *const i8,\n pswidth: 1224.00f64,\n psheight: 792.00f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"tabloid\\x00\" as *const u8 as *const i8,\n pswidth: 792.00f64,\n psheight: 1224.00f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"a6\\x00\" as *const u8 as *const i8,\n pswidth: 297.638f64,\n psheight: 419.528f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"a5\\x00\" as *const u8 as *const i8,\n pswidth: 419.528f64,\n psheight: 595.276f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"a4\\x00\" as *const u8 as "},"suffix":{"kind":"string","value":" .is_null()\n {\n if streq_ptr(ppformat, (*ppinfo).name) {\n break;\n }\n ppinfo = if !ppinfo.offset(1).is_null() && !(*ppinfo.offset(1)).name.is_null() {\n ppinfo.offset(1)\n } else {\n 0 as *const paper\n }\n }\n return if !ppinfo.is_null()\n && !(if !ppinfo.is_null() && !(*ppinfo).name.is_null() {\n (*ppinfo).name\n } else {\n 0 as *const i8\n })\n .is_null()\n {\n ppinfo\n } else {\n 0 as *const paper\n };\n}\n/* HAVE_LIBPAPER */\n/* HAVE_LIBPAPER */\n#[no_mangle]\npub unsafe extern \"C\" fn dumppaperinfo() {\n let mut ppinfo = &*paperspecs.as_ptr().offset(0) as *const paper;\n while !ppinfo.is_null()\n && !(if !ppinfo.is_null() && !(*ppinfo).name.is_null() {\n (*ppinfo).name\n } else {\n 0 as *const i8\n })\n .is_null()\n {\n let wd = if !ppinfo.is_null() && !(*ppinfo).name.is_null() {\n (*ppinfo).pswidth\n } else {\n 0.0f64\n };\n let ht = if !ppinfo.is_null() && !(*ppinfo).name.is_null() {\n (*ppinfo).psheight\n } else {\n 0.0f64\n };\n println!(\n \"{}: {:.2} {:.2} ({:.2}mm {:.2}mm)\",\n if !ppinfo.is_null() && !(*ppinfo).name.is_null() {\n use std::ffi::CStr;\n let name = CStr::from_ptr((*ppinfo).name);\n name.to_string_lossy()\n } else {\n use std::borrow::Cow;\n Cow::Borrowed(\"(null)\")\n },\n wd,\n ht,\n 25.4f64 * wd / 72.0f64,\n 25.4f64 * ht / 72.0f64,\n );\n ppinfo = if !ppinfo.offset(1).is_null() && !(*ppinfo.offset(1)).name.is_null() {\n ppinfo.offset(1)\n } else {\n 0 as *const paper\n }\n }\n}\n"},"middle":{"kind":"string","value":"*const i8,\n pswidth: 595.276f64,\n psheight: 841.890f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"a3\\x00\" as *const u8 as *const i8,\n pswidth: 841.890f64,\n psheight: 1190.550f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"b6\\x00\" as *const u8 as *const i8,\n pswidth: 364.25f64,\n psheight: 515.91f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"b5\\x00\" as *const u8 as *const i8,\n pswidth: 515.91f64,\n psheight: 728.50f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"b4\\x00\" as *const u8 as *const i8,\n pswidth: 728.50f64,\n psheight: 1031.81f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"b3\\x00\" as *const u8 as *const i8,\n pswidth: 1031.81f64,\n psheight: 1457.00f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"b5var\\x00\" as *const u8 as *const i8,\n pswidth: 515.91f64,\n psheight: 651.97f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"jisb6\\x00\" as *const u8 as *const i8,\n pswidth: 364.25f64,\n psheight: 515.91f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"jisb5\\x00\" as *const u8 as *const i8,\n pswidth: 515.91f64,\n psheight: 728.50f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"jisb4\\x00\" as *const u8 as *const i8,\n pswidth: 728.50f64,\n psheight: 1031.81f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"jisb3\\x00\" as *const u8 as *const i8,\n pswidth: 1031.81f64,\n psheight: 1457.00f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"isob6\\x00\" as *const u8 as *const i8,\n pswidth: 354.331f64,\n psheight: 498.898f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"isob5\\x00\" as *const u8 as *const i8,\n pswidth: 498.898f64,\n psheight: 708.661f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"isob4\\x00\" as *const u8 as *const i8,\n pswidth: 708.661f64,\n psheight: 1000.630f64,\n };\n init\n },\n {\n let mut init = paper {\n name: b\"isob3\\x00\" as *const u8 as *const i8,\n pswidth: 1000.630f64,\n psheight: 1417.320f64,\n };\n init\n },\n {\n let mut init = paper {\n name: 0 as *const i8,\n pswidth: 0i32 as f64,\n psheight: 0i32 as f64,\n };\n init\n },\n];\n#[no_mangle]\npub unsafe extern \"C\" fn paperinfo(mut ppformat: *const i8) -> *const paper {\n if ppformat.is_null() {\n return 0 as *const paper;\n }\n let mut ppinfo = &*paperspecs.as_ptr().offset(0) as *const paper;\n while !ppinfo.is_null()\n && !(if !ppinfo.is_null() && !(*ppinfo).name.is_null() {\n (*ppinfo).name\n } else {\n 0 as *const i8\n })\n "},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"pub fn hex_to_bytes(text: &str, dest: &mut [u8]) -> Result<()> {\n\n let n = dest.len();\n\n let text_len = text.len();\n\n\n\n if text_len != 2 * n {\n\n return Err(ErrorKind::BadLength(2 * n, text_len).into());\n\n }\n\n\n\n for i in 0..n {\n\n dest[i] = u8::from_str_radix(&text[i * 2..(i + 1) * 2], 16)?;\n\n }\n\n\n\n Ok(())\n\n}\n\n\n\n// The specific implementation we're using: SHA256.\n\n\n\nconst N_BYTES: usize = 32;\n\npub const DIGEST_NAME: &str = \"SHA256SUM\";\n\npub const DIGEST_LEN: usize = 64;\n\n\n","file_path":"src/digest.rs","rank":0,"score":190693.3822029074},{"content":"type synctex_recorder_t = Option<unsafe extern \"C\" fn(_: i32) -> ()>;\n\n\n\nconst default_synctex_ctxt: Context = Context {\n\n file: None,\n\n root_name: ptr::null_mut(),\n\n count: 0i32,\n\n node: 0i32,\n\n recorder: None,\n\n tag: 0i32,\n\n line: 0i32,\n\n curh: 0i32,\n\n curv: 0i32,\n\n magnification: 0i32,\n\n unit: 0i32,\n\n total_length: 0,\n\n lastv: -1i32,\n\n form_depth: 0i32,\n\n synctex_tag_counter: 0_u32,\n\n flags: Flags::empty(),\n\n};\n","file_path":"engine/src/xetex_synctex.rs","rank":1,"score":187574.89352690981},{"content":"pub fn agl_name_is_unicode(glyphname: &[u8]) -> bool {\n\n if glyphname.is_empty() {\n\n return false;\n\n }\n\n let len = glyphname\n\n .iter()\n\n .position(|&x| x == b'.')\n\n .unwrap_or(glyphname.len());\n\n /*\n\n * uni02ac is invalid glyph name and mapped to th empty string.\n\n */\n\n if len >= 7 && (len - 3) % 4 == 0 && glyphname.starts_with(b\"uni\") {\n\n let c = glyphname[3];\n\n /*\n\n * Check if the 4th character is uppercase hexadecimal digit.\n\n * \"union\" should not be treated as Unicode glyph name.\n\n */\n\n if c.is_ascii_digit() || c >= b'A' && c <= b'F' {\n\n return true;\n\n } else {\n","file_path":"dpx/src/dpx_agl.rs","rank":2,"score":184437.18106554932},{"content":"#[inline(always)]\n\nfn as_printable_ascii(c: i32) -> Option<u8> {\n\n if c > 0x20 && c < 0x7F {\n\n Some(c as u8)\n\n } else {\n\n None\n\n }\n\n}\n\n\n\nimpl<'a, 'b: 'a> State<'a, 'b> {\n\n pub fn finished(self) {\n\n if let Some(oh) = self.cur_output {\n\n let (name, digest) = oh.into_name_digest();\n\n self.events.output_closed(name, digest);\n\n }\n\n }\n\n}\n\n\n\nimpl<'a, 'b: 'a> XdvEvents for State<'a, 'b> {\n\n type Error = Error;\n\n\n","file_path":"src/engines/spx2html.rs","rank":3,"score":162092.50599737326},{"content":"fn scan_otl_tag(mut otl_tags: &[u8]) -> Result<(Vec<u8>, Vec<u8>, Vec<u8>), ()> {\n\n let mut script;\n\n let mut language = vec![b' '; 4];\n\n if otl_tags.is_empty() {\n\n return Err(());\n\n }\n\n /* First parse otl_tags variable */\n\n let mut p = otl_tags;\n\n\n\n if let Some(slen) = p.iter().position(|&x| x == b'.') {\n\n /* Format scrp.lang.feat */\n\n if slen < 5 {\n\n script = Vec::from(&p[..slen]);\n\n } else {\n\n warn!(\"Invalid OTL script tag found: {}\", p.display());\n\n return Err(());\n\n }\n\n p = &p[slen + 1..];\n\n if let Some(llen) = p.iter().position(|&x| x == b'.') {\n\n /* Now lang part */\n","file_path":"dpx/src/dpx_tt_gsub.rs","rank":4,"score":152930.38468736532},{"content":"type id = *mut Object;\n\n\n\nextern \"C\" {\n\n pub type __CFAllocator;\n\n pub type __CFURL;\n\n pub type __CTFontDescriptor;\n\n pub type __CFString;\n\n pub type __CFArray;\n\n pub type __CFDictionary;\n\n pub type __CFSet;\n\n pub type __CTFont;\n\n #[no_mangle]\n\n fn free(_: *mut libc::c_void);\n\n #[no_mangle]\n\n fn malloc(_: libc::c_ulong) -> *mut libc::c_void;\n\n #[no_mangle]\n\n fn strchr(_: *const libc::c_char, _: libc::c_int) -> *mut libc::c_char;\n\n #[no_mangle]\n\n fn strlen(_: *const libc::c_char) -> libc::c_ulong;\n\n #[no_mangle]\n","file_path":"engine/src/xetex_font_manager_coretext.rs","rank":5,"score":149475.96920560196},{"content":"type rust_output_handle_t = *mut libc::c_void;\n\npub type rust_input_handle_t = *mut libc::c_void;\n\n\n\n#[derive(PartialEq)]\n\npub struct OutputHandleWrapper(NonNull<libc::c_void>);\n\n\n\nimpl OutputHandleWrapper {\n\n pub fn new(ptr: rust_output_handle_t) -> Option<Self> {\n\n NonNull::new(ptr).map(|nnp| Self(nnp))\n\n }\n\n}\n\n\n\nimpl Write for OutputHandleWrapper {\n\n fn write(&mut self, buf: &[u8]) -> Result<usize> {\n\n unsafe {\n\n Ok(\n\n ttstub_output_write(self.0.as_ptr(), buf.as_ptr() as *const i8, buf.len() as u64)\n\n as usize,\n\n )\n\n }\n","file_path":"bridge/src/lib.rs","rank":6,"score":144489.09819678107},{"content":"#[derive(Clone, Debug, Eq, PartialEq)]\n\nstruct SharedByteBuffer(Rc<Vec<u8>>);\n\n\n\nimpl SharedByteBuffer {\n\n fn new(data: Vec<u8>) -> SharedByteBuffer {\n\n SharedByteBuffer(Rc::new(data))\n\n }\n\n}\n\n\n\nimpl AsRef<[u8]> for SharedByteBuffer {\n\n fn as_ref(&self) -> &[u8] {\n\n &*self.0\n\n }\n\n}\n\n\n\nimpl InputFeatures for Cursor<SharedByteBuffer> {\n\n fn get_size(&mut self) -> Result<usize> {\n\n Ok(self.get_ref().0.len())\n\n }\n\n\n\n fn try_seek(&mut self, pos: SeekFrom) -> Result<u64> {\n","file_path":"src/io/stdstreams.rs","rank":7,"score":144393.9015064857},{"content":"pub fn bytes_to_hex(bytes: &[u8]) -> String {\n\n bytes\n\n .iter()\n\n .map(|b| format!(\"{:02x}\", b))\n\n .collect::<Vec<_>>()\n\n .concat()\n\n}\n\n\n","file_path":"src/digest.rs","rank":8,"score":142833.1413145302},{"content":"fn xtol(mut buf: &[u8]) -> i32 {\n\n let mut v: i32 = 0i32;\n\n for &b in buf {\n\n v <<= 4;\n\n if b.is_ascii_digit() {\n\n v += (b - b'0') as i32;\n\n } else if b >= b'A' && b <= b'F' {\n\n v += (b - b'A' + 10) as i32;\n\n } else {\n\n return -1;\n\n }\n\n }\n\n v\n\n}\n\n\n\nunsafe fn put_unicode_glyph(name: &[u8], mut dstpp: *mut *mut u8, mut limptr: *mut u8) -> i32 {\n\n let mut len = 0;\n\n let mut p = name;\n\n if p[1] != b'n' {\n\n p = &p[1..];\n","file_path":"dpx/src/dpx_agl.rs","rank":9,"score":140514.51107537074},{"content":"fn skip_modifier<'a>(buf: &'a [u8]) -> (&'a [u8], usize) {\n\n let mut slen = 0;\n\n for s in MODIFIERS.iter() {\n\n if buf.starts_with(s) {\n\n slen = s.len();\n\n break;\n\n }\n\n }\n\n (&buf[slen..], slen)\n\n}\n","file_path":"dpx/src/dpx_agl.rs","rank":10,"score":138254.28482163395},{"content":"pub fn get_unique_time_if_given() -> Option<SystemTime> {\n\n use std::time::Duration;\n\n\n\n let env = std::env::var(\"SOURCE_DATE_EPOCH\");\n\n\n\n env.ok()\n\n .map(|x| {\n\n x.trim()\n\n .parse::<u64>()\n\n .ok()\n\n .map(|x| SystemTime::UNIX_EPOCH.checked_add(Duration::new(x, 0)))\n\n })\n\n .unwrap_or(None)\n\n .unwrap_or(None)\n\n}\n\n\n\nstatic mut unique_tag_state: i32 = 1i32;\n\nstatic mut unique_tags_deterministic: i32 = 0i32;\n\n#[no_mangle]\n\npub unsafe extern \"C\" fn pdf_font_reset_unique_tag_state() {\n","file_path":"dpx/src/dpx_pdffont.rs","rank":11,"score":137305.19741023888},{"content":"/// A hack to allow casting of Bundles to IoProviders.\n\n///\n\n/// The code that sets up the I/O stack is handed a reference to a Bundle\n\n/// trait object. For the actual I/O, it needs to convert this to an\n\n/// IoProvider trait object. [According to\n\n/// StackExchange](https://stackoverflow.com/a/28664881/3760486), the\n\n/// following pattern is the least-bad way to achieve the necessary upcasting.\n\npub trait AsIoProviderMut {\n\n /// Represent this value as an IoProvider trait object.\n\n fn as_ioprovider_mut(&mut self) -> &mut dyn IoProvider;\n\n}\n\n\n\nimpl<T: IoProvider> AsIoProviderMut for T {\n\n fn as_ioprovider_mut(&mut self) -> &mut dyn IoProvider {\n\n self\n\n }\n\n}\n\n\n","file_path":"src/io/mod.rs","rank":12,"score":134236.3886603842},{"content":"fn convert_tag(tag: &mut [u8; 4], u_tag: u32) {\n\n *tag = u_tag.to_be_bytes();\n\n}\n\n\n\n/*\n\n * Computes the max power of 2 <= n\n\n */\n\nunsafe fn max2floor(mut n: u32) -> u32 {\n\n let mut val: i32 = 1i32;\n\n while n > 1_u32 {\n\n n = n.wrapping_div(2_u32);\n\n val *= 2i32\n\n }\n\n val as u32\n\n}\n\n/*\n\n * Computes the log2 of the max power of 2 <= n\n\n */\n\nunsafe fn log2floor(mut n: u32) -> u32 {\n\n let mut val: u32 = 0_u32;\n","file_path":"dpx/src/dpx_sfnt.rs","rank":13,"score":129622.98698968318},{"content":"/// A trait for types that can read or write files needed by the TeX engine.\n\npub trait IoProvider: AsIoProviderMut {\n\n fn output_open_name(&mut self, _name: &OsStr) -> OpenResult<OutputHandle> {\n\n OpenResult::NotAvailable\n\n }\n\n\n\n fn output_open_stdout(&mut self) -> OpenResult<OutputHandle> {\n\n OpenResult::NotAvailable\n\n }\n\n\n\n fn input_open_name(\n\n &mut self,\n\n _name: &OsStr,\n\n _status: &mut dyn StatusBackend,\n\n ) -> OpenResult<InputHandle> {\n\n OpenResult::NotAvailable\n\n }\n\n\n\n /// Open the \"primary\" input file, which in the context of TeX is the main\n\n /// input that it's given. When the build is being done using the\n\n /// filesystem and the input is a file on the filesystem, this function\n","file_path":"src/io/mod.rs","rank":14,"score":125836.00530370105},{"content":"/// Compile LaTeX text to a PDF.\n\n///\n\n/// This function is an all-in-one interface to the main Tectonic workflow. Given\n\n/// a string representing a LaTeX input file, it will compile it to a PDF and return\n\n/// a byte vector corresponding to the resulting file:\n\n///\n\n/// ```\n\n/// let latex = r#\"\n\n/// \\documentclass{article}\n\n/// \\begin{document}\n\n/// Hello, world!\n\n/// \\end{document}\n\n/// \"#;\n\n///\n\n/// # tectonic::test_util::activate_test_mode_augmented(env!(\"CARGO_MANIFEST_DIR\"));\n\n/// let pdf_data: Vec<u8> = tectonic::latex_to_pdf(latex).expect(\"processing failed\");\n\n/// println!(\"Output PDF size is {} bytes\", pdf_data.len());\n\n/// ```\n\n///\n\n/// The compilation uses the default bundle, the location of which is embedded\n\n/// in the crate or potentially specified in the user’s configuration file.\n\n/// The current working directory will be searched for any `\\\\input` files.\n\n/// Messages aimed at the user are suppressed, but (in the default\n\n/// configuration) network I/O may occur to pull down needed resource files.\n\n/// No outputs are written to disk; all supporting files besides the PDF\n\n/// document are discarded. The XeTeX engine is run multiple times if needed\n\n/// to get the output file to converge.\n\n///\n\n/// For more sophisticated uses, use the [`driver`] module, which provides a\n\n/// high-level interface for driving the typesetting engines with much more\n\n/// control over their behavior.\n\n///\n\n/// Note that the current engine implementations use lots of global state, so\n\n/// they are not thread-safe. This crate uses a global mutex to serialize\n\n/// invocations of the engines. This means that if you call this function from\n\n/// multiple threads simultaneously, the bulk of the work will be done in\n\n/// serial. The aim is to lift this limitation one day, but it will require\n\n/// extensive work on the underlying C/C++ code.\n\npub fn latex_to_pdf<T: AsRef<str>>(latex: T) -> Result<Vec<u8>> {\n\n use std::ffi::OsStr;\n\n\n\n let mut status = status::NoopStatusBackend::new();\n\n\n\n let auto_create_config_file = false;\n\n let config = ctry!(config::PersistentConfig::open(auto_create_config_file);\n\n \"failed to open the default configuration file\");\n\n\n\n let only_cached = false;\n\n let bundle = ctry!(config.default_bundle(only_cached, &mut status);\n\n \"failed to load the default resource bundle\");\n\n\n\n let format_cache_path = ctry!(config.format_cache_path();\n\n \"failed to set up the format cache\");\n\n\n\n let mut files = {\n\n // Looking forward to non-lexical lifetimes!\n\n let mut sb = driver::ProcessingSessionBuilder::default();\n\n sb.bundle(bundle)\n","file_path":"src/lib.rs","rank":15,"score":118926.19429242914},{"content":"\tUInt32\tversion;\t\t\t\t/* version = kCurrentTableVersion */\n","file_path":"engine/tectonic/teckit-Format.h","rank":16,"score":90631.83220267965},{"content":"\t\tUInt8\ttype;\t\t\t\t/* see kRepElem_... below */\n","file_path":"engine/tectonic/teckit-Format.h","rank":17,"score":90336.33542817865},{"content":"fn skip_capital<'a>(p: &'a [u8]) -> (&'a [u8], usize) {\n\n if p.starts_with(b\"AE\") || p.starts_with(b\"OE\") {\n\n (&p[2..], 2)\n\n } else if p.starts_with(b\"Eth\") {\n\n (&p[3..], 3)\n\n } else if p.starts_with(b\"Thorn\") {\n\n (&p[5..], 5)\n\n } else if p.len() >= 1 {\n\n if p[0].is_ascii_uppercase() {\n\n (&p[1..], 1)\n\n } else {\n\n (p, 0)\n\n }\n\n } else {\n\n (p, 0)\n\n }\n\n}\n","file_path":"dpx/src/dpx_agl.rs","rank":18,"score":89139.80987969796},{"content":"#[derive(Clone, Debug, Eq, PartialEq)]\n\nstruct FileSummary {\n\n write_digest: Option<DigestData>,\n\n}\n\n\n\nimpl FileSummary {\n\n fn new() -> FileSummary {\n\n FileSummary { write_digest: None }\n\n }\n\n}\n\n\n","file_path":"tests/formats.rs","rank":19,"score":89050.6699213537},{"content":"#[derive(Clone, Debug, Eq, PartialEq)]\n\nstruct State {\n\n pub h: i32,\n\n pub v: i32,\n\n pub w: i32,\n\n pub x: i32,\n\n pub y: i32,\n\n pub z: i32,\n\n}\n\n\n\nimpl State {\n\n pub fn new() -> Self {\n\n State {\n\n h: 0,\n\n v: 0,\n\n w: 0,\n\n x: 0,\n\n y: 0,\n\n z: 0,\n\n }\n\n }\n\n}\n\n\n\n/// A simple cursor on a buffer.\n","file_path":"xdv/src/lib.rs","rank":20,"score":89050.6699213537},{"content":"struct TestCase {\n\n stem: String,\n\n}\n\n\n\nimpl TestCase {\n\n fn new(stem: &str) -> Self {\n\n TestCase {\n\n stem: stem.to_owned(),\n\n }\n\n }\n\n\n\n fn go(&mut self) {\n\n util::set_test_root();\n\n\n\n let mut p = test_path(&[\"bibtex\"]);\n\n\n\n p.push(&self.stem);\n\n\n\n p.set_extension(\"aux\");\n\n let auxname = p.file_name().unwrap().to_str().unwrap().to_owned();\n","file_path":"tests/bibtex.rs","rank":21,"score":89043.98910440826},{"content":"struct Stats {}\n\n\n\nimpl Stats {\n\n pub fn new() -> Self {\n\n Stats {}\n\n }\n\n}\n\n\n\nimpl tectonic_xdv::XdvEvents for Stats {\n\n type Error = Error;\n\n\n\n fn handle_header(&mut self, filetype: FileType, comment: &[u8]) -> Result<(), Self::Error> {\n\n println!(\"file type: {}\", filetype);\n\n\n\n match str::from_utf8(comment) {\n\n Ok(s) => {\n\n println!(\"comment: {}\", s);\n\n }\n\n Err(e) => {\n\n println!(\"cannot parse comment: {}\", e);\n","file_path":"xdv/examples/xdvdump.rs","rank":22,"score":89043.98910440826},{"content":"#[derive(Clone, Debug)]\n\nstruct TarIndex {\n\n tar: Vec<u8>,\n\n index: Vec<u8>,\n\n map: HashMap<(u64, u64), String>,\n\n}\n\n\n\nimpl TarIndex {\n\n fn from_dir<P: AsRef<Path>>(path: P) -> io::Result<TarIndex> {\n\n let path = path.as_ref();\n\n let mut builder = TarIndexBuilder::new();\n\n for de in path.read_dir()? {\n\n let path = de?.path();\n\n let content = fs::read(&path)?;\n\n builder.push(path.file_name().unwrap().to_str().unwrap(), &content);\n\n }\n\n\n\n builder.push(\n\n tectonic::digest::DIGEST_NAME,\n\n b\"0000000000000000000000000000000000000000000000000000000000000000\",\n\n );\n\n\n\n Ok(builder.finish())\n\n }\n\n}\n\n\n","file_path":"tests/cached_itarbundle.rs","rank":23,"score":87468.12953099453},{"content":"#[derive(Clone, Debug)]\n\nstruct VcPkgState {\n\n include_paths: Vec<PathBuf>,\n\n}\n\n\n\n/// State for discovering and managing our dependencies, which may vary\n\n/// depending on the framework that we're using to discover them.\n\n///\n\n/// The basic gameplan is that we probe our dependencies to check that they're\n\n/// available and pull out the C/C++ include directories; then we emit info\n\n/// for building our C/C++ libraries; then we emit info for our dependencies.\n\n/// Building stuff pretty much always requires some level of hackery, though,\n\n/// so we don't try to be purist about the details.\n","file_path":"engine/build.rs","rank":24,"score":87468.12953099453},{"content":"struct TestCase {\n\n stem: String,\n\n expected_result: Result<TexResult>,\n\n check_synctex: bool,\n\n check_pdf: bool,\n\n extra_io: Vec<Box<dyn IoProvider>>,\n\n}\n\n\n\nimpl TestCase {\n\n fn new(stem: &str) -> Self {\n\n TestCase {\n\n stem: stem.to_owned(),\n\n expected_result: Ok(TexResult::Spotless),\n\n check_synctex: false,\n\n check_pdf: false,\n\n extra_io: Vec::new(),\n\n }\n\n }\n\n\n\n fn check_synctex(&mut self, check_synctex: bool) -> &mut Self {\n","file_path":"tests/tex-outputs.rs","rank":25,"score":87461.3050429533},{"content":"struct Colordef {\n\n key: &'static str,\n\n color: PdfColor,\n\n}\n\n\n\nimpl Colordef {\n\n const fn new(key: &'static str, color: PdfColor) -> Self {\n\n Colordef { key, color }\n\n }\n\n}\n\n\n\nconst COLORDEFS: [Colordef; 68] = [\n\n Colordef::new(\"GreenYellow\", PdfColor::Cmyk(0.15, 0.0, 0.69, 0.0)),\n\n Colordef::new(\"Yellow\", PdfColor::Cmyk(0.0, 0.0, 1.0, 0.0)),\n\n Colordef::new(\"Goldenrod\", PdfColor::Cmyk(0.0, 0.1, 0.84, 0.0)),\n\n Colordef::new(\"Dandelion\", PdfColor::Cmyk(0.0, 0.29, 0.84, 0.0)),\n\n Colordef::new(\"Apricot\", PdfColor::Cmyk(0.0, 0.32, 0.52, 0.0)),\n\n Colordef::new(\"Peach\", PdfColor::Cmyk(0.0, 0.5, 0.7, 0.0)),\n\n Colordef::new(\"Melon\", PdfColor::Cmyk(0.0, 0.46, 0.5, 0.0)),\n\n Colordef::new(\"YellowOrange\", PdfColor::Cmyk(0.0, 0.42, 1.0, 0.0)),\n","file_path":"dpx/src/specials/util.rs","rank":26,"score":87461.3050429533},{"content":"#[derive(Debug)]\n\nstruct PkgConfigState {\n\n libs: pkg_config::Library,\n\n}\n\n\n\n// Need a way to check that the vcpkg harfbuzz port has graphite2 and icu options enabled.\n\n#[cfg(not(target_os = \"macos\"))]\n\nconst VCPKG_LIBS: &[&'static str] = &[\"fontconfig\", \"harfbuzz\", \"freetype\", \"graphite2\"];\n\n\n\n#[cfg(target_os = \"macos\")]\n\nconst VCPKG_LIBS: &[&'static str] = &[\"harfbuzz\", \"freetype\", \"graphite2\"];\n\n\n\n/// Build-script state when using vcpkg as the backend.\n","file_path":"engine/build.rs","rank":27,"score":87461.3050429533},{"content":"#[derive(Copy, Clone)]\n\n#[repr(C, packed(2))]\n\nstruct FixedPoint {\n\n x: Fixed,\n\n y: Fixed,\n\n}\n\n\n\npub type str_number = int32_t;\n\n/* tectonic/core-strutils.h: miscellaneous C string utilities\n\n Copyright 2016-2018 the Tectonic Project\n\n Licensed under the MIT License.\n\n*/\n\n/* Note that we explicitly do *not* change this on Windows. For maximum\n\n * portability, we should probably accept *either* forward or backward slashes\n\n * as directory separators. */\n\nuse crate::{streq_ptr, strstartswith};\n\n/* ***************************************************************************\\\n\n Part of the XeTeX typesetting system\n\n Copyright (c) 1994-2008 by SIL International\n\n Copyright (c) 2009 by Jonathan Kew\n\n Copyright (c) 2012, 2013 by Jiang Jiang\n\n Copyright (c) 2012-2015 by Khaled Hosny\n","file_path":"engine/src/xetex_aatfont.rs","rank":28,"score":85981.87260048195},{"content":"#[derive(Clone, Copy, Debug)]\n\nstruct FileInfo {\n\n offset: u64,\n\n length: u64,\n\n}\n\n\n","file_path":"src/io/cached_itarbundle.rs","rank":29,"score":85975.570205366},{"content":"#[derive(Clone, Debug)]\n\nstruct CacheContent {\n\n digest_text: String,\n\n redirect_url: String,\n\n index: HashMap<String, FileInfo>,\n\n}\n\n\n","file_path":"src/io/cached_itarbundle.rs","rank":30,"score":85968.85934645252},{"content":"#[repr(C)]\n\nstruct TectonicBridgeApi {\n\n context: *const libc::c_void,\n\n issue_warning: *const libc::c_void,\n\n issue_error: *const libc::c_void,\n\n get_file_md5: *const libc::c_void,\n\n get_data_md5: *const libc::c_void,\n\n output_open: *const libc::c_void,\n\n output_open_stdout: *const libc::c_void,\n\n output_putc: *const libc::c_void,\n\n output_write: *const libc::c_void,\n\n output_flush: *const libc::c_void,\n\n output_close: *const libc::c_void,\n\n input_open: *const libc::c_void,\n\n input_open_primary: *const libc::c_void,\n\n input_get_size: *const libc::c_void,\n\n input_seek: *const libc::c_void,\n\n input_read: *const libc::c_void,\n\n input_getc: *const libc::c_void,\n\n input_ungetc: *const libc::c_void,\n\n input_close: *const libc::c_void,\n","file_path":"src/engines/mod.rs","rank":31,"score":85968.71472211597},{"content":"struct TarIndexService {\n\n tar_index: Mutex<TarIndex>,\n\n requests: Mutex<Vec<TectonicRequest>>,\n\n local_addr: Mutex<Option<SocketAddr>>,\n\n}\n\n\n","file_path":"tests/cached_itarbundle.rs","rank":32,"score":85962.0348584113},{"content":"struct MemoryIoItem {\n\n // TODO: smarter buffering structure than Vec<u8>? E.g., linked list of 4k\n\n // chunks or something. In the current scheme reallocations will get\n\n // expensive.\n\n files: Rc<RefCell<HashMap<OsString, Vec<u8>>>>,\n\n name: OsString,\n\n state: Cursor<Vec<u8>>,\n\n}\n\n\n\nimpl MemoryIoItem {\n\n pub fn new(\n\n files: &Rc<RefCell<HashMap<OsString, Vec<u8>>>>,\n\n name: &OsStr,\n\n truncate: bool,\n\n ) -> MemoryIoItem {\n\n let cur = match files.borrow_mut().remove(name) {\n\n Some(data) => {\n\n if truncate {\n\n Vec::new()\n\n } else {\n","file_path":"src/io/memory.rs","rank":33,"score":85962.0348584113},{"content":"/// Build a fake tarindex by concatenating files.\n\nstruct TarIndexBuilder {\n\n tar: Vec<u8>,\n\n index: GzEncoder<Vec<u8>>,\n\n /// Map from (offset, length) to file name.\n\n map: HashMap<(u64, u64), String>,\n\n}\n\n\n\nimpl TarIndexBuilder {\n\n fn new() -> TarIndexBuilder {\n\n let tar = Vec::new();\n\n let index = GzBuilder::new()\n\n .filename(\"bundle.tar.index.gz\")\n\n .write(Vec::new(), flate2::Compression::default());\n\n let map = HashMap::new();\n\n\n\n TarIndexBuilder { tar, index, map }\n\n }\n\n\n\n /// Add a file.\n\n fn push(&mut self, name: &str, content: &[u8]) -> &mut Self {\n","file_path":"tests/cached_itarbundle.rs","rank":34,"score":85962.0348584113},{"content":"pub trait DefinitelySame {\n\n fn definitely_same(&self, other: &Self) -> bool;\n\n}\n\n\n\n// Rust currently thinks that this impl conflicts with the one that we\n\n// provide for Result ... I am pretty sure that's not the case since the\n\n// Result PartialEq impl requires that T and E be PartialEq too, whereas\n\n// our definition works for subtypes that are DefinitelySame but\n\n// not PartialEq too.\n\n//\n\n//impl<T: PartialEq> DefinitelySame for T {\n\n// fn definitely_same(&self, other: &T) -> bool {\n\n// self == other\n\n// }\n\n//}\n\n\n\nimpl DefinitelySame for ErrorKind {\n\n fn definitely_same(&self, other: &Self) -> bool {\n\n if let ErrorKind::Msg(ref s) = *self {\n\n return if let ErrorKind::Msg(ref o) = *other {\n","file_path":"src/errors.rs","rank":35,"score":84754.48322091051},{"content":"#[derive(Clone, Copy, Debug)]\n\nstruct LocalCacheItem {\n\n _length: u64,\n\n digest: DigestData,\n\n}\n\n\n","file_path":"src/io/cached_itarbundle.rs","rank":36,"score":84553.28883610276},{"content":"#[derive(Clone, Debug, Eq, PartialEq)]\n\nstruct Error(String);\n\n\n\nimpl Display for Error {\n\n fn fmt(&self, f: &mut Formatter) -> Result<(), FmtError> {\n\n write!(f, \"{}\", self.0)\n\n }\n\n}\n\n\n\nimpl From<io::Error> for Error {\n\n fn from(e: io::Error) -> Self {\n\n Error(format!(\"{}\", e)) // note: weirdly, can't use `Self` on this line\n\n }\n\n}\n\n\n\nimpl From<XdvError> for Error {\n\n fn from(e: XdvError) -> Self {\n\n Error(format!(\"{}\", e))\n\n }\n\n}\n\n\n","file_path":"xdv/examples/xdvdump.rs","rank":37,"score":83327.82565381327},{"content":"type scaled_t = int32_t;\n","file_path":"engine/src/xetex_aatfont.rs","rank":38,"score":81909.22529051497},{"content":"/// Types implementing this trait accept events from the XDV parser.\n\npub trait XdvEvents {\n\n /// An error type returned by the handler functions defined in this trait. It\n\n /// must implement `From<XdvError>`.\n\n type Error: Debug + From<XdvError>;\n\n\n\n /// Handle the XDV header\n\n #[allow(unused)] // <= prevents underscore-prefixed names from showing up in docs\n\n fn handle_header(&mut self, filetype: FileType, comment: &[u8]) -> Result<(), Self::Error> {\n\n Ok(())\n\n }\n\n\n\n /// Begin a new page.\n\n #[allow(unused)]\n\n fn handle_begin_page(\n\n &mut self,\n\n counters: &[i32],\n\n previous_bop: i32,\n\n ) -> Result<(), Self::Error> {\n\n Ok(())\n\n }\n","file_path":"xdv/src/lib.rs","rank":39,"score":81679.4689374995},{"content":"pub trait StatusBackend {\n\n /// Report a message to the status backend.\n\n fn report(&mut self, kind: MessageKind, args: Arguments, err: Option<&Error>);\n\n\n\n /// Issue a note-level status, idealy highlighting a particular phrase.\n\n ///\n\n /// This is a bit of a hack. For [`driver::ProcessingSession::run`], I\n\n /// like the UX when we issue notes in this style. It's a bit more\n\n /// high-level than intended for this trait, but we can provide a nice\n\n /// sensible default implementation, so whatever.\n\n fn note_highlighted(&mut self, before: &str, highlighted: &str, after: &str) {\n\n self.report(\n\n MessageKind::Note,\n\n format_args!(\"{}{}{}\", before, highlighted, after),\n\n None,\n\n )\n\n }\n\n}\n\n\n\n/// Report a formatted informational message to the user.\n","file_path":"src/status/mod.rs","rank":40,"score":81672.89724579843},{"content":"pub trait Pack {\n\n fn pack(&mut self, dest: &mut [u8]) -> usize;\n\n}\n\n\n\n/// Rewrittened cff_index\n\n#[derive(Clone)]\n\npub struct CffIndex {\n\n pub count: u16, // ??\n\n pub offsize: c_offsize,\n\n pub offset: Vec<l_offset>,\n\n pub data: Vec<u8>,\n\n}\n\nimpl CffIndex {\n\n // cff_index_new\n\n pub fn new(count: u16) -> Box<Self> {\n\n let offset = if count > 0 {\n\n let mut offset = vec![0; count as usize + 1];\n\n offset[0] = 1;\n\n offset\n\n } else {\n","file_path":"dpx/src/dpx_cff.rs","rank":41,"score":81672.89724579843},{"content":"pub trait FromBEByteSlice {\n\n fn from_be_byte_slice(b: &[u8]) -> Self;\n\n}\n\nimpl FromBEByteSlice for u32 {\n\n fn from_be_byte_slice(b: &[u8]) -> Self {\n\n let mut dst: [u8; 4] = unsafe { MaybeUninit::uninit().assume_init() };\n\n dst.copy_from_slice(b);\n\n u32::from_be_bytes(dst)\n\n }\n\n}\n\nimpl FromBEByteSlice for u16 {\n\n fn from_be_byte_slice(b: &[u8]) -> Self {\n\n let mut dst: [u8; 2] = unsafe { MaybeUninit::uninit().assume_init() };\n\n dst.copy_from_slice(b);\n\n u16::from_be_bytes(dst)\n\n }\n\n}\n\n\n\npub mod dpx_agl;\n\npub mod dpx_bmpimage;\n","file_path":"dpx/src/lib.rs","rank":42,"score":81672.89724579843},{"content":"type Fract = SInt32;\n","file_path":"engine/src/xetex_aatfont.rs","rank":43,"score":80486.84197972206},{"content":"type Fixed = SInt32;\n","file_path":"engine/src/xetex_aatfont.rs","rank":44,"score":80486.84197972206},{"content":"/// Set the magic environment variable that enables the testing infrastructure\n\n/// embedded in the main Tectonic crate. This function is separated out from\n\n/// the main crate because it embeds `CARGO_MANIFEST_DIR`, which is not\n\n/// something we want to leak into the binary artifacts we produce.\n\npub fn set_test_root() {\n\n ::tectonic::test_util::set_test_root_augmented(env!(\"CARGO_MANIFEST_DIR\"));\n\n}\n\n\n","file_path":"tests/util/mod.rs","rank":45,"score":80250.78582870727},{"content":"pub trait FromLEByteSlice {\n\n fn from_le_byte_slice(b: &[u8]) -> Self;\n\n}\n\nimpl FromLEByteSlice for u32 {\n\n fn from_le_byte_slice(b: &[u8]) -> Self {\n\n let mut dst: [u8; 4] = unsafe { MaybeUninit::uninit().assume_init() };\n\n dst.copy_from_slice(b);\n\n u32::from_le_bytes(dst)\n\n }\n\n}\n\nimpl FromLEByteSlice for u16 {\n\n fn from_le_byte_slice(b: &[u8]) -> Self {\n\n let mut dst: [u8; 2] = unsafe { MaybeUninit::uninit().assume_init() };\n\n dst.copy_from_slice(b);\n\n u16::from_le_bytes(dst)\n\n }\n\n}\n","file_path":"dpx/src/lib.rs","rank":46,"score":80250.78582870727},{"content":"pub trait IoEventBackend {\n\n /// This function is called when a file is opened for output.\n\n fn output_opened(&mut self, _name: &OsStr) {}\n\n\n\n /// This function is called when the wrapped \"standard output\"\n\n /// (\"console\", \"terminal\") stream is opened.\n\n fn stdout_opened(&mut self) {}\n\n\n\n /// This function is called when an output file is closed. The \"digest\"\n\n /// argument specifies the cryptographic digest of the data that were\n\n /// written. Note that this function takes ownership of the name and\n\n /// digest.\n\n fn output_closed(&mut self, _name: OsString, _digest: DigestData) {}\n\n\n\n /// This function is called when a file is opened for input.\n\n fn input_opened(&mut self, _name: &OsStr, _origin: InputOrigin) {}\n\n\n\n /// This function is called when the \"primary input\" stream is opened.\n\n fn primary_input_opened(&mut self, _origin: InputOrigin) {}\n\n\n","file_path":"src/engines/mod.rs","rank":47,"score":80250.78582870727},{"content":"struct State<'a, 'b: 'a> {\n\n outname: String,\n\n io: &'a mut IoStack<'b>,\n\n events: &'a mut dyn IoEventBackend,\n\n status: &'a mut dyn StatusBackend,\n\n cur_output: Option<OutputHandle>,\n\n warned_lost_chars: bool,\n\n buf: Vec<u8>,\n\n}\n\n\n\nimpl<'a, 'b: 'a> State<'a, 'b> {\n\n pub fn new(\n\n outname: String,\n\n io: &'a mut IoStack<'b>,\n\n events: &'a mut dyn IoEventBackend,\n\n status: &'a mut dyn StatusBackend,\n\n ) -> Self {\n\n Self {\n\n outname,\n\n io,\n\n events,\n\n status,\n\n cur_output: None,\n\n warned_lost_chars: false,\n\n buf: Vec::new(),\n\n }\n\n }\n\n}\n\n\n","file_path":"src/engines/spx2html.rs","rank":48,"score":79270.91186823834},{"content":"/// Activate this crate's \"test mode\", if-and-only-if the magic testing\n\n/// environment variable has been set. This allows testing of the Tectonic\n\n/// executable in a transparent way — notably, we avoid embedding the build\n\n/// prefix in the resulting binary, and we don't need to pass it any magical\n\n/// command line arguments.\n\npub fn maybe_activate_test_mode() {\n\n if env::var_os(TEST_ROOT_ENV_VAR).is_none() {\n\n return;\n\n }\n\n\n\n crate::config::activate_config_test_mode(true);\n\n}\n\n\n","file_path":"src/test_util.rs","rank":49,"score":78905.63864394772},{"content":"pub fn create() -> DigestComputer {\n\n Default::default()\n\n}\n\n\n\n#[derive(Copy, Clone, Debug, Eq, PartialEq)]\n\npub struct DigestData([u8; N_BYTES]);\n\n\n\nimpl DigestData {\n\n pub fn zeros() -> DigestData {\n\n DigestData([0u8; N_BYTES])\n\n }\n\n\n\n pub fn of_nothing() -> DigestData {\n\n let dc = create();\n\n Self::from(dc)\n\n }\n\n\n\n /// Given a base path, create a child path from this digest's value. The\n\n /// child path has a subdirectory from the hex value of the first byte of\n\n /// the digest, then a name consisting of the rest of the hex data. **The\n","file_path":"src/digest.rs","rank":50,"score":78537.45326715318},{"content":"pub fn _dpx_ensure_output_handle() {\n\n if let Some(handle) = unsafe { ttstub_output_open_stdout() } {\n\n unsafe {\n\n _dpx_message_handle = Some(handle);\n\n }\n\n } else {\n\n panic!(\"xdvipdfmx cannot get output logging handle?!\");\n\n }\n\n}\n\nunsafe extern \"C\" fn _dpx_print_to_stdout(\n\n mut fmt: *const i8,\n\n mut argp: ::std::ffi::VaList,\n\n mut warn: bool,\n\n) {\n\n let mut n: i32 = 0;\n\n n = vsnprintf(\n\n _dpx_message_buf.as_mut_ptr() as *mut i8,\n\n ::std::mem::size_of::<[i8; 1024]>() as u64,\n\n fmt,\n\n argp.as_va_list(),\n","file_path":"dpx/src/dpx_error.rs","rank":51,"score":77614.94246745805},{"content":"type int32_t = libc::c_int;\n","file_path":"engine/src/xetex_aatfont.rs","rank":52,"score":77324.47034007822},{"content":"type uint16_t = libc::c_ushort;\n\npub type Boolean = libc::c_uchar;\n","file_path":"engine/src/xetex_aatfont.rs","rank":53,"score":77324.47034007822},{"content":"/// A special IoProvider that can make TeX format files.\n\n///\n\n/// A “bundle” is expected to contain a large number of TeX support files —\n\n/// for instance, a compilation of a TeXLive distribution. In terms of the\n\n/// software architecture, though, what is special about a bundle is that one\n\n/// can generate one or more TeX format files from its contents without\n\n/// reference to any other I/O resources.\n\npub trait Bundle: IoProvider {\n\n /// Get a cryptographic digest summarizing this bundle’s contents.\n\n ///\n\n /// The digest summarizes the exact contents of every file in the bundle.\n\n /// It is computed from the sorted names and SHA256 digests of the\n\n /// component files [as implemented in the script\n\n /// builder/make-zipfile.py](https://github.com/tectonic-typesetting/tectonic-staging/blob/master/builder/make-zipfile.py#L138)\n\n /// in the `tectonic-staging` module.\n\n ///\n\n /// The default implementation gets the digest from a file name\n\n /// `SHA256SUM`, which is expected to contain the digest in hex-encoded\n\n /// format.\n\n fn get_digest(&mut self, status: &mut dyn StatusBackend) -> Result<DigestData> {\n\n let digest_text = match self.input_open_name(OsStr::new(digest::DIGEST_NAME), status) {\n\n OpenResult::Ok(h) => {\n\n let mut text = String::new();\n\n h.take(64).read_to_string(&mut text)?;\n\n text\n\n }\n\n\n","file_path":"src/io/mod.rs","rank":54,"score":77136.61860455177},{"content":"pub trait InputFeatures: Read {\n\n fn get_size(&mut self) -> Result<usize>;\n\n fn try_seek(&mut self, pos: SeekFrom) -> Result<u64>;\n\n}\n\n\n\n/// What kind of source an input file ultimately came from. We keep track of\n\n/// this in order to be able to emit Makefile-style dependencies for input\n\n/// files. Right now, we only provide enough options to achieve this goal; we\n\n/// could add more.\n\n#[derive(Clone, Copy, Debug, Eq, PartialEq)]\n\npub enum InputOrigin {\n\n /// This file lives on the filesystem and might change under us. (That is\n\n /// it is not a cached bundle file.)\n\n Filesystem,\n\n\n\n /// This file was never used as an input.\n\n NotInput,\n\n\n\n /// This file is none of the above.\n\n Other,\n","file_path":"src/io/mod.rs","rank":55,"score":77115.34185006203},{"content":"type UInt32 = libc::c_uint;\n","file_path":"engine/src/xetex_aatfont.rs","rank":56,"score":75973.29923336842},{"content":"type SInt32 = libc::c_int;\n\n\n","file_path":"engine/src/xetex_aatfont.rs","rank":57,"score":75973.29923336842},{"content":"// Duplicated from Cargo's own testing code:\n\n// https://github.com/rust-lang/cargo/blob/19fdb308/tests/cargotest/support/mod.rs#L305-L318\n\npub fn cargo_dir() -> PathBuf {\n\n env::var_os(\"CARGO_BIN_PATH\")\n\n .map(PathBuf::from)\n\n .or_else(|| {\n\n env::current_exe().ok().map(|mut path| {\n\n path.pop();\n\n if path.ends_with(\"deps\") {\n\n path.pop();\n\n }\n\n path\n\n })\n\n })\n\n .unwrap_or_else(|| panic!(\"CARGO_BIN_PATH wasn't set. Cannot continue running test\"))\n\n}\n\n\n","file_path":"tests/util/mod.rs","rank":58,"score":75764.42902458424},{"content":"#[derive(Debug)]\n\nstruct Cursor<'a, T: XdvEvents> {\n\n /// The *remaining* unprocessed bytes.\n\n buf: &'a [u8],\n\n\n\n /// How many bytes from the *original* chunk buffer have been fully processed.\n\n pub checkpoint: usize,\n\n\n\n /// How many bytes from the *original* chunk buffer we have looked at.\n\n offset: usize,\n\n\n\n /// The offset into the *total stream* that the original chunk buffer was\n\n /// at.\n\n global_offset: u64,\n\n\n\n /// Helps us avoid tedious type annotations.\n\n _events: PhantomData<T>,\n\n}\n\n\n\nimpl<'a, T: XdvEvents> Cursor<'a, T> {\n\n pub fn new(buf: &'a [u8], global_offset: u64) -> Self {\n","file_path":"xdv/src/lib.rs","rank":59,"score":74766.67625297813},{"content":"pub trait Warn<E>: Sized {}\n\n\n","file_path":"dpx/src/lib.rs","rank":60,"score":74648.21218617905},{"content":"fn is_smallcap(glyphname: &[u8]) -> bool {\n\n if glyphname.is_empty() {\n\n return false;\n\n }\n\n let len = glyphname.len();\n\n if len < 6 || glyphname.ends_with(b\"small\") {\n\n return false;\n\n }\n\n let len = len - 5;\n\n let p = &glyphname[..len];\n\n let (p, slen) = skip_modifier(p);\n\n if slen == len {\n\n return true;\n\n } else {\n\n if slen > 0 {\n\n /* ??? */\n\n return false;\n\n }\n\n }\n\n let (mut p, slen) = skip_capital(p);\n","file_path":"dpx/src/dpx_agl.rs","rank":61,"score":73541.95579379864},{"content":"struct ExecutionState<'a, I: 'a + IoProvider> {\n\n io: &'a mut I,\n\n events: &'a mut dyn IoEventBackend,\n\n status: &'a mut dyn StatusBackend,\n\n #[allow(clippy::vec_box)]\n\n input_handles: Vec<Box<InputHandle>>,\n\n #[allow(clippy::vec_box)]\n\n output_handles: Vec<Box<OutputHandle>>,\n\n}\n\n\n\nimpl<'a, I: 'a + IoProvider> ExecutionState<'a, I> {\n\n pub fn new(\n\n io: &'a mut I,\n\n events: &'a mut dyn IoEventBackend,\n\n status: &'a mut dyn StatusBackend,\n\n ) -> ExecutionState<'a, I> {\n\n ExecutionState {\n\n io,\n\n events,\n\n status,\n","file_path":"src/engines/mod.rs","rank":62,"score":72763.97678490198},{"content":"#[doc(hidden)]\n\npub fn activate_config_test_mode(forced: bool) {\n\n CONFIG_TEST_MODE_ACTIVATED.store(forced, Ordering::SeqCst);\n\n}\n\n\n\n#[cfg_attr(feature = \"serde\", derive(Deserialize, Serialize))]\n\npub struct PersistentConfig {\n\n default_bundles: Vec<BundleInfo>,\n\n}\n\n\n\n#[cfg_attr(feature = \"serde\", derive(Deserialize, Serialize))]\n\npub struct BundleInfo {\n\n url: String,\n\n}\n\n\n\nimpl PersistentConfig {\n\n #[cfg(feature = \"serialization\")]\n\n /// Open the per-user configuration file.\n\n ///\n\n /// This file is stored in TOML format. If the configuration file does not\n\n /// exist, no error is signaled — instead, a basic default configuration\n","file_path":"src/config.rs","rank":63,"score":72012.36882492981},{"content":"pub fn user_config() -> Result<PathBuf> {\n\n Ok(app_dirs2::app_root(AppDataType::UserConfig, &APP_INFO)?)\n\n}\n\n\n","file_path":"src/app_dirs.rs","rank":64,"score":72012.36882492981},{"content":"pub fn pdf_dev_get_fixed_point() -> pdf_coord {\n\n let mut gss = unsafe { &mut gs_stack };\n\n let gs = gss.top();\n\n gs.pt_fixee.clone()\n\n}\n","file_path":"dpx/src/dpx_pdfdraw.rs","rank":65,"score":70975.55919812758},{"content":"/// Generate a plain.fmt file using local files only -- a variety of tests\n\n/// need such a file to exist.\n\n///\n\n/// Note that because tests are run in parallel, this can get quite racy. At\n\n/// the moment we just let everybody write and overwrite the file, but we\n\n/// could use a locking scheme to get smarter about this.\n\npub fn ensure_plain_format() -> Result<PathBuf> {\n\n use ::tectonic::engines::NoopIoEventBackend;\n\n use ::tectonic::io::{\n\n try_open_file, FilesystemIo, FilesystemPrimaryInputIo, IoStack, MemoryIo,\n\n };\n\n use ::tectonic::status::NoopStatusBackend;\n\n use ::tectonic::TexEngine;\n\n\n\n let fmt_path = test_path(&[\"plain.fmt\"]);\n\n\n\n if try_open_file(&fmt_path).is_not_available() {\n\n let mut mem = MemoryIo::new(true);\n\n\n\n let mut assets_dir = test_path(&[\"assets\"]);\n\n let mut fs_support = FilesystemIo::new(&assets_dir, false, false, HashSet::new());\n\n\n\n assets_dir.push(\"plain\");\n\n assets_dir.set_extension(\"tex\");\n\n let mut fs_primary = FilesystemPrimaryInputIo::new(&assets_dir);\n\n\n","file_path":"tests/util/mod.rs","rank":66,"score":70806.91468715439},{"content":"pub fn get_user_config() -> Result<PathBuf> {\n\n Ok(app_dirs2::get_app_root(AppDataType::UserConfig, &APP_INFO)?)\n\n}\n\n\n","file_path":"src/app_dirs.rs","rank":67,"score":70788.7016865338},{"content":"/// Similarly, a stunted verion of CliIoEvents.\n\nstruct FormatTestEvents(HashMap<OsString, FileSummary>);\n\n\n\nimpl FormatTestEvents {\n\n fn new() -> FormatTestEvents {\n\n FormatTestEvents(HashMap::new())\n\n }\n\n}\n\n\n\nimpl IoEventBackend for FormatTestEvents {\n\n fn output_opened(&mut self, name: &OsStr) {\n\n self.0.insert(name.to_os_string(), FileSummary::new());\n\n }\n\n\n\n fn output_closed(&mut self, name: OsString, digest: DigestData) {\n\n let summ = self\n\n .0\n\n .get_mut(&name)\n\n .expect(\"closing file that wasn't opened?\");\n\n summ.write_digest = Some(digest);\n\n }\n\n}\n\n\n","file_path":"tests/formats.rs","rank":68,"score":69739.88195587599},{"content":"/// Obtain a path to a testing resource file. The environment variable whose\n\n/// name is stored in the constant `TEST_ROOT_ENV_VAR` must be set to an\n\n/// appropriate directory. (Note: `TEST_ROOT_ENV_VAR` is a constant giving the\n\n/// *name* of the relevant variable — not the name of the variable itself!)\n\npub fn test_path(parts: &[&str]) -> PathBuf {\n\n let mut path = PathBuf::from(env::var_os(TEST_ROOT_ENV_VAR).expect(\n\n \"Tectonic testing infrastructure cannot be used without \\\n\n setting the magic test-root environment variable\",\n\n ));\n\n path.push(parts.iter().collect::<PathBuf>());\n\n path\n\n}\n\n\n\n/// Utility for being able to treat the \"assets/\" directory as a bundle.\n\npub struct TestBundle(FilesystemIo);\n\n\n\nimpl Default for TestBundle {\n\n fn default() -> Self {\n\n TestBundle(FilesystemIo::new(\n\n &test_path(&[\"assets\"]),\n\n false,\n\n false,\n\n HashSet::new(),\n\n ))\n","file_path":"src/test_util.rs","rank":69,"score":68804.24439718413},{"content":"/// Normalize a TeX path in a system independent™ way by stripping any `.`, `..`,\n\n/// or extra separators '/' so that it is of the form\n\n///\n\n/// ```text\n\n/// path/to/my/file.txt\n\n/// ../../path/to/parent/dir/file.txt\n\n/// /absolute/path/to/file.txt\n\n/// ```\n\n///\n\n/// Does not strip whitespace.\n\n///\n\n/// Returns `None` if the path refers to a parent of the root.\n\nfn try_normalize_tex_path(path: &str) -> Option<String> {\n\n use std::iter::repeat;\n\n if path.is_empty() {\n\n return Some(\"\".into());\n\n }\n\n let mut r = Vec::new();\n\n let mut parent_level = 0;\n\n let mut has_root = false;\n\n\n\n // TODO: We need to handle a prefix on Windows (i.e. \"C:\").\n\n\n\n for (i, c) in path.split('/').enumerate() {\n\n match c {\n\n \"\" if i == 0 => {\n\n has_root = true;\n\n r.push(\"\");\n\n }\n\n \"\" | \".\" => {}\n\n \"..\" => {\n\n match r.pop() {\n","file_path":"src/io/mod.rs","rank":70,"score":67892.38509119571},{"content":"fn format_to_extension(format: FileFormat) -> Vec<&'static str> {\n\n match format {\n\n FileFormat::AFM => vec![\"afm\"],\n\n FileFormat::Bib => vec![\"bib\"],\n\n FileFormat::Bst => vec![\"bst\"],\n\n FileFormat::Cmap => vec![\"cmap\"], /* XXX: kpathsea doesn't define any suffixes for this */\n\n FileFormat::Enc => vec![\"enc\"],\n\n FileFormat::Format => vec![\"fmt\"],\n\n FileFormat::FontMap => vec![\"map\"],\n\n FileFormat::MiscFonts => vec![\"miscfonts\"], /* XXX: no kpathsea suffixes */\n\n FileFormat::Ofm => vec![\"ofm\"],\n\n FileFormat::OpenType => vec![\"otf\", \"OTF\"],\n\n FileFormat::Ovf => vec![\"ovf\", \"vf\"],\n\n FileFormat::Pict => vec![\"pdf\", \"jpg\", \"eps\", \"epsi\"], /* XXX: also .eps, .epsi, ... */\n\n FileFormat::Pk => vec![\"pk\"],\n\n FileFormat::ProgramData => vec![\"programdata\"], /* XXX no suffixes */\n\n FileFormat::Sfd => vec![\"sfd\"],\n\n FileFormat::Tex => vec![\"tex\", \"sty\", \"cls\", \"fd\", \"aux\", \"bbl\", \"def\", \"clo\", \"ldf\"],\n\n FileFormat::TexPsHeader => vec![\"pro\"],\n\n FileFormat::TFM => vec![\"tfm\"],\n\n FileFormat::TrueType => vec![\"ttf\", \"ttc\", \"TTF\", \"TTC\", \"dfont\"],\n\n FileFormat::Type1 => vec![\"pfa\", \"pfb\"],\n\n FileFormat::Vf => vec![\"vf\"],\n\n }\n\n}\n\n\n","file_path":"src/engines/mod.rs","rank":71,"score":66295.44638203162},{"content":"fn c_format_to_rust(format: libc::c_int) -> Option<FileFormat> {\n\n match format {\n\n 1 => Some(FileFormat::Pk),\n\n 3 => Some(FileFormat::TFM),\n\n 4 => Some(FileFormat::AFM),\n\n 6 => Some(FileFormat::Bib),\n\n 7 => Some(FileFormat::Bst),\n\n 10 => Some(FileFormat::Format),\n\n 11 => Some(FileFormat::FontMap),\n\n 20 => Some(FileFormat::Ofm),\n\n 23 => Some(FileFormat::Ovf),\n\n 25 => Some(FileFormat::Pict),\n\n 26 => Some(FileFormat::Tex),\n\n 30 => Some(FileFormat::TexPsHeader),\n\n 32 => Some(FileFormat::Type1),\n\n 33 => Some(FileFormat::Vf),\n\n 36 => Some(FileFormat::TrueType),\n\n 39 => Some(FileFormat::ProgramData),\n\n 40 => Some(FileFormat::ProgramData), // NOTE: kpathsea distinguishes text/binary; we don't\n\n 41 => Some(FileFormat::MiscFonts),\n\n 44 => Some(FileFormat::Enc),\n\n 45 => Some(FileFormat::Cmap),\n\n 46 => Some(FileFormat::Sfd),\n\n 47 => Some(FileFormat::OpenType),\n\n _ => None,\n\n }\n\n}\n","file_path":"src/engines/mod.rs","rank":72,"score":66228.6934092929},{"content":"class XeTeXFontInst_Mac : public XeTeXFontInst\n\n{\n\nprotected:\n\n\n\npublic:\n\n XeTeXFontInst_Mac(CTFontDescriptorRef descriptor, float pointSize, int &status);\n\n\n\n virtual ~XeTeXFontInst_Mac();\n\n\n\n virtual void initialize(int &status);\n\n};\n\n*/\n\n#[no_mangle]\n\npub unsafe extern \"C\" fn XeTeXFontInst_Mac_create(\n\n mut descriptor: CTFontDescriptorRef,\n\n mut pointSize: libc::c_float,\n\n mut status: *mut libc::c_int,\n\n) -> *mut XeTeXFontInst_Mac {\n\n let mut value: *mut XeTeXFontInst_Mac =\n\n malloc(::std::mem::size_of::<XeTeXFontInst_Mac>() as libc::c_ulong)\n\n as *mut XeTeXFontInst_Mac;\n\n XeTeXFontInst_Mac_ctor(value, descriptor, pointSize, status);\n\n return value;\n\n}\n","file_path":"engine/src/xetex_font_info_coretext.rs","rank":73,"score":65638.25920252486},{"content":"pub fn user_cache_dir(path: &str) -> Result<PathBuf> {\n\n Ok(app_dirs2::app_dir(AppDataType::UserCache, &APP_INFO, path)?)\n\n}\n","file_path":"src/app_dirs.rs","rank":74,"score":64874.58254361791},{"content":"pub fn get_date_and_time() -> (i32, i32, i32, i32) {\n\n use chrono::prelude::*;\n\n\n\n let tm = Local::now();\n\n\n\n let year = tm.year();\n\n let month = tm.month();\n\n let day = tm.day();\n\n let minutes = tm.hour() * 60 + tm.minute();\n\n\n\n (minutes as _, day as _, month as _, year)\n\n}\n\nunsafe extern \"C\" fn checkpool_pointer(mut pool_ptr_0: pool_pointer, mut len: size_t) {\n\n assert!(\n\n !((pool_ptr_0 as u64).wrapping_add(len) >= pool_size as u64),\n\n \"string pool overflow [{} bytes]\",\n\n pool_size,\n\n );\n\n}\n\n#[no_mangle]\n","file_path":"engine/src/xetex_texmfmp.rs","rank":75,"score":64874.58254361791},{"content":"type InternalResult<T, E> = Result<T, InternalError<E>>;\n\n\n\nimpl<T: Debug + From<XdvError>> From<T> for InternalError<T> {\n\n fn from(e: T) -> Self {\n\n InternalError::Other(e)\n\n }\n\n}\n\n\n","file_path":"xdv/src/lib.rs","rank":76,"score":63641.570567701434},{"content":"fn parse_index_line(line: &str) -> Result<Option<(String, FileInfo)>> {\n\n let mut bits = line.split_whitespace();\n\n\n\n if let (Some(name), Some(offset), Some(length)) = (bits.next(), bits.next(), bits.next()) {\n\n Ok(Some((\n\n name.to_owned(),\n\n FileInfo {\n\n offset: offset.parse::<u64>()?,\n\n length: length.parse::<u64>()?,\n\n },\n\n )))\n\n } else {\n\n // TODO: preserve the warning info or something!\n\n Ok(None)\n\n }\n\n}\n\n\n","file_path":"src/io/cached_itarbundle.rs","rank":77,"score":61637.398339361396},{"content":"/// A combination of the two above functions. Set the \"test root\" variable,\n\n/// making it such that the testing infrastructure in this module can work;\n\n/// and then activate \"test mode\", such that certain other parts of the crate\n\n/// alter their behavior for use in the test environment. This makes for\n\n/// convenient doctests — you can secretly run them in the special test setup\n\n/// with a one-liner:\n\n///\n\n/// # tectonic::test_util::activate_test_mode_augmented(env!(\"CARGO_MANIFEST_DIR\"));\n\npub fn activate_test_mode_augmented<V: AsRef<OsStr>>(root: V) {\n\n set_test_root_augmented(root);\n\n maybe_activate_test_mode();\n\n}\n\n\n","file_path":"src/test_util.rs","rank":78,"score":61421.23130097095},{"content":"/// Set `TEST_ROOT_ENV_VAR` in the current process to the specified value,\n\n/// with a path element \"tests\" appended. If the variable was previously\n\n/// unset, this will make it such that `test_path()` and the other pieces of\n\n/// testing infrastructure in this module will start working.\n\n///\n\n/// The peculiar form of this function makes for easy one-liners in the test\n\n/// code exploiting the environment variable $CARGO_MANIFEST_DIR.\n\npub fn set_test_root_augmented<V: AsRef<OsStr>>(root: V) {\n\n let mut root = PathBuf::from(root.as_ref());\n\n root.push(\"tests\");\n\n env::set_var(TEST_ROOT_ENV_VAR, root);\n\n}\n\n\n","file_path":"src/test_util.rs","rank":79,"score":61416.07365595036},{"content":"/// A convenience method to provide a better error message when writing to a created file.\n\nfn file_create_write<P, F, E>(path: P, write_fn: F) -> Result<()>\n\nwhere\n\n P: AsRef<Path>,\n\n F: FnOnce(&mut File) -> std::result::Result<(), E>,\n\n std::result::Result<(), E>: crate::errors::ResultExt<()>,\n\n{\n\n let path = path.as_ref();\n\n let mut f = ctry!(File::create(path); \"couldn't open {} for writing\",\n\n path.display());\n\n ctry!(write_fn(&mut f); \"couldn't write to {}\", path.display());\n\n Ok(())\n\n}\n\n\n","file_path":"src/io/cached_itarbundle.rs","rank":80,"score":59228.684173818234},{"content":"/* This is dvipdfmx, an eXtended version of dvipdfm by Mark A. Wicks.\n\n\n\n Copyright (C) 2002-2016 by Jin-Hwan Cho and Shunsaku Hirata,\n\n the dvipdfmx project team.\n\n\n\n Copyright (C) 1998, 1999 by Mark A. Wicks <mwicks@kettering.edu>\n\n\n\n This program is free software; you can redistribute it and/or modify\n\n it under the terms of the GNU General Public License as published by\n\n the Free Software Foundation; either version 2 of the License, or\n\n (at your option) any later version.\n\n\n\n This program is distributed in the hope that it will be useful,\n\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\n GNU General Public License for more details.\n\n\n\n You should have received a copy of the GNU General Public License\n\n along with this program; if not, write to the Free Software\n\n Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.\n","file_path":"dpx/src/specials/dvipdfmx.rs","rank":81,"score":58696.28203413873},{"content":"/* This is dvipdfmx, an eXtended version of dvipdfm by Mark A. Wicks.\n\n\n\n Copyright (C) 2002-2016 by Jin-Hwan Cho and Shunsaku Hirata,\n\n the dvipdfmx project team.\n\n\n\n Copyright (C) 1998, 1999 by Mark A. Wicks <mwicks@kettering.edu>\n\n\n\n This program is free software; you can redistribute it and/or modify\n\n it under the terms of the GNU General Public License as published by\n\n the Free Software Foundation; either version 2 of the License, or\n\n (at your option) any later version.\n\n\n\n This program is distributed in the hope that it will be useful,\n\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\n GNU General Public License for more details.\n\n\n\n You should have received a copy of the GNU General Public License\n\n along with this program; if not, write to the Free Software\n\n Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.\n","file_path":"dpx/src/dpx_dvipdfmx.rs","rank":82,"score":58696.28203413873},{"content":"fn cache_dir(path: &str, custom_cache_root: Option<&Path>) -> Result<PathBuf> {\n\n if let Some(root) = custom_cache_root {\n\n if !root.is_dir() {\n\n bail!(\"Custom cache path {} is not a directory\", root.display());\n\n }\n\n let full_path = root.join(path);\n\n ctry!(fs::create_dir_all(&full_path); \"failed to create directory {}\", full_path.display());\n\n Ok(full_path)\n\n } else {\n\n app_dirs::user_cache_dir(path)\n\n }\n\n}\n","file_path":"src/io/cached_itarbundle.rs","rank":83,"score":58542.215836936506},{"content":" (*pi).name\n\n } else {\n\n 0 as *const i8\n\n })\n\n .is_null()\n\n {\n\n paper_width = if !pi.is_null() && !(*pi).name.is_null() {\n\n (*pi).pswidth\n\n } else {\n\n 0.0f64\n\n };\n\n paper_height = if !pi.is_null() && !(*pi).name.is_null() {\n\n (*pi).psheight\n\n } else {\n\n 0.0f64\n\n }\n\n } else {\n\n let mut p: *const i8 = paperspec;\n\n let mut endptr: *const i8 = 0 as *const i8;\n\n let mut comma: *const i8 = 0 as *const i8;\n","file_path":"dpx/src/dpx_dvipdfmx.rs","rank":84,"score":58519.54982452946},{"content":"*/\n\n#![allow(\n\n unused_mut\n\n)]\n\n\n\nuse std::ffi::CStr;\n\n\n\nuse super::{spc_arg, spc_env, SpcHandler};\n\nuse crate::dpx_dpxutil::parse_c_ident;\n\nuse crate::dpx_pdfparse::skip_white;\n\nuse crate::spc_warn;\n\nuse libc::{free, memcmp, strlen};\n\n\n\npub type size_t = u64;\n\n\n\n/* tectonic/core-strutils.h: miscellaneous C string utilities\n\n Copyright 2016-2018 the Tectonic Project\n\n Licensed under the MIT License.\n\n*/\n\n/* Note that we explicitly do *not* change this on Windows. For maximum\n","file_path":"dpx/src/specials/dvipdfmx.rs","rank":85,"score":58514.589275275495},{"content":"/* Encryption */\n\nstatic mut do_encryption: i32 = 0i32;\n\nstatic mut key_bits: i32 = 40i32;\n\nstatic mut permission: i32 = 0x3ci32;\n\n/* Page device */\n\n#[no_mangle]\n\npub static mut paper_width: f64 = 595.0f64;\n\n#[no_mangle]\n\npub static mut paper_height: f64 = 842.0f64;\n\nstatic mut x_offset: f64 = 72.0f64;\n\nstatic mut y_offset: f64 = 72.0f64;\n\n#[no_mangle]\n\npub static mut landscape_mode: i32 = 0i32;\n\n#[no_mangle]\n\npub static mut always_embed: i32 = 0i32;\n\n/* always embed fonts, regardless of licensing flags */\n\n/* XXX: there are four quasi-redundant versions of this; grp for K_UNIT__PT */\n\nunsafe fn read_length(mut vp: *mut f64, mut pp: *mut *const i8, mut endptr: *const i8) -> i32 {\n\n let mut q: *mut i8 = 0 as *mut i8;\n\n let mut p: *const i8 = *pp;\n","file_path":"dpx/src/dpx_dvipdfmx.rs","rank":86,"score":58514.02583495871},{"content":"use super::dpx_pdfdev::pdf_rect;\n\n#[no_mangle]\n\npub static mut is_xdv: i32 = 0i32;\n\n#[no_mangle]\n\npub static mut translate_origin: i32 = 0i32;\n\nstatic mut ignore_colors: i8 = 0_i8;\n\nstatic mut annot_grow: f64 = 0.0f64;\n\nstatic mut bookmark_open: i32 = 0i32;\n\nstatic mut mag: f64 = 1.0f64;\n\nstatic mut font_dpi: i32 = 600i32;\n\n/*\n\n * Precision is essentially limited to 0.01pt.\n\n * See, dev_set_string() in pdfdev.c.\n\n */\n\nstatic mut pdfdecimaldigits: i32 = 3i32;\n\n/* Image cache life in hours */\n\n/* 0 means erase all old images and leave new images */\n\n/* -1 means erase all old images and also erase new images */\n\n/* -2 means ignore image cache (default) */\n\nstatic mut image_cache_life: i32 = -2i32;\n","file_path":"dpx/src/dpx_dvipdfmx.rs","rank":87,"score":58508.34799028795},{"content":" warn!(\"Unknown unit of measure: {}\", CStr::from_ptr(q).display(),);\n\n error = -1i32\n\n }\n\n }\n\n free(qq as *mut libc::c_void);\n\n } else {\n\n warn!(\"Missing unit of measure after \\\"true\\\"\");\n\n error = -1i32\n\n }\n\n }\n\n *vp = v * u;\n\n *pp = p;\n\n error\n\n}\n\nunsafe fn select_paper(mut paperspec: *const i8) {\n\n let mut pi: *const paper = 0 as *const paper;\n\n let mut error: i32 = 0i32;\n\n pi = paperinfo(paperspec);\n\n if !pi.is_null()\n\n && !(if !pi.is_null() && !(*pi).name.is_null() {\n","file_path":"dpx/src/dpx_dvipdfmx.rs","rank":88,"score":58507.78214729899},{"content":"use super::dpx_pdfencrypt::{pdf_enc_compute_id_string, pdf_enc_set_passwd, pdf_enc_set_verbose};\n\nuse super::dpx_pdfobj::{\n\n pdf_files_close, pdf_files_init, pdf_get_version, pdf_obj_reset_global_state,\n\n pdf_obj_set_verbose, pdf_set_compression, pdf_set_use_predictor, pdf_set_version,\n\n};\n\nuse super::dpx_tfm::tfm_reset_global_state;\n\nuse super::dpx_vf::vf_reset_global_state;\n\nuse crate::specials::{\n\n spc_exec_at_begin_document, spc_exec_at_end_document, tpic::tpic_set_fill_mode,\n\n};\n\nuse libc::{atof, atoi, free, memcmp, strchr, strcmp, strlen};\n\nuse std::slice::from_raw_parts;\n\n\n\npub type PageRange = page_range;\n\n#[derive(Copy, Clone)]\n\n#[repr(C)]\n\npub struct page_range {\n\n pub first: i32,\n\n pub last: i32,\n\n}\n","file_path":"dpx/src/dpx_dvipdfmx.rs","rank":89,"score":58505.273727888605},{"content":" b\"dvipdfmx:\\x00\" as *const u8 as *const i8 as *const libc::c_void,\n\n strlen(b\"dvipdfmx:\\x00\" as *const u8 as *const i8),\n\n ) == 0\n\n {\n\n return true;\n\n }\n\n false\n\n}\n\n#[no_mangle]\n\npub unsafe extern \"C\" fn spc_dvipdfmx_setup_handler(\n\n mut sph: *mut SpcHandler,\n\n mut spe: *mut spc_env,\n\n mut ap: *mut spc_arg,\n\n) -> i32 {\n\n let mut error: i32 = -1i32;\n\n assert!(!sph.is_null() && !spe.is_null() && !ap.is_null());\n\n skip_white(&mut (*ap).curptr, (*ap).endptr);\n\n if (*ap)\n\n .curptr\n\n .offset(strlen(b\"dvipdfmx:\\x00\" as *const u8 as *const i8) as isize)\n","file_path":"dpx/src/specials/dvipdfmx.rs","rank":90,"score":58504.39547206472},{"content":" * portability, we should probably accept *either* forward or backward slashes\n\n * as directory separators. */\n\n\n\nunsafe fn spc_handler_null(mut _spe: *mut spc_env, mut args: *mut spc_arg) -> i32 {\n\n (*args).curptr = (*args).endptr;\n\n 0i32\n\n}\n\nconst DVIPDFMX_HANDLERS: [SpcHandler; 1] = [SpcHandler {\n\n key: b\"config\",\n\n exec: Some(spc_handler_null),\n\n}];\n\n\n\n#[no_mangle]\n\npub unsafe extern \"C\" fn spc_dvipdfmx_check_special(mut buf: *const i8, mut len: i32) -> bool {\n\n let mut p = buf;\n\n let endptr = p.offset(len as isize);\n\n skip_white(&mut p, endptr);\n\n if p.offset(strlen(b\"dvipdfmx:\\x00\" as *const u8 as *const i8) as isize) <= endptr\n\n && memcmp(\n\n p as *const libc::c_void,\n","file_path":"dpx/src/specials/dvipdfmx.rs","rank":91,"score":58504.15807091915},{"content":" pdf_fontmap_set_verbose(verbose as i32);\n\n dpx_file_set_verbose(verbose as i32);\n\n tt_aux_set_verbose(verbose as i32);\n\n }\n\n pdf_set_compression(if compress as i32 != 0 { 9i32 } else { 0i32 });\n\n pdf_font_set_deterministic_unique_tags(if deterministic_tags as i32 != 0 {\n\n 1i32\n\n } else {\n\n 0i32\n\n });\n\n system_default();\n\n pdf_init_fontmaps();\n\n /* We used to read the config file here. It synthesized command-line\n\n * arguments, so we emulate the default TeXLive config file by copying those\n\n * code bits. */\n\n pdf_set_version(5_u32); /* last page */\n\n select_paper(b\"letter\\x00\" as *const u8 as *const i8);\n\n annot_grow = 0i32 as f64;\n\n bookmark_open = 0i32;\n\n key_bits = 40i32;\n","file_path":"dpx/src/dpx_dvipdfmx.rs","rank":92,"score":58501.51923867286},{"content":" comma = strchr(p, ',' as i32);\n\n endptr = p.offset(strlen(p) as isize);\n\n if comma.is_null() {\n\n panic!(\n\n \"Unrecognized paper format: {}\",\n\n CStr::from_ptr(paperspec).display()\n\n );\n\n }\n\n error = read_length(&mut paper_width, &mut p, comma);\n\n p = comma.offset(1);\n\n error = read_length(&mut paper_height, &mut p, endptr)\n\n }\n\n if error != 0 || paper_width <= 0.0f64 || paper_height <= 0.0f64 {\n\n panic!(\n\n \"Invalid paper size: {} ({:.2}x{:.2}\",\n\n CStr::from_ptr(paperspec).display(),\n\n paper_width,\n\n paper_height,\n\n );\n\n };\n","file_path":"dpx/src/dpx_dvipdfmx.rs","rank":93,"score":58500.99759736816},{"content":" i = i.wrapping_add(1)\n\n }\n\n if page_count < 1_u32 {\n\n panic!(\"No pages fall in range!\");\n\n }\n\n spc_exec_at_end_document();\n\n}\n\n#[no_mangle]\n\npub unsafe extern \"C\" fn dvipdfmx_main(\n\n mut pdf_filename: *const i8,\n\n mut dvi_filename: *const i8,\n\n mut pagespec: *const i8,\n\n mut opt_flags: i32,\n\n mut translate: bool,\n\n mut compress: bool,\n\n mut deterministic_tags: bool,\n\n mut quiet: bool,\n\n mut verbose: u32,\n\n) -> i32 {\n\n let mut enable_object_stream: bool = true; /* This must come before parsing options... */\n","file_path":"dpx/src/dpx_dvipdfmx.rs","rank":94,"score":58500.23733540939},{"content":"/* This is dvipdfmx, an eXtended version of dvipdfm by Mark A. Wicks.\n\n\n\n Copyright (C) 2002-2016 by Jin-Hwan Cho and Shunsaku Hirata,\n\n the dvipdfmx project team.\n\n\n\n Copyright (C) 1998, 1999 by Mark A. Wicks <mwicks@kettering.edu>\n\n\n\n This program is free software; you can redistribute it and/or modify\n\n it under the terms of the GNU General Public License as published by\n\n the Free Software Foundation; either version 2 of the License, or\n\n (at your option) any later version.\n\n\n\n This program is distributed in the hope that it will be useful,\n\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\n GNU General Public License for more details.\n\n\n\n You should have received a copy of the GNU General Public License\n\n along with this program; if not, write to the Free Software\n\n Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.\n","file_path":"dpx/src/dpx_mpost.rs","rank":95,"score":229.4666557578548},{"content":"/* This is dvipdfmx, an eXtended version of dvipdfm by Mark A. Wicks.\n\n\n\n Copyright (C) 2002-2016 by Jin-Hwan Cho and Shunsaku Hirata,\n\n the dvipdfmx project team.\n\n\n\n Copyright (C) 1998, 1999 by Mark A. Wicks <mwicks@kettering.edu>\n\n\n\n This program is free software; you can redistribute it and/or modify\n\n it under the terms of the GNU General Public License as published by\n\n the Free Software Foundation; either version 2 of the License, or\n\n (at your option) any later version.\n\n\n\n This program is distributed in the hope that it will be useful,\n\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\n GNU General Public License for more details.\n\n\n\n You should have received a copy of the GNU General Public License\n\n along with this program; if not, write to the Free Software\n\n Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.\n","file_path":"dpx/src/specials/dvips.rs","rank":96,"score":229.46665575785474},{"content":"/* This is dvipdfmx, an eXtended version of dvipdfm by Mark A. Wicks.\n\n\n\n Copyright (C) 2002-2016 by Jin-Hwan Cho and Shunsaku Hirata,\n\n the dvipdfmx project team.\n\n\n\n Copyright (C) 1998, 1999 by Mark A. Wicks <mwicks@kettering.edu>\n\n\n\n This program is free software; you can redistribute it and/or modify\n\n it under the terms of the GNU General Public License as published by\n\n the Free Software Foundation; either version 2 of the License, or\n\n (at your option) any later version.\n\n\n\n This program is distributed in the hope that it will be useful,\n\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\n GNU General Public License for more details.\n\n\n\n You should have received a copy of the GNU General Public License\n\n along with this program; if not, write to the Free Software\n\n Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.\n","file_path":"dpx/src/dpx_type0.rs","rank":97,"score":229.46665575785465},{"content":"/* This is dvipdfmx, an eXtended version of dvipdfm by Mark A. Wicks.\n\n\n\n Copyright (C) 2002-2016 by Jin-Hwan Cho and Shunsaku Hirata,\n\n the dvipdfmx project team.\n\n\n\n Copyright (C) 1998, 1999 by Mark A. Wicks <mwicks@kettering.edu>\n\n\n\n This program is free software; you can redistribute it and/or modify\n\n it under the terms of the GNU General Public License as published by\n\n the Free Software Foundation; either version 2 of the License, or\n\n (at your option) any later version.\n\n\n\n This program is distributed in the hope that it will be useful,\n\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\n GNU General Public License for more details.\n\n\n\n You should have received a copy of the GNU General Public License\n\n along with this program; if not, write to the Free Software\n\n Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.\n","file_path":"dpx/src/dpx_vf.rs","rank":98,"score":229.46665575785468},{"content":"/* This is dvipdfmx, an eXtended version of dvipdfm by Mark A. Wicks.\n\n\n\n Copyright (C) 2002-2016 by Jin-Hwan Cho and Shunsaku Hirata,\n\n the dvipdfmx project team.\n\n\n\n Copyright (C) 1998, 1999 by Mark A. Wicks <mwicks@kettering.edu>\n\n\n\n This program is free software; you can redistribute it and/or modify\n\n it under the terms of the GNU General Public License as published by\n\n the Free Software Foundation; either version 2 of the License, or\n\n (at your option) any later version.\n\n\n\n This program is distributed in the hope that it will be useful,\n\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\n GNU General Public License for more details.\n\n\n\n You should have received a copy of the GNU General Public License\n\n along with this program; if not, write to the Free Software\n\n Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.\n","file_path":"dpx/src/dpx_otl_conf.rs","rank":99,"score":229.46665575785468}],"string":"[\n {\n \"content\": \"pub fn hex_to_bytes(text: &str, dest: &mut [u8]) -> Result<()> {\\n\\n let n = dest.len();\\n\\n let text_len = text.len();\\n\\n\\n\\n if text_len != 2 * n {\\n\\n return Err(ErrorKind::BadLength(2 * n, text_len).into());\\n\\n }\\n\\n\\n\\n for i in 0..n {\\n\\n dest[i] = u8::from_str_radix(&text[i * 2..(i + 1) * 2], 16)?;\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\\n// The specific implementation we're using: SHA256.\\n\\n\\n\\nconst N_BYTES: usize = 32;\\n\\npub const DIGEST_NAME: &str = \\\"SHA256SUM\\\";\\n\\npub const DIGEST_LEN: usize = 64;\\n\\n\\n\",\n \"file_path\": \"src/digest.rs\",\n \"rank\": 0,\n \"score\": 190693.3822029074\n },\n {\n \"content\": \"type synctex_recorder_t = Option<unsafe extern \\\"C\\\" fn(_: i32) -> ()>;\\n\\n\\n\\nconst default_synctex_ctxt: Context = Context {\\n\\n file: None,\\n\\n root_name: ptr::null_mut(),\\n\\n count: 0i32,\\n\\n node: 0i32,\\n\\n recorder: None,\\n\\n tag: 0i32,\\n\\n line: 0i32,\\n\\n curh: 0i32,\\n\\n curv: 0i32,\\n\\n magnification: 0i32,\\n\\n unit: 0i32,\\n\\n total_length: 0,\\n\\n lastv: -1i32,\\n\\n form_depth: 0i32,\\n\\n synctex_tag_counter: 0_u32,\\n\\n flags: Flags::empty(),\\n\\n};\\n\",\n \"file_path\": \"engine/src/xetex_synctex.rs\",\n \"rank\": 1,\n \"score\": 187574.89352690981\n },\n {\n \"content\": \"pub fn agl_name_is_unicode(glyphname: &[u8]) -> bool {\\n\\n if glyphname.is_empty() {\\n\\n return false;\\n\\n }\\n\\n let len = glyphname\\n\\n .iter()\\n\\n .position(|&x| x == b'.')\\n\\n .unwrap_or(glyphname.len());\\n\\n /*\\n\\n * uni02ac is invalid glyph name and mapped to th empty string.\\n\\n */\\n\\n if len >= 7 && (len - 3) % 4 == 0 && glyphname.starts_with(b\\\"uni\\\") {\\n\\n let c = glyphname[3];\\n\\n /*\\n\\n * Check if the 4th character is uppercase hexadecimal digit.\\n\\n * \\\"union\\\" should not be treated as Unicode glyph name.\\n\\n */\\n\\n if c.is_ascii_digit() || c >= b'A' && c <= b'F' {\\n\\n return true;\\n\\n } else {\\n\",\n \"file_path\": \"dpx/src/dpx_agl.rs\",\n \"rank\": 2,\n \"score\": 184437.18106554932\n },\n {\n \"content\": \"#[inline(always)]\\n\\nfn as_printable_ascii(c: i32) -> Option<u8> {\\n\\n if c > 0x20 && c < 0x7F {\\n\\n Some(c as u8)\\n\\n } else {\\n\\n None\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a, 'b: 'a> State<'a, 'b> {\\n\\n pub fn finished(self) {\\n\\n if let Some(oh) = self.cur_output {\\n\\n let (name, digest) = oh.into_name_digest();\\n\\n self.events.output_closed(name, digest);\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a, 'b: 'a> XdvEvents for State<'a, 'b> {\\n\\n type Error = Error;\\n\\n\\n\",\n \"file_path\": \"src/engines/spx2html.rs\",\n \"rank\": 3,\n \"score\": 162092.50599737326\n },\n {\n \"content\": \"fn scan_otl_tag(mut otl_tags: &[u8]) -> Result<(Vec<u8>, Vec<u8>, Vec<u8>), ()> {\\n\\n let mut script;\\n\\n let mut language = vec![b' '; 4];\\n\\n if otl_tags.is_empty() {\\n\\n return Err(());\\n\\n }\\n\\n /* First parse otl_tags variable */\\n\\n let mut p = otl_tags;\\n\\n\\n\\n if let Some(slen) = p.iter().position(|&x| x == b'.') {\\n\\n /* Format scrp.lang.feat */\\n\\n if slen < 5 {\\n\\n script = Vec::from(&p[..slen]);\\n\\n } else {\\n\\n warn!(\\\"Invalid OTL script tag found: {}\\\", p.display());\\n\\n return Err(());\\n\\n }\\n\\n p = &p[slen + 1..];\\n\\n if let Some(llen) = p.iter().position(|&x| x == b'.') {\\n\\n /* Now lang part */\\n\",\n \"file_path\": \"dpx/src/dpx_tt_gsub.rs\",\n \"rank\": 4,\n \"score\": 152930.38468736532\n },\n {\n \"content\": \"type id = *mut Object;\\n\\n\\n\\nextern \\\"C\\\" {\\n\\n pub type __CFAllocator;\\n\\n pub type __CFURL;\\n\\n pub type __CTFontDescriptor;\\n\\n pub type __CFString;\\n\\n pub type __CFArray;\\n\\n pub type __CFDictionary;\\n\\n pub type __CFSet;\\n\\n pub type __CTFont;\\n\\n #[no_mangle]\\n\\n fn free(_: *mut libc::c_void);\\n\\n #[no_mangle]\\n\\n fn malloc(_: libc::c_ulong) -> *mut libc::c_void;\\n\\n #[no_mangle]\\n\\n fn strchr(_: *const libc::c_char, _: libc::c_int) -> *mut libc::c_char;\\n\\n #[no_mangle]\\n\\n fn strlen(_: *const libc::c_char) -> libc::c_ulong;\\n\\n #[no_mangle]\\n\",\n \"file_path\": \"engine/src/xetex_font_manager_coretext.rs\",\n \"rank\": 5,\n \"score\": 149475.96920560196\n },\n {\n \"content\": \"type rust_output_handle_t = *mut libc::c_void;\\n\\npub type rust_input_handle_t = *mut libc::c_void;\\n\\n\\n\\n#[derive(PartialEq)]\\n\\npub struct OutputHandleWrapper(NonNull<libc::c_void>);\\n\\n\\n\\nimpl OutputHandleWrapper {\\n\\n pub fn new(ptr: rust_output_handle_t) -> Option<Self> {\\n\\n NonNull::new(ptr).map(|nnp| Self(nnp))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Write for OutputHandleWrapper {\\n\\n fn write(&mut self, buf: &[u8]) -> Result<usize> {\\n\\n unsafe {\\n\\n Ok(\\n\\n ttstub_output_write(self.0.as_ptr(), buf.as_ptr() as *const i8, buf.len() as u64)\\n\\n as usize,\\n\\n )\\n\\n }\\n\",\n \"file_path\": \"bridge/src/lib.rs\",\n \"rank\": 6,\n \"score\": 144489.09819678107\n },\n {\n \"content\": \"#[derive(Clone, Debug, Eq, PartialEq)]\\n\\nstruct SharedByteBuffer(Rc<Vec<u8>>);\\n\\n\\n\\nimpl SharedByteBuffer {\\n\\n fn new(data: Vec<u8>) -> SharedByteBuffer {\\n\\n SharedByteBuffer(Rc::new(data))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl AsRef<[u8]> for SharedByteBuffer {\\n\\n fn as_ref(&self) -> &[u8] {\\n\\n &*self.0\\n\\n }\\n\\n}\\n\\n\\n\\nimpl InputFeatures for Cursor<SharedByteBuffer> {\\n\\n fn get_size(&mut self) -> Result<usize> {\\n\\n Ok(self.get_ref().0.len())\\n\\n }\\n\\n\\n\\n fn try_seek(&mut self, pos: SeekFrom) -> Result<u64> {\\n\",\n \"file_path\": \"src/io/stdstreams.rs\",\n \"rank\": 7,\n \"score\": 144393.9015064857\n },\n {\n \"content\": \"pub fn bytes_to_hex(bytes: &[u8]) -> String {\\n\\n bytes\\n\\n .iter()\\n\\n .map(|b| format!(\\\"{:02x}\\\", b))\\n\\n .collect::<Vec<_>>()\\n\\n .concat()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/digest.rs\",\n \"rank\": 8,\n \"score\": 142833.1413145302\n },\n {\n \"content\": \"fn xtol(mut buf: &[u8]) -> i32 {\\n\\n let mut v: i32 = 0i32;\\n\\n for &b in buf {\\n\\n v <<= 4;\\n\\n if b.is_ascii_digit() {\\n\\n v += (b - b'0') as i32;\\n\\n } else if b >= b'A' && b <= b'F' {\\n\\n v += (b - b'A' + 10) as i32;\\n\\n } else {\\n\\n return -1;\\n\\n }\\n\\n }\\n\\n v\\n\\n}\\n\\n\\n\\nunsafe fn put_unicode_glyph(name: &[u8], mut dstpp: *mut *mut u8, mut limptr: *mut u8) -> i32 {\\n\\n let mut len = 0;\\n\\n let mut p = name;\\n\\n if p[1] != b'n' {\\n\\n p = &p[1..];\\n\",\n \"file_path\": \"dpx/src/dpx_agl.rs\",\n \"rank\": 9,\n \"score\": 140514.51107537074\n },\n {\n \"content\": \"fn skip_modifier<'a>(buf: &'a [u8]) -> (&'a [u8], usize) {\\n\\n let mut slen = 0;\\n\\n for s in MODIFIERS.iter() {\\n\\n if buf.starts_with(s) {\\n\\n slen = s.len();\\n\\n break;\\n\\n }\\n\\n }\\n\\n (&buf[slen..], slen)\\n\\n}\\n\",\n \"file_path\": \"dpx/src/dpx_agl.rs\",\n \"rank\": 10,\n \"score\": 138254.28482163395\n },\n {\n \"content\": \"pub fn get_unique_time_if_given() -> Option<SystemTime> {\\n\\n use std::time::Duration;\\n\\n\\n\\n let env = std::env::var(\\\"SOURCE_DATE_EPOCH\\\");\\n\\n\\n\\n env.ok()\\n\\n .map(|x| {\\n\\n x.trim()\\n\\n .parse::<u64>()\\n\\n .ok()\\n\\n .map(|x| SystemTime::UNIX_EPOCH.checked_add(Duration::new(x, 0)))\\n\\n })\\n\\n .unwrap_or(None)\\n\\n .unwrap_or(None)\\n\\n}\\n\\n\\n\\nstatic mut unique_tag_state: i32 = 1i32;\\n\\nstatic mut unique_tags_deterministic: i32 = 0i32;\\n\\n#[no_mangle]\\n\\npub unsafe extern \\\"C\\\" fn pdf_font_reset_unique_tag_state() {\\n\",\n \"file_path\": \"dpx/src/dpx_pdffont.rs\",\n \"rank\": 11,\n \"score\": 137305.19741023888\n },\n {\n \"content\": \"/// A hack to allow casting of Bundles to IoProviders.\\n\\n///\\n\\n/// The code that sets up the I/O stack is handed a reference to a Bundle\\n\\n/// trait object. For the actual I/O, it needs to convert this to an\\n\\n/// IoProvider trait object. [According to\\n\\n/// StackExchange](https://stackoverflow.com/a/28664881/3760486), the\\n\\n/// following pattern is the least-bad way to achieve the necessary upcasting.\\n\\npub trait AsIoProviderMut {\\n\\n /// Represent this value as an IoProvider trait object.\\n\\n fn as_ioprovider_mut(&mut self) -> &mut dyn IoProvider;\\n\\n}\\n\\n\\n\\nimpl<T: IoProvider> AsIoProviderMut for T {\\n\\n fn as_ioprovider_mut(&mut self) -> &mut dyn IoProvider {\\n\\n self\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/io/mod.rs\",\n \"rank\": 12,\n \"score\": 134236.3886603842\n },\n {\n \"content\": \"fn convert_tag(tag: &mut [u8; 4], u_tag: u32) {\\n\\n *tag = u_tag.to_be_bytes();\\n\\n}\\n\\n\\n\\n/*\\n\\n * Computes the max power of 2 <= n\\n\\n */\\n\\nunsafe fn max2floor(mut n: u32) -> u32 {\\n\\n let mut val: i32 = 1i32;\\n\\n while n > 1_u32 {\\n\\n n = n.wrapping_div(2_u32);\\n\\n val *= 2i32\\n\\n }\\n\\n val as u32\\n\\n}\\n\\n/*\\n\\n * Computes the log2 of the max power of 2 <= n\\n\\n */\\n\\nunsafe fn log2floor(mut n: u32) -> u32 {\\n\\n let mut val: u32 = 0_u32;\\n\",\n \"file_path\": \"dpx/src/dpx_sfnt.rs\",\n \"rank\": 13,\n \"score\": 129622.98698968318\n },\n {\n \"content\": \"/// A trait for types that can read or write files needed by the TeX engine.\\n\\npub trait IoProvider: AsIoProviderMut {\\n\\n fn output_open_name(&mut self, _name: &OsStr) -> OpenResult<OutputHandle> {\\n\\n OpenResult::NotAvailable\\n\\n }\\n\\n\\n\\n fn output_open_stdout(&mut self) -> OpenResult<OutputHandle> {\\n\\n OpenResult::NotAvailable\\n\\n }\\n\\n\\n\\n fn input_open_name(\\n\\n &mut self,\\n\\n _name: &OsStr,\\n\\n _status: &mut dyn StatusBackend,\\n\\n ) -> OpenResult<InputHandle> {\\n\\n OpenResult::NotAvailable\\n\\n }\\n\\n\\n\\n /// Open the \\\"primary\\\" input file, which in the context of TeX is the main\\n\\n /// input that it's given. When the build is being done using the\\n\\n /// filesystem and the input is a file on the filesystem, this function\\n\",\n \"file_path\": \"src/io/mod.rs\",\n \"rank\": 14,\n \"score\": 125836.00530370105\n },\n {\n \"content\": \"/// Compile LaTeX text to a PDF.\\n\\n///\\n\\n/// This function is an all-in-one interface to the main Tectonic workflow. Given\\n\\n/// a string representing a LaTeX input file, it will compile it to a PDF and return\\n\\n/// a byte vector corresponding to the resulting file:\\n\\n///\\n\\n/// ```\\n\\n/// let latex = r#\\\"\\n\\n/// \\\\documentclass{article}\\n\\n/// \\\\begin{document}\\n\\n/// Hello, world!\\n\\n/// \\\\end{document}\\n\\n/// \\\"#;\\n\\n///\\n\\n/// # tectonic::test_util::activate_test_mode_augmented(env!(\\\"CARGO_MANIFEST_DIR\\\"));\\n\\n/// let pdf_data: Vec<u8> = tectonic::latex_to_pdf(latex).expect(\\\"processing failed\\\");\\n\\n/// println!(\\\"Output PDF size is {} bytes\\\", pdf_data.len());\\n\\n/// ```\\n\\n///\\n\\n/// The compilation uses the default bundle, the location of which is embedded\\n\\n/// in the crate or potentially specified in the user’s configuration file.\\n\\n/// The current working directory will be searched for any `\\\\\\\\input` files.\\n\\n/// Messages aimed at the user are suppressed, but (in the default\\n\\n/// configuration) network I/O may occur to pull down needed resource files.\\n\\n/// No outputs are written to disk; all supporting files besides the PDF\\n\\n/// document are discarded. The XeTeX engine is run multiple times if needed\\n\\n/// to get the output file to converge.\\n\\n///\\n\\n/// For more sophisticated uses, use the [`driver`] module, which provides a\\n\\n/// high-level interface for driving the typesetting engines with much more\\n\\n/// control over their behavior.\\n\\n///\\n\\n/// Note that the current engine implementations use lots of global state, so\\n\\n/// they are not thread-safe. This crate uses a global mutex to serialize\\n\\n/// invocations of the engines. This means that if you call this function from\\n\\n/// multiple threads simultaneously, the bulk of the work will be done in\\n\\n/// serial. The aim is to lift this limitation one day, but it will require\\n\\n/// extensive work on the underlying C/C++ code.\\n\\npub fn latex_to_pdf<T: AsRef<str>>(latex: T) -> Result<Vec<u8>> {\\n\\n use std::ffi::OsStr;\\n\\n\\n\\n let mut status = status::NoopStatusBackend::new();\\n\\n\\n\\n let auto_create_config_file = false;\\n\\n let config = ctry!(config::PersistentConfig::open(auto_create_config_file);\\n\\n \\\"failed to open the default configuration file\\\");\\n\\n\\n\\n let only_cached = false;\\n\\n let bundle = ctry!(config.default_bundle(only_cached, &mut status);\\n\\n \\\"failed to load the default resource bundle\\\");\\n\\n\\n\\n let format_cache_path = ctry!(config.format_cache_path();\\n\\n \\\"failed to set up the format cache\\\");\\n\\n\\n\\n let mut files = {\\n\\n // Looking forward to non-lexical lifetimes!\\n\\n let mut sb = driver::ProcessingSessionBuilder::default();\\n\\n sb.bundle(bundle)\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 15,\n \"score\": 118926.19429242914\n },\n {\n \"content\": \"\\tUInt32\\tversion;\\t\\t\\t\\t/* version = kCurrentTableVersion */\\n\",\n \"file_path\": \"engine/tectonic/teckit-Format.h\",\n \"rank\": 16,\n \"score\": 90631.83220267965\n },\n {\n \"content\": \"\\t\\tUInt8\\ttype;\\t\\t\\t\\t/* see kRepElem_... below */\\n\",\n \"file_path\": \"engine/tectonic/teckit-Format.h\",\n \"rank\": 17,\n \"score\": 90336.33542817865\n },\n {\n \"content\": \"fn skip_capital<'a>(p: &'a [u8]) -> (&'a [u8], usize) {\\n\\n if p.starts_with(b\\\"AE\\\") || p.starts_with(b\\\"OE\\\") {\\n\\n (&p[2..], 2)\\n\\n } else if p.starts_with(b\\\"Eth\\\") {\\n\\n (&p[3..], 3)\\n\\n } else if p.starts_with(b\\\"Thorn\\\") {\\n\\n (&p[5..], 5)\\n\\n } else if p.len() >= 1 {\\n\\n if p[0].is_ascii_uppercase() {\\n\\n (&p[1..], 1)\\n\\n } else {\\n\\n (p, 0)\\n\\n }\\n\\n } else {\\n\\n (p, 0)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"dpx/src/dpx_agl.rs\",\n \"rank\": 18,\n \"score\": 89139.80987969796\n },\n {\n \"content\": \"#[derive(Clone, Debug, Eq, PartialEq)]\\n\\nstruct FileSummary {\\n\\n write_digest: Option<DigestData>,\\n\\n}\\n\\n\\n\\nimpl FileSummary {\\n\\n fn new() -> FileSummary {\\n\\n FileSummary { write_digest: None }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/formats.rs\",\n \"rank\": 19,\n \"score\": 89050.6699213537\n },\n {\n \"content\": \"#[derive(Clone, Debug, Eq, PartialEq)]\\n\\nstruct State {\\n\\n pub h: i32,\\n\\n pub v: i32,\\n\\n pub w: i32,\\n\\n pub x: i32,\\n\\n pub y: i32,\\n\\n pub z: i32,\\n\\n}\\n\\n\\n\\nimpl State {\\n\\n pub fn new() -> Self {\\n\\n State {\\n\\n h: 0,\\n\\n v: 0,\\n\\n w: 0,\\n\\n x: 0,\\n\\n y: 0,\\n\\n z: 0,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// A simple cursor on a buffer.\\n\",\n \"file_path\": \"xdv/src/lib.rs\",\n \"rank\": 20,\n \"score\": 89050.6699213537\n },\n {\n \"content\": \"struct TestCase {\\n\\n stem: String,\\n\\n}\\n\\n\\n\\nimpl TestCase {\\n\\n fn new(stem: &str) -> Self {\\n\\n TestCase {\\n\\n stem: stem.to_owned(),\\n\\n }\\n\\n }\\n\\n\\n\\n fn go(&mut self) {\\n\\n util::set_test_root();\\n\\n\\n\\n let mut p = test_path(&[\\\"bibtex\\\"]);\\n\\n\\n\\n p.push(&self.stem);\\n\\n\\n\\n p.set_extension(\\\"aux\\\");\\n\\n let auxname = p.file_name().unwrap().to_str().unwrap().to_owned();\\n\",\n \"file_path\": \"tests/bibtex.rs\",\n \"rank\": 21,\n \"score\": 89043.98910440826\n },\n {\n \"content\": \"struct Stats {}\\n\\n\\n\\nimpl Stats {\\n\\n pub fn new() -> Self {\\n\\n Stats {}\\n\\n }\\n\\n}\\n\\n\\n\\nimpl tectonic_xdv::XdvEvents for Stats {\\n\\n type Error = Error;\\n\\n\\n\\n fn handle_header(&mut self, filetype: FileType, comment: &[u8]) -> Result<(), Self::Error> {\\n\\n println!(\\\"file type: {}\\\", filetype);\\n\\n\\n\\n match str::from_utf8(comment) {\\n\\n Ok(s) => {\\n\\n println!(\\\"comment: {}\\\", s);\\n\\n }\\n\\n Err(e) => {\\n\\n println!(\\\"cannot parse comment: {}\\\", e);\\n\",\n \"file_path\": \"xdv/examples/xdvdump.rs\",\n \"rank\": 22,\n \"score\": 89043.98910440826\n },\n {\n \"content\": \"#[derive(Clone, Debug)]\\n\\nstruct TarIndex {\\n\\n tar: Vec<u8>,\\n\\n index: Vec<u8>,\\n\\n map: HashMap<(u64, u64), String>,\\n\\n}\\n\\n\\n\\nimpl TarIndex {\\n\\n fn from_dir<P: AsRef<Path>>(path: P) -> io::Result<TarIndex> {\\n\\n let path = path.as_ref();\\n\\n let mut builder = TarIndexBuilder::new();\\n\\n for de in path.read_dir()? {\\n\\n let path = de?.path();\\n\\n let content = fs::read(&path)?;\\n\\n builder.push(path.file_name().unwrap().to_str().unwrap(), &content);\\n\\n }\\n\\n\\n\\n builder.push(\\n\\n tectonic::digest::DIGEST_NAME,\\n\\n b\\\"0000000000000000000000000000000000000000000000000000000000000000\\\",\\n\\n );\\n\\n\\n\\n Ok(builder.finish())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/cached_itarbundle.rs\",\n \"rank\": 23,\n \"score\": 87468.12953099453\n },\n {\n \"content\": \"#[derive(Clone, Debug)]\\n\\nstruct VcPkgState {\\n\\n include_paths: Vec<PathBuf>,\\n\\n}\\n\\n\\n\\n/// State for discovering and managing our dependencies, which may vary\\n\\n/// depending on the framework that we're using to discover them.\\n\\n///\\n\\n/// The basic gameplan is that we probe our dependencies to check that they're\\n\\n/// available and pull out the C/C++ include directories; then we emit info\\n\\n/// for building our C/C++ libraries; then we emit info for our dependencies.\\n\\n/// Building stuff pretty much always requires some level of hackery, though,\\n\\n/// so we don't try to be purist about the details.\\n\",\n \"file_path\": \"engine/build.rs\",\n \"rank\": 24,\n \"score\": 87468.12953099453\n },\n {\n \"content\": \"struct TestCase {\\n\\n stem: String,\\n\\n expected_result: Result<TexResult>,\\n\\n check_synctex: bool,\\n\\n check_pdf: bool,\\n\\n extra_io: Vec<Box<dyn IoProvider>>,\\n\\n}\\n\\n\\n\\nimpl TestCase {\\n\\n fn new(stem: &str) -> Self {\\n\\n TestCase {\\n\\n stem: stem.to_owned(),\\n\\n expected_result: Ok(TexResult::Spotless),\\n\\n check_synctex: false,\\n\\n check_pdf: false,\\n\\n extra_io: Vec::new(),\\n\\n }\\n\\n }\\n\\n\\n\\n fn check_synctex(&mut self, check_synctex: bool) -> &mut Self {\\n\",\n \"file_path\": \"tests/tex-outputs.rs\",\n \"rank\": 25,\n \"score\": 87461.3050429533\n },\n {\n \"content\": \"struct Colordef {\\n\\n key: &'static str,\\n\\n color: PdfColor,\\n\\n}\\n\\n\\n\\nimpl Colordef {\\n\\n const fn new(key: &'static str, color: PdfColor) -> Self {\\n\\n Colordef { key, color }\\n\\n }\\n\\n}\\n\\n\\n\\nconst COLORDEFS: [Colordef; 68] = [\\n\\n Colordef::new(\\\"GreenYellow\\\", PdfColor::Cmyk(0.15, 0.0, 0.69, 0.0)),\\n\\n Colordef::new(\\\"Yellow\\\", PdfColor::Cmyk(0.0, 0.0, 1.0, 0.0)),\\n\\n Colordef::new(\\\"Goldenrod\\\", PdfColor::Cmyk(0.0, 0.1, 0.84, 0.0)),\\n\\n Colordef::new(\\\"Dandelion\\\", PdfColor::Cmyk(0.0, 0.29, 0.84, 0.0)),\\n\\n Colordef::new(\\\"Apricot\\\", PdfColor::Cmyk(0.0, 0.32, 0.52, 0.0)),\\n\\n Colordef::new(\\\"Peach\\\", PdfColor::Cmyk(0.0, 0.5, 0.7, 0.0)),\\n\\n Colordef::new(\\\"Melon\\\", PdfColor::Cmyk(0.0, 0.46, 0.5, 0.0)),\\n\\n Colordef::new(\\\"YellowOrange\\\", PdfColor::Cmyk(0.0, 0.42, 1.0, 0.0)),\\n\",\n \"file_path\": \"dpx/src/specials/util.rs\",\n \"rank\": 26,\n \"score\": 87461.3050429533\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct PkgConfigState {\\n\\n libs: pkg_config::Library,\\n\\n}\\n\\n\\n\\n// Need a way to check that the vcpkg harfbuzz port has graphite2 and icu options enabled.\\n\\n#[cfg(not(target_os = \\\"macos\\\"))]\\n\\nconst VCPKG_LIBS: &[&'static str] = &[\\\"fontconfig\\\", \\\"harfbuzz\\\", \\\"freetype\\\", \\\"graphite2\\\"];\\n\\n\\n\\n#[cfg(target_os = \\\"macos\\\")]\\n\\nconst VCPKG_LIBS: &[&'static str] = &[\\\"harfbuzz\\\", \\\"freetype\\\", \\\"graphite2\\\"];\\n\\n\\n\\n/// Build-script state when using vcpkg as the backend.\\n\",\n \"file_path\": \"engine/build.rs\",\n \"rank\": 27,\n \"score\": 87461.3050429533\n },\n {\n \"content\": \"#[derive(Copy, Clone)]\\n\\n#[repr(C, packed(2))]\\n\\nstruct FixedPoint {\\n\\n x: Fixed,\\n\\n y: Fixed,\\n\\n}\\n\\n\\n\\npub type str_number = int32_t;\\n\\n/* tectonic/core-strutils.h: miscellaneous C string utilities\\n\\n Copyright 2016-2018 the Tectonic Project\\n\\n Licensed under the MIT License.\\n\\n*/\\n\\n/* Note that we explicitly do *not* change this on Windows. For maximum\\n\\n * portability, we should probably accept *either* forward or backward slashes\\n\\n * as directory separators. */\\n\\nuse crate::{streq_ptr, strstartswith};\\n\\n/* ***************************************************************************\\\\\\n\\n Part of the XeTeX typesetting system\\n\\n Copyright (c) 1994-2008 by SIL International\\n\\n Copyright (c) 2009 by Jonathan Kew\\n\\n Copyright (c) 2012, 2013 by Jiang Jiang\\n\\n Copyright (c) 2012-2015 by Khaled Hosny\\n\",\n \"file_path\": \"engine/src/xetex_aatfont.rs\",\n \"rank\": 28,\n \"score\": 85981.87260048195\n },\n {\n \"content\": \"#[derive(Clone, Copy, Debug)]\\n\\nstruct FileInfo {\\n\\n offset: u64,\\n\\n length: u64,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/io/cached_itarbundle.rs\",\n \"rank\": 29,\n \"score\": 85975.570205366\n },\n {\n \"content\": \"#[derive(Clone, Debug)]\\n\\nstruct CacheContent {\\n\\n digest_text: String,\\n\\n redirect_url: String,\\n\\n index: HashMap<String, FileInfo>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/io/cached_itarbundle.rs\",\n \"rank\": 30,\n \"score\": 85968.85934645252\n },\n {\n \"content\": \"#[repr(C)]\\n\\nstruct TectonicBridgeApi {\\n\\n context: *const libc::c_void,\\n\\n issue_warning: *const libc::c_void,\\n\\n issue_error: *const libc::c_void,\\n\\n get_file_md5: *const libc::c_void,\\n\\n get_data_md5: *const libc::c_void,\\n\\n output_open: *const libc::c_void,\\n\\n output_open_stdout: *const libc::c_void,\\n\\n output_putc: *const libc::c_void,\\n\\n output_write: *const libc::c_void,\\n\\n output_flush: *const libc::c_void,\\n\\n output_close: *const libc::c_void,\\n\\n input_open: *const libc::c_void,\\n\\n input_open_primary: *const libc::c_void,\\n\\n input_get_size: *const libc::c_void,\\n\\n input_seek: *const libc::c_void,\\n\\n input_read: *const libc::c_void,\\n\\n input_getc: *const libc::c_void,\\n\\n input_ungetc: *const libc::c_void,\\n\\n input_close: *const libc::c_void,\\n\",\n \"file_path\": \"src/engines/mod.rs\",\n \"rank\": 31,\n \"score\": 85968.71472211597\n },\n {\n \"content\": \"struct TarIndexService {\\n\\n tar_index: Mutex<TarIndex>,\\n\\n requests: Mutex<Vec<TectonicRequest>>,\\n\\n local_addr: Mutex<Option<SocketAddr>>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/cached_itarbundle.rs\",\n \"rank\": 32,\n \"score\": 85962.0348584113\n },\n {\n \"content\": \"struct MemoryIoItem {\\n\\n // TODO: smarter buffering structure than Vec<u8>? E.g., linked list of 4k\\n\\n // chunks or something. In the current scheme reallocations will get\\n\\n // expensive.\\n\\n files: Rc<RefCell<HashMap<OsString, Vec<u8>>>>,\\n\\n name: OsString,\\n\\n state: Cursor<Vec<u8>>,\\n\\n}\\n\\n\\n\\nimpl MemoryIoItem {\\n\\n pub fn new(\\n\\n files: &Rc<RefCell<HashMap<OsString, Vec<u8>>>>,\\n\\n name: &OsStr,\\n\\n truncate: bool,\\n\\n ) -> MemoryIoItem {\\n\\n let cur = match files.borrow_mut().remove(name) {\\n\\n Some(data) => {\\n\\n if truncate {\\n\\n Vec::new()\\n\\n } else {\\n\",\n \"file_path\": \"src/io/memory.rs\",\n \"rank\": 33,\n \"score\": 85962.0348584113\n },\n {\n \"content\": \"/// Build a fake tarindex by concatenating files.\\n\\nstruct TarIndexBuilder {\\n\\n tar: Vec<u8>,\\n\\n index: GzEncoder<Vec<u8>>,\\n\\n /// Map from (offset, length) to file name.\\n\\n map: HashMap<(u64, u64), String>,\\n\\n}\\n\\n\\n\\nimpl TarIndexBuilder {\\n\\n fn new() -> TarIndexBuilder {\\n\\n let tar = Vec::new();\\n\\n let index = GzBuilder::new()\\n\\n .filename(\\\"bundle.tar.index.gz\\\")\\n\\n .write(Vec::new(), flate2::Compression::default());\\n\\n let map = HashMap::new();\\n\\n\\n\\n TarIndexBuilder { tar, index, map }\\n\\n }\\n\\n\\n\\n /// Add a file.\\n\\n fn push(&mut self, name: &str, content: &[u8]) -> &mut Self {\\n\",\n \"file_path\": \"tests/cached_itarbundle.rs\",\n \"rank\": 34,\n \"score\": 85962.0348584113\n },\n {\n \"content\": \"pub trait DefinitelySame {\\n\\n fn definitely_same(&self, other: &Self) -> bool;\\n\\n}\\n\\n\\n\\n// Rust currently thinks that this impl conflicts with the one that we\\n\\n// provide for Result ... I am pretty sure that's not the case since the\\n\\n// Result PartialEq impl requires that T and E be PartialEq too, whereas\\n\\n// our definition works for subtypes that are DefinitelySame but\\n\\n// not PartialEq too.\\n\\n//\\n\\n//impl<T: PartialEq> DefinitelySame for T {\\n\\n// fn definitely_same(&self, other: &T) -> bool {\\n\\n// self == other\\n\\n// }\\n\\n//}\\n\\n\\n\\nimpl DefinitelySame for ErrorKind {\\n\\n fn definitely_same(&self, other: &Self) -> bool {\\n\\n if let ErrorKind::Msg(ref s) = *self {\\n\\n return if let ErrorKind::Msg(ref o) = *other {\\n\",\n \"file_path\": \"src/errors.rs\",\n \"rank\": 35,\n \"score\": 84754.48322091051\n },\n {\n \"content\": \"#[derive(Clone, Copy, Debug)]\\n\\nstruct LocalCacheItem {\\n\\n _length: u64,\\n\\n digest: DigestData,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/io/cached_itarbundle.rs\",\n \"rank\": 36,\n \"score\": 84553.28883610276\n },\n {\n \"content\": \"#[derive(Clone, Debug, Eq, PartialEq)]\\n\\nstruct Error(String);\\n\\n\\n\\nimpl Display for Error {\\n\\n fn fmt(&self, f: &mut Formatter) -> Result<(), FmtError> {\\n\\n write!(f, \\\"{}\\\", self.0)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<io::Error> for Error {\\n\\n fn from(e: io::Error) -> Self {\\n\\n Error(format!(\\\"{}\\\", e)) // note: weirdly, can't use `Self` on this line\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<XdvError> for Error {\\n\\n fn from(e: XdvError) -> Self {\\n\\n Error(format!(\\\"{}\\\", e))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"xdv/examples/xdvdump.rs\",\n \"rank\": 37,\n \"score\": 83327.82565381327\n },\n {\n \"content\": \"type scaled_t = int32_t;\\n\",\n \"file_path\": \"engine/src/xetex_aatfont.rs\",\n \"rank\": 38,\n \"score\": 81909.22529051497\n },\n {\n \"content\": \"/// Types implementing this trait accept events from the XDV parser.\\n\\npub trait XdvEvents {\\n\\n /// An error type returned by the handler functions defined in this trait. It\\n\\n /// must implement `From<XdvError>`.\\n\\n type Error: Debug + From<XdvError>;\\n\\n\\n\\n /// Handle the XDV header\\n\\n #[allow(unused)] // <= prevents underscore-prefixed names from showing up in docs\\n\\n fn handle_header(&mut self, filetype: FileType, comment: &[u8]) -> Result<(), Self::Error> {\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n /// Begin a new page.\\n\\n #[allow(unused)]\\n\\n fn handle_begin_page(\\n\\n &mut self,\\n\\n counters: &[i32],\\n\\n previous_bop: i32,\\n\\n ) -> Result<(), Self::Error> {\\n\\n Ok(())\\n\\n }\\n\",\n \"file_path\": \"xdv/src/lib.rs\",\n \"rank\": 39,\n \"score\": 81679.4689374995\n },\n {\n \"content\": \"pub trait StatusBackend {\\n\\n /// Report a message to the status backend.\\n\\n fn report(&mut self, kind: MessageKind, args: Arguments, err: Option<&Error>);\\n\\n\\n\\n /// Issue a note-level status, idealy highlighting a particular phrase.\\n\\n ///\\n\\n /// This is a bit of a hack. For [`driver::ProcessingSession::run`], I\\n\\n /// like the UX when we issue notes in this style. It's a bit more\\n\\n /// high-level than intended for this trait, but we can provide a nice\\n\\n /// sensible default implementation, so whatever.\\n\\n fn note_highlighted(&mut self, before: &str, highlighted: &str, after: &str) {\\n\\n self.report(\\n\\n MessageKind::Note,\\n\\n format_args!(\\\"{}{}{}\\\", before, highlighted, after),\\n\\n None,\\n\\n )\\n\\n }\\n\\n}\\n\\n\\n\\n/// Report a formatted informational message to the user.\\n\",\n \"file_path\": \"src/status/mod.rs\",\n \"rank\": 40,\n \"score\": 81672.89724579843\n },\n {\n \"content\": \"pub trait Pack {\\n\\n fn pack(&mut self, dest: &mut [u8]) -> usize;\\n\\n}\\n\\n\\n\\n/// Rewrittened cff_index\\n\\n#[derive(Clone)]\\n\\npub struct CffIndex {\\n\\n pub count: u16, // ??\\n\\n pub offsize: c_offsize,\\n\\n pub offset: Vec<l_offset>,\\n\\n pub data: Vec<u8>,\\n\\n}\\n\\nimpl CffIndex {\\n\\n // cff_index_new\\n\\n pub fn new(count: u16) -> Box<Self> {\\n\\n let offset = if count > 0 {\\n\\n let mut offset = vec![0; count as usize + 1];\\n\\n offset[0] = 1;\\n\\n offset\\n\\n } else {\\n\",\n \"file_path\": \"dpx/src/dpx_cff.rs\",\n \"rank\": 41,\n \"score\": 81672.89724579843\n },\n {\n \"content\": \"pub trait FromBEByteSlice {\\n\\n fn from_be_byte_slice(b: &[u8]) -> Self;\\n\\n}\\n\\nimpl FromBEByteSlice for u32 {\\n\\n fn from_be_byte_slice(b: &[u8]) -> Self {\\n\\n let mut dst: [u8; 4] = unsafe { MaybeUninit::uninit().assume_init() };\\n\\n dst.copy_from_slice(b);\\n\\n u32::from_be_bytes(dst)\\n\\n }\\n\\n}\\n\\nimpl FromBEByteSlice for u16 {\\n\\n fn from_be_byte_slice(b: &[u8]) -> Self {\\n\\n let mut dst: [u8; 2] = unsafe { MaybeUninit::uninit().assume_init() };\\n\\n dst.copy_from_slice(b);\\n\\n u16::from_be_bytes(dst)\\n\\n }\\n\\n}\\n\\n\\n\\npub mod dpx_agl;\\n\\npub mod dpx_bmpimage;\\n\",\n \"file_path\": \"dpx/src/lib.rs\",\n \"rank\": 42,\n \"score\": 81672.89724579843\n },\n {\n \"content\": \"type Fract = SInt32;\\n\",\n \"file_path\": \"engine/src/xetex_aatfont.rs\",\n \"rank\": 43,\n \"score\": 80486.84197972206\n },\n {\n \"content\": \"type Fixed = SInt32;\\n\",\n \"file_path\": \"engine/src/xetex_aatfont.rs\",\n \"rank\": 44,\n \"score\": 80486.84197972206\n },\n {\n \"content\": \"/// Set the magic environment variable that enables the testing infrastructure\\n\\n/// embedded in the main Tectonic crate. This function is separated out from\\n\\n/// the main crate because it embeds `CARGO_MANIFEST_DIR`, which is not\\n\\n/// something we want to leak into the binary artifacts we produce.\\n\\npub fn set_test_root() {\\n\\n ::tectonic::test_util::set_test_root_augmented(env!(\\\"CARGO_MANIFEST_DIR\\\"));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/util/mod.rs\",\n \"rank\": 45,\n \"score\": 80250.78582870727\n },\n {\n \"content\": \"pub trait FromLEByteSlice {\\n\\n fn from_le_byte_slice(b: &[u8]) -> Self;\\n\\n}\\n\\nimpl FromLEByteSlice for u32 {\\n\\n fn from_le_byte_slice(b: &[u8]) -> Self {\\n\\n let mut dst: [u8; 4] = unsafe { MaybeUninit::uninit().assume_init() };\\n\\n dst.copy_from_slice(b);\\n\\n u32::from_le_bytes(dst)\\n\\n }\\n\\n}\\n\\nimpl FromLEByteSlice for u16 {\\n\\n fn from_le_byte_slice(b: &[u8]) -> Self {\\n\\n let mut dst: [u8; 2] = unsafe { MaybeUninit::uninit().assume_init() };\\n\\n dst.copy_from_slice(b);\\n\\n u16::from_le_bytes(dst)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"dpx/src/lib.rs\",\n \"rank\": 46,\n \"score\": 80250.78582870727\n },\n {\n \"content\": \"pub trait IoEventBackend {\\n\\n /// This function is called when a file is opened for output.\\n\\n fn output_opened(&mut self, _name: &OsStr) {}\\n\\n\\n\\n /// This function is called when the wrapped \\\"standard output\\\"\\n\\n /// (\\\"console\\\", \\\"terminal\\\") stream is opened.\\n\\n fn stdout_opened(&mut self) {}\\n\\n\\n\\n /// This function is called when an output file is closed. The \\\"digest\\\"\\n\\n /// argument specifies the cryptographic digest of the data that were\\n\\n /// written. Note that this function takes ownership of the name and\\n\\n /// digest.\\n\\n fn output_closed(&mut self, _name: OsString, _digest: DigestData) {}\\n\\n\\n\\n /// This function is called when a file is opened for input.\\n\\n fn input_opened(&mut self, _name: &OsStr, _origin: InputOrigin) {}\\n\\n\\n\\n /// This function is called when the \\\"primary input\\\" stream is opened.\\n\\n fn primary_input_opened(&mut self, _origin: InputOrigin) {}\\n\\n\\n\",\n \"file_path\": \"src/engines/mod.rs\",\n \"rank\": 47,\n \"score\": 80250.78582870727\n },\n {\n \"content\": \"struct State<'a, 'b: 'a> {\\n\\n outname: String,\\n\\n io: &'a mut IoStack<'b>,\\n\\n events: &'a mut dyn IoEventBackend,\\n\\n status: &'a mut dyn StatusBackend,\\n\\n cur_output: Option<OutputHandle>,\\n\\n warned_lost_chars: bool,\\n\\n buf: Vec<u8>,\\n\\n}\\n\\n\\n\\nimpl<'a, 'b: 'a> State<'a, 'b> {\\n\\n pub fn new(\\n\\n outname: String,\\n\\n io: &'a mut IoStack<'b>,\\n\\n events: &'a mut dyn IoEventBackend,\\n\\n status: &'a mut dyn StatusBackend,\\n\\n ) -> Self {\\n\\n Self {\\n\\n outname,\\n\\n io,\\n\\n events,\\n\\n status,\\n\\n cur_output: None,\\n\\n warned_lost_chars: false,\\n\\n buf: Vec::new(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/engines/spx2html.rs\",\n \"rank\": 48,\n \"score\": 79270.91186823834\n },\n {\n \"content\": \"/// Activate this crate's \\\"test mode\\\", if-and-only-if the magic testing\\n\\n/// environment variable has been set. This allows testing of the Tectonic\\n\\n/// executable in a transparent way — notably, we avoid embedding the build\\n\\n/// prefix in the resulting binary, and we don't need to pass it any magical\\n\\n/// command line arguments.\\n\\npub fn maybe_activate_test_mode() {\\n\\n if env::var_os(TEST_ROOT_ENV_VAR).is_none() {\\n\\n return;\\n\\n }\\n\\n\\n\\n crate::config::activate_config_test_mode(true);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test_util.rs\",\n \"rank\": 49,\n \"score\": 78905.63864394772\n },\n {\n \"content\": \"pub fn create() -> DigestComputer {\\n\\n Default::default()\\n\\n}\\n\\n\\n\\n#[derive(Copy, Clone, Debug, Eq, PartialEq)]\\n\\npub struct DigestData([u8; N_BYTES]);\\n\\n\\n\\nimpl DigestData {\\n\\n pub fn zeros() -> DigestData {\\n\\n DigestData([0u8; N_BYTES])\\n\\n }\\n\\n\\n\\n pub fn of_nothing() -> DigestData {\\n\\n let dc = create();\\n\\n Self::from(dc)\\n\\n }\\n\\n\\n\\n /// Given a base path, create a child path from this digest's value. The\\n\\n /// child path has a subdirectory from the hex value of the first byte of\\n\\n /// the digest, then a name consisting of the rest of the hex data. **The\\n\",\n \"file_path\": \"src/digest.rs\",\n \"rank\": 50,\n \"score\": 78537.45326715318\n },\n {\n \"content\": \"pub fn _dpx_ensure_output_handle() {\\n\\n if let Some(handle) = unsafe { ttstub_output_open_stdout() } {\\n\\n unsafe {\\n\\n _dpx_message_handle = Some(handle);\\n\\n }\\n\\n } else {\\n\\n panic!(\\\"xdvipdfmx cannot get output logging handle?!\\\");\\n\\n }\\n\\n}\\n\\nunsafe extern \\\"C\\\" fn _dpx_print_to_stdout(\\n\\n mut fmt: *const i8,\\n\\n mut argp: ::std::ffi::VaList,\\n\\n mut warn: bool,\\n\\n) {\\n\\n let mut n: i32 = 0;\\n\\n n = vsnprintf(\\n\\n _dpx_message_buf.as_mut_ptr() as *mut i8,\\n\\n ::std::mem::size_of::<[i8; 1024]>() as u64,\\n\\n fmt,\\n\\n argp.as_va_list(),\\n\",\n \"file_path\": \"dpx/src/dpx_error.rs\",\n \"rank\": 51,\n \"score\": 77614.94246745805\n },\n {\n \"content\": \"type int32_t = libc::c_int;\\n\",\n \"file_path\": \"engine/src/xetex_aatfont.rs\",\n \"rank\": 52,\n \"score\": 77324.47034007822\n },\n {\n \"content\": \"type uint16_t = libc::c_ushort;\\n\\npub type Boolean = libc::c_uchar;\\n\",\n \"file_path\": \"engine/src/xetex_aatfont.rs\",\n \"rank\": 53,\n \"score\": 77324.47034007822\n },\n {\n \"content\": \"/// A special IoProvider that can make TeX format files.\\n\\n///\\n\\n/// A “bundle” is expected to contain a large number of TeX support files —\\n\\n/// for instance, a compilation of a TeXLive distribution. In terms of the\\n\\n/// software architecture, though, what is special about a bundle is that one\\n\\n/// can generate one or more TeX format files from its contents without\\n\\n/// reference to any other I/O resources.\\n\\npub trait Bundle: IoProvider {\\n\\n /// Get a cryptographic digest summarizing this bundle’s contents.\\n\\n ///\\n\\n /// The digest summarizes the exact contents of every file in the bundle.\\n\\n /// It is computed from the sorted names and SHA256 digests of the\\n\\n /// component files [as implemented in the script\\n\\n /// builder/make-zipfile.py](https://github.com/tectonic-typesetting/tectonic-staging/blob/master/builder/make-zipfile.py#L138)\\n\\n /// in the `tectonic-staging` module.\\n\\n ///\\n\\n /// The default implementation gets the digest from a file name\\n\\n /// `SHA256SUM`, which is expected to contain the digest in hex-encoded\\n\\n /// format.\\n\\n fn get_digest(&mut self, status: &mut dyn StatusBackend) -> Result<DigestData> {\\n\\n let digest_text = match self.input_open_name(OsStr::new(digest::DIGEST_NAME), status) {\\n\\n OpenResult::Ok(h) => {\\n\\n let mut text = String::new();\\n\\n h.take(64).read_to_string(&mut text)?;\\n\\n text\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/io/mod.rs\",\n \"rank\": 54,\n \"score\": 77136.61860455177\n },\n {\n \"content\": \"pub trait InputFeatures: Read {\\n\\n fn get_size(&mut self) -> Result<usize>;\\n\\n fn try_seek(&mut self, pos: SeekFrom) -> Result<u64>;\\n\\n}\\n\\n\\n\\n/// What kind of source an input file ultimately came from. We keep track of\\n\\n/// this in order to be able to emit Makefile-style dependencies for input\\n\\n/// files. Right now, we only provide enough options to achieve this goal; we\\n\\n/// could add more.\\n\\n#[derive(Clone, Copy, Debug, Eq, PartialEq)]\\n\\npub enum InputOrigin {\\n\\n /// This file lives on the filesystem and might change under us. (That is\\n\\n /// it is not a cached bundle file.)\\n\\n Filesystem,\\n\\n\\n\\n /// This file was never used as an input.\\n\\n NotInput,\\n\\n\\n\\n /// This file is none of the above.\\n\\n Other,\\n\",\n \"file_path\": \"src/io/mod.rs\",\n \"rank\": 55,\n \"score\": 77115.34185006203\n },\n {\n \"content\": \"type UInt32 = libc::c_uint;\\n\",\n \"file_path\": \"engine/src/xetex_aatfont.rs\",\n \"rank\": 56,\n \"score\": 75973.29923336842\n },\n {\n \"content\": \"type SInt32 = libc::c_int;\\n\\n\\n\",\n \"file_path\": \"engine/src/xetex_aatfont.rs\",\n \"rank\": 57,\n \"score\": 75973.29923336842\n },\n {\n \"content\": \"// Duplicated from Cargo's own testing code:\\n\\n// https://github.com/rust-lang/cargo/blob/19fdb308/tests/cargotest/support/mod.rs#L305-L318\\n\\npub fn cargo_dir() -> PathBuf {\\n\\n env::var_os(\\\"CARGO_BIN_PATH\\\")\\n\\n .map(PathBuf::from)\\n\\n .or_else(|| {\\n\\n env::current_exe().ok().map(|mut path| {\\n\\n path.pop();\\n\\n if path.ends_with(\\\"deps\\\") {\\n\\n path.pop();\\n\\n }\\n\\n path\\n\\n })\\n\\n })\\n\\n .unwrap_or_else(|| panic!(\\\"CARGO_BIN_PATH wasn't set. Cannot continue running test\\\"))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/util/mod.rs\",\n \"rank\": 58,\n \"score\": 75764.42902458424\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct Cursor<'a, T: XdvEvents> {\\n\\n /// The *remaining* unprocessed bytes.\\n\\n buf: &'a [u8],\\n\\n\\n\\n /// How many bytes from the *original* chunk buffer have been fully processed.\\n\\n pub checkpoint: usize,\\n\\n\\n\\n /// How many bytes from the *original* chunk buffer we have looked at.\\n\\n offset: usize,\\n\\n\\n\\n /// The offset into the *total stream* that the original chunk buffer was\\n\\n /// at.\\n\\n global_offset: u64,\\n\\n\\n\\n /// Helps us avoid tedious type annotations.\\n\\n _events: PhantomData<T>,\\n\\n}\\n\\n\\n\\nimpl<'a, T: XdvEvents> Cursor<'a, T> {\\n\\n pub fn new(buf: &'a [u8], global_offset: u64) -> Self {\\n\",\n \"file_path\": \"xdv/src/lib.rs\",\n \"rank\": 59,\n \"score\": 74766.67625297813\n },\n {\n \"content\": \"pub trait Warn<E>: Sized {}\\n\\n\\n\",\n \"file_path\": \"dpx/src/lib.rs\",\n \"rank\": 60,\n \"score\": 74648.21218617905\n },\n {\n \"content\": \"fn is_smallcap(glyphname: &[u8]) -> bool {\\n\\n if glyphname.is_empty() {\\n\\n return false;\\n\\n }\\n\\n let len = glyphname.len();\\n\\n if len < 6 || glyphname.ends_with(b\\\"small\\\") {\\n\\n return false;\\n\\n }\\n\\n let len = len - 5;\\n\\n let p = &glyphname[..len];\\n\\n let (p, slen) = skip_modifier(p);\\n\\n if slen == len {\\n\\n return true;\\n\\n } else {\\n\\n if slen > 0 {\\n\\n /* ??? */\\n\\n return false;\\n\\n }\\n\\n }\\n\\n let (mut p, slen) = skip_capital(p);\\n\",\n \"file_path\": \"dpx/src/dpx_agl.rs\",\n \"rank\": 61,\n \"score\": 73541.95579379864\n },\n {\n \"content\": \"struct ExecutionState<'a, I: 'a + IoProvider> {\\n\\n io: &'a mut I,\\n\\n events: &'a mut dyn IoEventBackend,\\n\\n status: &'a mut dyn StatusBackend,\\n\\n #[allow(clippy::vec_box)]\\n\\n input_handles: Vec<Box<InputHandle>>,\\n\\n #[allow(clippy::vec_box)]\\n\\n output_handles: Vec<Box<OutputHandle>>,\\n\\n}\\n\\n\\n\\nimpl<'a, I: 'a + IoProvider> ExecutionState<'a, I> {\\n\\n pub fn new(\\n\\n io: &'a mut I,\\n\\n events: &'a mut dyn IoEventBackend,\\n\\n status: &'a mut dyn StatusBackend,\\n\\n ) -> ExecutionState<'a, I> {\\n\\n ExecutionState {\\n\\n io,\\n\\n events,\\n\\n status,\\n\",\n \"file_path\": \"src/engines/mod.rs\",\n \"rank\": 62,\n \"score\": 72763.97678490198\n },\n {\n \"content\": \"#[doc(hidden)]\\n\\npub fn activate_config_test_mode(forced: bool) {\\n\\n CONFIG_TEST_MODE_ACTIVATED.store(forced, Ordering::SeqCst);\\n\\n}\\n\\n\\n\\n#[cfg_attr(feature = \\\"serde\\\", derive(Deserialize, Serialize))]\\n\\npub struct PersistentConfig {\\n\\n default_bundles: Vec<BundleInfo>,\\n\\n}\\n\\n\\n\\n#[cfg_attr(feature = \\\"serde\\\", derive(Deserialize, Serialize))]\\n\\npub struct BundleInfo {\\n\\n url: String,\\n\\n}\\n\\n\\n\\nimpl PersistentConfig {\\n\\n #[cfg(feature = \\\"serialization\\\")]\\n\\n /// Open the per-user configuration file.\\n\\n ///\\n\\n /// This file is stored in TOML format. If the configuration file does not\\n\\n /// exist, no error is signaled — instead, a basic default configuration\\n\",\n \"file_path\": \"src/config.rs\",\n \"rank\": 63,\n \"score\": 72012.36882492981\n },\n {\n \"content\": \"pub fn user_config() -> Result<PathBuf> {\\n\\n Ok(app_dirs2::app_root(AppDataType::UserConfig, &APP_INFO)?)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/app_dirs.rs\",\n \"rank\": 64,\n \"score\": 72012.36882492981\n },\n {\n \"content\": \"pub fn pdf_dev_get_fixed_point() -> pdf_coord {\\n\\n let mut gss = unsafe { &mut gs_stack };\\n\\n let gs = gss.top();\\n\\n gs.pt_fixee.clone()\\n\\n}\\n\",\n \"file_path\": \"dpx/src/dpx_pdfdraw.rs\",\n \"rank\": 65,\n \"score\": 70975.55919812758\n },\n {\n \"content\": \"/// Generate a plain.fmt file using local files only -- a variety of tests\\n\\n/// need such a file to exist.\\n\\n///\\n\\n/// Note that because tests are run in parallel, this can get quite racy. At\\n\\n/// the moment we just let everybody write and overwrite the file, but we\\n\\n/// could use a locking scheme to get smarter about this.\\n\\npub fn ensure_plain_format() -> Result<PathBuf> {\\n\\n use ::tectonic::engines::NoopIoEventBackend;\\n\\n use ::tectonic::io::{\\n\\n try_open_file, FilesystemIo, FilesystemPrimaryInputIo, IoStack, MemoryIo,\\n\\n };\\n\\n use ::tectonic::status::NoopStatusBackend;\\n\\n use ::tectonic::TexEngine;\\n\\n\\n\\n let fmt_path = test_path(&[\\\"plain.fmt\\\"]);\\n\\n\\n\\n if try_open_file(&fmt_path).is_not_available() {\\n\\n let mut mem = MemoryIo::new(true);\\n\\n\\n\\n let mut assets_dir = test_path(&[\\\"assets\\\"]);\\n\\n let mut fs_support = FilesystemIo::new(&assets_dir, false, false, HashSet::new());\\n\\n\\n\\n assets_dir.push(\\\"plain\\\");\\n\\n assets_dir.set_extension(\\\"tex\\\");\\n\\n let mut fs_primary = FilesystemPrimaryInputIo::new(&assets_dir);\\n\\n\\n\",\n \"file_path\": \"tests/util/mod.rs\",\n \"rank\": 66,\n \"score\": 70806.91468715439\n },\n {\n \"content\": \"pub fn get_user_config() -> Result<PathBuf> {\\n\\n Ok(app_dirs2::get_app_root(AppDataType::UserConfig, &APP_INFO)?)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/app_dirs.rs\",\n \"rank\": 67,\n \"score\": 70788.7016865338\n },\n {\n \"content\": \"/// Similarly, a stunted verion of CliIoEvents.\\n\\nstruct FormatTestEvents(HashMap<OsString, FileSummary>);\\n\\n\\n\\nimpl FormatTestEvents {\\n\\n fn new() -> FormatTestEvents {\\n\\n FormatTestEvents(HashMap::new())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl IoEventBackend for FormatTestEvents {\\n\\n fn output_opened(&mut self, name: &OsStr) {\\n\\n self.0.insert(name.to_os_string(), FileSummary::new());\\n\\n }\\n\\n\\n\\n fn output_closed(&mut self, name: OsString, digest: DigestData) {\\n\\n let summ = self\\n\\n .0\\n\\n .get_mut(&name)\\n\\n .expect(\\\"closing file that wasn't opened?\\\");\\n\\n summ.write_digest = Some(digest);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/formats.rs\",\n \"rank\": 68,\n \"score\": 69739.88195587599\n },\n {\n \"content\": \"/// Obtain a path to a testing resource file. The environment variable whose\\n\\n/// name is stored in the constant `TEST_ROOT_ENV_VAR` must be set to an\\n\\n/// appropriate directory. (Note: `TEST_ROOT_ENV_VAR` is a constant giving the\\n\\n/// *name* of the relevant variable — not the name of the variable itself!)\\n\\npub fn test_path(parts: &[&str]) -> PathBuf {\\n\\n let mut path = PathBuf::from(env::var_os(TEST_ROOT_ENV_VAR).expect(\\n\\n \\\"Tectonic testing infrastructure cannot be used without \\\\\\n\\n setting the magic test-root environment variable\\\",\\n\\n ));\\n\\n path.push(parts.iter().collect::<PathBuf>());\\n\\n path\\n\\n}\\n\\n\\n\\n/// Utility for being able to treat the \\\"assets/\\\" directory as a bundle.\\n\\npub struct TestBundle(FilesystemIo);\\n\\n\\n\\nimpl Default for TestBundle {\\n\\n fn default() -> Self {\\n\\n TestBundle(FilesystemIo::new(\\n\\n &test_path(&[\\\"assets\\\"]),\\n\\n false,\\n\\n false,\\n\\n HashSet::new(),\\n\\n ))\\n\",\n \"file_path\": \"src/test_util.rs\",\n \"rank\": 69,\n \"score\": 68804.24439718413\n },\n {\n \"content\": \"/// Normalize a TeX path in a system independent™ way by stripping any `.`, `..`,\\n\\n/// or extra separators '/' so that it is of the form\\n\\n///\\n\\n/// ```text\\n\\n/// path/to/my/file.txt\\n\\n/// ../../path/to/parent/dir/file.txt\\n\\n/// /absolute/path/to/file.txt\\n\\n/// ```\\n\\n///\\n\\n/// Does not strip whitespace.\\n\\n///\\n\\n/// Returns `None` if the path refers to a parent of the root.\\n\\nfn try_normalize_tex_path(path: &str) -> Option<String> {\\n\\n use std::iter::repeat;\\n\\n if path.is_empty() {\\n\\n return Some(\\\"\\\".into());\\n\\n }\\n\\n let mut r = Vec::new();\\n\\n let mut parent_level = 0;\\n\\n let mut has_root = false;\\n\\n\\n\\n // TODO: We need to handle a prefix on Windows (i.e. \\\"C:\\\").\\n\\n\\n\\n for (i, c) in path.split('/').enumerate() {\\n\\n match c {\\n\\n \\\"\\\" if i == 0 => {\\n\\n has_root = true;\\n\\n r.push(\\\"\\\");\\n\\n }\\n\\n \\\"\\\" | \\\".\\\" => {}\\n\\n \\\"..\\\" => {\\n\\n match r.pop() {\\n\",\n \"file_path\": \"src/io/mod.rs\",\n \"rank\": 70,\n \"score\": 67892.38509119571\n },\n {\n \"content\": \"fn format_to_extension(format: FileFormat) -> Vec<&'static str> {\\n\\n match format {\\n\\n FileFormat::AFM => vec![\\\"afm\\\"],\\n\\n FileFormat::Bib => vec![\\\"bib\\\"],\\n\\n FileFormat::Bst => vec![\\\"bst\\\"],\\n\\n FileFormat::Cmap => vec![\\\"cmap\\\"], /* XXX: kpathsea doesn't define any suffixes for this */\\n\\n FileFormat::Enc => vec![\\\"enc\\\"],\\n\\n FileFormat::Format => vec![\\\"fmt\\\"],\\n\\n FileFormat::FontMap => vec![\\\"map\\\"],\\n\\n FileFormat::MiscFonts => vec![\\\"miscfonts\\\"], /* XXX: no kpathsea suffixes */\\n\\n FileFormat::Ofm => vec![\\\"ofm\\\"],\\n\\n FileFormat::OpenType => vec![\\\"otf\\\", \\\"OTF\\\"],\\n\\n FileFormat::Ovf => vec![\\\"ovf\\\", \\\"vf\\\"],\\n\\n FileFormat::Pict => vec![\\\"pdf\\\", \\\"jpg\\\", \\\"eps\\\", \\\"epsi\\\"], /* XXX: also .eps, .epsi, ... */\\n\\n FileFormat::Pk => vec![\\\"pk\\\"],\\n\\n FileFormat::ProgramData => vec![\\\"programdata\\\"], /* XXX no suffixes */\\n\\n FileFormat::Sfd => vec![\\\"sfd\\\"],\\n\\n FileFormat::Tex => vec![\\\"tex\\\", \\\"sty\\\", \\\"cls\\\", \\\"fd\\\", \\\"aux\\\", \\\"bbl\\\", \\\"def\\\", \\\"clo\\\", \\\"ldf\\\"],\\n\\n FileFormat::TexPsHeader => vec![\\\"pro\\\"],\\n\\n FileFormat::TFM => vec![\\\"tfm\\\"],\\n\\n FileFormat::TrueType => vec![\\\"ttf\\\", \\\"ttc\\\", \\\"TTF\\\", \\\"TTC\\\", \\\"dfont\\\"],\\n\\n FileFormat::Type1 => vec![\\\"pfa\\\", \\\"pfb\\\"],\\n\\n FileFormat::Vf => vec![\\\"vf\\\"],\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/engines/mod.rs\",\n \"rank\": 71,\n \"score\": 66295.44638203162\n },\n {\n \"content\": \"fn c_format_to_rust(format: libc::c_int) -> Option<FileFormat> {\\n\\n match format {\\n\\n 1 => Some(FileFormat::Pk),\\n\\n 3 => Some(FileFormat::TFM),\\n\\n 4 => Some(FileFormat::AFM),\\n\\n 6 => Some(FileFormat::Bib),\\n\\n 7 => Some(FileFormat::Bst),\\n\\n 10 => Some(FileFormat::Format),\\n\\n 11 => Some(FileFormat::FontMap),\\n\\n 20 => Some(FileFormat::Ofm),\\n\\n 23 => Some(FileFormat::Ovf),\\n\\n 25 => Some(FileFormat::Pict),\\n\\n 26 => Some(FileFormat::Tex),\\n\\n 30 => Some(FileFormat::TexPsHeader),\\n\\n 32 => Some(FileFormat::Type1),\\n\\n 33 => Some(FileFormat::Vf),\\n\\n 36 => Some(FileFormat::TrueType),\\n\\n 39 => Some(FileFormat::ProgramData),\\n\\n 40 => Some(FileFormat::ProgramData), // NOTE: kpathsea distinguishes text/binary; we don't\\n\\n 41 => Some(FileFormat::MiscFonts),\\n\\n 44 => Some(FileFormat::Enc),\\n\\n 45 => Some(FileFormat::Cmap),\\n\\n 46 => Some(FileFormat::Sfd),\\n\\n 47 => Some(FileFormat::OpenType),\\n\\n _ => None,\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/engines/mod.rs\",\n \"rank\": 72,\n \"score\": 66228.6934092929\n },\n {\n \"content\": \"class XeTeXFontInst_Mac : public XeTeXFontInst\\n\\n{\\n\\nprotected:\\n\\n\\n\\npublic:\\n\\n XeTeXFontInst_Mac(CTFontDescriptorRef descriptor, float pointSize, int &status);\\n\\n\\n\\n virtual ~XeTeXFontInst_Mac();\\n\\n\\n\\n virtual void initialize(int &status);\\n\\n};\\n\\n*/\\n\\n#[no_mangle]\\n\\npub unsafe extern \\\"C\\\" fn XeTeXFontInst_Mac_create(\\n\\n mut descriptor: CTFontDescriptorRef,\\n\\n mut pointSize: libc::c_float,\\n\\n mut status: *mut libc::c_int,\\n\\n) -> *mut XeTeXFontInst_Mac {\\n\\n let mut value: *mut XeTeXFontInst_Mac =\\n\\n malloc(::std::mem::size_of::<XeTeXFontInst_Mac>() as libc::c_ulong)\\n\\n as *mut XeTeXFontInst_Mac;\\n\\n XeTeXFontInst_Mac_ctor(value, descriptor, pointSize, status);\\n\\n return value;\\n\\n}\\n\",\n \"file_path\": \"engine/src/xetex_font_info_coretext.rs\",\n \"rank\": 73,\n \"score\": 65638.25920252486\n },\n {\n \"content\": \"pub fn user_cache_dir(path: &str) -> Result<PathBuf> {\\n\\n Ok(app_dirs2::app_dir(AppDataType::UserCache, &APP_INFO, path)?)\\n\\n}\\n\",\n \"file_path\": \"src/app_dirs.rs\",\n \"rank\": 74,\n \"score\": 64874.58254361791\n },\n {\n \"content\": \"pub fn get_date_and_time() -> (i32, i32, i32, i32) {\\n\\n use chrono::prelude::*;\\n\\n\\n\\n let tm = Local::now();\\n\\n\\n\\n let year = tm.year();\\n\\n let month = tm.month();\\n\\n let day = tm.day();\\n\\n let minutes = tm.hour() * 60 + tm.minute();\\n\\n\\n\\n (minutes as _, day as _, month as _, year)\\n\\n}\\n\\nunsafe extern \\\"C\\\" fn checkpool_pointer(mut pool_ptr_0: pool_pointer, mut len: size_t) {\\n\\n assert!(\\n\\n !((pool_ptr_0 as u64).wrapping_add(len) >= pool_size as u64),\\n\\n \\\"string pool overflow [{} bytes]\\\",\\n\\n pool_size,\\n\\n );\\n\\n}\\n\\n#[no_mangle]\\n\",\n \"file_path\": \"engine/src/xetex_texmfmp.rs\",\n \"rank\": 75,\n \"score\": 64874.58254361791\n },\n {\n \"content\": \"type InternalResult<T, E> = Result<T, InternalError<E>>;\\n\\n\\n\\nimpl<T: Debug + From<XdvError>> From<T> for InternalError<T> {\\n\\n fn from(e: T) -> Self {\\n\\n InternalError::Other(e)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"xdv/src/lib.rs\",\n \"rank\": 76,\n \"score\": 63641.570567701434\n },\n {\n \"content\": \"fn parse_index_line(line: &str) -> Result<Option<(String, FileInfo)>> {\\n\\n let mut bits = line.split_whitespace();\\n\\n\\n\\n if let (Some(name), Some(offset), Some(length)) = (bits.next(), bits.next(), bits.next()) {\\n\\n Ok(Some((\\n\\n name.to_owned(),\\n\\n FileInfo {\\n\\n offset: offset.parse::<u64>()?,\\n\\n length: length.parse::<u64>()?,\\n\\n },\\n\\n )))\\n\\n } else {\\n\\n // TODO: preserve the warning info or something!\\n\\n Ok(None)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/io/cached_itarbundle.rs\",\n \"rank\": 77,\n \"score\": 61637.398339361396\n },\n {\n \"content\": \"/// A combination of the two above functions. Set the \\\"test root\\\" variable,\\n\\n/// making it such that the testing infrastructure in this module can work;\\n\\n/// and then activate \\\"test mode\\\", such that certain other parts of the crate\\n\\n/// alter their behavior for use in the test environment. This makes for\\n\\n/// convenient doctests — you can secretly run them in the special test setup\\n\\n/// with a one-liner:\\n\\n///\\n\\n/// # tectonic::test_util::activate_test_mode_augmented(env!(\\\"CARGO_MANIFEST_DIR\\\"));\\n\\npub fn activate_test_mode_augmented<V: AsRef<OsStr>>(root: V) {\\n\\n set_test_root_augmented(root);\\n\\n maybe_activate_test_mode();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test_util.rs\",\n \"rank\": 78,\n \"score\": 61421.23130097095\n },\n {\n \"content\": \"/// Set `TEST_ROOT_ENV_VAR` in the current process to the specified value,\\n\\n/// with a path element \\\"tests\\\" appended. If the variable was previously\\n\\n/// unset, this will make it such that `test_path()` and the other pieces of\\n\\n/// testing infrastructure in this module will start working.\\n\\n///\\n\\n/// The peculiar form of this function makes for easy one-liners in the test\\n\\n/// code exploiting the environment variable $CARGO_MANIFEST_DIR.\\n\\npub fn set_test_root_augmented<V: AsRef<OsStr>>(root: V) {\\n\\n let mut root = PathBuf::from(root.as_ref());\\n\\n root.push(\\\"tests\\\");\\n\\n env::set_var(TEST_ROOT_ENV_VAR, root);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test_util.rs\",\n \"rank\": 79,\n \"score\": 61416.07365595036\n },\n {\n \"content\": \"/// A convenience method to provide a better error message when writing to a created file.\\n\\nfn file_create_write<P, F, E>(path: P, write_fn: F) -> Result<()>\\n\\nwhere\\n\\n P: AsRef<Path>,\\n\\n F: FnOnce(&mut File) -> std::result::Result<(), E>,\\n\\n std::result::Result<(), E>: crate::errors::ResultExt<()>,\\n\\n{\\n\\n let path = path.as_ref();\\n\\n let mut f = ctry!(File::create(path); \\\"couldn't open {} for writing\\\",\\n\\n path.display());\\n\\n ctry!(write_fn(&mut f); \\\"couldn't write to {}\\\", path.display());\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/io/cached_itarbundle.rs\",\n \"rank\": 80,\n \"score\": 59228.684173818234\n },\n {\n \"content\": \"/* This is dvipdfmx, an eXtended version of dvipdfm by Mark A. Wicks.\\n\\n\\n\\n Copyright (C) 2002-2016 by Jin-Hwan Cho and Shunsaku Hirata,\\n\\n the dvipdfmx project team.\\n\\n\\n\\n Copyright (C) 1998, 1999 by Mark A. Wicks <mwicks@kettering.edu>\\n\\n\\n\\n This program is free software; you can redistribute it and/or modify\\n\\n it under the terms of the GNU General Public License as published by\\n\\n the Free Software Foundation; either version 2 of the License, or\\n\\n (at your option) any later version.\\n\\n\\n\\n This program is distributed in the hope that it will be useful,\\n\\n but WITHOUT ANY WARRANTY; without even the implied warranty of\\n\\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\\n\\n GNU General Public License for more details.\\n\\n\\n\\n You should have received a copy of the GNU General Public License\\n\\n along with this program; if not, write to the Free Software\\n\\n Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.\\n\",\n \"file_path\": \"dpx/src/specials/dvipdfmx.rs\",\n \"rank\": 81,\n \"score\": 58696.28203413873\n },\n {\n \"content\": \"/* This is dvipdfmx, an eXtended version of dvipdfm by Mark A. Wicks.\\n\\n\\n\\n Copyright (C) 2002-2016 by Jin-Hwan Cho and Shunsaku Hirata,\\n\\n the dvipdfmx project team.\\n\\n\\n\\n Copyright (C) 1998, 1999 by Mark A. Wicks <mwicks@kettering.edu>\\n\\n\\n\\n This program is free software; you can redistribute it and/or modify\\n\\n it under the terms of the GNU General Public License as published by\\n\\n the Free Software Foundation; either version 2 of the License, or\\n\\n (at your option) any later version.\\n\\n\\n\\n This program is distributed in the hope that it will be useful,\\n\\n but WITHOUT ANY WARRANTY; without even the implied warranty of\\n\\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\\n\\n GNU General Public License for more details.\\n\\n\\n\\n You should have received a copy of the GNU General Public License\\n\\n along with this program; if not, write to the Free Software\\n\\n Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.\\n\",\n \"file_path\": \"dpx/src/dpx_dvipdfmx.rs\",\n \"rank\": 82,\n \"score\": 58696.28203413873\n },\n {\n \"content\": \"fn cache_dir(path: &str, custom_cache_root: Option<&Path>) -> Result<PathBuf> {\\n\\n if let Some(root) = custom_cache_root {\\n\\n if !root.is_dir() {\\n\\n bail!(\\\"Custom cache path {} is not a directory\\\", root.display());\\n\\n }\\n\\n let full_path = root.join(path);\\n\\n ctry!(fs::create_dir_all(&full_path); \\\"failed to create directory {}\\\", full_path.display());\\n\\n Ok(full_path)\\n\\n } else {\\n\\n app_dirs::user_cache_dir(path)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/io/cached_itarbundle.rs\",\n \"rank\": 83,\n \"score\": 58542.215836936506\n },\n {\n \"content\": \" (*pi).name\\n\\n } else {\\n\\n 0 as *const i8\\n\\n })\\n\\n .is_null()\\n\\n {\\n\\n paper_width = if !pi.is_null() && !(*pi).name.is_null() {\\n\\n (*pi).pswidth\\n\\n } else {\\n\\n 0.0f64\\n\\n };\\n\\n paper_height = if !pi.is_null() && !(*pi).name.is_null() {\\n\\n (*pi).psheight\\n\\n } else {\\n\\n 0.0f64\\n\\n }\\n\\n } else {\\n\\n let mut p: *const i8 = paperspec;\\n\\n let mut endptr: *const i8 = 0 as *const i8;\\n\\n let mut comma: *const i8 = 0 as *const i8;\\n\",\n \"file_path\": \"dpx/src/dpx_dvipdfmx.rs\",\n \"rank\": 84,\n \"score\": 58519.54982452946\n },\n {\n \"content\": \"*/\\n\\n#![allow(\\n\\n unused_mut\\n\\n)]\\n\\n\\n\\nuse std::ffi::CStr;\\n\\n\\n\\nuse super::{spc_arg, spc_env, SpcHandler};\\n\\nuse crate::dpx_dpxutil::parse_c_ident;\\n\\nuse crate::dpx_pdfparse::skip_white;\\n\\nuse crate::spc_warn;\\n\\nuse libc::{free, memcmp, strlen};\\n\\n\\n\\npub type size_t = u64;\\n\\n\\n\\n/* tectonic/core-strutils.h: miscellaneous C string utilities\\n\\n Copyright 2016-2018 the Tectonic Project\\n\\n Licensed under the MIT License.\\n\\n*/\\n\\n/* Note that we explicitly do *not* change this on Windows. For maximum\\n\",\n \"file_path\": \"dpx/src/specials/dvipdfmx.rs\",\n \"rank\": 85,\n \"score\": 58514.589275275495\n },\n {\n \"content\": \"/* Encryption */\\n\\nstatic mut do_encryption: i32 = 0i32;\\n\\nstatic mut key_bits: i32 = 40i32;\\n\\nstatic mut permission: i32 = 0x3ci32;\\n\\n/* Page device */\\n\\n#[no_mangle]\\n\\npub static mut paper_width: f64 = 595.0f64;\\n\\n#[no_mangle]\\n\\npub static mut paper_height: f64 = 842.0f64;\\n\\nstatic mut x_offset: f64 = 72.0f64;\\n\\nstatic mut y_offset: f64 = 72.0f64;\\n\\n#[no_mangle]\\n\\npub static mut landscape_mode: i32 = 0i32;\\n\\n#[no_mangle]\\n\\npub static mut always_embed: i32 = 0i32;\\n\\n/* always embed fonts, regardless of licensing flags */\\n\\n/* XXX: there are four quasi-redundant versions of this; grp for K_UNIT__PT */\\n\\nunsafe fn read_length(mut vp: *mut f64, mut pp: *mut *const i8, mut endptr: *const i8) -> i32 {\\n\\n let mut q: *mut i8 = 0 as *mut i8;\\n\\n let mut p: *const i8 = *pp;\\n\",\n \"file_path\": \"dpx/src/dpx_dvipdfmx.rs\",\n \"rank\": 86,\n \"score\": 58514.02583495871\n },\n {\n \"content\": \"use super::dpx_pdfdev::pdf_rect;\\n\\n#[no_mangle]\\n\\npub static mut is_xdv: i32 = 0i32;\\n\\n#[no_mangle]\\n\\npub static mut translate_origin: i32 = 0i32;\\n\\nstatic mut ignore_colors: i8 = 0_i8;\\n\\nstatic mut annot_grow: f64 = 0.0f64;\\n\\nstatic mut bookmark_open: i32 = 0i32;\\n\\nstatic mut mag: f64 = 1.0f64;\\n\\nstatic mut font_dpi: i32 = 600i32;\\n\\n/*\\n\\n * Precision is essentially limited to 0.01pt.\\n\\n * See, dev_set_string() in pdfdev.c.\\n\\n */\\n\\nstatic mut pdfdecimaldigits: i32 = 3i32;\\n\\n/* Image cache life in hours */\\n\\n/* 0 means erase all old images and leave new images */\\n\\n/* -1 means erase all old images and also erase new images */\\n\\n/* -2 means ignore image cache (default) */\\n\\nstatic mut image_cache_life: i32 = -2i32;\\n\",\n \"file_path\": \"dpx/src/dpx_dvipdfmx.rs\",\n \"rank\": 87,\n \"score\": 58508.34799028795\n },\n {\n \"content\": \" warn!(\\\"Unknown unit of measure: {}\\\", CStr::from_ptr(q).display(),);\\n\\n error = -1i32\\n\\n }\\n\\n }\\n\\n free(qq as *mut libc::c_void);\\n\\n } else {\\n\\n warn!(\\\"Missing unit of measure after \\\\\\\"true\\\\\\\"\\\");\\n\\n error = -1i32\\n\\n }\\n\\n }\\n\\n *vp = v * u;\\n\\n *pp = p;\\n\\n error\\n\\n}\\n\\nunsafe fn select_paper(mut paperspec: *const i8) {\\n\\n let mut pi: *const paper = 0 as *const paper;\\n\\n let mut error: i32 = 0i32;\\n\\n pi = paperinfo(paperspec);\\n\\n if !pi.is_null()\\n\\n && !(if !pi.is_null() && !(*pi).name.is_null() {\\n\",\n \"file_path\": \"dpx/src/dpx_dvipdfmx.rs\",\n \"rank\": 88,\n \"score\": 58507.78214729899\n },\n {\n \"content\": \"use super::dpx_pdfencrypt::{pdf_enc_compute_id_string, pdf_enc_set_passwd, pdf_enc_set_verbose};\\n\\nuse super::dpx_pdfobj::{\\n\\n pdf_files_close, pdf_files_init, pdf_get_version, pdf_obj_reset_global_state,\\n\\n pdf_obj_set_verbose, pdf_set_compression, pdf_set_use_predictor, pdf_set_version,\\n\\n};\\n\\nuse super::dpx_tfm::tfm_reset_global_state;\\n\\nuse super::dpx_vf::vf_reset_global_state;\\n\\nuse crate::specials::{\\n\\n spc_exec_at_begin_document, spc_exec_at_end_document, tpic::tpic_set_fill_mode,\\n\\n};\\n\\nuse libc::{atof, atoi, free, memcmp, strchr, strcmp, strlen};\\n\\nuse std::slice::from_raw_parts;\\n\\n\\n\\npub type PageRange = page_range;\\n\\n#[derive(Copy, Clone)]\\n\\n#[repr(C)]\\n\\npub struct page_range {\\n\\n pub first: i32,\\n\\n pub last: i32,\\n\\n}\\n\",\n \"file_path\": \"dpx/src/dpx_dvipdfmx.rs\",\n \"rank\": 89,\n \"score\": 58505.273727888605\n },\n {\n \"content\": \" b\\\"dvipdfmx:\\\\x00\\\" as *const u8 as *const i8 as *const libc::c_void,\\n\\n strlen(b\\\"dvipdfmx:\\\\x00\\\" as *const u8 as *const i8),\\n\\n ) == 0\\n\\n {\\n\\n return true;\\n\\n }\\n\\n false\\n\\n}\\n\\n#[no_mangle]\\n\\npub unsafe extern \\\"C\\\" fn spc_dvipdfmx_setup_handler(\\n\\n mut sph: *mut SpcHandler,\\n\\n mut spe: *mut spc_env,\\n\\n mut ap: *mut spc_arg,\\n\\n) -> i32 {\\n\\n let mut error: i32 = -1i32;\\n\\n assert!(!sph.is_null() && !spe.is_null() && !ap.is_null());\\n\\n skip_white(&mut (*ap).curptr, (*ap).endptr);\\n\\n if (*ap)\\n\\n .curptr\\n\\n .offset(strlen(b\\\"dvipdfmx:\\\\x00\\\" as *const u8 as *const i8) as isize)\\n\",\n \"file_path\": \"dpx/src/specials/dvipdfmx.rs\",\n \"rank\": 90,\n \"score\": 58504.39547206472\n },\n {\n \"content\": \" * portability, we should probably accept *either* forward or backward slashes\\n\\n * as directory separators. */\\n\\n\\n\\nunsafe fn spc_handler_null(mut _spe: *mut spc_env, mut args: *mut spc_arg) -> i32 {\\n\\n (*args).curptr = (*args).endptr;\\n\\n 0i32\\n\\n}\\n\\nconst DVIPDFMX_HANDLERS: [SpcHandler; 1] = [SpcHandler {\\n\\n key: b\\\"config\\\",\\n\\n exec: Some(spc_handler_null),\\n\\n}];\\n\\n\\n\\n#[no_mangle]\\n\\npub unsafe extern \\\"C\\\" fn spc_dvipdfmx_check_special(mut buf: *const i8, mut len: i32) -> bool {\\n\\n let mut p = buf;\\n\\n let endptr = p.offset(len as isize);\\n\\n skip_white(&mut p, endptr);\\n\\n if p.offset(strlen(b\\\"dvipdfmx:\\\\x00\\\" as *const u8 as *const i8) as isize) <= endptr\\n\\n && memcmp(\\n\\n p as *const libc::c_void,\\n\",\n \"file_path\": \"dpx/src/specials/dvipdfmx.rs\",\n \"rank\": 91,\n \"score\": 58504.15807091915\n },\n {\n \"content\": \" pdf_fontmap_set_verbose(verbose as i32);\\n\\n dpx_file_set_verbose(verbose as i32);\\n\\n tt_aux_set_verbose(verbose as i32);\\n\\n }\\n\\n pdf_set_compression(if compress as i32 != 0 { 9i32 } else { 0i32 });\\n\\n pdf_font_set_deterministic_unique_tags(if deterministic_tags as i32 != 0 {\\n\\n 1i32\\n\\n } else {\\n\\n 0i32\\n\\n });\\n\\n system_default();\\n\\n pdf_init_fontmaps();\\n\\n /* We used to read the config file here. It synthesized command-line\\n\\n * arguments, so we emulate the default TeXLive config file by copying those\\n\\n * code bits. */\\n\\n pdf_set_version(5_u32); /* last page */\\n\\n select_paper(b\\\"letter\\\\x00\\\" as *const u8 as *const i8);\\n\\n annot_grow = 0i32 as f64;\\n\\n bookmark_open = 0i32;\\n\\n key_bits = 40i32;\\n\",\n \"file_path\": \"dpx/src/dpx_dvipdfmx.rs\",\n \"rank\": 92,\n \"score\": 58501.51923867286\n },\n {\n \"content\": \" comma = strchr(p, ',' as i32);\\n\\n endptr = p.offset(strlen(p) as isize);\\n\\n if comma.is_null() {\\n\\n panic!(\\n\\n \\\"Unrecognized paper format: {}\\\",\\n\\n CStr::from_ptr(paperspec).display()\\n\\n );\\n\\n }\\n\\n error = read_length(&mut paper_width, &mut p, comma);\\n\\n p = comma.offset(1);\\n\\n error = read_length(&mut paper_height, &mut p, endptr)\\n\\n }\\n\\n if error != 0 || paper_width <= 0.0f64 || paper_height <= 0.0f64 {\\n\\n panic!(\\n\\n \\\"Invalid paper size: {} ({:.2}x{:.2}\\\",\\n\\n CStr::from_ptr(paperspec).display(),\\n\\n paper_width,\\n\\n paper_height,\\n\\n );\\n\\n };\\n\",\n \"file_path\": \"dpx/src/dpx_dvipdfmx.rs\",\n \"rank\": 93,\n \"score\": 58500.99759736816\n },\n {\n \"content\": \" i = i.wrapping_add(1)\\n\\n }\\n\\n if page_count < 1_u32 {\\n\\n panic!(\\\"No pages fall in range!\\\");\\n\\n }\\n\\n spc_exec_at_end_document();\\n\\n}\\n\\n#[no_mangle]\\n\\npub unsafe extern \\\"C\\\" fn dvipdfmx_main(\\n\\n mut pdf_filename: *const i8,\\n\\n mut dvi_filename: *const i8,\\n\\n mut pagespec: *const i8,\\n\\n mut opt_flags: i32,\\n\\n mut translate: bool,\\n\\n mut compress: bool,\\n\\n mut deterministic_tags: bool,\\n\\n mut quiet: bool,\\n\\n mut verbose: u32,\\n\\n) -> i32 {\\n\\n let mut enable_object_stream: bool = true; /* This must come before parsing options... */\\n\",\n \"file_path\": \"dpx/src/dpx_dvipdfmx.rs\",\n \"rank\": 94,\n \"score\": 58500.23733540939\n },\n {\n \"content\": \"/* This is dvipdfmx, an eXtended version of dvipdfm by Mark A. Wicks.\\n\\n\\n\\n Copyright (C) 2002-2016 by Jin-Hwan Cho and Shunsaku Hirata,\\n\\n the dvipdfmx project team.\\n\\n\\n\\n Copyright (C) 1998, 1999 by Mark A. Wicks <mwicks@kettering.edu>\\n\\n\\n\\n This program is free software; you can redistribute it and/or modify\\n\\n it under the terms of the GNU General Public License as published by\\n\\n the Free Software Foundation; either version 2 of the License, or\\n\\n (at your option) any later version.\\n\\n\\n\\n This program is distributed in the hope that it will be useful,\\n\\n but WITHOUT ANY WARRANTY; without even the implied warranty of\\n\\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\\n\\n GNU General Public License for more details.\\n\\n\\n\\n You should have received a copy of the GNU General Public License\\n\\n along with this program; if not, write to the Free Software\\n\\n Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.\\n\",\n \"file_path\": \"dpx/src/dpx_mpost.rs\",\n \"rank\": 95,\n \"score\": 229.4666557578548\n },\n {\n \"content\": \"/* This is dvipdfmx, an eXtended version of dvipdfm by Mark A. Wicks.\\n\\n\\n\\n Copyright (C) 2002-2016 by Jin-Hwan Cho and Shunsaku Hirata,\\n\\n the dvipdfmx project team.\\n\\n\\n\\n Copyright (C) 1998, 1999 by Mark A. Wicks <mwicks@kettering.edu>\\n\\n\\n\\n This program is free software; you can redistribute it and/or modify\\n\\n it under the terms of the GNU General Public License as published by\\n\\n the Free Software Foundation; either version 2 of the License, or\\n\\n (at your option) any later version.\\n\\n\\n\\n This program is distributed in the hope that it will be useful,\\n\\n but WITHOUT ANY WARRANTY; without even the implied warranty of\\n\\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\\n\\n GNU General Public License for more details.\\n\\n\\n\\n You should have received a copy of the GNU General Public License\\n\\n along with this program; if not, write to the Free Software\\n\\n Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.\\n\",\n \"file_path\": \"dpx/src/specials/dvips.rs\",\n \"rank\": 96,\n \"score\": 229.46665575785474\n },\n {\n \"content\": \"/* This is dvipdfmx, an eXtended version of dvipdfm by Mark A. Wicks.\\n\\n\\n\\n Copyright (C) 2002-2016 by Jin-Hwan Cho and Shunsaku Hirata,\\n\\n the dvipdfmx project team.\\n\\n\\n\\n Copyright (C) 1998, 1999 by Mark A. Wicks <mwicks@kettering.edu>\\n\\n\\n\\n This program is free software; you can redistribute it and/or modify\\n\\n it under the terms of the GNU General Public License as published by\\n\\n the Free Software Foundation; either version 2 of the License, or\\n\\n (at your option) any later version.\\n\\n\\n\\n This program is distributed in the hope that it will be useful,\\n\\n but WITHOUT ANY WARRANTY; without even the implied warranty of\\n\\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\\n\\n GNU General Public License for more details.\\n\\n\\n\\n You should have received a copy of the GNU General Public License\\n\\n along with this program; if not, write to the Free Software\\n\\n Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.\\n\",\n \"file_path\": \"dpx/src/dpx_type0.rs\",\n \"rank\": 97,\n \"score\": 229.46665575785465\n },\n {\n \"content\": \"/* This is dvipdfmx, an eXtended version of dvipdfm by Mark A. Wicks.\\n\\n\\n\\n Copyright (C) 2002-2016 by Jin-Hwan Cho and Shunsaku Hirata,\\n\\n the dvipdfmx project team.\\n\\n\\n\\n Copyright (C) 1998, 1999 by Mark A. Wicks <mwicks@kettering.edu>\\n\\n\\n\\n This program is free software; you can redistribute it and/or modify\\n\\n it under the terms of the GNU General Public License as published by\\n\\n the Free Software Foundation; either version 2 of the License, or\\n\\n (at your option) any later version.\\n\\n\\n\\n This program is distributed in the hope that it will be useful,\\n\\n but WITHOUT ANY WARRANTY; without even the implied warranty of\\n\\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\\n\\n GNU General Public License for more details.\\n\\n\\n\\n You should have received a copy of the GNU General Public License\\n\\n along with this program; if not, write to the Free Software\\n\\n Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.\\n\",\n \"file_path\": \"dpx/src/dpx_vf.rs\",\n \"rank\": 98,\n \"score\": 229.46665575785468\n },\n {\n \"content\": \"/* This is dvipdfmx, an eXtended version of dvipdfm by Mark A. Wicks.\\n\\n\\n\\n Copyright (C) 2002-2016 by Jin-Hwan Cho and Shunsaku Hirata,\\n\\n the dvipdfmx project team.\\n\\n\\n\\n Copyright (C) 1998, 1999 by Mark A. Wicks <mwicks@kettering.edu>\\n\\n\\n\\n This program is free software; you can redistribute it and/or modify\\n\\n it under the terms of the GNU General Public License as published by\\n\\n the Free Software Foundation; either version 2 of the License, or\\n\\n (at your option) any later version.\\n\\n\\n\\n This program is distributed in the hope that it will be useful,\\n\\n but WITHOUT ANY WARRANTY; without even the implied warranty of\\n\\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\\n\\n GNU General Public License for more details.\\n\\n\\n\\n You should have received a copy of the GNU General Public License\\n\\n along with this program; if not, write to the Free Software\\n\\n Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.\\n\",\n \"file_path\": \"dpx/src/dpx_otl_conf.rs\",\n \"rank\": 99,\n \"score\": 229.46665575785468\n }\n]","isConversational":false}}},{"rowIdx":1380,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/nal/sei/buffering_period.rs"},"repo_name":{"kind":"string","value":"fkaa/h264-reader"},"commit":{"kind":"string","value":"24bc61f62599ee3d3fe4df7f725a00002ac8d484"},"file_code":{"kind":"string","value":"use super::SeiCompletePayloadReader;\nuse std::marker;\nuse crate::nal::{sps, pps};\nuse crate::rbsp::RbspBitReader;\nuse crate::Context;\nuse crate::nal::sei::HeaderType;\nuse crate::rbsp::RbspBitReaderError;\nuse log::*;\n\n#[derive(Debug)]\nenum BufferingPeriodError {\n ReaderError(RbspBitReaderError),\n UndefinedSeqParamSetId(pps::ParamSetId),\n InvalidSeqParamSetId(pps::ParamSetIdError),\n}\nimpl From<RbspBitReaderError> for BufferingPeriodError {\n fn from(e: RbspBitReaderError) -> Self {\n BufferingPeriodError::ReaderError(e)\n }\n}\nimpl From<pps::ParamSetIdError> for BufferingPeriodError {\n fn from(e: pps::ParamSetIdError) -> Self {\n BufferingPeriodError::InvalidSeqParamSetId(e)\n }\n}\n\n#[derive(Debug, Eq, PartialEq)]\nstruct InitialCpbRemoval {\n initial_cpb_removal_delay: u32,\n initial_cpb_removal_delay_offset: u32,\n}\n\nfn read_cpb_removal_delay_list(r: &mut RbspBitReader<'_>, count: usize, length: u8) -> Result<Vec<InitialCpbRemoval>,RbspBitReaderError> {\n let mut res = vec!();\n for _ in 0..count {\n res.push(InitialCpbRemoval {\n initial_cpb_removal_delay: r.read_u32(length)?,\n initial_cpb_removal_delay_offset: r.read_u32(length)?,\n });\n }\n Ok(res)\n}\n\n#[derive(Debug, Eq, PartialEq)]\nstruct BufferingPeriod {\n nal_hrd_bp: Option<Vec<InitialCpbRemoval>>,\n vcl_hrd_bp: Option<Vec<InitialCpbRemoval>>,\n}\nimpl BufferingPeriod {\n fn read<Ctx>(ctx: &Context<Ctx>, buf: &[u8]) -> Result<BufferingPeriod,BufferingPeriodError> {\n let mut r = RbspBitReader::new(buf);\n let seq_parameter_set_id = pps::ParamSetId::from_u32(r.read_ue_named(\"seq_parameter_set_id\")?)?;\n let sps = ctx.sps_by_id(seq_parameter_set_id)\n .ok_or_else(|| BufferingPeriodError::UndefinedSeqParamSetId(seq_parameter_set_id))?;\n let vui = sps.vui_parameters.as_ref();\n let mut read = |p: &sps::HrdParameters| read_cpb_removal_delay_list(\n &mut r,\n p.cpb_specs.len(),\n p.initial_cpb_removal_delay_length_minus1 + 1,\n );\n let nal_hrd_bp = vui.and_then(|v| v.nal_hrd_parameters.as_ref()).map(&mut read).transpose()?;\n let vcl_hrd_bp = vui.and_then(|v| v.vcl_hrd_parameters.as_ref()).map(&mut read).transpose()?;\n Ok(BufferingPeriod {\n nal_hrd_bp,\n vcl_hrd_bp,\n })\n }\n}\npub struct BufferingPeriodPayloadReader<Ctx> {\n phantom: marker::PhantomData<Ctx>,\n}\nimpl<Ctx> Default for BufferingPeriodPayloadReader<Ctx> {\n fn default() -> Self {\n BufferingPeriodPayloadReader {\n phantom: marker::PhantomData\n }\n }\n}\nimpl<Ctx> SeiCompletePayloadReader for BufferingPeriodPayloadReader<Ctx> {\n type Ctx = Ctx;\n\n fn header(&mut self, ctx: &mut Context<Ctx>, payload_type: HeaderType, buf: &[u8]) {\n assert_eq!(payload_type, HeaderType::BufferingPeriod);\n match BufferingPeriod::read(ctx, buf) {\n Err(e) => error!(\"Failure reading buffering_period: {:?}\", e),\n Ok(buffering_period) => {\n info!(\"TODO: expose buffering_period {:#?}\", buffering_period);\n }\n }\n }\n}\n\n#[cfg(test)]\nmod test {\n use hex_literal::hex;\n\n use super::*;\n\n #[test]\n fn parse() {\n \n \n let mut ctx = Context::default();\n let sps_rbsp = hex!(\"\n 4d 60 15 8d 8d 28 58 9d 08 00 00 0f a0 00 07 53\n 07 00 00 00 92 7c 00 00 12 4f 80 fb dc 18 00 00\n 0f 42 40 00 07 a1 20 7d ee 07 c6 0c 62 60\n \");\n ctx.put_seq_param_set(sps::SeqParameterSet::from_bytes(&sps_rbsp[..]).unwrap());\n\n let payload = &hex!(\"d7 e4 00 00 57 e4 00 00 40\")[..];\n assert_eq!(BufferingPeriod::read(&ctx, payload).unwrap(), BufferingPeriod {\n nal_hrd_bp: Some(vec![\n InitialCpbRemoval {\n initial_cpb_removal_delay: 45_000,\n initial_cpb_removal_delay_offset: 0,\n },\n ]),\n vcl_hrd_bp: Some(vec![\n InitialCpbRemoval {\n initial_cpb_removal_delay: 45_000,\n initial_cpb_removal_delay_offset: 0,\n },\n ]),\n });\n }\n}\n"},"prefix":{"kind":"string","value":"use super::SeiCompletePayloadReader;\nuse std::marker;\nuse crate::nal::{sps, pps};\nuse crate::rbsp::RbspBitReader;\nuse crate::Context;\nuse crate::nal::sei::HeaderType;\nuse crate::rbsp::RbspBitReaderError;\nuse log::*;\n\n#[derive(Debug)]\nenum BufferingPeriodError {\n ReaderError(RbspBitReaderError),\n UndefinedSeqParamSetId(pps::ParamSetId),\n InvalidSeqParamSetId(pps::ParamSetIdError),\n}\nimpl From<RbspBitReaderError> for BufferingPeriodError {\n fn from(e: RbspBitReaderError) -> Self {\n BufferingPeriodError::ReaderError(e)\n }\n}\nimpl From<pps::ParamSetIdError> for BufferingPeriodError {\n fn from(e: pps::ParamSetIdError) -> Self {\n BufferingPeriodError::InvalidSeqParamSetId(e)\n }\n}\n\n#[derive(Debug, Eq, PartialEq)]\nstruct InitialCpbRemoval {\n initial_cpb_removal_delay: u32,\n initial_cpb_removal_delay_offset: u32,\n}\n\nfn read_cpb_removal_delay_list(r: &mut RbspBitReader<'_>, count: usize, length: u8) -> Result<Vec<InitialCpbRemoval>,RbspBitReaderError> {\n let mut res = vec!();\n for _ in 0..count {\n res.push(InitialCpbRemoval {\n initial_cpb_removal_delay: r.read_u32(length)?,\n initial_cpb_removal_delay_offset: r.read_u32(length)?,\n });\n }\n Ok(res)\n}\n\n#[derive(Debug, Eq, PartialEq)]\nstruct BufferingPeriod {\n nal_hrd_bp: Option<Vec<InitialCpbRemoval>>,\n vcl_hrd_bp: Option<Vec<InitialCpbRemoval>>,\n}\nimpl BufferingPeriod {\n fn read<Ctx>(ctx: &Context<Ctx>, buf: &[u8]) -> Result<BufferingPeriod,BufferingPeriodError> {\n let mut r = RbspBitReader::new(buf);\n let seq_parameter_set_id = pps::ParamSetId::from_u32(r.read_ue_named(\"seq_parameter_set_id\")?)?;\n let sps = ctx.sps_by_id(seq_parameter_set_id)\n .ok_or_else(|| BufferingPeriodError::UndefinedSeqParamSetId(seq_parameter_set_id))?;\n let vui = sps.vui_parameters.as_ref();\n let mut read = |p: &sps::HrdParameters| read_cpb_removal_delay_list(\n &mut r,\n p.cpb_specs.len(),\n p.initial_cpb_removal_delay_length_minus1 + 1,\n );\n let nal_hrd_bp = vui.and_then(|v| v.nal_hrd_parameters.as_ref()).map(&mut read).transpose()?;\n let vcl_hrd_bp = vui.and_then(|v| v.vcl_hrd_parameters.as_ref()).map(&mut read).transpose()?;\n Ok(BufferingPeriod {\n nal_hrd_bp,\n vcl_hrd_bp,\n })\n }\n}\npub struct BufferingPeriodPayloadReader<Ctx> {\n phantom: marker::PhantomData<Ctx>,\n}\nimpl<Ctx> Default for BufferingPeriodPayloadReader<Ctx> {\n fn default() -> Self {\n BufferingPeriodPayloadReader {\n phantom: marker::PhantomData\n }\n }\n}\nimpl<Ctx> SeiCompletePayloadReader for BufferingPeriodPayloadReader<Ctx> {\n type Ctx = Ctx;\n\n fn header(&mut self, ctx: &mut Context<Ctx>, payload_type: HeaderType, buf: &[u8]) {\n assert_eq!(payload_type, HeaderType::BufferingPeriod);\n "},"suffix":{"kind":"string","value":"\n }\n}\n\n#[cfg(test)]\nmod test {\n use hex_literal::hex;\n\n use super::*;\n\n #[test]\n fn parse() {\n \n \n let mut ctx = Context::default();\n let sps_rbsp = hex!(\"\n 4d 60 15 8d 8d 28 58 9d 08 00 00 0f a0 00 07 53\n 07 00 00 00 92 7c 00 00 12 4f 80 fb dc 18 00 00\n 0f 42 40 00 07 a1 20 7d ee 07 c6 0c 62 60\n \");\n ctx.put_seq_param_set(sps::SeqParameterSet::from_bytes(&sps_rbsp[..]).unwrap());\n\n let payload = &hex!(\"d7 e4 00 00 57 e4 00 00 40\")[..];\n assert_eq!(BufferingPeriod::read(&ctx, payload).unwrap(), BufferingPeriod {\n nal_hrd_bp: Some(vec![\n InitialCpbRemoval {\n initial_cpb_removal_delay: 45_000,\n initial_cpb_removal_delay_offset: 0,\n },\n ]),\n vcl_hrd_bp: Some(vec![\n InitialCpbRemoval {\n initial_cpb_removal_delay: 45_000,\n initial_cpb_removal_delay_offset: 0,\n },\n ]),\n });\n }\n}\n"},"middle":{"kind":"string","value":"match BufferingPeriod::read(ctx, buf) {\n Err(e) => error!(\"Failure reading buffering_period: {:?}\", e),\n Ok(buffering_period) => {\n info!(\"TODO: expose buffering_period {:#?}\", buffering_period);\n }\n }"},"strategy":{"kind":"string","value":"if_condition"},"context_items":{"kind":"list like","value":[{"content":"fn count_zero_bits<R: BitRead>(r: &mut R, name: &'static str) -> Result<u8, RbspBitReaderError> {\n\n let mut count = 0;\n\n while !r.read_bit()? {\n\n count += 1;\n\n if count > 31 {\n\n return Err(RbspBitReaderError::ExpGolombTooLarge(name));\n\n }\n\n }\n\n Ok(count)\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use std::rc::Rc;\n\n use std::cell::RefCell;\n\n use hex_literal::*;\n\n\n\n struct State {\n\n started: bool,\n","file_path":"src/rbsp.rs","rank":1,"score":131124.25740496398},{"content":"struct ParamSetIter<'buf>(&'buf[u8], UnitType);\n\n\n\nimpl<'buf> ParamSetIter<'buf> {\n\n pub fn new(buf: &'buf[u8], unit_type: UnitType) -> ParamSetIter<'buf> {\n\n ParamSetIter(buf, unit_type)\n\n }\n\n}\n\nimpl<'buf> Iterator for ParamSetIter<'buf>\n\n{\n\n type Item = Result<&'buf[u8], ParamSetError>;\n\n\n\n fn next(&mut self) -> Option<Self::Item> {\n\n if self.0.is_empty() {\n\n None\n\n } else {\n\n let len = u16::from(self.0[0]) << 8 | u16::from(self.0[1]);\n\n let data = &self.0[2..];\n\n let res = match NalHeader::new(data[0]) {\n\n Ok(nal_header) => {\n\n if nal_header.nal_unit_type() == self.1 {\n","file_path":"src/avcc.rs","rank":2,"score":126047.9002822754},{"content":"/// Removes _Emulation Prevention_ from the given byte sequence of a single NAL unit, returning the\n\n/// NAL units _Raw Byte Sequence Payload_ (RBSP). Expects to be called without the NAL header byte.\n\npub fn decode_nal<'a>(nal_unit: &'a [u8]) -> Cow<'a, [u8]> {\n\n struct DecoderState<'b> {\n\n data: Cow<'b, [u8]>,\n\n index: usize,\n\n }\n\n\n\n impl<'b> DecoderState<'b> {\n\n pub fn new(data: Cow<'b, [u8]>) -> Self {\n\n DecoderState { \n\n data,\n\n index: 0,\n\n }\n\n }\n\n }\n\n\n\n impl<'b> NalHandler for DecoderState<'b> {\n\n type Ctx = ();\n\n\n\n fn start(&mut self, _ctx: &mut Context<Self::Ctx>, _header: NalHeader) {}\n\n\n","file_path":"src/rbsp.rs","rank":3,"score":94684.68520967415},{"content":"fn h264_reader(c: &mut Criterion) {\n\n let mut f = File::open(\"big_buck_bunny_1080p.h264\").expect(\"file not found\");\n\n let len = f.metadata().unwrap().len();\n\n let mut buf = vec![0; usize::try_from(len).unwrap()];\n\n f.read(&mut buf[..]).unwrap();\n\n let mut ctx = Context::default();\n\n let nal_handler = NullNalHandler {\n\n start: 0,\n\n push: 0,\n\n end: 0,\n\n };\n\n let rbsp_nal_reader = NullRbspNalReader {\n\n decoder: RbspDecoder::new(nal_handler),\n\n decoder_started: false,\n\n };\n\n let nal_reader = NullNalReader {\n\n start: 0,\n\n push: 0,\n\n end: 0,\n\n };\n","file_path":"benches/bench.rs","rank":4,"score":70504.98575609578},{"content":"fn parse_nal(c: &mut Criterion) {\n\n let sps = hex!(\n\n \"64 00 16 AC 1B 1A 80 B0 3D FF FF\n\n 00 28 00 21 6E 0C 0C 0C 80 00 01\n\n F4 00 00 27 10 74 30 07 D0 00 07\n\n A1 25 DE 5C 68 60 0F A0 00 0F 42\n\n 4B BC B8 50\");\n\n let mut group = c.benchmark_group(\"parse_nal\");\n\n group.bench_function(\"sps\", |b| b.iter(|| SeqParameterSet::from_bytes(&sps[..]).unwrap()));\n\n}\n\n\n\ncriterion_group!(benches, h264_reader, parse_nal);\n\ncriterion_main!(benches);\n","file_path":"benches/bench.rs","rank":5,"score":70504.98575609578},{"content":"#[derive(Debug, PartialEq)]\n\nstruct SliceType {\n\n family: SliceFamily,\n\n exclusive: SliceExclusive,\n\n}\n\nimpl SliceType {\n\n fn from_id(id: u32) -> Result<SliceType, SliceHeaderError> {\n\n match id {\n\n 0 => Ok(SliceType { family: SliceFamily::P, exclusive: SliceExclusive::NonExclusive }),\n\n 1 => Ok(SliceType { family: SliceFamily::B, exclusive: SliceExclusive::NonExclusive }),\n\n 2 => Ok(SliceType { family: SliceFamily::I, exclusive: SliceExclusive::NonExclusive }),\n\n 3 => Ok(SliceType { family: SliceFamily::SP, exclusive: SliceExclusive::NonExclusive }),\n\n 4 => Ok(SliceType { family: SliceFamily::SI, exclusive: SliceExclusive::NonExclusive }),\n\n 5 => Ok(SliceType { family: SliceFamily::P, exclusive: SliceExclusive::Exclusive }),\n\n 6 => Ok(SliceType { family: SliceFamily::B, exclusive: SliceExclusive::Exclusive }),\n\n 7 => Ok(SliceType { family: SliceFamily::I, exclusive: SliceExclusive::Exclusive }),\n\n 8 => Ok(SliceType { family: SliceFamily::SP, exclusive: SliceExclusive::Exclusive }),\n\n 9 => Ok(SliceType { family: SliceFamily::SI, exclusive: SliceExclusive::Exclusive }),\n\n _ => Err(SliceHeaderError::InvalidSliceType(id))\n\n }\n\n }\n","file_path":"src/nal/slice/mod.rs","rank":6,"score":68348.54420211987},{"content":"#[derive(Debug,PartialEq)]\n\nenum PicOrderCountLsb {\n\n Frame(u32),\n\n FieldsAbsolute { top: u32, bottom_delta: i32 },\n\n FieldsDelta([i32; 2]),\n\n}\n\n\n","file_path":"src/nal/slice/mod.rs","rank":7,"score":63611.10520938069},{"content":"pub trait Register: Default {\n\n type Ctx;\n\n fn handle(&mut self, ctx: &mut Context<Self::Ctx>, country_code: ItuTT35, payload: &[u8]);\n\n}\n\n\n\npub struct UserDataRegisteredItuTT35Reader<R: Register> {\n\n register: R,\n\n}\n\nimpl<R: Register> UserDataRegisteredItuTT35Reader<R> {\n\n pub fn new(register: R) -> UserDataRegisteredItuTT35Reader<R> {\n\n UserDataRegisteredItuTT35Reader {\n\n register,\n\n }\n\n }\n\n}\n\nimpl<R: Register> SeiCompletePayloadReader for UserDataRegisteredItuTT35Reader<R> {\n\n type Ctx = R::Ctx;\n\n\n\n fn header(&mut self, ctx: &mut Context<Self::Ctx>, payload_type: HeaderType, buf: &[u8]) {\n\n assert_eq!(payload_type, HeaderType::UserDataRegisteredItuTT35);\n","file_path":"src/nal/sei/user_data_registered_itu_t_t35.rs","rank":8,"score":63384.80617952558},{"content":"struct InUnitState {\n\n /// The number of bytes to backtrack if the current sequence of `0x00`s\n\n /// doesn't end the NAL unit.\n\n backtrack_bytes: usize,\n\n}\n\n\n","file_path":"src/annexb.rs","rank":11,"score":45138.13767259798},{"content":"#[derive(Debug)]\n\nenum ParseState {\n\n Start,\n\n OneZero,\n\n TwoZero,\n\n}\n\n\n\n/// Push parser which removes _emulation prevention_ as it calls\n\n/// an inner [NalHandler]. Expects to be called without the NAL header byte.\n\npub struct RbspDecoder<R>\n\n where\n\n R: NalHandler\n\n{\n\n state: ParseState,\n\n nal_reader: R,\n\n}\n\nimpl<R> RbspDecoder<R>\n\n where\n\n R: NalHandler\n\n{\n\n pub fn new(nal_reader: R) -> Self {\n","file_path":"src/rbsp.rs","rank":12,"score":45138.13767259798},{"content":"#[derive(Debug)]\n\nenum ParseState {\n\n Start,\n\n StartOneZero,\n\n StartTwoZero,\n\n StartOne,\n\n InUnit,\n\n InUnitOneZero,\n\n InUnitTwoZero,\n\n Error,\n\n End,\n\n}\n\nimpl ParseState {\n\n /// If in a NAL unit (`NalReader`'s `start` has been called but not its `end`),\n\n /// returns an object describing the state.\n\n fn in_unit(&self) -> Option<InUnitState> {\n\n match *self {\n\n ParseState::Start => None,\n\n ParseState::StartOneZero => None,\n\n ParseState::StartTwoZero => None,\n\n ParseState::StartOne => None,\n\n ParseState::InUnit => Some(InUnitState { backtrack_bytes: 0 }),\n\n ParseState::InUnitOneZero => Some(InUnitState { backtrack_bytes: 1 }),\n\n ParseState::InUnitTwoZero => Some(InUnitState { backtrack_bytes: 2 }),\n\n ParseState::Error => None,\n\n ParseState::End => None,\n\n }\n\n }\n\n}\n\n\n","file_path":"src/annexb.rs","rank":13,"score":45138.13767259798},{"content":"#[derive(Debug,PartialEq)]\n\nenum Field {\n\n Top,\n\n Bottom,\n\n}\n\n\n","file_path":"src/nal/slice/mod.rs","rank":14,"score":43630.44616959907},{"content":"struct NullNalHandler {\n\n start: u64,\n\n push: u64,\n\n end: u64,\n\n}\n\nimpl NalHandler for NullNalHandler {\n\n type Ctx = ();\n\n\n\n fn start(&mut self, _ctx: &mut Context<Self::Ctx>, _header: NalHeader) {\n\n self.start += 1;\n\n }\n\n\n\n fn push(&mut self, _ctx: &mut Context<Self::Ctx>, _buf: &[u8]) {\n\n self.push += 1;\n\n }\n\n\n\n fn end(&mut self, _ctx: &mut Context<Self::Ctx>) {\n\n self.end += 1;\n\n }\n\n}\n\n\n","file_path":"benches/bench.rs","rank":15,"score":43626.495102454035},{"content":"struct NullNalReader {\n\n start: u64,\n\n push: u64,\n\n end: u64,\n\n}\n\nimpl NalReader for NullNalReader {\n\n type Ctx = ();\n\n\n\n fn start(&mut self, _ctx: &mut Context<Self::Ctx>) {\n\n self.start += 1;\n\n }\n\n fn push(&mut self, _ctx: &mut Context<Self::Ctx>, _buf: &[u8]) {\n\n self.push += 1;\n\n }\n\n fn end(&mut self, _ctx: &mut Context<Self::Ctx>) {\n\n self.end += 1;\n\n }\n\n}\n\n\n","file_path":"benches/bench.rs","rank":16,"score":43626.495102454035},{"content":"#[derive(Default)]\n\nstruct AvcBuilder {\n\n started: bool,\n\n cur: Vec<u8>,\n\n}\n\n\n\nimpl h264_reader::annexb::NalReader for AvcBuilder {\n\n type Ctx = Vec<u8>;\n\n\n\n fn start(&mut self, _ctx: &mut Context<Self::Ctx>) {\n\n assert!(!self.started);\n\n self.started = true;\n\n }\n\n fn push(&mut self, _ctx: &mut Context<Self::Ctx>, buf: &[u8]) {\n\n assert!(self.started);\n\n assert!(!buf.is_empty()); // useless empty push.\n\n self.cur.extend_from_slice(buf);\n\n }\n\n fn end(&mut self, ctx: &mut Context<Self::Ctx>) {\n\n assert!(self.started);\n\n self.started = false;\n","file_path":"fuzz/fuzz_targets/annexb.rs","rank":17,"score":42270.27088462817},{"content":"#[derive(Debug,PartialEq)]\n\nenum SliceFamily {\n\n P,\n\n B,\n\n I,\n\n SP,\n\n SI\n\n}\n","file_path":"src/nal/slice/mod.rs","rank":18,"score":42270.08246166817},{"content":"#[derive(Debug,PartialEq)]\n\nenum FieldPic {\n\n Frame,\n\n Field(Field),\n\n}\n\n\n","file_path":"src/nal/slice/mod.rs","rank":19,"score":42270.08246166817},{"content":"#[derive(Debug,PartialEq)]\n\nenum SliceExclusive {\n\n /// All slices in the picture have the same type\n\n Exclusive,\n\n /// Other slices in the picture may have a different type than the current slice\n\n NonExclusive,\n\n}\n","file_path":"src/nal/slice/mod.rs","rank":20,"score":42270.08246166817},{"content":"#[derive(Debug)]\n\nenum ColourPlane {\n\n /// Indicates the _chroma_ colour plane\n\n Y,\n\n /// Indicates the _blue-difference_ colour plane\n\n Cb,\n\n /// Indicates the _red-difference_ colour plane\n\n Cr,\n\n}\n\n#[derive(Debug)]\n\npub enum ColourPlaneError {\n\n InvalidId(u8),\n\n}\n\nimpl ColourPlane {\n\n fn from_id(id: u8) -> Result<ColourPlane, ColourPlaneError> {\n\n match id {\n\n 0 => Ok(ColourPlane::Y),\n\n 1 => Ok(ColourPlane::Cb),\n\n 2 => Ok(ColourPlane::Cr),\n\n _ => Err(ColourPlaneError::InvalidId(id))\n\n }\n\n }\n\n}\n\n\n","file_path":"src/nal/slice/mod.rs","rank":21,"score":42266.13139452314},{"content":"#[derive(Debug)]\n\nstruct PredWeight {\n\n weight: i32,\n\n offset: i32,\n\n}\n","file_path":"src/nal/slice/mod.rs","rank":22,"score":42266.13139452314},{"content":"#[derive(Debug)]\n\nenum NalSwitchState {\n\n Start,\n\n Handling(UnitType),\n\n Ignoring,\n\n}\n\n// TODO: generate enum at compile time rather than Vec<Box<>>\n\npub struct NalSwitch<Ctx> {\n\n readers_by_id: Vec<Option<Box<RefCell<dyn NalHandler<Ctx=Ctx>>>>>,\n\n state: NalSwitchState,\n\n}\n\nimpl<Ctx> Default for NalSwitch<Ctx> {\n\n fn default() -> Self {\n\n NalSwitch {\n\n readers_by_id: Vec::new(),\n\n state: NalSwitchState::Start,\n\n }\n\n }\n\n}\n\nimpl<Ctx> NalSwitch<Ctx> {\n\n pub fn put_handler(&mut self, unit_type: UnitType, handler: Box<RefCell<dyn NalHandler<Ctx=Ctx>>>) {\n","file_path":"src/nal/mod.rs","rank":23,"score":42266.13139452314},{"content":"#[derive(Debug, Clone)]\n\nstruct PicScalingMatrix {\n\n // TODO\n\n}\n\nimpl PicScalingMatrix {\n\n fn read(r: &mut RbspBitReader<'_>, sps: &sps::SeqParameterSet, transform_8x8_mode_flag: bool) -> Result<Option<PicScalingMatrix>,PpsError> {\n\n let pic_scaling_matrix_present_flag = r.read_bool()?;\n\n Ok(if pic_scaling_matrix_present_flag {\n\n let mut scaling_list4x4 = vec!();\n\n let mut scaling_list8x8 = vec!();\n\n\n\n let count = if transform_8x8_mode_flag {\n\n if sps.chroma_info.chroma_format == sps::ChromaFormat::YUV444 { 12 } else { 8 }\n\n } else {\n\n 0\n\n };\n\n for i in 0..6+count {\n\n let seq_scaling_list_present_flag = r.read_bool()?;\n\n if seq_scaling_list_present_flag {\n\n if i < 6 {\n\n scaling_list4x4.push(sps::ScalingList::read(r, 16).map_err(PpsError::ScalingMatrix)?);\n","file_path":"src/nal/pps.rs","rank":24,"score":42266.13139452314},{"content":"struct NullRbspNalReader {\n\n decoder: RbspDecoder<NullNalHandler>,\n\n decoder_started: bool,\n\n}\n\nimpl NalReader for NullRbspNalReader {\n\n type Ctx = ();\n\n\n\n fn start(&mut self, _ctx: &mut Context<Self::Ctx>) {\n\n assert!(!self.decoder_started);\n\n }\n\n fn push(&mut self, ctx: &mut Context<Self::Ctx>, mut buf: &[u8]) {\n\n if !self.decoder_started && !buf.is_empty() {\n\n let hdr = NalHeader::new(buf[0]).unwrap();\n\n self.decoder.start(ctx, hdr);\n\n buf = &buf[1..];\n\n self.decoder_started = true;\n\n }\n\n if self.decoder_started {\n\n self.decoder.push(ctx, buf);\n\n }\n\n }\n\n fn end(&mut self, ctx: &mut Context<Self::Ctx>) {\n\n assert!(self.decoder_started);\n\n self.decoder.end(ctx);\n\n self.decoder_started = false;\n\n }\n\n}\n\n\n","file_path":"benches/bench.rs","rank":25,"score":42266.13139452314},{"content":"enum ParseState {\n\n Unstarted,\n\n Start(NalHeader),\n\n Continue(NalHeader),\n\n}\n\n\n","file_path":"src/nal/slice/mod.rs","rank":26,"score":42266.13139452314},{"content":"#[derive(Default)]\n\nstruct NalCapture {\n\n buf: Vec<u8>,\n\n}\n\nimpl NalHandler for NalCapture {\n\n type Ctx = ();\n\n\n\n fn start(&mut self, ctx: &mut h264_reader::Context<Self::Ctx>, header: NalHeader) {\n\n self.buf.clear();\n\n }\n\n\n\n fn push(&mut self, ctx: &mut h264_reader::Context<Self::Ctx>, buf: &[u8]) {\n\n self.buf.extend_from_slice(buf);\n\n }\n\n\n\n fn end(&mut self, ctx: &mut h264_reader::Context<Self::Ctx>) {\n\n }\n\n}\n\n\n","file_path":"fuzz/fuzz_targets/fuzz_target_1.rs","rank":27,"score":41039.55916907769},{"content":"#[derive(Debug)]\n\nstruct PredWeightTable {\n\n luma_log2_weight_denom: u32,\n\n chroma_log2_weight_denom: Option<u32>,\n\n luma_weights: Vec<Option<PredWeight>>,\n\n chroma_weights: Vec<Vec<PredWeight>>,\n\n}\n\nimpl PredWeightTable {\n\n fn read(r: &mut RbspBitReader<'_>, slice_type: &SliceType, pps: &pps::PicParameterSet, sps: &sps::SeqParameterSet, num_ref_active: &Option<NumRefIdxActive>) -> Result<PredWeightTable, SliceHeaderError> {\n\n let chroma_array_type = if sps.chroma_info.separate_colour_plane_flag {\n\n // TODO: \"Otherwise (separate_colour_plane_flag is equal to 1), ChromaArrayType is\n\n // set equal to 0.\" ...does this mean ChromaFormat::Monochrome then?\n\n sps::ChromaFormat::Monochrome\n\n } else {\n\n sps.chroma_info.chroma_format\n\n };\n\n let luma_log2_weight_denom = r.read_ue_named(\"luma_log2_weight_denom\")?;\n\n let chroma_log2_weight_denom = if chroma_array_type != sps::ChromaFormat::Monochrome {\n\n Some(r.read_ue_named(\"chroma_log2_weight_denom\")?)\n\n } else {\n\n None\n","file_path":"src/nal/slice/mod.rs","rank":28,"score":41035.41967897267},{"content":"struct InProgressSlice {\n\n header: h264_reader::nal::NalHeader,\n\n buf: Vec<u8>,\n\n}\n","file_path":"fuzz/fuzz_targets/fuzz_target_1.rs","rank":29,"score":41035.41967897267},{"content":"#[derive(Debug)]\n\nenum SeiHeaderState {\n\n Begin,\n\n PayloadType { payload_type: u32 },\n\n PayloadSize { payload_type: HeaderType, payload_size: u32 },\n\n Payload { payload_type: HeaderType, payload_size: u32, consumed_size: u32 },\n\n End,\n\n}\n\n\n","file_path":"src/nal/sei/mod.rs","rank":30,"score":41035.41967897267},{"content":"#[derive(Debug)]\n\nenum ModificationOfPicNums {\n\n Subtract(u32),\n\n Add(u32),\n\n LongTermRef(u32),\n\n}\n","file_path":"src/nal/slice/mod.rs","rank":31,"score":41035.41967897267},{"content":"struct SliceFuzz {\n\n current_slice: Option<InProgressSlice>,\n\n}\n\nimpl SliceFuzz {\n\n pub fn new() -> SliceFuzz {\n\n SliceFuzz {\n\n current_slice: None,\n\n }\n\n }\n\n}\n\nimpl h264_reader::nal::NalHandler for SliceFuzz {\n\n type Ctx = ();\n\n\n\n fn start(&mut self, ctx: &mut h264_reader::Context<Self::Ctx>, header: h264_reader::nal::NalHeader) {\n\n let mut buf = Vec::new();\n\n buf.push(header.into());\n\n self.current_slice = Some(InProgressSlice {\n\n header,\n\n buf,\n\n });\n","file_path":"fuzz/fuzz_targets/fuzz_target_1.rs","rank":32,"score":41035.41967897267},{"content":"pub trait NalReader {\n\n type Ctx;\n\n\n\n /// Starts a NAL unit.\n\n fn start(&mut self, ctx: &mut Context<Self::Ctx>);\n\n\n\n /// Pushes a non-empty buffer as part of a NAL unit.\n\n fn push(&mut self, ctx: &mut Context<Self::Ctx>, buf: &[u8]);\n\n\n\n /// Ends a NAL unit, which could be empty.\n\n fn end(&mut self, ctx: &mut Context<Self::Ctx>);\n\n}\n\n\n\n/// Push parser for Annex B format which delegates to a [NalReader].\n\n///\n\n/// Guarantees that the bytes supplied to `NalReader`—the concatenation of all\n\n/// `buf`s supplied to `NalReader::push`—will be exactly the same for a given\n\n/// Annex B stream, regardless of boundaries of `AnnexBReader::push` calls.\n\npub struct AnnexBReader<R, Ctx>\n\n where\n","file_path":"src/annexb.rs","rank":33,"score":40493.85262945283},{"content":"#[derive(Debug)]\n\nenum DecRefPicMarking {\n\n Idr {\n\n no_output_of_prior_pics_flag: bool,\n\n long_term_reference_flag: bool,\n\n },\n\n /// `adaptive_ref_pic_marking_mode_flag` equal to `0`\n\n SlidingWindow,\n\n /// `adaptive_ref_pic_marking_mode_flag` equal to `1`\n\n Adaptive(Vec<MemoryManagementControlOperation>),\n\n}\n\nimpl DecRefPicMarking {\n\n fn read(r: &mut RbspBitReader<'_>, header: NalHeader) -> Result<DecRefPicMarking, SliceHeaderError> {\n\n Ok(if header.nal_unit_type() == crate::nal::UnitType::SliceLayerWithoutPartitioningIdr {\n\n DecRefPicMarking::Idr {\n\n no_output_of_prior_pics_flag: r.read_bool_named(\"no_output_of_prior_pics_flag\")?,\n\n long_term_reference_flag: r.read_bool_named(\"long_term_reference_flag\")?,\n\n }\n\n } else if r.read_bool_named(\"adaptive_ref_pic_marking_mode_flag\")? {\n\n let mut ctl = vec![];\n\n loop {\n","file_path":"src/nal/slice/mod.rs","rank":35,"score":39916.66795408563},{"content":"#[derive(Debug)]\n\nenum MemoryManagementControlOperation {\n\n /// `memory_management_control_operation` value of `1`\n\n ShortTermUnusedForRef { difference_of_pic_nums_minus1: u32 },\n\n /// `memory_management_control_operation` value of `2`\n\n LongTermUnusedForRef { long_term_pic_num: u32 },\n\n /// `memory_management_control_operation` value of `3`\n\n ShortTermUsedForLongTerm { difference_of_pic_nums_minus1: u32, long_term_frame_idx: u32 },\n\n /// `memory_management_control_operation` value of `4`\n\n MaxUsedLongTermFrameRef { max_long_term_frame_idx_plus1: u32 },\n\n /// `memory_management_control_operation` value of `5`\n\n AllRefPicturesUnused,\n\n /// `memory_management_control_operation` value of `6`\n\n CurrentUsedForLongTerm { long_term_frame_idx: u32 },\n\n}\n\n\n\n/// Decoded reference picture marking\n","file_path":"src/nal/slice/mod.rs","rank":36,"score":39916.66795408563},{"content":"#[derive(Debug)]\n\nenum RefPicListModifications {\n\n I,\n\n P {\n\n ref_pic_list_modification_l0: Vec<ModificationOfPicNums>,\n\n },\n\n B {\n\n ref_pic_list_modification_l0: Vec<ModificationOfPicNums>,\n\n ref_pic_list_modification_l1: Vec<ModificationOfPicNums>,\n\n },\n\n}\n\nimpl RefPicListModifications {\n\n fn read(slice_family: &SliceFamily, r: &mut RbspBitReader<'_>) -> Result<RefPicListModifications, SliceHeaderError> {\n\n Ok(match slice_family {\n\n SliceFamily::I | SliceFamily::SI => RefPicListModifications::I,\n\n SliceFamily::B => RefPicListModifications::B {\n\n ref_pic_list_modification_l0: Self::read_list(r)?,\n\n ref_pic_list_modification_l1: Self::read_list(r)?,\n\n },\n\n SliceFamily::P | SliceFamily::SP => RefPicListModifications::P {\n\n ref_pic_list_modification_l0: Self::read_list(r)?,\n","file_path":"src/nal/slice/mod.rs","rank":37,"score":39916.66795408563},{"content":"struct PicTimingFuzz;\n\nimpl nal::sei::pic_timing::PicTimingHandler for PicTimingFuzz {\n\n type Ctx = ();\n\n\n\n fn handle(&mut self, ctx: &mut h264_reader::Context<Self::Ctx>, pic_timing: nal::sei::pic_timing::PicTiming) {\n\n println!(\" {:?}\", pic_timing);\n\n }\n\n}\n\n\n\nh264_reader::sei_switch!{\n\n SeiSwitch<()> {\n\n //BufferingPeriod: h264_reader::nal::sei::buffering_period::BufferingPeriodPayloadReader\n\n // => h264_reader::nal::sei::buffering_period::BufferingPeriodPayloadReader::new(),\n\n //UserDataRegisteredItuTT35: h264_reader::nal::sei::user_data_registered_itu_t_t35::UserDataRegisteredItuTT35Reader<TT35Switch>\n\n // => h264_reader::nal::sei::user_data_registered_itu_t_t35::UserDataRegisteredItuTT35Reader::new(TT35Switch::default()),\n\n PicTiming: h264_reader::nal::sei::pic_timing::PicTimingReader<PicTimingFuzz>\n\n => h264_reader::nal::sei::pic_timing::PicTimingReader::new(PicTimingFuzz),\n\n }\n\n}\n","file_path":"fuzz/fuzz_targets/fuzz_target_1.rs","rank":38,"score":39916.66795408563},{"content":"#[derive(Debug)]\n\nenum NumRefIdxActive {\n\n P{ num_ref_idx_l0_active_minus1: u32 },\n\n B{ num_ref_idx_l0_active_minus1: u32, num_ref_idx_l1_active_minus1: u32 }\n\n}\n\nimpl NumRefIdxActive {\n\n fn num_ref_idx_l0_active_minus1(&self) -> u32 {\n\n match *self {\n\n NumRefIdxActive::P { num_ref_idx_l0_active_minus1 } => num_ref_idx_l0_active_minus1,\n\n NumRefIdxActive::B { num_ref_idx_l0_active_minus1, .. } => num_ref_idx_l0_active_minus1,\n\n }\n\n }\n\n}\n\n\n","file_path":"src/nal/slice/mod.rs","rank":39,"score":39916.66795408563},{"content":"// TODO: rename to 'RbspHandler' or something, to indicate it's only for post-emulation-prevention-bytes data\n\npub trait NalHandler {\n\n type Ctx;\n\n\n\n fn start(&mut self, ctx: &mut Context<Self::Ctx>, header: NalHeader);\n\n fn push(&mut self, ctx: &mut Context<Self::Ctx>, buf: &[u8]);\n\n fn end(&mut self, ctx: &mut Context<Self::Ctx>);\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use super::*;\n\n use hex_literal::*;\n\n\n\n #[test]\n\n fn header() {\n\n let h = NalHeader::new(0b0101_0001).unwrap();\n\n assert_eq!(0b10, h.nal_ref_idc());\n\n assert_eq!(UnitType::Reserved(17), h.nal_unit_type());\n\n }\n\n\n","file_path":"src/nal/mod.rs","rank":40,"score":39124.61995870987},{"content":"struct FuzzSeiPayoadReader {\n\n switch: SeiSwitch,\n\n}\n\nimpl h264_reader::nal::sei::SeiIncrementalPayloadReader for FuzzSeiPayoadReader {\n\n type Ctx = ();\n\n\n\n fn start(&mut self, ctx: &mut h264_reader::Context<Self::Ctx>, payload_type: h264_reader::nal::sei::HeaderType, payload_size: u32) {\n\n //println!(\" SEI: {:?} size={}\", payload_type, payload_size);\n\n self.switch.start(ctx, payload_type, payload_size)\n\n }\n\n\n\n fn push(&mut self, ctx: &mut h264_reader::Context<Self::Ctx>, buf: &[u8]) {\n\n self.switch.push(ctx, buf)\n\n }\n\n\n\n fn end(&mut self, ctx: &mut h264_reader::Context<Self::Ctx>) {\n\n self.switch.end(ctx)\n\n }\n\n\n\n fn reset(&mut self, ctx: &mut h264_reader::Context<Self::Ctx>) {\n\n self.switch.reset(ctx)\n\n }\n\n}\n\n\n","file_path":"fuzz/fuzz_targets/fuzz_target_1.rs","rank":41,"score":38895.263116268536},{"content":"pub trait PicTimingHandler {\n\n type Ctx;\n\n fn handle(&mut self, ctx: &mut Context<Self::Ctx>, pic_timing: PicTiming);\n\n}\n\npub struct PicTimingReader<H: PicTimingHandler> {\n\n handler: H,\n\n}\n\nimpl<H: PicTimingHandler> PicTimingReader<H> {\n\n pub fn new(handler: H) -> Self {\n\n PicTimingReader {\n\n handler,\n\n }\n\n }\n\n}\n\nimpl<H: PicTimingHandler> SeiCompletePayloadReader for PicTimingReader<H> {\n\n type Ctx = H::Ctx;\n\n\n\n fn header(&mut self, ctx: &mut Context<Self::Ctx>, payload_type: HeaderType, buf: &[u8]) {\n\n assert_eq!(payload_type, HeaderType::PicTiming);\n\n match PicTiming::read(ctx, buf) {\n\n Err(e) => error!(\"Failure reading pic_timing: {:?}\", e),\n\n Ok(pic_timing) => {\n\n self.handler.handle(ctx, pic_timing);\n\n }\n\n }\n\n }\n\n}\n","file_path":"src/nal/sei/pic_timing.rs","rank":42,"score":35731.775127251196},{"content":"pub trait SeiIncrementalPayloadReader {\n\n type Ctx;\n\n fn start(&mut self, ctx: &mut Context<Self::Ctx>, payload_type: HeaderType, payload_size: u32);\n\n fn push(&mut self, ctx: &mut Context<Self::Ctx>, buf: &[u8]);\n\n fn end(&mut self, ctx: &mut Context<Self::Ctx>);\n\n fn reset(&mut self, ctx: &mut Context<Self::Ctx>);\n\n}\n\n\n\npub struct SeiBuffer<R: SeiCompletePayloadReader> {\n\n payload_type: Option<HeaderType>,\n\n buf: Vec<u8>,\n\n reader: R,\n\n}\n\nimpl<R: SeiCompletePayloadReader> SeiBuffer<R> {\n\n pub fn new(reader: R) -> Self {\n\n SeiBuffer {\n\n payload_type: None,\n\n buf: Vec::new(),\n\n reader,\n\n }\n","file_path":"src/nal/sei/mod.rs","rank":43,"score":35731.775127251196},{"content":"pub trait SeiCompletePayloadReader {\n\n type Ctx;\n\n fn header(&mut self, ctx: &mut Context<Self::Ctx>, payload_type: HeaderType, buf: &[u8]);\n\n}\n\n\n","file_path":"src/nal/sei/mod.rs","rank":44,"score":35731.775127251196},{"content":" use std::cell::RefCell;\n\n\n\n #[derive(Default)]\n\n struct State {\n\n started: u32,\n\n ended: u32,\n\n data: Vec<u8>,\n\n }\n\n struct MockReader {\n\n state: Rc<RefCell<State>>\n\n }\n\n impl SeiIncrementalPayloadReader for MockReader {\n\n type Ctx = ();\n\n\n\n fn start(&mut self, _ctx: &mut Context<Self::Ctx>, _payload_type: HeaderType, _payload_size: u32) {\n\n self.state.borrow_mut().started += 1;\n\n }\n\n\n\n fn push(&mut self, _ctx: &mut Context<Self::Ctx>, buf: &[u8]) {\n\n self.state.borrow_mut().data.extend_from_slice(buf);\n","file_path":"src/nal/sei/mod.rs","rank":46,"score":33.28320486776622},{"content":"impl<Ctx> Default for SeqParameterSetNalHandler<Ctx> {\n\n fn default() -> Self {\n\n SeqParameterSetNalHandler {\n\n buf: Vec::new(),\n\n phantom: marker::PhantomData,\n\n }\n\n }\n\n}\n\nimpl<Ctx> NalHandler for SeqParameterSetNalHandler<Ctx> {\n\n type Ctx = Ctx;\n\n\n\n fn start(&mut self, _ctx: &mut Context<Ctx>, header: NalHeader) {\n\n assert_eq!(header.nal_unit_type(), super::UnitType::SeqParameterSet);\n\n }\n\n\n\n fn push(&mut self, _ctx: &mut Context<Ctx>, buf: &[u8]) {\n\n self.buf.extend_from_slice(buf);\n\n }\n\n\n\n fn end(&mut self, ctx: &mut Context<Ctx>) {\n","file_path":"src/nal/sps.rs","rank":47,"score":32.02088936010842},{"content":" }\n\n}\n\nimpl<R: SeiCompletePayloadReader> SeiIncrementalPayloadReader for SeiBuffer<R> {\n\n type Ctx = R::Ctx;\n\n\n\n fn start(&mut self, _ctx: &mut Context<Self::Ctx>, payload_type: HeaderType, _payload_size: u32) {\n\n self.payload_type = Some(payload_type);\n\n }\n\n\n\n fn push(&mut self, _ctx: &mut Context<Self::Ctx>, buf: &[u8]) {\n\n self.buf.extend_from_slice(buf);\n\n }\n\n\n\n fn end(&mut self, ctx: &mut Context<Self::Ctx>) {\n\n self.reader.header(ctx, self.payload_type.unwrap(), &self.buf[..]);\n\n self.buf.clear();\n\n self.payload_type = None;\n\n }\n\n\n\n fn reset(&mut self, _ctx: &mut Context<Self::Ctx>) {\n","file_path":"src/nal/sei/mod.rs","rank":48,"score":30.880319225076715},{"content":" type Ctx = R::Ctx;\n\n\n\n fn start(&mut self, ctx: &mut Context<Self::Ctx>, header: NalHeader) {\n\n assert_eq!(header.nal_unit_type(), super::UnitType::SEI);\n\n self.reader.start(ctx, header);\n\n }\n\n\n\n fn push(&mut self, ctx: &mut Context<Self::Ctx>, buf: &[u8]) {\n\n self.reader.push(ctx, buf);\n\n }\n\n\n\n fn end(&mut self, ctx: &mut Context<Self::Ctx>) {\n\n self.reader.end(ctx);\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use super::*;\n\n use std::rc::Rc;\n","file_path":"src/nal/sei/mod.rs","rank":49,"score":29.340421098541746},{"content":"\n\n fn read_slice_groups(r: &mut RbspBitReader<'_>) -> Result<Option<SliceGroup>,PpsError> {\n\n let num_slice_groups_minus1 = r.read_ue_named(\"num_slice_groups_minus1\")?;\n\n Ok(if num_slice_groups_minus1 > 0 {\n\n Some(SliceGroup::read(r, num_slice_groups_minus1)?)\n\n } else {\n\n None\n\n })\n\n }\n\n}\n\n\n\npub struct PicParameterSetNalHandler<Ctx> {\n\n buf: Vec<u8>,\n\n phantom: marker::PhantomData<Ctx>\n\n}\n\n\n\nimpl<Ctx> Default for PicParameterSetNalHandler<Ctx> {\n\n fn default() -> Self {\n\n PicParameterSetNalHandler {\n\n buf: Vec::new(),\n","file_path":"src/nal/pps.rs","rank":50,"score":29.03557866204224},{"content":"}\n\n\n\n#[derive(Debug)]\n\npub struct PicTiming {\n\n pub delays: Option<Delays>,\n\n pub pic_struct: Option<PicStruct>,\n\n}\n\nimpl PicTiming {\n\n pub fn read<Ctx>(ctx: &mut Context<Ctx>, buf: &[u8]) -> Result<PicTiming, PicTimingError> {\n\n let mut r = RbspBitReader::new(buf);\n\n let seq_parameter_set_id = ParamSetId::from_u32(0).unwrap();\n\n match ctx.sps_by_id(seq_parameter_set_id) {\n\n None => Err(PicTimingError::UndefinedSeqParamSetId(seq_parameter_set_id)),\n\n Some(sps) => {\n\n Ok(PicTiming {\n\n delays: Self::read_delays(&mut r, sps)?,\n\n pic_struct: Self::read_pic_struct(&mut r, sps)?,\n\n })\n\n }\n\n }\n","file_path":"src/nal/sei/pic_timing.rs","rank":51,"score":28.9535557126694},{"content":" ExpGolombTooLarge(&'static str),\n\n}\n\n\n\npub struct RbspBitReader<'buf> {\n\n reader: bitstream_io::read::BitReader<std::io::Cursor<&'buf [u8]>, bitstream_io::BigEndian>,\n\n}\n\nimpl<'buf> RbspBitReader<'buf> {\n\n pub fn new(buf: &'buf [u8]) -> Self {\n\n RbspBitReader {\n\n reader: bitstream_io::read::BitReader::new(std::io::Cursor::new(buf)),\n\n }\n\n }\n\n\n\n pub fn read_ue_named(&mut self, name: &'static str) -> Result<u32,RbspBitReaderError> {\n\n let count = count_zero_bits(&mut self.reader, name)?;\n\n if count > 0 {\n\n let val = self.read_u32(count)?;\n\n Ok((1 << count) -1 + val)\n\n } else {\n\n Ok(0)\n","file_path":"src/rbsp.rs","rank":52,"score":27.71757594178394},{"content":" struct MockHandler;\n\n impl NalHandler for MockHandler {\n\n type Ctx = ();\n\n\n\n fn start(&mut self, _ctx: &mut Context<Self::Ctx>, header: NalHeader) {\n\n assert_eq!(header.nal_unit_type(), UnitType::SeqParameterSet);\n\n }\n\n\n\n fn push(&mut self, _ctx: &mut Context<Self::Ctx>, buf: &[u8]) {\n\n let expected = hex!(\n\n \"64 00 0A AC 72 84 44 26 84 00 00\n\n 00 04 00 00 00 CA 3C 48 96 11 80\");\n\n assert_eq!(buf, &expected[..])\n\n }\n\n\n\n fn end(&mut self, _ctx: &mut Context<Self::Ctx>) {\n\n }\n\n }\n\n\n\n #[test]\n","file_path":"src/nal/mod.rs","rank":53,"score":27.03847138165554},{"content":"\n\n pub fn into_handler(self) -> R {\n\n self.nal_reader\n\n }\n\n}\n\nimpl<R> NalHandler for RbspDecoder<R>\n\n where\n\n R: NalHandler\n\n{\n\n type Ctx = R::Ctx;\n\n\n\n fn start(&mut self, ctx: &mut Context<Self::Ctx>, header: NalHeader) {\n\n self.state = ParseState::Start;\n\n self.nal_reader.start(ctx, header);\n\n }\n\n\n\n fn push(&mut self, ctx: &mut Context<Self::Ctx>, mut buf: &[u8]) {\n\n // buf[0..i] hasn't yet been emitted and is RBSP (has no emulation_prevention_three_bytes).\n\n // self.state describes the state before buf[i].\n\n // buf[i..] has yet to be examined.\n","file_path":"src/rbsp.rs","rank":54,"score":26.396961617475856},{"content":" phantom: marker::PhantomData,\n\n }\n\n }\n\n}\n\nimpl<Ctx> NalHandler for PicParameterSetNalHandler<Ctx> {\n\n type Ctx = Ctx;\n\n\n\n fn start(&mut self, _ctx: &mut Context<Ctx>, header: NalHeader) {\n\n assert_eq!(header.nal_unit_type(), super::UnitType::PicParameterSet);\n\n }\n\n\n\n fn push(&mut self, _ctx: &mut Context<Ctx>, buf: &[u8]) {\n\n self.buf.extend_from_slice(buf);\n\n }\n\n\n\n fn end(&mut self, ctx: &mut Context<Ctx>) {\n\n let pps = PicParameterSet::from_bytes(ctx, &self.buf[..]);\n\n self.buf.clear();\n\n match pps {\n\n Ok(pps) => {\n","file_path":"src/nal/pps.rs","rank":55,"score":25.544270486607264},{"content":" }\n\n }\n\n impl $crate::nal::sei::SeiIncrementalPayloadReader for $struct_name {\n\n type Ctx = $ctx;\n\n\n\n fn start(&mut self, ctx: &mut $crate::Context<Self::Ctx>, payload_type: $crate::nal::sei::HeaderType, payload_size: u32) {\n\n self.current_type = Some(payload_type);\n\n match payload_type {\n\n $(\n\n $crate::nal::sei::HeaderType::$name => self.$name.start(ctx, payload_type, payload_size),\n\n )*\n\n _ => (),\n\n }\n\n }\n\n\n\n fn push(&mut self, ctx: &mut $crate::Context<Self::Ctx>, buf: &[u8]) {\n\n match self.current_type {\n\n $(\n\n Some($crate::nal::sei::HeaderType::$name) => self.$name.push(ctx, buf),\n\n )*\n","file_path":"src/nal/sei/mod.rs","rank":56,"score":24.791724835067846},{"content":" }),\n\n _ => Err(PpsError::InvalidSliceGroupMapType(slice_group_map_type))\n\n }\n\n }\n\n\n\n fn read_run_lengths(r: &mut RbspBitReader<'_>, num_slice_groups_minus1: u32) -> Result<Vec<u32>,PpsError> {\n\n let mut run_length_minus1 = Vec::with_capacity(num_slice_groups_minus1 as usize + 1);\n\n for _ in 0..num_slice_groups_minus1+1 {\n\n run_length_minus1.push(r.read_ue_named(\"run_length_minus1\")?);\n\n }\n\n Ok(run_length_minus1)\n\n }\n\n\n\n fn read_rectangles(r: &mut RbspBitReader<'_>, num_slice_groups_minus1: u32) -> Result<Vec<SliceRect>,PpsError> {\n\n let mut run_length_minus1 = Vec::with_capacity(num_slice_groups_minus1 as usize + 1);\n\n for _ in 0..num_slice_groups_minus1+1 {\n\n run_length_minus1.push(SliceRect::read(r)?);\n\n }\n\n Ok(run_length_minus1)\n\n }\n","file_path":"src/nal/pps.rs","rank":57,"score":23.349672581793925},{"content":"impl Default for SeqScalingMatrix {\n\n fn default() -> Self {\n\n SeqScalingMatrix { }\n\n }\n\n}\n\nimpl SeqScalingMatrix {\n\n fn read(r: &mut RbspBitReader<'_>, chroma_format_idc: u32) -> Result<SeqScalingMatrix,ScalingMatrixError> {\n\n let mut scaling_list4x4 = vec!();\n\n let mut scaling_list8x8 = vec!();\n\n\n\n let count = if chroma_format_idc == 3 { 12 } else { 8 };\n\n for i in 0..count {\n\n let seq_scaling_list_present_flag = r.read_bool()?;\n\n if seq_scaling_list_present_flag {\n\n if i < 6 {\n\n scaling_list4x4.push(ScalingList::read(r, 16)?);\n\n } else {\n\n scaling_list8x8.push(ScalingList::read(r, 64)?);\n\n }\n\n }\n","file_path":"src/nal/sps.rs","rank":58,"score":23.23908463793292},{"content":" BadSeqParamSetId(ParamSetIdError),\n\n /// A field in the bitstream had a value too large for a subsequent calculation\n\n FieldValueTooLarge { name: &'static str, value: u32 },\n\n /// The frame-cropping values are too large vs. the coded picture size,\n\n CroppingError(FrameCropping),\n\n /// The `cpb_cnt_minus1` field must be between 0 and 31 inclusive.\n\n CpbCountOutOfRange(u32),\n\n}\n\n\n\nimpl From<RbspBitReaderError> for SpsError {\n\n fn from(e: RbspBitReaderError) -> Self {\n\n SpsError::RbspReaderError(e)\n\n }\n\n}\n\n\n\npub struct SeqParameterSetNalHandler<Ctx> {\n\n buf: Vec<u8>,\n\n phantom: marker::PhantomData<Ctx>\n\n}\n\n\n","file_path":"src/nal/sps.rs","rank":59,"score":23.084181561752622},{"content":" self.buf.clear();\n\n }\n\n}\n\n\n\npub struct SeiHeaderReader<R: SeiIncrementalPayloadReader> {\n\n state: SeiHeaderState,\n\n reader: R,\n\n}\n\nimpl<R: SeiIncrementalPayloadReader> SeiHeaderReader<R> {\n\n pub fn new(reader: R) -> Self {\n\n SeiHeaderReader {\n\n state: SeiHeaderState::Begin,\n\n reader,\n\n }\n\n }\n\n}\n\nimpl<R: SeiIncrementalPayloadReader> NalHandler for SeiHeaderReader<R> {\n\n type Ctx = R::Ctx;\n\n\n\n fn start(&mut self, _ctx: &mut Context<Self::Ctx>, header: NalHeader) {\n","file_path":"src/nal/sei/mod.rs","rank":60,"score":22.91769134407182},{"content":" self.nal_reader.end(ctx);\n\n }\n\n self.to(ParseState::End);\n\n }\n\n\n\n fn to(&mut self, new_state: ParseState) {\n\n self.state = new_state;\n\n }\n\n\n\n /// count must be 2 or less\n\n fn emit_fake(&mut self, ctx: &mut Context<Ctx>, count: usize) {\n\n let fake = [0u8; 2];\n\n self.nal_reader.push(ctx, &fake[..count]);\n\n }\n\n\n\n fn maybe_emit(&mut self, ctx: &mut Context<Ctx>, buf:&[u8], start: Option<usize>, end: usize, backtrack: usize) {\n\n match start {\n\n Some(s) if s + backtrack < end => {\n\n self.nal_reader.push(ctx, &buf[s..end - backtrack]);\n\n },\n","file_path":"src/annexb.rs","rank":61,"score":22.84474805313168},{"content":" } else {\n\n Some(r.read_i32(time_offset_length)?)\n\n };\n\n Ok(ClockTimestamp {\n\n ct_type,\n\n nuit_field_based_flag,\n\n counting_type,\n\n discontinuity_flag,\n\n cnt_dropped_flag,\n\n n_frames,\n\n smh,\n\n time_offset,\n\n })\n\n }\n\n}\n\n\n\n#[derive(Debug)]\n\npub struct PicStruct {\n\n pub pic_struct: PicStructType,\n\n pub clock_timestamps: Vec<Option<ClockTimestamp>>,\n","file_path":"src/nal/sei/pic_timing.rs","rank":62,"score":22.51140150982888},{"content":" pub constraint_flags: ConstraintFlags,\n\n pub level_idc: u8,\n\n pub seq_parameter_set_id: ParamSetId,\n\n pub chroma_info: ChromaInfo,\n\n pub log2_max_frame_num_minus4: u8,\n\n pub pic_order_cnt: PicOrderCntType,\n\n pub max_num_ref_frames: u32,\n\n pub gaps_in_frame_num_value_allowed_flag: bool,\n\n pub pic_width_in_mbs_minus1: u32,\n\n pub pic_height_in_map_units_minus1: u32,\n\n pub frame_mbs_flags: FrameMbsFlags,\n\n pub direct_8x8_inference_flag: bool,\n\n pub frame_cropping: Option<FrameCropping>,\n\n pub vui_parameters: Option<VuiParameters>,\n\n}\n\nimpl SeqParameterSet {\n\n pub fn from_bytes(buf: &[u8]) -> Result<SeqParameterSet, SpsError> {\n\n let mut r = RbspBitReader::new(buf);\n\n let profile_idc = r.read_u8(8)?.into();\n\n let sps = SeqParameterSet {\n","file_path":"src/nal/sps.rs","rank":63,"score":22.12114087759747},{"content":" }\n\n }\n\n\n\n pub fn read_se_named(&mut self, name: &'static str) -> Result<i32, RbspBitReaderError> {\n\n Ok(Self::golomb_to_signed(self.read_ue_named(name)?))\n\n }\n\n\n\n pub fn read_bool(&mut self) -> Result<bool, RbspBitReaderError> {\n\n self.reader.read_bit().map_err( |e| RbspBitReaderError::ReaderError(e) )\n\n }\n\n\n\n pub fn read_bool_named(&mut self, name: &'static str) -> Result<bool, RbspBitReaderError> {\n\n self.reader.read_bit().map_err( |e| RbspBitReaderError::ReaderErrorFor(name, e) )\n\n }\n\n\n\n pub fn read_u8(&mut self, bit_count: u32) -> Result<u8, RbspBitReaderError> {\n\n self.reader.read(u32::from(bit_count)).map_err( |e| RbspBitReaderError::ReaderError(e) )\n\n }\n\n\n\n pub fn read_u16(&mut self, bit_count: u8) -> Result<u16, RbspBitReaderError> {\n","file_path":"src/rbsp.rs","rank":64,"score":21.87909299467812},{"content":" fn push(&mut self, _ctx: &mut Context<Self::Ctx>, buf: &[u8]) {\n\n let dest = self.index..(self.index + buf.len());\n\n\n\n if &self.data[dest.clone()] != buf {\n\n self.data.to_mut()[dest].copy_from_slice(buf);\n\n }\n\n\n\n self.index += buf.len();\n\n }\n\n\n\n fn end(&mut self, _ctx: &mut Context<Self::Ctx>) {\n\n if let Cow::Owned(vec) = &mut self.data {\n\n vec.truncate(self.index);\n\n }\n\n }\n\n }\n\n\n\n let state = DecoderState::new(Cow::Borrowed(nal_unit));\n\n\n\n let mut decoder = RbspDecoder::new(state);\n","file_path":"src/rbsp.rs","rank":65,"score":21.54844165742293},{"content":" let pic_struct = PicStructType::from_id(r.read_u8(4)?)?;\n\n let clock_timestamps = Self::read_clock_timestamps(r, &pic_struct, sps)?;\n\n\n\n Some(PicStruct {\n\n pic_struct,\n\n clock_timestamps,\n\n })\n\n } else {\n\n None\n\n }\n\n } else {\n\n None\n\n })\n\n }\n\n\n\n fn read_clock_timestamps(r: &mut RbspBitReader<'_>, pic_struct: &PicStructType, sps: &sps::SeqParameterSet) -> Result<Vec<Option<ClockTimestamp>>,PicTimingError> {\n\n let mut res = Vec::new();\n\n for _ in 0..pic_struct.num_clock_timestamps() {\n\n res.push(if r.read_bool_named(\"clock_timestamp_flag\")? {\n\n Some(ClockTimestamp::read(r, sps)?)\n\n } else {\n\n None\n\n });\n\n }\n\n Ok(res)\n\n }\n\n}\n","file_path":"src/nal/sei/pic_timing.rs","rank":66,"score":21.493947284946298},{"content":" self.reader.read(u32::from(bit_count)).map_err( |e| RbspBitReaderError::ReaderError(e) )\n\n }\n\n\n\n pub fn read_u32(&mut self, bit_count: u8) -> Result<u32, RbspBitReaderError> {\n\n self.reader.read(u32::from(bit_count)).map_err( |e| RbspBitReaderError::ReaderError(e) )\n\n }\n\n\n\n pub fn read_i32(&mut self, bit_count: u8) -> Result<i32, RbspBitReaderError> {\n\n self.reader.read(u32::from(bit_count)).map_err( |e| RbspBitReaderError::ReaderError(e) )\n\n }\n\n\n\n /// Returns true if positioned before the RBSP trailing bits.\n\n ///\n\n /// This matches the definition of `more_rbsp_data()` in Rec. ITU-T H.264\n\n /// (03/2010) section 7.2.\n\n pub fn has_more_rbsp_data(&mut self, name: &'static str) -> Result<bool, RbspBitReaderError> {\n\n // BitReader returns its reader iff at an aligned position.\n\n //self.reader.reader().map(|r| (r.position() as usize) < r.get_ref().len()).unwrap_or(true)\n\n let mut throwaway = self.reader.clone();\n\n let r = (move || {\n","file_path":"src/rbsp.rs","rank":67,"score":21.46925713796741},{"content":" pub num_ref_idx_l0_default_active_minus1: u32,\n\n pub num_ref_idx_l1_default_active_minus1: u32,\n\n pub weighted_pred_flag: bool,\n\n pub weighted_bipred_idc: u8,\n\n pub pic_init_qp_minus26: i32,\n\n pub pic_init_qs_minus26: i32,\n\n pub chroma_qp_index_offset: i32,\n\n pub deblocking_filter_control_present_flag: bool,\n\n pub constrained_intra_pred_flag: bool,\n\n pub redundant_pic_cnt_present_flag: bool,\n\n pub extension: Option<PicParameterSetExtra>,\n\n}\n\nimpl PicParameterSet {\n\n pub fn from_bytes<Ctx>(ctx: &Context<Ctx>, buf: &[u8]) -> Result<PicParameterSet, PpsError> {\n\n let mut r = RbspBitReader::new(buf);\n\n let pic_parameter_set_id = ParamSetId::from_u32(r.read_ue_named(\"pic_parameter_set_id\")?)\n\n .map_err(PpsError::BadPicParamSetId)?;\n\n let seq_parameter_set_id = ParamSetId::from_u32(r.read_ue_named(\"seq_parameter_set_id\")?)\n\n .map_err(PpsError::BadSeqParamSetId)?;\n\n let seq_parameter_set = ctx.sps_by_id(seq_parameter_set_id)\n","file_path":"src/nal/pps.rs","rank":68,"score":21.396312618848018},{"content":" SecMinHour::SMH(_, _, h) => *h,\n\n }\n\n }\n\n}\n\n\n\n#[derive(Debug)]\n\npub struct ClockTimestamp {\n\n pub ct_type: CtType,\n\n pub nuit_field_based_flag: bool,\n\n pub counting_type: CountingType,\n\n pub discontinuity_flag: bool,\n\n pub cnt_dropped_flag: bool,\n\n pub n_frames: u8,\n\n pub smh: SecMinHour,\n\n pub time_offset: Option<i32>,\n\n}\n\nimpl ClockTimestamp {\n\n fn read(r: &mut RbspBitReader<'_>, sps: &sps::SeqParameterSet) -> Result<ClockTimestamp, PicTimingError> {\n\n let ct_type = CtType::from_id(r.read_u8(2)?);\n\n let nuit_field_based_flag = r.read_bool_named(\"nuit_field_based_flag\")?;\n","file_path":"src/nal/sei/pic_timing.rs","rank":69,"score":21.168082207138035},{"content":" data: Vec<u8>,\n\n }\n\n struct MockReader {\n\n state: Rc<RefCell<State>>\n\n }\n\n impl MockReader {\n\n fn new(state: Rc<RefCell<State>>) -> MockReader {\n\n MockReader {\n\n state\n\n }\n\n }\n\n }\n\n impl NalReader for MockReader {\n\n type Ctx = ();\n\n\n\n fn start(&mut self, _ctx: &mut Context<Self::Ctx>) {\n\n let mut state = self.state.borrow_mut();\n\n assert_eq!(state.started, state.ended);\n\n state.started += 1;\n\n }\n","file_path":"src/annexb.rs","rank":70,"score":20.891910047608246},{"content":"use crate::nal::sei::HeaderType;\n\nuse crate::Context;\n\nuse crate::nal::sei::SeiCompletePayloadReader;\n\nuse log::*;\n\n\n\n#[derive(Debug)]\n\npub enum ItuTT35Error {\n\n NotEnoughData { expected: usize, actual: usize }\n\n}\n\n\n\n#[derive(Debug, PartialEq)]\n\npub enum ItuTT35 {\n\n Japan,\n\n Albania,\n\n Algeria,\n\n AmericanSamoa,\n\n GermanyFederalRepublicOf(u8),\n\n Anguilla,\n\n AntiguaandBarbuda,\n\n Argentina,\n","file_path":"src/nal/sei/user_data_registered_itu_t_t35.rs","rank":71,"score":20.756190355592793},{"content":" assert_eq!(header.nal_unit_type(), crate::nal::UnitType::SEI);\n\n self.state = SeiHeaderState::Begin;\n\n }\n\n\n\n fn push(&mut self, ctx: &mut Context<Self::Ctx>, buf: &[u8]) {\n\n assert!(!buf.is_empty());\n\n let mut input = &buf[..];\n\n loop {\n\n if input.is_empty() {\n\n break;\n\n }\n\n let b = input[0];\n\n let mut exit = false;\n\n self.state = match self.state {\n\n SeiHeaderState::End => {\n\n panic!(\"SeiHeaderReader no preceding call to start()\");\n\n },\n\n SeiHeaderState::Begin => {\n\n match b {\n\n 0xff => {\n","file_path":"src/nal/sei/mod.rs","rank":72,"score":20.71638163762347},{"content":" Ok((header, sps, pps))\n\n }\n\n}\n\n\n\npub struct SliceLayerWithoutPartitioningRbsp<Ctx> {\n\n state: ParseState,\n\n phantom: marker::PhantomData<Ctx>\n\n}\n\nimpl<Ctx> super::NalHandler for SliceLayerWithoutPartitioningRbsp<Ctx> {\n\n type Ctx = Ctx;\n\n\n\n fn start(&mut self, _ctx: &mut Context<Ctx>, header: NalHeader) {\n\n self.state = ParseState::Start(header);\n\n }\n\n\n\n fn push(&mut self, ctx: &mut Context<Ctx>, buf: &[u8]) {\n\n match self.state {\n\n ParseState::Unstarted => panic!(\"start() not yet called\"),\n\n ParseState::Start(header) => {\n\n let mut r = RbspBitReader::new(buf);\n","file_path":"src/nal/slice/mod.rs","rank":73,"score":20.629525010704963},{"content":"\n\n fn read_group_ids(r: &mut RbspBitReader<'_>, num_slice_groups_minus1: u32) -> Result<Vec<u32>,PpsError> {\n\n let pic_size_in_map_units_minus1 = r.read_ue_named(\"pic_size_in_map_units_minus1\")?;\n\n // TODO: avoid any panics due to failed conversions\n\n let size = ((1f64+f64::from(pic_size_in_map_units_minus1)).log2()) as u8;\n\n let mut run_length_minus1 = Vec::with_capacity(num_slice_groups_minus1 as usize + 1);\n\n for _ in 0..num_slice_groups_minus1+1 {\n\n run_length_minus1.push(r.read_u32(size)?);\n\n }\n\n Ok(run_length_minus1)\n\n }\n\n}\n\n\n\n#[derive(Debug, Clone)]\n","file_path":"src/nal/pps.rs","rank":74,"score":20.505094031460636},{"content":" R: NalReader<Ctx=Ctx>\n\n{\n\n state: ParseState,\n\n nal_reader: R,\n\n}\n\nimpl<R, Ctx> AnnexBReader<R, Ctx>\n\n where\n\n R: NalReader<Ctx=Ctx>\n\n{\n\n pub fn new(nal_reader: R) -> Self {\n\n AnnexBReader {\n\n state: ParseState::End,\n\n nal_reader,\n\n }\n\n }\n\n\n\n pub fn start(&mut self, ctx: &mut Context<Ctx>) {\n\n if self.state.in_unit().is_some() {\n\n // TODO: or reset()?\n\n self.nal_reader.end(ctx);\n","file_path":"src/annexb.rs","rank":75,"score":20.434018540515666},{"content":"}\n\n\n\n#[derive(Debug, Clone)]\n\npub struct SliceRect {\n\n top_left: u32,\n\n bottom_right: u32,\n\n}\n\nimpl SliceRect {\n\n fn read(r: &mut RbspBitReader<'_>) -> Result<SliceRect,PpsError> {\n\n Ok(SliceRect {\n\n top_left: r.read_ue_named(\"top_left\")?,\n\n bottom_right: r.read_ue_named(\"bottom_right\")?,\n\n })\n\n }\n\n}\n\n\n\n#[derive(Debug, Clone)]\n\npub enum SliceGroup {\n\n Interleaved {\n\n run_length_minus1: Vec<u32>,\n","file_path":"src/nal/pps.rs","rank":76,"score":20.292519190874703},{"content":" fn push(&mut self, _ctx: &mut Context<Self::Ctx>, buf: &[u8]) {\n\n self.state.borrow_mut().data.extend_from_slice(buf);\n\n }\n\n\n\n fn end(&mut self, _ctx: &mut Context<Self::Ctx>) {\n\n self.state.borrow_mut().ended = true;\n\n }\n\n }\n\n\n\n #[test]\n\n fn it_works() {\n\n let data = hex!(\n\n \"67 64 00 0A AC 72 84 44 26 84 00 00 03\n\n 00 04 00 00 03 00 CA 3C 48 96 11 80\");\n\n for i in 1..data.len()-1 {\n\n let state = Rc::new(RefCell::new(State {\n\n started: false,\n\n ended: false,\n\n data: Vec::new(),\n\n }));\n","file_path":"src/rbsp.rs","rank":77,"score":20.000386782526142},{"content":" pub fn sequence_parameter_sets(&self) -> impl Iterator<Item = Result<&'buf[u8], ParamSetError>> {\n\n let num = self.num_of_sequence_parameter_sets();\n\n let data = &self.data[Self::MIN_CONF_SIZE..];\n\n ParamSetIter::new(data, UnitType::SeqParameterSet)\n\n .take(num)\n\n }\n\n pub fn picture_parameter_sets(&self) -> impl Iterator<Item = Result<&'buf[u8], ParamSetError>> + 'buf {\n\n let offset = self.seq_param_sets_end().unwrap();\n\n let num = self.data[offset];\n\n let data = &self.data[offset+1..];\n\n ParamSetIter::new(data, UnitType::PicParameterSet)\n\n .take(num as usize)\n\n }\n\n\n\n /// Creates an H264 parser context from the given user context, using the settings encoded into\n\n /// this `AvcDecoderConfigurationRecord`.\n\n ///\n\n /// In particular, the _sequence parameter set_ and _picture parameter set_ values of this\n\n /// configuration record will be inserted into the resulting context.\n\n pub fn create_context<C>(&self, ctx: C) -> Result<Context<C>, AvccError> {\n","file_path":"src/avcc.rs","rank":78,"score":19.936413036479305},{"content":"\n\n fn push(&mut self, _ctx: &mut Context<Self::Ctx>, buf: &[u8]) {\n\n let mut state = self.state.borrow_mut();\n\n assert!(state.started > state.ended);\n\n assert!(!buf.is_empty());\n\n state.data.extend_from_slice(buf);\n\n }\n\n\n\n fn end(&mut self, _ctx: &mut Context<Self::Ctx>) {\n\n let mut state = self.state.borrow_mut();\n\n state.ended += 1;\n\n assert_eq!(state.started, state.ended);\n\n }\n\n }\n\n\n\n #[test]\n\n fn simple_nal() {\n\n let state = Rc::new(RefCell::new(State {\n\n started: 0,\n\n ended: 0,\n","file_path":"src/annexb.rs","rank":79,"score":19.902528126227953},{"content":" match SliceHeader::read(ctx, &mut r, header) {\n\n Ok(header) => info!(\"TODO: expose to caller: {:#?}\", header),\n\n Err(e) => error!(\"slice_header() error: SliceHeaderError::{:?}\", e),\n\n }\n\n self.state = ParseState::Continue(header);\n\n },\n\n ParseState::Continue(_header) => {\n\n // TODO\n\n }\n\n }\n\n }\n\n\n\n fn end(&mut self, _ctx: &mut Context<Ctx>) {\n\n // TODO\n\n }\n\n}\n\nimpl<Ctx> Default for SliceLayerWithoutPartitioningRbsp<Ctx> {\n\n fn default() -> Self {\n\n SliceLayerWithoutPartitioningRbsp {\n\n state: ParseState::Unstarted,\n\n phantom: marker::PhantomData,\n\n }\n\n }\n\n}","file_path":"src/nal/slice/mod.rs","rank":80,"score":19.895843532401493},{"content":" None\n\n })\n\n }\n\n fn read_cpb_specs(r: &mut RbspBitReader<'_>, cpb_cnt: u32) -> Result<Vec<CpbSpec>,RbspBitReaderError> {\n\n let mut cpb_specs = Vec::with_capacity(cpb_cnt as usize);\n\n for _ in 0..cpb_cnt {\n\n cpb_specs.push(CpbSpec::read(r)?);\n\n }\n\n Ok(cpb_specs)\n\n }\n\n}\n\n\n\n#[derive(Debug, Clone)]\n\npub struct BitstreamRestrictions {\n\n motion_vectors_over_pic_boundaries_flag: bool,\n\n max_bytes_per_pic_denom: u32,\n\n max_bits_per_mb_denom: u32,\n\n log2_max_mv_length_horizontal: u32,\n\n log2_max_mv_length_vertical: u32,\n\n max_num_reorder_frames: u32,\n","file_path":"src/nal/sps.rs","rank":81,"score":19.851300337526553},{"content":"impl ScalingList {\n\n pub fn read(r: &mut RbspBitReader<'_>, size: u8) -> Result<ScalingList,ScalingMatrixError> {\n\n let mut scaling_list = vec!();\n\n let mut last_scale = 8;\n\n let mut next_scale = 8;\n\n let mut _use_default_scaling_matrix_flag = false;\n\n for j in 0..size {\n\n if next_scale != 0 {\n\n let delta_scale = r.read_se_named(\"delta_scale\")?;\n\n if delta_scale < -128 || delta_scale > 127 {\n\n return Err(ScalingMatrixError::DeltaScaleOutOfRange(delta_scale));\n\n }\n\n next_scale = (last_scale + delta_scale + 256) % 256;\n\n _use_default_scaling_matrix_flag = j == 0 && next_scale == 0;\n\n }\n\n let new_value = if next_scale == 0 { last_scale } else { next_scale };\n\n scaling_list.push(new_value);\n\n last_scale = new_value;\n\n }\n\n Ok(ScalingList { })\n","file_path":"src/nal/sps.rs","rank":82,"score":19.4696990862634},{"content":"\n\n#[derive(Debug, Clone)]\n\npub struct VuiParameters {\n\n pub aspect_ratio_info: Option<AspectRatioInfo>,\n\n pub overscan_appropriate: OverscanAppropriate,\n\n pub video_signal_type: Option<VideoSignalType>,\n\n pub chroma_loc_info: Option<ChromaLocInfo>,\n\n pub timing_info: Option<TimingInfo>,\n\n pub nal_hrd_parameters: Option<HrdParameters>,\n\n pub vcl_hrd_parameters: Option<HrdParameters>,\n\n pub low_delay_hrd_flag: Option<bool>,\n\n pub pic_struct_present_flag: bool,\n\n pub bitstream_restrictions: Option<BitstreamRestrictions>,\n\n}\n\nimpl VuiParameters {\n\n fn read(r: &mut RbspBitReader<'_>) -> Result<Option<VuiParameters>, SpsError> {\n\n let vui_parameters_present_flag = r.read_bool()?;\n\n Ok(if vui_parameters_present_flag {\n\n let mut hrd_parameters_present = false;\n\n Some(VuiParameters {\n","file_path":"src/nal/sps.rs","rank":83,"score":19.428270588077993},{"content":" }\n\n\n\n fn push(&mut self, ctx: &mut h264_reader::Context<Self::Ctx>, buf: &[u8]) {\n\n self.current_slice\n\n .as_mut()\n\n .unwrap()\n\n .buf\n\n .extend_from_slice(buf);\n\n }\n\n\n\n fn end(&mut self, ctx: &mut h264_reader::Context<Self::Ctx>) {\n\n let current_slice = self.current_slice.take().unwrap();\n\n let capture = NalCapture::default();\n\n let mut decode = RbspDecoder::new(capture);\n\n decode.start(ctx, current_slice.header);\n\n decode.push(ctx, ¤t_slice.buf[..]);\n\n decode.end(ctx);\n\n let capture = decode.into_handler();\n\n let mut r = rbsp::RbspBitReader::new(&capture.buf[1..]);\n\n match nal::slice::SliceHeader::read(ctx, &mut r, current_slice.header) {\n","file_path":"fuzz/fuzz_targets/fuzz_target_1.rs","rank":84,"score":19.403873009223496},{"content":" }\n\n\n\n fn read_delays(r: &mut RbspBitReader<'_>, sps: &sps::SeqParameterSet) -> Result<Option<Delays>,PicTimingError> {\n\n Ok(if let Some(ref vui_params) = sps.vui_parameters {\n\n if let Some(ref hrd) = vui_params.nal_hrd_parameters.as_ref().or_else(|| vui_params.nal_hrd_parameters.as_ref() ) {\n\n Some(Delays {\n\n cpb_removal_delay: r.read_u32(hrd.cpb_removal_delay_length_minus1+1)?,\n\n dpb_output_delay: r.read_u32(hrd.dpb_output_delay_length_minus1+1)?,\n\n })\n\n } else {\n\n None\n\n }\n\n } else {\n\n None\n\n })\n\n }\n\n\n\n fn read_pic_struct(r: &mut RbspBitReader<'_>, sps: &sps::SeqParameterSet) -> Result<Option<PicStruct>,PicTimingError> {\n\n Ok(if let Some(ref vui_params) = sps.vui_parameters {\n\n if vui_params.pic_struct_present_flag {\n","file_path":"src/nal/sei/pic_timing.rs","rank":85,"score":19.2889646752151},{"content":" 2 => CountingType::DroppingIndividualZero,\n\n 3 => CountingType::DroppingIndividualMax,\n\n 4 => CountingType::DroppingTwoLowest,\n\n 5 => CountingType::DroppingIndividual,\n\n 6 => CountingType::Dropping,\n\n 7..=31 => CountingType::Reserved(id),\n\n _ => panic!(\"unexpected counting_type {}\", id),\n\n }\n\n }\n\n}\n\n\n\n#[derive(Debug)]\n\npub enum SecMinHour {\n\n None,\n\n S(u8),\n\n SM(u8, u8),\n\n SMH(u8, u8, u8)\n\n}\n\nimpl SecMinHour {\n\n pub fn seconds(&self) -> u8 {\n","file_path":"src/nal/sei/pic_timing.rs","rank":86,"score":19.124869507199037},{"content":" let video_signal_type_present_flag = r.read_bool()?;\n\n Ok(if video_signal_type_present_flag {\n\n Some(VideoSignalType {\n\n video_format: VideoFormat::from(r.read_u8(3)?),\n\n video_full_range_flag: r.read_bool()?,\n\n colour_description: ColourDescription::read(r)?,\n\n })\n\n } else {\n\n None\n\n })\n\n }\n\n}\n\n\n\n#[derive(Debug, Clone)]\n\npub struct ChromaLocInfo {\n\n chroma_sample_loc_type_top_field: u32,\n\n chroma_sample_loc_type_bottom_field: u32,\n\n}\n\nimpl ChromaLocInfo {\n\n fn read(r: &mut RbspBitReader<'_>) -> Result<Option<ChromaLocInfo>, RbspBitReaderError> {\n","file_path":"src/nal/sps.rs","rank":87,"score":19.084052683589945},{"content":" fn read(r: &mut RbspBitReader<'_>) -> Result<CpbSpec,RbspBitReaderError> {\n\n Ok(CpbSpec {\n\n bit_rate_value_minus1: r.read_ue_named(\"bit_rate_value_minus1\")?,\n\n cpb_size_value_minus1: r.read_ue_named(\"cpb_size_value_minus1\")?,\n\n cbr_flag: r.read_bool_named(\"cbr_flag\")?,\n\n })\n\n }\n\n}\n\n\n\n\n\n#[derive(Debug, Clone)]\n\npub struct HrdParameters {\n\n pub bit_rate_scale: u8,\n\n pub cpb_size_scale: u8,\n\n pub cpb_specs: Vec<CpbSpec>,\n\n pub initial_cpb_removal_delay_length_minus1: u8,\n\n pub cpb_removal_delay_length_minus1: u8,\n\n pub dpb_output_delay_length_minus1: u8,\n\n pub time_offset_length: u8,\n\n}\n","file_path":"src/nal/sps.rs","rank":88,"score":19.045138176181034},{"content":" slice_type: SliceType,\n\n colour_plane: Option<ColourPlane>,\n\n frame_num: u16,\n\n field_pic: FieldPic,\n\n idr_pic_id: Option<u32>,\n\n pic_order_cnt_lsb: Option<PicOrderCountLsb>,\n\n redundant_pic_cnt: Option<u32>,\n\n direct_spatial_mv_pred_flag: Option<bool>,\n\n num_ref_idx_active: Option<NumRefIdxActive>,\n\n ref_pic_list_modification: Option<RefPicListModifications>, // may become an enum rather than Option in future (for ref_pic_list_mvc_modification)\n\n pred_weight_table: Option<PredWeightTable>,\n\n dec_ref_pic_marking: Option<DecRefPicMarking>,\n\n cabac_init_idc: Option<u32>,\n\n slice_qp_delta: i32,\n\n sp_for_switch_flag: Option<bool>,\n\n slice_qs: Option<u32>,\n\n disable_deblocking_filter_idc: u8,\n\n}\n\nimpl SliceHeader {\n\n pub fn read<'a, Ctx>(ctx: &'a mut Context<Ctx>, r: &mut RbspBitReader<'_>, header: NalHeader) -> Result<(SliceHeader, &'a SeqParameterSet, &'a PicParameterSet), SliceHeaderError> {\n","file_path":"src/nal/slice/mod.rs","rank":89,"score":19.02441606870664},{"content":" }\n\n}\n\nimpl<Ctx> Context<Ctx> {\n\n pub fn new(user_context: Ctx) -> Self {\n\n let mut seq_param_sets = vec!();\n\n for _ in 0..32 { seq_param_sets.push(None); }\n\n let mut pic_param_sets = vec!();\n\n for _ in 0..32 { pic_param_sets.push(None); }\n\n Context {\n\n seq_param_sets,\n\n pic_param_sets,\n\n user_context,\n\n }\n\n }\n\n}\n\nimpl<Ctx> Context<Ctx> {\n\n pub fn sps_by_id(&self, id: nal::pps::ParamSetId) -> Option<&nal::sps::SeqParameterSet> {\n\n if id.id() > 31 {\n\n None\n\n } else {\n","file_path":"src/lib.rs","rank":90,"score":18.908585276818265},{"content":" data: Vec::new(),\n\n }));\n\n let mock = MockReader::new(Rc::clone(&state));\n\n let mut r = AnnexBReader::new(mock);\n\n let data = vec!(\n\n 0, 0, 0, 1, // start-code\n\n 3, 0 // NAL data\n\n );\n\n let mut ctx = Context::default();\n\n r.start(&mut ctx);\n\n r.push(&mut ctx, &data[..]);\n\n r.end_units(&mut ctx);\n\n {\n\n let s = state.borrow();\n\n assert_eq!(1, s.started);\n\n assert_eq!(&s.data[..], &[3u8, 0u8][..]);\n\n assert_eq!(1, s.ended);\n\n }\n\n }\n\n\n","file_path":"src/annexb.rs","rank":91,"score":18.850646725067858},{"content":"impl HrdParameters {\n\n fn read(r: &mut RbspBitReader<'_>, hrd_parameters_present: &mut bool) -> Result<Option<HrdParameters>, SpsError> {\n\n let hrd_parameters_present_flag = r.read_bool_named(\"hrd_parameters_present_flag\")?;\n\n *hrd_parameters_present |= hrd_parameters_present_flag;\n\n Ok(if hrd_parameters_present_flag {\n\n let cpb_cnt_minus1 = r.read_ue_named(\"cpb_cnt_minus1\")?;\n\n if cpb_cnt_minus1 > 31 {\n\n return Err(SpsError::CpbCountOutOfRange(cpb_cnt_minus1));\n\n }\n\n let cpb_cnt = cpb_cnt_minus1 + 1;\n\n Some(HrdParameters {\n\n bit_rate_scale: r.read_u8(4)?,\n\n cpb_size_scale: r.read_u8(4)?,\n\n cpb_specs: Self::read_cpb_specs(r, cpb_cnt)?,\n\n initial_cpb_removal_delay_length_minus1: r.read_u8(5)?,\n\n cpb_removal_delay_length_minus1: r.read_u8(5)?,\n\n dpb_output_delay_length_minus1: r.read_u8(5)?,\n\n time_offset_length: r.read_u8(5)?,\n\n })\n\n } else {\n","file_path":"src/nal/sps.rs","rank":92,"score":18.79237561821609},{"content":" use super::*;\n\n\n\n #[derive(Default)]\n\n struct NullRegister {\n\n handled: bool,\n\n }\n\n impl crate::nal::sei::user_data_registered_itu_t_t35::Register for NullRegister {\n\n type Ctx = ();\n\n\n\n fn handle(&mut self, _ctx: &mut crate::Context<Self::Ctx>, country_code: crate::nal::sei::user_data_registered_itu_t_t35::ItuTT35, _payload: &[u8]) {\n\n assert_eq!(country_code, ItuTT35::UnitedKingdom);\n\n self.handled = true;\n\n }\n\n }\n\n #[test]\n\n fn macro_usage() {\n\n tt_35_switch!{\n\n TestTT35Switch<()> {\n\n UnitedKingdom => NullRegister,\n\n }\n\n }\n\n\n\n let mut sw = TestTT35Switch::default();\n\n let mut ctx = crate::Context::new(());\n\n let data = [ 0x00u8 ];\n\n sw.handle(&mut ctx, ItuTT35::UnitedKingdom, &data[..]);\n\n assert!(sw.UnitedKingdom.handled);\n\n }\n\n}","file_path":"src/nal/sei/user_data_registered_itu_t_t35.rs","rank":93,"score":18.58922861577487},{"content":" ended: bool,\n\n data: Vec<u8>,\n\n }\n\n struct MockReader {\n\n state: Rc<RefCell<State>>\n\n }\n\n impl MockReader {\n\n fn new(state: Rc<RefCell<State>>) -> MockReader {\n\n MockReader {\n\n state\n\n }\n\n }\n\n }\n\n impl NalHandler for MockReader {\n\n type Ctx = ();\n\n\n\n fn start(&mut self, _ctx: &mut Context<Self::Ctx>, _header: NalHeader) {\n\n self.state.borrow_mut().started = true;\n\n }\n\n\n","file_path":"src/rbsp.rs","rank":94,"score":18.455797033680764},{"content":" error!(\"End of SEI data encountered having read {} bytes of payloadSize={} for header type {:?}\", consumed_size, payload_size, payload_type);\n\n self.reader.reset(ctx);\n\n },\n\n }\n\n self.state = SeiHeaderState::End;\n\n }\n\n}\n\n\n\npub struct SeiNalHandler<R: SeiIncrementalPayloadReader> {\n\n reader: RbspDecoder<SeiHeaderReader<R>>,\n\n}\n\nimpl<R: SeiIncrementalPayloadReader> SeiNalHandler<R> {\n\n pub fn new(r: R) -> Self {\n\n SeiNalHandler {\n\n reader: RbspDecoder::new(SeiHeaderReader::new(r)),\n\n }\n\n }\n\n}\n\n\n\nimpl<R: SeiIncrementalPayloadReader> NalHandler for SeiNalHandler<R> {\n","file_path":"src/nal/sei/mod.rs","rank":95,"score":18.28286318665216},{"content":" fn read(r: &mut RbspBitReader<'_>) -> Result<FrameMbsFlags, RbspBitReaderError> {\n\n let frame_mbs_only_flag = r.read_bool()?;\n\n if frame_mbs_only_flag {\n\n Ok(FrameMbsFlags::Frames)\n\n } else {\n\n Ok(FrameMbsFlags::Fields {\n\n mb_adaptive_frame_field_flag: r.read_bool()?\n\n })\n\n }\n\n }\n\n}\n\n\n\n#[derive(Debug, Clone, PartialEq)]\n\npub struct FrameCropping {\n\n pub left_offset: u32,\n\n pub right_offset: u32,\n\n pub top_offset: u32,\n\n pub bottom_offset: u32,\n\n}\n\nimpl FrameCropping {\n","file_path":"src/nal/sps.rs","rank":96,"score":18.07512202569022},{"content":" Ok(if colour_description_present_flag {\n\n Some(ColourDescription {\n\n colour_primaries: r.read_u8(8)?,\n\n transfer_characteristics: r.read_u8(8)?,\n\n matrix_coefficients: r.read_u8(8)?,\n\n })\n\n } else {\n\n None\n\n })\n\n }\n\n}\n\n\n\n#[derive(Debug, Clone)]\n\npub struct VideoSignalType {\n\n video_format: VideoFormat,\n\n video_full_range_flag: bool,\n\n colour_description: Option<ColourDescription>,\n\n}\n\nimpl VideoSignalType {\n\n fn read(r: &mut RbspBitReader<'_>) -> Result<Option<VideoSignalType>, RbspBitReaderError> {\n","file_path":"src/nal/sps.rs","rank":97,"score":17.8599525981965},{"content":"//! Parser for H264 bitstream syntax. Not a video decoder.\n\n\n\n#![forbid(unsafe_code)]\n\n#![deny(rust_2018_idioms)]\n\n\n\npub mod rbsp;\n\npub mod annexb;\n\npub mod nal;\n\npub mod avcc;\n\n\n\n/// Contextual data that needs to be tracked between evaluations of different portions of H264\n\n/// syntax.\n\npub struct Context<Ctx> {\n\n seq_param_sets: Vec<Option<nal::sps::SeqParameterSet>>,\n\n pic_param_sets: Vec<Option<nal::pps::PicParameterSet>>,\n\n pub user_context: Ctx,\n\n}\n\nimpl Default for Context<()> {\n\n fn default() -> Self {\n\n Self::new(())\n","file_path":"src/lib.rs","rank":98,"score":17.85760462886614},{"content":" Progressive,\n\n Interlaced,\n\n Unknown,\n\n Reserved,\n\n}\n\nimpl CtType {\n\n fn from_id(id: u8) -> CtType {\n\n match id {\n\n 0 => CtType::Progressive,\n\n 1 => CtType::Interlaced,\n\n 2 => CtType::Unknown,\n\n 3 => CtType::Reserved,\n\n _ => panic!(\"unexpected ct_type {}\", id),\n\n }\n\n }\n\n}\n\n\n\n#[derive(Debug)]\n\npub enum CountingType {\n\n /// no dropping of `n_frames` values, and no use of `time_offset`\n","file_path":"src/nal/sei/pic_timing.rs","rank":99,"score":17.77957558613651}],"string":"[\n {\n \"content\": \"fn count_zero_bits<R: BitRead>(r: &mut R, name: &'static str) -> Result<u8, RbspBitReaderError> {\\n\\n let mut count = 0;\\n\\n while !r.read_bit()? {\\n\\n count += 1;\\n\\n if count > 31 {\\n\\n return Err(RbspBitReaderError::ExpGolombTooLarge(name));\\n\\n }\\n\\n }\\n\\n Ok(count)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use std::rc::Rc;\\n\\n use std::cell::RefCell;\\n\\n use hex_literal::*;\\n\\n\\n\\n struct State {\\n\\n started: bool,\\n\",\n \"file_path\": \"src/rbsp.rs\",\n \"rank\": 1,\n \"score\": 131124.25740496398\n },\n {\n \"content\": \"struct ParamSetIter<'buf>(&'buf[u8], UnitType);\\n\\n\\n\\nimpl<'buf> ParamSetIter<'buf> {\\n\\n pub fn new(buf: &'buf[u8], unit_type: UnitType) -> ParamSetIter<'buf> {\\n\\n ParamSetIter(buf, unit_type)\\n\\n }\\n\\n}\\n\\nimpl<'buf> Iterator for ParamSetIter<'buf>\\n\\n{\\n\\n type Item = Result<&'buf[u8], ParamSetError>;\\n\\n\\n\\n fn next(&mut self) -> Option<Self::Item> {\\n\\n if self.0.is_empty() {\\n\\n None\\n\\n } else {\\n\\n let len = u16::from(self.0[0]) << 8 | u16::from(self.0[1]);\\n\\n let data = &self.0[2..];\\n\\n let res = match NalHeader::new(data[0]) {\\n\\n Ok(nal_header) => {\\n\\n if nal_header.nal_unit_type() == self.1 {\\n\",\n \"file_path\": \"src/avcc.rs\",\n \"rank\": 2,\n \"score\": 126047.9002822754\n },\n {\n \"content\": \"/// Removes _Emulation Prevention_ from the given byte sequence of a single NAL unit, returning the\\n\\n/// NAL units _Raw Byte Sequence Payload_ (RBSP). Expects to be called without the NAL header byte.\\n\\npub fn decode_nal<'a>(nal_unit: &'a [u8]) -> Cow<'a, [u8]> {\\n\\n struct DecoderState<'b> {\\n\\n data: Cow<'b, [u8]>,\\n\\n index: usize,\\n\\n }\\n\\n\\n\\n impl<'b> DecoderState<'b> {\\n\\n pub fn new(data: Cow<'b, [u8]>) -> Self {\\n\\n DecoderState { \\n\\n data,\\n\\n index: 0,\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n impl<'b> NalHandler for DecoderState<'b> {\\n\\n type Ctx = ();\\n\\n\\n\\n fn start(&mut self, _ctx: &mut Context<Self::Ctx>, _header: NalHeader) {}\\n\\n\\n\",\n \"file_path\": \"src/rbsp.rs\",\n \"rank\": 3,\n \"score\": 94684.68520967415\n },\n {\n \"content\": \"fn h264_reader(c: &mut Criterion) {\\n\\n let mut f = File::open(\\\"big_buck_bunny_1080p.h264\\\").expect(\\\"file not found\\\");\\n\\n let len = f.metadata().unwrap().len();\\n\\n let mut buf = vec![0; usize::try_from(len).unwrap()];\\n\\n f.read(&mut buf[..]).unwrap();\\n\\n let mut ctx = Context::default();\\n\\n let nal_handler = NullNalHandler {\\n\\n start: 0,\\n\\n push: 0,\\n\\n end: 0,\\n\\n };\\n\\n let rbsp_nal_reader = NullRbspNalReader {\\n\\n decoder: RbspDecoder::new(nal_handler),\\n\\n decoder_started: false,\\n\\n };\\n\\n let nal_reader = NullNalReader {\\n\\n start: 0,\\n\\n push: 0,\\n\\n end: 0,\\n\\n };\\n\",\n \"file_path\": \"benches/bench.rs\",\n \"rank\": 4,\n \"score\": 70504.98575609578\n },\n {\n \"content\": \"fn parse_nal(c: &mut Criterion) {\\n\\n let sps = hex!(\\n\\n \\\"64 00 16 AC 1B 1A 80 B0 3D FF FF\\n\\n 00 28 00 21 6E 0C 0C 0C 80 00 01\\n\\n F4 00 00 27 10 74 30 07 D0 00 07\\n\\n A1 25 DE 5C 68 60 0F A0 00 0F 42\\n\\n 4B BC B8 50\\\");\\n\\n let mut group = c.benchmark_group(\\\"parse_nal\\\");\\n\\n group.bench_function(\\\"sps\\\", |b| b.iter(|| SeqParameterSet::from_bytes(&sps[..]).unwrap()));\\n\\n}\\n\\n\\n\\ncriterion_group!(benches, h264_reader, parse_nal);\\n\\ncriterion_main!(benches);\\n\",\n \"file_path\": \"benches/bench.rs\",\n \"rank\": 5,\n \"score\": 70504.98575609578\n },\n {\n \"content\": \"#[derive(Debug, PartialEq)]\\n\\nstruct SliceType {\\n\\n family: SliceFamily,\\n\\n exclusive: SliceExclusive,\\n\\n}\\n\\nimpl SliceType {\\n\\n fn from_id(id: u32) -> Result<SliceType, SliceHeaderError> {\\n\\n match id {\\n\\n 0 => Ok(SliceType { family: SliceFamily::P, exclusive: SliceExclusive::NonExclusive }),\\n\\n 1 => Ok(SliceType { family: SliceFamily::B, exclusive: SliceExclusive::NonExclusive }),\\n\\n 2 => Ok(SliceType { family: SliceFamily::I, exclusive: SliceExclusive::NonExclusive }),\\n\\n 3 => Ok(SliceType { family: SliceFamily::SP, exclusive: SliceExclusive::NonExclusive }),\\n\\n 4 => Ok(SliceType { family: SliceFamily::SI, exclusive: SliceExclusive::NonExclusive }),\\n\\n 5 => Ok(SliceType { family: SliceFamily::P, exclusive: SliceExclusive::Exclusive }),\\n\\n 6 => Ok(SliceType { family: SliceFamily::B, exclusive: SliceExclusive::Exclusive }),\\n\\n 7 => Ok(SliceType { family: SliceFamily::I, exclusive: SliceExclusive::Exclusive }),\\n\\n 8 => Ok(SliceType { family: SliceFamily::SP, exclusive: SliceExclusive::Exclusive }),\\n\\n 9 => Ok(SliceType { family: SliceFamily::SI, exclusive: SliceExclusive::Exclusive }),\\n\\n _ => Err(SliceHeaderError::InvalidSliceType(id))\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/nal/slice/mod.rs\",\n \"rank\": 6,\n \"score\": 68348.54420211987\n },\n {\n \"content\": \"#[derive(Debug,PartialEq)]\\n\\nenum PicOrderCountLsb {\\n\\n Frame(u32),\\n\\n FieldsAbsolute { top: u32, bottom_delta: i32 },\\n\\n FieldsDelta([i32; 2]),\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/nal/slice/mod.rs\",\n \"rank\": 7,\n \"score\": 63611.10520938069\n },\n {\n \"content\": \"pub trait Register: Default {\\n\\n type Ctx;\\n\\n fn handle(&mut self, ctx: &mut Context<Self::Ctx>, country_code: ItuTT35, payload: &[u8]);\\n\\n}\\n\\n\\n\\npub struct UserDataRegisteredItuTT35Reader<R: Register> {\\n\\n register: R,\\n\\n}\\n\\nimpl<R: Register> UserDataRegisteredItuTT35Reader<R> {\\n\\n pub fn new(register: R) -> UserDataRegisteredItuTT35Reader<R> {\\n\\n UserDataRegisteredItuTT35Reader {\\n\\n register,\\n\\n }\\n\\n }\\n\\n}\\n\\nimpl<R: Register> SeiCompletePayloadReader for UserDataRegisteredItuTT35Reader<R> {\\n\\n type Ctx = R::Ctx;\\n\\n\\n\\n fn header(&mut self, ctx: &mut Context<Self::Ctx>, payload_type: HeaderType, buf: &[u8]) {\\n\\n assert_eq!(payload_type, HeaderType::UserDataRegisteredItuTT35);\\n\",\n \"file_path\": \"src/nal/sei/user_data_registered_itu_t_t35.rs\",\n \"rank\": 8,\n \"score\": 63384.80617952558\n },\n {\n \"content\": \"struct InUnitState {\\n\\n /// The number of bytes to backtrack if the current sequence of `0x00`s\\n\\n /// doesn't end the NAL unit.\\n\\n backtrack_bytes: usize,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/annexb.rs\",\n \"rank\": 11,\n \"score\": 45138.13767259798\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nenum ParseState {\\n\\n Start,\\n\\n OneZero,\\n\\n TwoZero,\\n\\n}\\n\\n\\n\\n/// Push parser which removes _emulation prevention_ as it calls\\n\\n/// an inner [NalHandler]. Expects to be called without the NAL header byte.\\n\\npub struct RbspDecoder<R>\\n\\n where\\n\\n R: NalHandler\\n\\n{\\n\\n state: ParseState,\\n\\n nal_reader: R,\\n\\n}\\n\\nimpl<R> RbspDecoder<R>\\n\\n where\\n\\n R: NalHandler\\n\\n{\\n\\n pub fn new(nal_reader: R) -> Self {\\n\",\n \"file_path\": \"src/rbsp.rs\",\n \"rank\": 12,\n \"score\": 45138.13767259798\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nenum ParseState {\\n\\n Start,\\n\\n StartOneZero,\\n\\n StartTwoZero,\\n\\n StartOne,\\n\\n InUnit,\\n\\n InUnitOneZero,\\n\\n InUnitTwoZero,\\n\\n Error,\\n\\n End,\\n\\n}\\n\\nimpl ParseState {\\n\\n /// If in a NAL unit (`NalReader`'s `start` has been called but not its `end`),\\n\\n /// returns an object describing the state.\\n\\n fn in_unit(&self) -> Option<InUnitState> {\\n\\n match *self {\\n\\n ParseState::Start => None,\\n\\n ParseState::StartOneZero => None,\\n\\n ParseState::StartTwoZero => None,\\n\\n ParseState::StartOne => None,\\n\\n ParseState::InUnit => Some(InUnitState { backtrack_bytes: 0 }),\\n\\n ParseState::InUnitOneZero => Some(InUnitState { backtrack_bytes: 1 }),\\n\\n ParseState::InUnitTwoZero => Some(InUnitState { backtrack_bytes: 2 }),\\n\\n ParseState::Error => None,\\n\\n ParseState::End => None,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/annexb.rs\",\n \"rank\": 13,\n \"score\": 45138.13767259798\n },\n {\n \"content\": \"#[derive(Debug,PartialEq)]\\n\\nenum Field {\\n\\n Top,\\n\\n Bottom,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/nal/slice/mod.rs\",\n \"rank\": 14,\n \"score\": 43630.44616959907\n },\n {\n \"content\": \"struct NullNalHandler {\\n\\n start: u64,\\n\\n push: u64,\\n\\n end: u64,\\n\\n}\\n\\nimpl NalHandler for NullNalHandler {\\n\\n type Ctx = ();\\n\\n\\n\\n fn start(&mut self, _ctx: &mut Context<Self::Ctx>, _header: NalHeader) {\\n\\n self.start += 1;\\n\\n }\\n\\n\\n\\n fn push(&mut self, _ctx: &mut Context<Self::Ctx>, _buf: &[u8]) {\\n\\n self.push += 1;\\n\\n }\\n\\n\\n\\n fn end(&mut self, _ctx: &mut Context<Self::Ctx>) {\\n\\n self.end += 1;\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/bench.rs\",\n \"rank\": 15,\n \"score\": 43626.495102454035\n },\n {\n \"content\": \"struct NullNalReader {\\n\\n start: u64,\\n\\n push: u64,\\n\\n end: u64,\\n\\n}\\n\\nimpl NalReader for NullNalReader {\\n\\n type Ctx = ();\\n\\n\\n\\n fn start(&mut self, _ctx: &mut Context<Self::Ctx>) {\\n\\n self.start += 1;\\n\\n }\\n\\n fn push(&mut self, _ctx: &mut Context<Self::Ctx>, _buf: &[u8]) {\\n\\n self.push += 1;\\n\\n }\\n\\n fn end(&mut self, _ctx: &mut Context<Self::Ctx>) {\\n\\n self.end += 1;\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/bench.rs\",\n \"rank\": 16,\n \"score\": 43626.495102454035\n },\n {\n \"content\": \"#[derive(Default)]\\n\\nstruct AvcBuilder {\\n\\n started: bool,\\n\\n cur: Vec<u8>,\\n\\n}\\n\\n\\n\\nimpl h264_reader::annexb::NalReader for AvcBuilder {\\n\\n type Ctx = Vec<u8>;\\n\\n\\n\\n fn start(&mut self, _ctx: &mut Context<Self::Ctx>) {\\n\\n assert!(!self.started);\\n\\n self.started = true;\\n\\n }\\n\\n fn push(&mut self, _ctx: &mut Context<Self::Ctx>, buf: &[u8]) {\\n\\n assert!(self.started);\\n\\n assert!(!buf.is_empty()); // useless empty push.\\n\\n self.cur.extend_from_slice(buf);\\n\\n }\\n\\n fn end(&mut self, ctx: &mut Context<Self::Ctx>) {\\n\\n assert!(self.started);\\n\\n self.started = false;\\n\",\n \"file_path\": \"fuzz/fuzz_targets/annexb.rs\",\n \"rank\": 17,\n \"score\": 42270.27088462817\n },\n {\n \"content\": \"#[derive(Debug,PartialEq)]\\n\\nenum SliceFamily {\\n\\n P,\\n\\n B,\\n\\n I,\\n\\n SP,\\n\\n SI\\n\\n}\\n\",\n \"file_path\": \"src/nal/slice/mod.rs\",\n \"rank\": 18,\n \"score\": 42270.08246166817\n },\n {\n \"content\": \"#[derive(Debug,PartialEq)]\\n\\nenum FieldPic {\\n\\n Frame,\\n\\n Field(Field),\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/nal/slice/mod.rs\",\n \"rank\": 19,\n \"score\": 42270.08246166817\n },\n {\n \"content\": \"#[derive(Debug,PartialEq)]\\n\\nenum SliceExclusive {\\n\\n /// All slices in the picture have the same type\\n\\n Exclusive,\\n\\n /// Other slices in the picture may have a different type than the current slice\\n\\n NonExclusive,\\n\\n}\\n\",\n \"file_path\": \"src/nal/slice/mod.rs\",\n \"rank\": 20,\n \"score\": 42270.08246166817\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nenum ColourPlane {\\n\\n /// Indicates the _chroma_ colour plane\\n\\n Y,\\n\\n /// Indicates the _blue-difference_ colour plane\\n\\n Cb,\\n\\n /// Indicates the _red-difference_ colour plane\\n\\n Cr,\\n\\n}\\n\\n#[derive(Debug)]\\n\\npub enum ColourPlaneError {\\n\\n InvalidId(u8),\\n\\n}\\n\\nimpl ColourPlane {\\n\\n fn from_id(id: u8) -> Result<ColourPlane, ColourPlaneError> {\\n\\n match id {\\n\\n 0 => Ok(ColourPlane::Y),\\n\\n 1 => Ok(ColourPlane::Cb),\\n\\n 2 => Ok(ColourPlane::Cr),\\n\\n _ => Err(ColourPlaneError::InvalidId(id))\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/nal/slice/mod.rs\",\n \"rank\": 21,\n \"score\": 42266.13139452314\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct PredWeight {\\n\\n weight: i32,\\n\\n offset: i32,\\n\\n}\\n\",\n \"file_path\": \"src/nal/slice/mod.rs\",\n \"rank\": 22,\n \"score\": 42266.13139452314\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nenum NalSwitchState {\\n\\n Start,\\n\\n Handling(UnitType),\\n\\n Ignoring,\\n\\n}\\n\\n// TODO: generate enum at compile time rather than Vec<Box<>>\\n\\npub struct NalSwitch<Ctx> {\\n\\n readers_by_id: Vec<Option<Box<RefCell<dyn NalHandler<Ctx=Ctx>>>>>,\\n\\n state: NalSwitchState,\\n\\n}\\n\\nimpl<Ctx> Default for NalSwitch<Ctx> {\\n\\n fn default() -> Self {\\n\\n NalSwitch {\\n\\n readers_by_id: Vec::new(),\\n\\n state: NalSwitchState::Start,\\n\\n }\\n\\n }\\n\\n}\\n\\nimpl<Ctx> NalSwitch<Ctx> {\\n\\n pub fn put_handler(&mut self, unit_type: UnitType, handler: Box<RefCell<dyn NalHandler<Ctx=Ctx>>>) {\\n\",\n \"file_path\": \"src/nal/mod.rs\",\n \"rank\": 23,\n \"score\": 42266.13139452314\n },\n {\n \"content\": \"#[derive(Debug, Clone)]\\n\\nstruct PicScalingMatrix {\\n\\n // TODO\\n\\n}\\n\\nimpl PicScalingMatrix {\\n\\n fn read(r: &mut RbspBitReader<'_>, sps: &sps::SeqParameterSet, transform_8x8_mode_flag: bool) -> Result<Option<PicScalingMatrix>,PpsError> {\\n\\n let pic_scaling_matrix_present_flag = r.read_bool()?;\\n\\n Ok(if pic_scaling_matrix_present_flag {\\n\\n let mut scaling_list4x4 = vec!();\\n\\n let mut scaling_list8x8 = vec!();\\n\\n\\n\\n let count = if transform_8x8_mode_flag {\\n\\n if sps.chroma_info.chroma_format == sps::ChromaFormat::YUV444 { 12 } else { 8 }\\n\\n } else {\\n\\n 0\\n\\n };\\n\\n for i in 0..6+count {\\n\\n let seq_scaling_list_present_flag = r.read_bool()?;\\n\\n if seq_scaling_list_present_flag {\\n\\n if i < 6 {\\n\\n scaling_list4x4.push(sps::ScalingList::read(r, 16).map_err(PpsError::ScalingMatrix)?);\\n\",\n \"file_path\": \"src/nal/pps.rs\",\n \"rank\": 24,\n \"score\": 42266.13139452314\n },\n {\n \"content\": \"struct NullRbspNalReader {\\n\\n decoder: RbspDecoder<NullNalHandler>,\\n\\n decoder_started: bool,\\n\\n}\\n\\nimpl NalReader for NullRbspNalReader {\\n\\n type Ctx = ();\\n\\n\\n\\n fn start(&mut self, _ctx: &mut Context<Self::Ctx>) {\\n\\n assert!(!self.decoder_started);\\n\\n }\\n\\n fn push(&mut self, ctx: &mut Context<Self::Ctx>, mut buf: &[u8]) {\\n\\n if !self.decoder_started && !buf.is_empty() {\\n\\n let hdr = NalHeader::new(buf[0]).unwrap();\\n\\n self.decoder.start(ctx, hdr);\\n\\n buf = &buf[1..];\\n\\n self.decoder_started = true;\\n\\n }\\n\\n if self.decoder_started {\\n\\n self.decoder.push(ctx, buf);\\n\\n }\\n\\n }\\n\\n fn end(&mut self, ctx: &mut Context<Self::Ctx>) {\\n\\n assert!(self.decoder_started);\\n\\n self.decoder.end(ctx);\\n\\n self.decoder_started = false;\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/bench.rs\",\n \"rank\": 25,\n \"score\": 42266.13139452314\n },\n {\n \"content\": \"enum ParseState {\\n\\n Unstarted,\\n\\n Start(NalHeader),\\n\\n Continue(NalHeader),\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/nal/slice/mod.rs\",\n \"rank\": 26,\n \"score\": 42266.13139452314\n },\n {\n \"content\": \"#[derive(Default)]\\n\\nstruct NalCapture {\\n\\n buf: Vec<u8>,\\n\\n}\\n\\nimpl NalHandler for NalCapture {\\n\\n type Ctx = ();\\n\\n\\n\\n fn start(&mut self, ctx: &mut h264_reader::Context<Self::Ctx>, header: NalHeader) {\\n\\n self.buf.clear();\\n\\n }\\n\\n\\n\\n fn push(&mut self, ctx: &mut h264_reader::Context<Self::Ctx>, buf: &[u8]) {\\n\\n self.buf.extend_from_slice(buf);\\n\\n }\\n\\n\\n\\n fn end(&mut self, ctx: &mut h264_reader::Context<Self::Ctx>) {\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fuzz/fuzz_targets/fuzz_target_1.rs\",\n \"rank\": 27,\n \"score\": 41039.55916907769\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct PredWeightTable {\\n\\n luma_log2_weight_denom: u32,\\n\\n chroma_log2_weight_denom: Option<u32>,\\n\\n luma_weights: Vec<Option<PredWeight>>,\\n\\n chroma_weights: Vec<Vec<PredWeight>>,\\n\\n}\\n\\nimpl PredWeightTable {\\n\\n fn read(r: &mut RbspBitReader<'_>, slice_type: &SliceType, pps: &pps::PicParameterSet, sps: &sps::SeqParameterSet, num_ref_active: &Option<NumRefIdxActive>) -> Result<PredWeightTable, SliceHeaderError> {\\n\\n let chroma_array_type = if sps.chroma_info.separate_colour_plane_flag {\\n\\n // TODO: \\\"Otherwise (separate_colour_plane_flag is equal to 1), ChromaArrayType is\\n\\n // set equal to 0.\\\" ...does this mean ChromaFormat::Monochrome then?\\n\\n sps::ChromaFormat::Monochrome\\n\\n } else {\\n\\n sps.chroma_info.chroma_format\\n\\n };\\n\\n let luma_log2_weight_denom = r.read_ue_named(\\\"luma_log2_weight_denom\\\")?;\\n\\n let chroma_log2_weight_denom = if chroma_array_type != sps::ChromaFormat::Monochrome {\\n\\n Some(r.read_ue_named(\\\"chroma_log2_weight_denom\\\")?)\\n\\n } else {\\n\\n None\\n\",\n \"file_path\": \"src/nal/slice/mod.rs\",\n \"rank\": 28,\n \"score\": 41035.41967897267\n },\n {\n \"content\": \"struct InProgressSlice {\\n\\n header: h264_reader::nal::NalHeader,\\n\\n buf: Vec<u8>,\\n\\n}\\n\",\n \"file_path\": \"fuzz/fuzz_targets/fuzz_target_1.rs\",\n \"rank\": 29,\n \"score\": 41035.41967897267\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nenum SeiHeaderState {\\n\\n Begin,\\n\\n PayloadType { payload_type: u32 },\\n\\n PayloadSize { payload_type: HeaderType, payload_size: u32 },\\n\\n Payload { payload_type: HeaderType, payload_size: u32, consumed_size: u32 },\\n\\n End,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/nal/sei/mod.rs\",\n \"rank\": 30,\n \"score\": 41035.41967897267\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nenum ModificationOfPicNums {\\n\\n Subtract(u32),\\n\\n Add(u32),\\n\\n LongTermRef(u32),\\n\\n}\\n\",\n \"file_path\": \"src/nal/slice/mod.rs\",\n \"rank\": 31,\n \"score\": 41035.41967897267\n },\n {\n \"content\": \"struct SliceFuzz {\\n\\n current_slice: Option<InProgressSlice>,\\n\\n}\\n\\nimpl SliceFuzz {\\n\\n pub fn new() -> SliceFuzz {\\n\\n SliceFuzz {\\n\\n current_slice: None,\\n\\n }\\n\\n }\\n\\n}\\n\\nimpl h264_reader::nal::NalHandler for SliceFuzz {\\n\\n type Ctx = ();\\n\\n\\n\\n fn start(&mut self, ctx: &mut h264_reader::Context<Self::Ctx>, header: h264_reader::nal::NalHeader) {\\n\\n let mut buf = Vec::new();\\n\\n buf.push(header.into());\\n\\n self.current_slice = Some(InProgressSlice {\\n\\n header,\\n\\n buf,\\n\\n });\\n\",\n \"file_path\": \"fuzz/fuzz_targets/fuzz_target_1.rs\",\n \"rank\": 32,\n \"score\": 41035.41967897267\n },\n {\n \"content\": \"pub trait NalReader {\\n\\n type Ctx;\\n\\n\\n\\n /// Starts a NAL unit.\\n\\n fn start(&mut self, ctx: &mut Context<Self::Ctx>);\\n\\n\\n\\n /// Pushes a non-empty buffer as part of a NAL unit.\\n\\n fn push(&mut self, ctx: &mut Context<Self::Ctx>, buf: &[u8]);\\n\\n\\n\\n /// Ends a NAL unit, which could be empty.\\n\\n fn end(&mut self, ctx: &mut Context<Self::Ctx>);\\n\\n}\\n\\n\\n\\n/// Push parser for Annex B format which delegates to a [NalReader].\\n\\n///\\n\\n/// Guarantees that the bytes supplied to `NalReader`—the concatenation of all\\n\\n/// `buf`s supplied to `NalReader::push`—will be exactly the same for a given\\n\\n/// Annex B stream, regardless of boundaries of `AnnexBReader::push` calls.\\n\\npub struct AnnexBReader<R, Ctx>\\n\\n where\\n\",\n \"file_path\": \"src/annexb.rs\",\n \"rank\": 33,\n \"score\": 40493.85262945283\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nenum DecRefPicMarking {\\n\\n Idr {\\n\\n no_output_of_prior_pics_flag: bool,\\n\\n long_term_reference_flag: bool,\\n\\n },\\n\\n /// `adaptive_ref_pic_marking_mode_flag` equal to `0`\\n\\n SlidingWindow,\\n\\n /// `adaptive_ref_pic_marking_mode_flag` equal to `1`\\n\\n Adaptive(Vec<MemoryManagementControlOperation>),\\n\\n}\\n\\nimpl DecRefPicMarking {\\n\\n fn read(r: &mut RbspBitReader<'_>, header: NalHeader) -> Result<DecRefPicMarking, SliceHeaderError> {\\n\\n Ok(if header.nal_unit_type() == crate::nal::UnitType::SliceLayerWithoutPartitioningIdr {\\n\\n DecRefPicMarking::Idr {\\n\\n no_output_of_prior_pics_flag: r.read_bool_named(\\\"no_output_of_prior_pics_flag\\\")?,\\n\\n long_term_reference_flag: r.read_bool_named(\\\"long_term_reference_flag\\\")?,\\n\\n }\\n\\n } else if r.read_bool_named(\\\"adaptive_ref_pic_marking_mode_flag\\\")? {\\n\\n let mut ctl = vec![];\\n\\n loop {\\n\",\n \"file_path\": \"src/nal/slice/mod.rs\",\n \"rank\": 35,\n \"score\": 39916.66795408563\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nenum MemoryManagementControlOperation {\\n\\n /// `memory_management_control_operation` value of `1`\\n\\n ShortTermUnusedForRef { difference_of_pic_nums_minus1: u32 },\\n\\n /// `memory_management_control_operation` value of `2`\\n\\n LongTermUnusedForRef { long_term_pic_num: u32 },\\n\\n /// `memory_management_control_operation` value of `3`\\n\\n ShortTermUsedForLongTerm { difference_of_pic_nums_minus1: u32, long_term_frame_idx: u32 },\\n\\n /// `memory_management_control_operation` value of `4`\\n\\n MaxUsedLongTermFrameRef { max_long_term_frame_idx_plus1: u32 },\\n\\n /// `memory_management_control_operation` value of `5`\\n\\n AllRefPicturesUnused,\\n\\n /// `memory_management_control_operation` value of `6`\\n\\n CurrentUsedForLongTerm { long_term_frame_idx: u32 },\\n\\n}\\n\\n\\n\\n/// Decoded reference picture marking\\n\",\n \"file_path\": \"src/nal/slice/mod.rs\",\n \"rank\": 36,\n \"score\": 39916.66795408563\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nenum RefPicListModifications {\\n\\n I,\\n\\n P {\\n\\n ref_pic_list_modification_l0: Vec<ModificationOfPicNums>,\\n\\n },\\n\\n B {\\n\\n ref_pic_list_modification_l0: Vec<ModificationOfPicNums>,\\n\\n ref_pic_list_modification_l1: Vec<ModificationOfPicNums>,\\n\\n },\\n\\n}\\n\\nimpl RefPicListModifications {\\n\\n fn read(slice_family: &SliceFamily, r: &mut RbspBitReader<'_>) -> Result<RefPicListModifications, SliceHeaderError> {\\n\\n Ok(match slice_family {\\n\\n SliceFamily::I | SliceFamily::SI => RefPicListModifications::I,\\n\\n SliceFamily::B => RefPicListModifications::B {\\n\\n ref_pic_list_modification_l0: Self::read_list(r)?,\\n\\n ref_pic_list_modification_l1: Self::read_list(r)?,\\n\\n },\\n\\n SliceFamily::P | SliceFamily::SP => RefPicListModifications::P {\\n\\n ref_pic_list_modification_l0: Self::read_list(r)?,\\n\",\n \"file_path\": \"src/nal/slice/mod.rs\",\n \"rank\": 37,\n \"score\": 39916.66795408563\n },\n {\n \"content\": \"struct PicTimingFuzz;\\n\\nimpl nal::sei::pic_timing::PicTimingHandler for PicTimingFuzz {\\n\\n type Ctx = ();\\n\\n\\n\\n fn handle(&mut self, ctx: &mut h264_reader::Context<Self::Ctx>, pic_timing: nal::sei::pic_timing::PicTiming) {\\n\\n println!(\\\" {:?}\\\", pic_timing);\\n\\n }\\n\\n}\\n\\n\\n\\nh264_reader::sei_switch!{\\n\\n SeiSwitch<()> {\\n\\n //BufferingPeriod: h264_reader::nal::sei::buffering_period::BufferingPeriodPayloadReader\\n\\n // => h264_reader::nal::sei::buffering_period::BufferingPeriodPayloadReader::new(),\\n\\n //UserDataRegisteredItuTT35: h264_reader::nal::sei::user_data_registered_itu_t_t35::UserDataRegisteredItuTT35Reader<TT35Switch>\\n\\n // => h264_reader::nal::sei::user_data_registered_itu_t_t35::UserDataRegisteredItuTT35Reader::new(TT35Switch::default()),\\n\\n PicTiming: h264_reader::nal::sei::pic_timing::PicTimingReader<PicTimingFuzz>\\n\\n => h264_reader::nal::sei::pic_timing::PicTimingReader::new(PicTimingFuzz),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"fuzz/fuzz_targets/fuzz_target_1.rs\",\n \"rank\": 38,\n \"score\": 39916.66795408563\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nenum NumRefIdxActive {\\n\\n P{ num_ref_idx_l0_active_minus1: u32 },\\n\\n B{ num_ref_idx_l0_active_minus1: u32, num_ref_idx_l1_active_minus1: u32 }\\n\\n}\\n\\nimpl NumRefIdxActive {\\n\\n fn num_ref_idx_l0_active_minus1(&self) -> u32 {\\n\\n match *self {\\n\\n NumRefIdxActive::P { num_ref_idx_l0_active_minus1 } => num_ref_idx_l0_active_minus1,\\n\\n NumRefIdxActive::B { num_ref_idx_l0_active_minus1, .. } => num_ref_idx_l0_active_minus1,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/nal/slice/mod.rs\",\n \"rank\": 39,\n \"score\": 39916.66795408563\n },\n {\n \"content\": \"// TODO: rename to 'RbspHandler' or something, to indicate it's only for post-emulation-prevention-bytes data\\n\\npub trait NalHandler {\\n\\n type Ctx;\\n\\n\\n\\n fn start(&mut self, ctx: &mut Context<Self::Ctx>, header: NalHeader);\\n\\n fn push(&mut self, ctx: &mut Context<Self::Ctx>, buf: &[u8]);\\n\\n fn end(&mut self, ctx: &mut Context<Self::Ctx>);\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use super::*;\\n\\n use hex_literal::*;\\n\\n\\n\\n #[test]\\n\\n fn header() {\\n\\n let h = NalHeader::new(0b0101_0001).unwrap();\\n\\n assert_eq!(0b10, h.nal_ref_idc());\\n\\n assert_eq!(UnitType::Reserved(17), h.nal_unit_type());\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/nal/mod.rs\",\n \"rank\": 40,\n \"score\": 39124.61995870987\n },\n {\n \"content\": \"struct FuzzSeiPayoadReader {\\n\\n switch: SeiSwitch,\\n\\n}\\n\\nimpl h264_reader::nal::sei::SeiIncrementalPayloadReader for FuzzSeiPayoadReader {\\n\\n type Ctx = ();\\n\\n\\n\\n fn start(&mut self, ctx: &mut h264_reader::Context<Self::Ctx>, payload_type: h264_reader::nal::sei::HeaderType, payload_size: u32) {\\n\\n //println!(\\\" SEI: {:?} size={}\\\", payload_type, payload_size);\\n\\n self.switch.start(ctx, payload_type, payload_size)\\n\\n }\\n\\n\\n\\n fn push(&mut self, ctx: &mut h264_reader::Context<Self::Ctx>, buf: &[u8]) {\\n\\n self.switch.push(ctx, buf)\\n\\n }\\n\\n\\n\\n fn end(&mut self, ctx: &mut h264_reader::Context<Self::Ctx>) {\\n\\n self.switch.end(ctx)\\n\\n }\\n\\n\\n\\n fn reset(&mut self, ctx: &mut h264_reader::Context<Self::Ctx>) {\\n\\n self.switch.reset(ctx)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fuzz/fuzz_targets/fuzz_target_1.rs\",\n \"rank\": 41,\n \"score\": 38895.263116268536\n },\n {\n \"content\": \"pub trait PicTimingHandler {\\n\\n type Ctx;\\n\\n fn handle(&mut self, ctx: &mut Context<Self::Ctx>, pic_timing: PicTiming);\\n\\n}\\n\\npub struct PicTimingReader<H: PicTimingHandler> {\\n\\n handler: H,\\n\\n}\\n\\nimpl<H: PicTimingHandler> PicTimingReader<H> {\\n\\n pub fn new(handler: H) -> Self {\\n\\n PicTimingReader {\\n\\n handler,\\n\\n }\\n\\n }\\n\\n}\\n\\nimpl<H: PicTimingHandler> SeiCompletePayloadReader for PicTimingReader<H> {\\n\\n type Ctx = H::Ctx;\\n\\n\\n\\n fn header(&mut self, ctx: &mut Context<Self::Ctx>, payload_type: HeaderType, buf: &[u8]) {\\n\\n assert_eq!(payload_type, HeaderType::PicTiming);\\n\\n match PicTiming::read(ctx, buf) {\\n\\n Err(e) => error!(\\\"Failure reading pic_timing: {:?}\\\", e),\\n\\n Ok(pic_timing) => {\\n\\n self.handler.handle(ctx, pic_timing);\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/nal/sei/pic_timing.rs\",\n \"rank\": 42,\n \"score\": 35731.775127251196\n },\n {\n \"content\": \"pub trait SeiIncrementalPayloadReader {\\n\\n type Ctx;\\n\\n fn start(&mut self, ctx: &mut Context<Self::Ctx>, payload_type: HeaderType, payload_size: u32);\\n\\n fn push(&mut self, ctx: &mut Context<Self::Ctx>, buf: &[u8]);\\n\\n fn end(&mut self, ctx: &mut Context<Self::Ctx>);\\n\\n fn reset(&mut self, ctx: &mut Context<Self::Ctx>);\\n\\n}\\n\\n\\n\\npub struct SeiBuffer<R: SeiCompletePayloadReader> {\\n\\n payload_type: Option<HeaderType>,\\n\\n buf: Vec<u8>,\\n\\n reader: R,\\n\\n}\\n\\nimpl<R: SeiCompletePayloadReader> SeiBuffer<R> {\\n\\n pub fn new(reader: R) -> Self {\\n\\n SeiBuffer {\\n\\n payload_type: None,\\n\\n buf: Vec::new(),\\n\\n reader,\\n\\n }\\n\",\n \"file_path\": \"src/nal/sei/mod.rs\",\n \"rank\": 43,\n \"score\": 35731.775127251196\n },\n {\n \"content\": \"pub trait SeiCompletePayloadReader {\\n\\n type Ctx;\\n\\n fn header(&mut self, ctx: &mut Context<Self::Ctx>, payload_type: HeaderType, buf: &[u8]);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/nal/sei/mod.rs\",\n \"rank\": 44,\n \"score\": 35731.775127251196\n },\n {\n \"content\": \" use std::cell::RefCell;\\n\\n\\n\\n #[derive(Default)]\\n\\n struct State {\\n\\n started: u32,\\n\\n ended: u32,\\n\\n data: Vec<u8>,\\n\\n }\\n\\n struct MockReader {\\n\\n state: Rc<RefCell<State>>\\n\\n }\\n\\n impl SeiIncrementalPayloadReader for MockReader {\\n\\n type Ctx = ();\\n\\n\\n\\n fn start(&mut self, _ctx: &mut Context<Self::Ctx>, _payload_type: HeaderType, _payload_size: u32) {\\n\\n self.state.borrow_mut().started += 1;\\n\\n }\\n\\n\\n\\n fn push(&mut self, _ctx: &mut Context<Self::Ctx>, buf: &[u8]) {\\n\\n self.state.borrow_mut().data.extend_from_slice(buf);\\n\",\n \"file_path\": \"src/nal/sei/mod.rs\",\n \"rank\": 46,\n \"score\": 33.28320486776622\n },\n {\n \"content\": \"impl<Ctx> Default for SeqParameterSetNalHandler<Ctx> {\\n\\n fn default() -> Self {\\n\\n SeqParameterSetNalHandler {\\n\\n buf: Vec::new(),\\n\\n phantom: marker::PhantomData,\\n\\n }\\n\\n }\\n\\n}\\n\\nimpl<Ctx> NalHandler for SeqParameterSetNalHandler<Ctx> {\\n\\n type Ctx = Ctx;\\n\\n\\n\\n fn start(&mut self, _ctx: &mut Context<Ctx>, header: NalHeader) {\\n\\n assert_eq!(header.nal_unit_type(), super::UnitType::SeqParameterSet);\\n\\n }\\n\\n\\n\\n fn push(&mut self, _ctx: &mut Context<Ctx>, buf: &[u8]) {\\n\\n self.buf.extend_from_slice(buf);\\n\\n }\\n\\n\\n\\n fn end(&mut self, ctx: &mut Context<Ctx>) {\\n\",\n \"file_path\": \"src/nal/sps.rs\",\n \"rank\": 47,\n \"score\": 32.02088936010842\n },\n {\n \"content\": \" }\\n\\n}\\n\\nimpl<R: SeiCompletePayloadReader> SeiIncrementalPayloadReader for SeiBuffer<R> {\\n\\n type Ctx = R::Ctx;\\n\\n\\n\\n fn start(&mut self, _ctx: &mut Context<Self::Ctx>, payload_type: HeaderType, _payload_size: u32) {\\n\\n self.payload_type = Some(payload_type);\\n\\n }\\n\\n\\n\\n fn push(&mut self, _ctx: &mut Context<Self::Ctx>, buf: &[u8]) {\\n\\n self.buf.extend_from_slice(buf);\\n\\n }\\n\\n\\n\\n fn end(&mut self, ctx: &mut Context<Self::Ctx>) {\\n\\n self.reader.header(ctx, self.payload_type.unwrap(), &self.buf[..]);\\n\\n self.buf.clear();\\n\\n self.payload_type = None;\\n\\n }\\n\\n\\n\\n fn reset(&mut self, _ctx: &mut Context<Self::Ctx>) {\\n\",\n \"file_path\": \"src/nal/sei/mod.rs\",\n \"rank\": 48,\n \"score\": 30.880319225076715\n },\n {\n \"content\": \" type Ctx = R::Ctx;\\n\\n\\n\\n fn start(&mut self, ctx: &mut Context<Self::Ctx>, header: NalHeader) {\\n\\n assert_eq!(header.nal_unit_type(), super::UnitType::SEI);\\n\\n self.reader.start(ctx, header);\\n\\n }\\n\\n\\n\\n fn push(&mut self, ctx: &mut Context<Self::Ctx>, buf: &[u8]) {\\n\\n self.reader.push(ctx, buf);\\n\\n }\\n\\n\\n\\n fn end(&mut self, ctx: &mut Context<Self::Ctx>) {\\n\\n self.reader.end(ctx);\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use super::*;\\n\\n use std::rc::Rc;\\n\",\n \"file_path\": \"src/nal/sei/mod.rs\",\n \"rank\": 49,\n \"score\": 29.340421098541746\n },\n {\n \"content\": \"\\n\\n fn read_slice_groups(r: &mut RbspBitReader<'_>) -> Result<Option<SliceGroup>,PpsError> {\\n\\n let num_slice_groups_minus1 = r.read_ue_named(\\\"num_slice_groups_minus1\\\")?;\\n\\n Ok(if num_slice_groups_minus1 > 0 {\\n\\n Some(SliceGroup::read(r, num_slice_groups_minus1)?)\\n\\n } else {\\n\\n None\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\\npub struct PicParameterSetNalHandler<Ctx> {\\n\\n buf: Vec<u8>,\\n\\n phantom: marker::PhantomData<Ctx>\\n\\n}\\n\\n\\n\\nimpl<Ctx> Default for PicParameterSetNalHandler<Ctx> {\\n\\n fn default() -> Self {\\n\\n PicParameterSetNalHandler {\\n\\n buf: Vec::new(),\\n\",\n \"file_path\": \"src/nal/pps.rs\",\n \"rank\": 50,\n \"score\": 29.03557866204224\n },\n {\n \"content\": \"}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct PicTiming {\\n\\n pub delays: Option<Delays>,\\n\\n pub pic_struct: Option<PicStruct>,\\n\\n}\\n\\nimpl PicTiming {\\n\\n pub fn read<Ctx>(ctx: &mut Context<Ctx>, buf: &[u8]) -> Result<PicTiming, PicTimingError> {\\n\\n let mut r = RbspBitReader::new(buf);\\n\\n let seq_parameter_set_id = ParamSetId::from_u32(0).unwrap();\\n\\n match ctx.sps_by_id(seq_parameter_set_id) {\\n\\n None => Err(PicTimingError::UndefinedSeqParamSetId(seq_parameter_set_id)),\\n\\n Some(sps) => {\\n\\n Ok(PicTiming {\\n\\n delays: Self::read_delays(&mut r, sps)?,\\n\\n pic_struct: Self::read_pic_struct(&mut r, sps)?,\\n\\n })\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/nal/sei/pic_timing.rs\",\n \"rank\": 51,\n \"score\": 28.9535557126694\n },\n {\n \"content\": \" ExpGolombTooLarge(&'static str),\\n\\n}\\n\\n\\n\\npub struct RbspBitReader<'buf> {\\n\\n reader: bitstream_io::read::BitReader<std::io::Cursor<&'buf [u8]>, bitstream_io::BigEndian>,\\n\\n}\\n\\nimpl<'buf> RbspBitReader<'buf> {\\n\\n pub fn new(buf: &'buf [u8]) -> Self {\\n\\n RbspBitReader {\\n\\n reader: bitstream_io::read::BitReader::new(std::io::Cursor::new(buf)),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn read_ue_named(&mut self, name: &'static str) -> Result<u32,RbspBitReaderError> {\\n\\n let count = count_zero_bits(&mut self.reader, name)?;\\n\\n if count > 0 {\\n\\n let val = self.read_u32(count)?;\\n\\n Ok((1 << count) -1 + val)\\n\\n } else {\\n\\n Ok(0)\\n\",\n \"file_path\": \"src/rbsp.rs\",\n \"rank\": 52,\n \"score\": 27.71757594178394\n },\n {\n \"content\": \" struct MockHandler;\\n\\n impl NalHandler for MockHandler {\\n\\n type Ctx = ();\\n\\n\\n\\n fn start(&mut self, _ctx: &mut Context<Self::Ctx>, header: NalHeader) {\\n\\n assert_eq!(header.nal_unit_type(), UnitType::SeqParameterSet);\\n\\n }\\n\\n\\n\\n fn push(&mut self, _ctx: &mut Context<Self::Ctx>, buf: &[u8]) {\\n\\n let expected = hex!(\\n\\n \\\"64 00 0A AC 72 84 44 26 84 00 00\\n\\n 00 04 00 00 00 CA 3C 48 96 11 80\\\");\\n\\n assert_eq!(buf, &expected[..])\\n\\n }\\n\\n\\n\\n fn end(&mut self, _ctx: &mut Context<Self::Ctx>) {\\n\\n }\\n\\n }\\n\\n\\n\\n #[test]\\n\",\n \"file_path\": \"src/nal/mod.rs\",\n \"rank\": 53,\n \"score\": 27.03847138165554\n },\n {\n \"content\": \"\\n\\n pub fn into_handler(self) -> R {\\n\\n self.nal_reader\\n\\n }\\n\\n}\\n\\nimpl<R> NalHandler for RbspDecoder<R>\\n\\n where\\n\\n R: NalHandler\\n\\n{\\n\\n type Ctx = R::Ctx;\\n\\n\\n\\n fn start(&mut self, ctx: &mut Context<Self::Ctx>, header: NalHeader) {\\n\\n self.state = ParseState::Start;\\n\\n self.nal_reader.start(ctx, header);\\n\\n }\\n\\n\\n\\n fn push(&mut self, ctx: &mut Context<Self::Ctx>, mut buf: &[u8]) {\\n\\n // buf[0..i] hasn't yet been emitted and is RBSP (has no emulation_prevention_three_bytes).\\n\\n // self.state describes the state before buf[i].\\n\\n // buf[i..] has yet to be examined.\\n\",\n \"file_path\": \"src/rbsp.rs\",\n \"rank\": 54,\n \"score\": 26.396961617475856\n },\n {\n \"content\": \" phantom: marker::PhantomData,\\n\\n }\\n\\n }\\n\\n}\\n\\nimpl<Ctx> NalHandler for PicParameterSetNalHandler<Ctx> {\\n\\n type Ctx = Ctx;\\n\\n\\n\\n fn start(&mut self, _ctx: &mut Context<Ctx>, header: NalHeader) {\\n\\n assert_eq!(header.nal_unit_type(), super::UnitType::PicParameterSet);\\n\\n }\\n\\n\\n\\n fn push(&mut self, _ctx: &mut Context<Ctx>, buf: &[u8]) {\\n\\n self.buf.extend_from_slice(buf);\\n\\n }\\n\\n\\n\\n fn end(&mut self, ctx: &mut Context<Ctx>) {\\n\\n let pps = PicParameterSet::from_bytes(ctx, &self.buf[..]);\\n\\n self.buf.clear();\\n\\n match pps {\\n\\n Ok(pps) => {\\n\",\n \"file_path\": \"src/nal/pps.rs\",\n \"rank\": 55,\n \"score\": 25.544270486607264\n },\n {\n \"content\": \" }\\n\\n }\\n\\n impl $crate::nal::sei::SeiIncrementalPayloadReader for $struct_name {\\n\\n type Ctx = $ctx;\\n\\n\\n\\n fn start(&mut self, ctx: &mut $crate::Context<Self::Ctx>, payload_type: $crate::nal::sei::HeaderType, payload_size: u32) {\\n\\n self.current_type = Some(payload_type);\\n\\n match payload_type {\\n\\n $(\\n\\n $crate::nal::sei::HeaderType::$name => self.$name.start(ctx, payload_type, payload_size),\\n\\n )*\\n\\n _ => (),\\n\\n }\\n\\n }\\n\\n\\n\\n fn push(&mut self, ctx: &mut $crate::Context<Self::Ctx>, buf: &[u8]) {\\n\\n match self.current_type {\\n\\n $(\\n\\n Some($crate::nal::sei::HeaderType::$name) => self.$name.push(ctx, buf),\\n\\n )*\\n\",\n \"file_path\": \"src/nal/sei/mod.rs\",\n \"rank\": 56,\n \"score\": 24.791724835067846\n },\n {\n \"content\": \" }),\\n\\n _ => Err(PpsError::InvalidSliceGroupMapType(slice_group_map_type))\\n\\n }\\n\\n }\\n\\n\\n\\n fn read_run_lengths(r: &mut RbspBitReader<'_>, num_slice_groups_minus1: u32) -> Result<Vec<u32>,PpsError> {\\n\\n let mut run_length_minus1 = Vec::with_capacity(num_slice_groups_minus1 as usize + 1);\\n\\n for _ in 0..num_slice_groups_minus1+1 {\\n\\n run_length_minus1.push(r.read_ue_named(\\\"run_length_minus1\\\")?);\\n\\n }\\n\\n Ok(run_length_minus1)\\n\\n }\\n\\n\\n\\n fn read_rectangles(r: &mut RbspBitReader<'_>, num_slice_groups_minus1: u32) -> Result<Vec<SliceRect>,PpsError> {\\n\\n let mut run_length_minus1 = Vec::with_capacity(num_slice_groups_minus1 as usize + 1);\\n\\n for _ in 0..num_slice_groups_minus1+1 {\\n\\n run_length_minus1.push(SliceRect::read(r)?);\\n\\n }\\n\\n Ok(run_length_minus1)\\n\\n }\\n\",\n \"file_path\": \"src/nal/pps.rs\",\n \"rank\": 57,\n \"score\": 23.349672581793925\n },\n {\n \"content\": \"impl Default for SeqScalingMatrix {\\n\\n fn default() -> Self {\\n\\n SeqScalingMatrix { }\\n\\n }\\n\\n}\\n\\nimpl SeqScalingMatrix {\\n\\n fn read(r: &mut RbspBitReader<'_>, chroma_format_idc: u32) -> Result<SeqScalingMatrix,ScalingMatrixError> {\\n\\n let mut scaling_list4x4 = vec!();\\n\\n let mut scaling_list8x8 = vec!();\\n\\n\\n\\n let count = if chroma_format_idc == 3 { 12 } else { 8 };\\n\\n for i in 0..count {\\n\\n let seq_scaling_list_present_flag = r.read_bool()?;\\n\\n if seq_scaling_list_present_flag {\\n\\n if i < 6 {\\n\\n scaling_list4x4.push(ScalingList::read(r, 16)?);\\n\\n } else {\\n\\n scaling_list8x8.push(ScalingList::read(r, 64)?);\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/nal/sps.rs\",\n \"rank\": 58,\n \"score\": 23.23908463793292\n },\n {\n \"content\": \" BadSeqParamSetId(ParamSetIdError),\\n\\n /// A field in the bitstream had a value too large for a subsequent calculation\\n\\n FieldValueTooLarge { name: &'static str, value: u32 },\\n\\n /// The frame-cropping values are too large vs. the coded picture size,\\n\\n CroppingError(FrameCropping),\\n\\n /// The `cpb_cnt_minus1` field must be between 0 and 31 inclusive.\\n\\n CpbCountOutOfRange(u32),\\n\\n}\\n\\n\\n\\nimpl From<RbspBitReaderError> for SpsError {\\n\\n fn from(e: RbspBitReaderError) -> Self {\\n\\n SpsError::RbspReaderError(e)\\n\\n }\\n\\n}\\n\\n\\n\\npub struct SeqParameterSetNalHandler<Ctx> {\\n\\n buf: Vec<u8>,\\n\\n phantom: marker::PhantomData<Ctx>\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/nal/sps.rs\",\n \"rank\": 59,\n \"score\": 23.084181561752622\n },\n {\n \"content\": \" self.buf.clear();\\n\\n }\\n\\n}\\n\\n\\n\\npub struct SeiHeaderReader<R: SeiIncrementalPayloadReader> {\\n\\n state: SeiHeaderState,\\n\\n reader: R,\\n\\n}\\n\\nimpl<R: SeiIncrementalPayloadReader> SeiHeaderReader<R> {\\n\\n pub fn new(reader: R) -> Self {\\n\\n SeiHeaderReader {\\n\\n state: SeiHeaderState::Begin,\\n\\n reader,\\n\\n }\\n\\n }\\n\\n}\\n\\nimpl<R: SeiIncrementalPayloadReader> NalHandler for SeiHeaderReader<R> {\\n\\n type Ctx = R::Ctx;\\n\\n\\n\\n fn start(&mut self, _ctx: &mut Context<Self::Ctx>, header: NalHeader) {\\n\",\n \"file_path\": \"src/nal/sei/mod.rs\",\n \"rank\": 60,\n \"score\": 22.91769134407182\n },\n {\n \"content\": \" self.nal_reader.end(ctx);\\n\\n }\\n\\n self.to(ParseState::End);\\n\\n }\\n\\n\\n\\n fn to(&mut self, new_state: ParseState) {\\n\\n self.state = new_state;\\n\\n }\\n\\n\\n\\n /// count must be 2 or less\\n\\n fn emit_fake(&mut self, ctx: &mut Context<Ctx>, count: usize) {\\n\\n let fake = [0u8; 2];\\n\\n self.nal_reader.push(ctx, &fake[..count]);\\n\\n }\\n\\n\\n\\n fn maybe_emit(&mut self, ctx: &mut Context<Ctx>, buf:&[u8], start: Option<usize>, end: usize, backtrack: usize) {\\n\\n match start {\\n\\n Some(s) if s + backtrack < end => {\\n\\n self.nal_reader.push(ctx, &buf[s..end - backtrack]);\\n\\n },\\n\",\n \"file_path\": \"src/annexb.rs\",\n \"rank\": 61,\n \"score\": 22.84474805313168\n },\n {\n \"content\": \" } else {\\n\\n Some(r.read_i32(time_offset_length)?)\\n\\n };\\n\\n Ok(ClockTimestamp {\\n\\n ct_type,\\n\\n nuit_field_based_flag,\\n\\n counting_type,\\n\\n discontinuity_flag,\\n\\n cnt_dropped_flag,\\n\\n n_frames,\\n\\n smh,\\n\\n time_offset,\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct PicStruct {\\n\\n pub pic_struct: PicStructType,\\n\\n pub clock_timestamps: Vec<Option<ClockTimestamp>>,\\n\",\n \"file_path\": \"src/nal/sei/pic_timing.rs\",\n \"rank\": 62,\n \"score\": 22.51140150982888\n },\n {\n \"content\": \" pub constraint_flags: ConstraintFlags,\\n\\n pub level_idc: u8,\\n\\n pub seq_parameter_set_id: ParamSetId,\\n\\n pub chroma_info: ChromaInfo,\\n\\n pub log2_max_frame_num_minus4: u8,\\n\\n pub pic_order_cnt: PicOrderCntType,\\n\\n pub max_num_ref_frames: u32,\\n\\n pub gaps_in_frame_num_value_allowed_flag: bool,\\n\\n pub pic_width_in_mbs_minus1: u32,\\n\\n pub pic_height_in_map_units_minus1: u32,\\n\\n pub frame_mbs_flags: FrameMbsFlags,\\n\\n pub direct_8x8_inference_flag: bool,\\n\\n pub frame_cropping: Option<FrameCropping>,\\n\\n pub vui_parameters: Option<VuiParameters>,\\n\\n}\\n\\nimpl SeqParameterSet {\\n\\n pub fn from_bytes(buf: &[u8]) -> Result<SeqParameterSet, SpsError> {\\n\\n let mut r = RbspBitReader::new(buf);\\n\\n let profile_idc = r.read_u8(8)?.into();\\n\\n let sps = SeqParameterSet {\\n\",\n \"file_path\": \"src/nal/sps.rs\",\n \"rank\": 63,\n \"score\": 22.12114087759747\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n pub fn read_se_named(&mut self, name: &'static str) -> Result<i32, RbspBitReaderError> {\\n\\n Ok(Self::golomb_to_signed(self.read_ue_named(name)?))\\n\\n }\\n\\n\\n\\n pub fn read_bool(&mut self) -> Result<bool, RbspBitReaderError> {\\n\\n self.reader.read_bit().map_err( |e| RbspBitReaderError::ReaderError(e) )\\n\\n }\\n\\n\\n\\n pub fn read_bool_named(&mut self, name: &'static str) -> Result<bool, RbspBitReaderError> {\\n\\n self.reader.read_bit().map_err( |e| RbspBitReaderError::ReaderErrorFor(name, e) )\\n\\n }\\n\\n\\n\\n pub fn read_u8(&mut self, bit_count: u32) -> Result<u8, RbspBitReaderError> {\\n\\n self.reader.read(u32::from(bit_count)).map_err( |e| RbspBitReaderError::ReaderError(e) )\\n\\n }\\n\\n\\n\\n pub fn read_u16(&mut self, bit_count: u8) -> Result<u16, RbspBitReaderError> {\\n\",\n \"file_path\": \"src/rbsp.rs\",\n \"rank\": 64,\n \"score\": 21.87909299467812\n },\n {\n \"content\": \" fn push(&mut self, _ctx: &mut Context<Self::Ctx>, buf: &[u8]) {\\n\\n let dest = self.index..(self.index + buf.len());\\n\\n\\n\\n if &self.data[dest.clone()] != buf {\\n\\n self.data.to_mut()[dest].copy_from_slice(buf);\\n\\n }\\n\\n\\n\\n self.index += buf.len();\\n\\n }\\n\\n\\n\\n fn end(&mut self, _ctx: &mut Context<Self::Ctx>) {\\n\\n if let Cow::Owned(vec) = &mut self.data {\\n\\n vec.truncate(self.index);\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n let state = DecoderState::new(Cow::Borrowed(nal_unit));\\n\\n\\n\\n let mut decoder = RbspDecoder::new(state);\\n\",\n \"file_path\": \"src/rbsp.rs\",\n \"rank\": 65,\n \"score\": 21.54844165742293\n },\n {\n \"content\": \" let pic_struct = PicStructType::from_id(r.read_u8(4)?)?;\\n\\n let clock_timestamps = Self::read_clock_timestamps(r, &pic_struct, sps)?;\\n\\n\\n\\n Some(PicStruct {\\n\\n pic_struct,\\n\\n clock_timestamps,\\n\\n })\\n\\n } else {\\n\\n None\\n\\n }\\n\\n } else {\\n\\n None\\n\\n })\\n\\n }\\n\\n\\n\\n fn read_clock_timestamps(r: &mut RbspBitReader<'_>, pic_struct: &PicStructType, sps: &sps::SeqParameterSet) -> Result<Vec<Option<ClockTimestamp>>,PicTimingError> {\\n\\n let mut res = Vec::new();\\n\\n for _ in 0..pic_struct.num_clock_timestamps() {\\n\\n res.push(if r.read_bool_named(\\\"clock_timestamp_flag\\\")? {\\n\\n Some(ClockTimestamp::read(r, sps)?)\\n\\n } else {\\n\\n None\\n\\n });\\n\\n }\\n\\n Ok(res)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/nal/sei/pic_timing.rs\",\n \"rank\": 66,\n \"score\": 21.493947284946298\n },\n {\n \"content\": \" self.reader.read(u32::from(bit_count)).map_err( |e| RbspBitReaderError::ReaderError(e) )\\n\\n }\\n\\n\\n\\n pub fn read_u32(&mut self, bit_count: u8) -> Result<u32, RbspBitReaderError> {\\n\\n self.reader.read(u32::from(bit_count)).map_err( |e| RbspBitReaderError::ReaderError(e) )\\n\\n }\\n\\n\\n\\n pub fn read_i32(&mut self, bit_count: u8) -> Result<i32, RbspBitReaderError> {\\n\\n self.reader.read(u32::from(bit_count)).map_err( |e| RbspBitReaderError::ReaderError(e) )\\n\\n }\\n\\n\\n\\n /// Returns true if positioned before the RBSP trailing bits.\\n\\n ///\\n\\n /// This matches the definition of `more_rbsp_data()` in Rec. ITU-T H.264\\n\\n /// (03/2010) section 7.2.\\n\\n pub fn has_more_rbsp_data(&mut self, name: &'static str) -> Result<bool, RbspBitReaderError> {\\n\\n // BitReader returns its reader iff at an aligned position.\\n\\n //self.reader.reader().map(|r| (r.position() as usize) < r.get_ref().len()).unwrap_or(true)\\n\\n let mut throwaway = self.reader.clone();\\n\\n let r = (move || {\\n\",\n \"file_path\": \"src/rbsp.rs\",\n \"rank\": 67,\n \"score\": 21.46925713796741\n },\n {\n \"content\": \" pub num_ref_idx_l0_default_active_minus1: u32,\\n\\n pub num_ref_idx_l1_default_active_minus1: u32,\\n\\n pub weighted_pred_flag: bool,\\n\\n pub weighted_bipred_idc: u8,\\n\\n pub pic_init_qp_minus26: i32,\\n\\n pub pic_init_qs_minus26: i32,\\n\\n pub chroma_qp_index_offset: i32,\\n\\n pub deblocking_filter_control_present_flag: bool,\\n\\n pub constrained_intra_pred_flag: bool,\\n\\n pub redundant_pic_cnt_present_flag: bool,\\n\\n pub extension: Option<PicParameterSetExtra>,\\n\\n}\\n\\nimpl PicParameterSet {\\n\\n pub fn from_bytes<Ctx>(ctx: &Context<Ctx>, buf: &[u8]) -> Result<PicParameterSet, PpsError> {\\n\\n let mut r = RbspBitReader::new(buf);\\n\\n let pic_parameter_set_id = ParamSetId::from_u32(r.read_ue_named(\\\"pic_parameter_set_id\\\")?)\\n\\n .map_err(PpsError::BadPicParamSetId)?;\\n\\n let seq_parameter_set_id = ParamSetId::from_u32(r.read_ue_named(\\\"seq_parameter_set_id\\\")?)\\n\\n .map_err(PpsError::BadSeqParamSetId)?;\\n\\n let seq_parameter_set = ctx.sps_by_id(seq_parameter_set_id)\\n\",\n \"file_path\": \"src/nal/pps.rs\",\n \"rank\": 68,\n \"score\": 21.396312618848018\n },\n {\n \"content\": \" SecMinHour::SMH(_, _, h) => *h,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct ClockTimestamp {\\n\\n pub ct_type: CtType,\\n\\n pub nuit_field_based_flag: bool,\\n\\n pub counting_type: CountingType,\\n\\n pub discontinuity_flag: bool,\\n\\n pub cnt_dropped_flag: bool,\\n\\n pub n_frames: u8,\\n\\n pub smh: SecMinHour,\\n\\n pub time_offset: Option<i32>,\\n\\n}\\n\\nimpl ClockTimestamp {\\n\\n fn read(r: &mut RbspBitReader<'_>, sps: &sps::SeqParameterSet) -> Result<ClockTimestamp, PicTimingError> {\\n\\n let ct_type = CtType::from_id(r.read_u8(2)?);\\n\\n let nuit_field_based_flag = r.read_bool_named(\\\"nuit_field_based_flag\\\")?;\\n\",\n \"file_path\": \"src/nal/sei/pic_timing.rs\",\n \"rank\": 69,\n \"score\": 21.168082207138035\n },\n {\n \"content\": \" data: Vec<u8>,\\n\\n }\\n\\n struct MockReader {\\n\\n state: Rc<RefCell<State>>\\n\\n }\\n\\n impl MockReader {\\n\\n fn new(state: Rc<RefCell<State>>) -> MockReader {\\n\\n MockReader {\\n\\n state\\n\\n }\\n\\n }\\n\\n }\\n\\n impl NalReader for MockReader {\\n\\n type Ctx = ();\\n\\n\\n\\n fn start(&mut self, _ctx: &mut Context<Self::Ctx>) {\\n\\n let mut state = self.state.borrow_mut();\\n\\n assert_eq!(state.started, state.ended);\\n\\n state.started += 1;\\n\\n }\\n\",\n \"file_path\": \"src/annexb.rs\",\n \"rank\": 70,\n \"score\": 20.891910047608246\n },\n {\n \"content\": \"use crate::nal::sei::HeaderType;\\n\\nuse crate::Context;\\n\\nuse crate::nal::sei::SeiCompletePayloadReader;\\n\\nuse log::*;\\n\\n\\n\\n#[derive(Debug)]\\n\\npub enum ItuTT35Error {\\n\\n NotEnoughData { expected: usize, actual: usize }\\n\\n}\\n\\n\\n\\n#[derive(Debug, PartialEq)]\\n\\npub enum ItuTT35 {\\n\\n Japan,\\n\\n Albania,\\n\\n Algeria,\\n\\n AmericanSamoa,\\n\\n GermanyFederalRepublicOf(u8),\\n\\n Anguilla,\\n\\n AntiguaandBarbuda,\\n\\n Argentina,\\n\",\n \"file_path\": \"src/nal/sei/user_data_registered_itu_t_t35.rs\",\n \"rank\": 71,\n \"score\": 20.756190355592793\n },\n {\n \"content\": \" assert_eq!(header.nal_unit_type(), crate::nal::UnitType::SEI);\\n\\n self.state = SeiHeaderState::Begin;\\n\\n }\\n\\n\\n\\n fn push(&mut self, ctx: &mut Context<Self::Ctx>, buf: &[u8]) {\\n\\n assert!(!buf.is_empty());\\n\\n let mut input = &buf[..];\\n\\n loop {\\n\\n if input.is_empty() {\\n\\n break;\\n\\n }\\n\\n let b = input[0];\\n\\n let mut exit = false;\\n\\n self.state = match self.state {\\n\\n SeiHeaderState::End => {\\n\\n panic!(\\\"SeiHeaderReader no preceding call to start()\\\");\\n\\n },\\n\\n SeiHeaderState::Begin => {\\n\\n match b {\\n\\n 0xff => {\\n\",\n \"file_path\": \"src/nal/sei/mod.rs\",\n \"rank\": 72,\n \"score\": 20.71638163762347\n },\n {\n \"content\": \" Ok((header, sps, pps))\\n\\n }\\n\\n}\\n\\n\\n\\npub struct SliceLayerWithoutPartitioningRbsp<Ctx> {\\n\\n state: ParseState,\\n\\n phantom: marker::PhantomData<Ctx>\\n\\n}\\n\\nimpl<Ctx> super::NalHandler for SliceLayerWithoutPartitioningRbsp<Ctx> {\\n\\n type Ctx = Ctx;\\n\\n\\n\\n fn start(&mut self, _ctx: &mut Context<Ctx>, header: NalHeader) {\\n\\n self.state = ParseState::Start(header);\\n\\n }\\n\\n\\n\\n fn push(&mut self, ctx: &mut Context<Ctx>, buf: &[u8]) {\\n\\n match self.state {\\n\\n ParseState::Unstarted => panic!(\\\"start() not yet called\\\"),\\n\\n ParseState::Start(header) => {\\n\\n let mut r = RbspBitReader::new(buf);\\n\",\n \"file_path\": \"src/nal/slice/mod.rs\",\n \"rank\": 73,\n \"score\": 20.629525010704963\n },\n {\n \"content\": \"\\n\\n fn read_group_ids(r: &mut RbspBitReader<'_>, num_slice_groups_minus1: u32) -> Result<Vec<u32>,PpsError> {\\n\\n let pic_size_in_map_units_minus1 = r.read_ue_named(\\\"pic_size_in_map_units_minus1\\\")?;\\n\\n // TODO: avoid any panics due to failed conversions\\n\\n let size = ((1f64+f64::from(pic_size_in_map_units_minus1)).log2()) as u8;\\n\\n let mut run_length_minus1 = Vec::with_capacity(num_slice_groups_minus1 as usize + 1);\\n\\n for _ in 0..num_slice_groups_minus1+1 {\\n\\n run_length_minus1.push(r.read_u32(size)?);\\n\\n }\\n\\n Ok(run_length_minus1)\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone)]\\n\",\n \"file_path\": \"src/nal/pps.rs\",\n \"rank\": 74,\n \"score\": 20.505094031460636\n },\n {\n \"content\": \" R: NalReader<Ctx=Ctx>\\n\\n{\\n\\n state: ParseState,\\n\\n nal_reader: R,\\n\\n}\\n\\nimpl<R, Ctx> AnnexBReader<R, Ctx>\\n\\n where\\n\\n R: NalReader<Ctx=Ctx>\\n\\n{\\n\\n pub fn new(nal_reader: R) -> Self {\\n\\n AnnexBReader {\\n\\n state: ParseState::End,\\n\\n nal_reader,\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn start(&mut self, ctx: &mut Context<Ctx>) {\\n\\n if self.state.in_unit().is_some() {\\n\\n // TODO: or reset()?\\n\\n self.nal_reader.end(ctx);\\n\",\n \"file_path\": \"src/annexb.rs\",\n \"rank\": 75,\n \"score\": 20.434018540515666\n },\n {\n \"content\": \"}\\n\\n\\n\\n#[derive(Debug, Clone)]\\n\\npub struct SliceRect {\\n\\n top_left: u32,\\n\\n bottom_right: u32,\\n\\n}\\n\\nimpl SliceRect {\\n\\n fn read(r: &mut RbspBitReader<'_>) -> Result<SliceRect,PpsError> {\\n\\n Ok(SliceRect {\\n\\n top_left: r.read_ue_named(\\\"top_left\\\")?,\\n\\n bottom_right: r.read_ue_named(\\\"bottom_right\\\")?,\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone)]\\n\\npub enum SliceGroup {\\n\\n Interleaved {\\n\\n run_length_minus1: Vec<u32>,\\n\",\n \"file_path\": \"src/nal/pps.rs\",\n \"rank\": 76,\n \"score\": 20.292519190874703\n },\n {\n \"content\": \" fn push(&mut self, _ctx: &mut Context<Self::Ctx>, buf: &[u8]) {\\n\\n self.state.borrow_mut().data.extend_from_slice(buf);\\n\\n }\\n\\n\\n\\n fn end(&mut self, _ctx: &mut Context<Self::Ctx>) {\\n\\n self.state.borrow_mut().ended = true;\\n\\n }\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn it_works() {\\n\\n let data = hex!(\\n\\n \\\"67 64 00 0A AC 72 84 44 26 84 00 00 03\\n\\n 00 04 00 00 03 00 CA 3C 48 96 11 80\\\");\\n\\n for i in 1..data.len()-1 {\\n\\n let state = Rc::new(RefCell::new(State {\\n\\n started: false,\\n\\n ended: false,\\n\\n data: Vec::new(),\\n\\n }));\\n\",\n \"file_path\": \"src/rbsp.rs\",\n \"rank\": 77,\n \"score\": 20.000386782526142\n },\n {\n \"content\": \" pub fn sequence_parameter_sets(&self) -> impl Iterator<Item = Result<&'buf[u8], ParamSetError>> {\\n\\n let num = self.num_of_sequence_parameter_sets();\\n\\n let data = &self.data[Self::MIN_CONF_SIZE..];\\n\\n ParamSetIter::new(data, UnitType::SeqParameterSet)\\n\\n .take(num)\\n\\n }\\n\\n pub fn picture_parameter_sets(&self) -> impl Iterator<Item = Result<&'buf[u8], ParamSetError>> + 'buf {\\n\\n let offset = self.seq_param_sets_end().unwrap();\\n\\n let num = self.data[offset];\\n\\n let data = &self.data[offset+1..];\\n\\n ParamSetIter::new(data, UnitType::PicParameterSet)\\n\\n .take(num as usize)\\n\\n }\\n\\n\\n\\n /// Creates an H264 parser context from the given user context, using the settings encoded into\\n\\n /// this `AvcDecoderConfigurationRecord`.\\n\\n ///\\n\\n /// In particular, the _sequence parameter set_ and _picture parameter set_ values of this\\n\\n /// configuration record will be inserted into the resulting context.\\n\\n pub fn create_context<C>(&self, ctx: C) -> Result<Context<C>, AvccError> {\\n\",\n \"file_path\": \"src/avcc.rs\",\n \"rank\": 78,\n \"score\": 19.936413036479305\n },\n {\n \"content\": \"\\n\\n fn push(&mut self, _ctx: &mut Context<Self::Ctx>, buf: &[u8]) {\\n\\n let mut state = self.state.borrow_mut();\\n\\n assert!(state.started > state.ended);\\n\\n assert!(!buf.is_empty());\\n\\n state.data.extend_from_slice(buf);\\n\\n }\\n\\n\\n\\n fn end(&mut self, _ctx: &mut Context<Self::Ctx>) {\\n\\n let mut state = self.state.borrow_mut();\\n\\n state.ended += 1;\\n\\n assert_eq!(state.started, state.ended);\\n\\n }\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn simple_nal() {\\n\\n let state = Rc::new(RefCell::new(State {\\n\\n started: 0,\\n\\n ended: 0,\\n\",\n \"file_path\": \"src/annexb.rs\",\n \"rank\": 79,\n \"score\": 19.902528126227953\n },\n {\n \"content\": \" match SliceHeader::read(ctx, &mut r, header) {\\n\\n Ok(header) => info!(\\\"TODO: expose to caller: {:#?}\\\", header),\\n\\n Err(e) => error!(\\\"slice_header() error: SliceHeaderError::{:?}\\\", e),\\n\\n }\\n\\n self.state = ParseState::Continue(header);\\n\\n },\\n\\n ParseState::Continue(_header) => {\\n\\n // TODO\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n fn end(&mut self, _ctx: &mut Context<Ctx>) {\\n\\n // TODO\\n\\n }\\n\\n}\\n\\nimpl<Ctx> Default for SliceLayerWithoutPartitioningRbsp<Ctx> {\\n\\n fn default() -> Self {\\n\\n SliceLayerWithoutPartitioningRbsp {\\n\\n state: ParseState::Unstarted,\\n\\n phantom: marker::PhantomData,\\n\\n }\\n\\n }\\n\\n}\",\n \"file_path\": \"src/nal/slice/mod.rs\",\n \"rank\": 80,\n \"score\": 19.895843532401493\n },\n {\n \"content\": \" None\\n\\n })\\n\\n }\\n\\n fn read_cpb_specs(r: &mut RbspBitReader<'_>, cpb_cnt: u32) -> Result<Vec<CpbSpec>,RbspBitReaderError> {\\n\\n let mut cpb_specs = Vec::with_capacity(cpb_cnt as usize);\\n\\n for _ in 0..cpb_cnt {\\n\\n cpb_specs.push(CpbSpec::read(r)?);\\n\\n }\\n\\n Ok(cpb_specs)\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone)]\\n\\npub struct BitstreamRestrictions {\\n\\n motion_vectors_over_pic_boundaries_flag: bool,\\n\\n max_bytes_per_pic_denom: u32,\\n\\n max_bits_per_mb_denom: u32,\\n\\n log2_max_mv_length_horizontal: u32,\\n\\n log2_max_mv_length_vertical: u32,\\n\\n max_num_reorder_frames: u32,\\n\",\n \"file_path\": \"src/nal/sps.rs\",\n \"rank\": 81,\n \"score\": 19.851300337526553\n },\n {\n \"content\": \"impl ScalingList {\\n\\n pub fn read(r: &mut RbspBitReader<'_>, size: u8) -> Result<ScalingList,ScalingMatrixError> {\\n\\n let mut scaling_list = vec!();\\n\\n let mut last_scale = 8;\\n\\n let mut next_scale = 8;\\n\\n let mut _use_default_scaling_matrix_flag = false;\\n\\n for j in 0..size {\\n\\n if next_scale != 0 {\\n\\n let delta_scale = r.read_se_named(\\\"delta_scale\\\")?;\\n\\n if delta_scale < -128 || delta_scale > 127 {\\n\\n return Err(ScalingMatrixError::DeltaScaleOutOfRange(delta_scale));\\n\\n }\\n\\n next_scale = (last_scale + delta_scale + 256) % 256;\\n\\n _use_default_scaling_matrix_flag = j == 0 && next_scale == 0;\\n\\n }\\n\\n let new_value = if next_scale == 0 { last_scale } else { next_scale };\\n\\n scaling_list.push(new_value);\\n\\n last_scale = new_value;\\n\\n }\\n\\n Ok(ScalingList { })\\n\",\n \"file_path\": \"src/nal/sps.rs\",\n \"rank\": 82,\n \"score\": 19.4696990862634\n },\n {\n \"content\": \"\\n\\n#[derive(Debug, Clone)]\\n\\npub struct VuiParameters {\\n\\n pub aspect_ratio_info: Option<AspectRatioInfo>,\\n\\n pub overscan_appropriate: OverscanAppropriate,\\n\\n pub video_signal_type: Option<VideoSignalType>,\\n\\n pub chroma_loc_info: Option<ChromaLocInfo>,\\n\\n pub timing_info: Option<TimingInfo>,\\n\\n pub nal_hrd_parameters: Option<HrdParameters>,\\n\\n pub vcl_hrd_parameters: Option<HrdParameters>,\\n\\n pub low_delay_hrd_flag: Option<bool>,\\n\\n pub pic_struct_present_flag: bool,\\n\\n pub bitstream_restrictions: Option<BitstreamRestrictions>,\\n\\n}\\n\\nimpl VuiParameters {\\n\\n fn read(r: &mut RbspBitReader<'_>) -> Result<Option<VuiParameters>, SpsError> {\\n\\n let vui_parameters_present_flag = r.read_bool()?;\\n\\n Ok(if vui_parameters_present_flag {\\n\\n let mut hrd_parameters_present = false;\\n\\n Some(VuiParameters {\\n\",\n \"file_path\": \"src/nal/sps.rs\",\n \"rank\": 83,\n \"score\": 19.428270588077993\n },\n {\n \"content\": \" }\\n\\n\\n\\n fn push(&mut self, ctx: &mut h264_reader::Context<Self::Ctx>, buf: &[u8]) {\\n\\n self.current_slice\\n\\n .as_mut()\\n\\n .unwrap()\\n\\n .buf\\n\\n .extend_from_slice(buf);\\n\\n }\\n\\n\\n\\n fn end(&mut self, ctx: &mut h264_reader::Context<Self::Ctx>) {\\n\\n let current_slice = self.current_slice.take().unwrap();\\n\\n let capture = NalCapture::default();\\n\\n let mut decode = RbspDecoder::new(capture);\\n\\n decode.start(ctx, current_slice.header);\\n\\n decode.push(ctx, ¤t_slice.buf[..]);\\n\\n decode.end(ctx);\\n\\n let capture = decode.into_handler();\\n\\n let mut r = rbsp::RbspBitReader::new(&capture.buf[1..]);\\n\\n match nal::slice::SliceHeader::read(ctx, &mut r, current_slice.header) {\\n\",\n \"file_path\": \"fuzz/fuzz_targets/fuzz_target_1.rs\",\n \"rank\": 84,\n \"score\": 19.403873009223496\n },\n {\n \"content\": \" }\\n\\n\\n\\n fn read_delays(r: &mut RbspBitReader<'_>, sps: &sps::SeqParameterSet) -> Result<Option<Delays>,PicTimingError> {\\n\\n Ok(if let Some(ref vui_params) = sps.vui_parameters {\\n\\n if let Some(ref hrd) = vui_params.nal_hrd_parameters.as_ref().or_else(|| vui_params.nal_hrd_parameters.as_ref() ) {\\n\\n Some(Delays {\\n\\n cpb_removal_delay: r.read_u32(hrd.cpb_removal_delay_length_minus1+1)?,\\n\\n dpb_output_delay: r.read_u32(hrd.dpb_output_delay_length_minus1+1)?,\\n\\n })\\n\\n } else {\\n\\n None\\n\\n }\\n\\n } else {\\n\\n None\\n\\n })\\n\\n }\\n\\n\\n\\n fn read_pic_struct(r: &mut RbspBitReader<'_>, sps: &sps::SeqParameterSet) -> Result<Option<PicStruct>,PicTimingError> {\\n\\n Ok(if let Some(ref vui_params) = sps.vui_parameters {\\n\\n if vui_params.pic_struct_present_flag {\\n\",\n \"file_path\": \"src/nal/sei/pic_timing.rs\",\n \"rank\": 85,\n \"score\": 19.2889646752151\n },\n {\n \"content\": \" 2 => CountingType::DroppingIndividualZero,\\n\\n 3 => CountingType::DroppingIndividualMax,\\n\\n 4 => CountingType::DroppingTwoLowest,\\n\\n 5 => CountingType::DroppingIndividual,\\n\\n 6 => CountingType::Dropping,\\n\\n 7..=31 => CountingType::Reserved(id),\\n\\n _ => panic!(\\\"unexpected counting_type {}\\\", id),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub enum SecMinHour {\\n\\n None,\\n\\n S(u8),\\n\\n SM(u8, u8),\\n\\n SMH(u8, u8, u8)\\n\\n}\\n\\nimpl SecMinHour {\\n\\n pub fn seconds(&self) -> u8 {\\n\",\n \"file_path\": \"src/nal/sei/pic_timing.rs\",\n \"rank\": 86,\n \"score\": 19.124869507199037\n },\n {\n \"content\": \" let video_signal_type_present_flag = r.read_bool()?;\\n\\n Ok(if video_signal_type_present_flag {\\n\\n Some(VideoSignalType {\\n\\n video_format: VideoFormat::from(r.read_u8(3)?),\\n\\n video_full_range_flag: r.read_bool()?,\\n\\n colour_description: ColourDescription::read(r)?,\\n\\n })\\n\\n } else {\\n\\n None\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone)]\\n\\npub struct ChromaLocInfo {\\n\\n chroma_sample_loc_type_top_field: u32,\\n\\n chroma_sample_loc_type_bottom_field: u32,\\n\\n}\\n\\nimpl ChromaLocInfo {\\n\\n fn read(r: &mut RbspBitReader<'_>) -> Result<Option<ChromaLocInfo>, RbspBitReaderError> {\\n\",\n \"file_path\": \"src/nal/sps.rs\",\n \"rank\": 87,\n \"score\": 19.084052683589945\n },\n {\n \"content\": \" fn read(r: &mut RbspBitReader<'_>) -> Result<CpbSpec,RbspBitReaderError> {\\n\\n Ok(CpbSpec {\\n\\n bit_rate_value_minus1: r.read_ue_named(\\\"bit_rate_value_minus1\\\")?,\\n\\n cpb_size_value_minus1: r.read_ue_named(\\\"cpb_size_value_minus1\\\")?,\\n\\n cbr_flag: r.read_bool_named(\\\"cbr_flag\\\")?,\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\\n\\n\\n#[derive(Debug, Clone)]\\n\\npub struct HrdParameters {\\n\\n pub bit_rate_scale: u8,\\n\\n pub cpb_size_scale: u8,\\n\\n pub cpb_specs: Vec<CpbSpec>,\\n\\n pub initial_cpb_removal_delay_length_minus1: u8,\\n\\n pub cpb_removal_delay_length_minus1: u8,\\n\\n pub dpb_output_delay_length_minus1: u8,\\n\\n pub time_offset_length: u8,\\n\\n}\\n\",\n \"file_path\": \"src/nal/sps.rs\",\n \"rank\": 88,\n \"score\": 19.045138176181034\n },\n {\n \"content\": \" slice_type: SliceType,\\n\\n colour_plane: Option<ColourPlane>,\\n\\n frame_num: u16,\\n\\n field_pic: FieldPic,\\n\\n idr_pic_id: Option<u32>,\\n\\n pic_order_cnt_lsb: Option<PicOrderCountLsb>,\\n\\n redundant_pic_cnt: Option<u32>,\\n\\n direct_spatial_mv_pred_flag: Option<bool>,\\n\\n num_ref_idx_active: Option<NumRefIdxActive>,\\n\\n ref_pic_list_modification: Option<RefPicListModifications>, // may become an enum rather than Option in future (for ref_pic_list_mvc_modification)\\n\\n pred_weight_table: Option<PredWeightTable>,\\n\\n dec_ref_pic_marking: Option<DecRefPicMarking>,\\n\\n cabac_init_idc: Option<u32>,\\n\\n slice_qp_delta: i32,\\n\\n sp_for_switch_flag: Option<bool>,\\n\\n slice_qs: Option<u32>,\\n\\n disable_deblocking_filter_idc: u8,\\n\\n}\\n\\nimpl SliceHeader {\\n\\n pub fn read<'a, Ctx>(ctx: &'a mut Context<Ctx>, r: &mut RbspBitReader<'_>, header: NalHeader) -> Result<(SliceHeader, &'a SeqParameterSet, &'a PicParameterSet), SliceHeaderError> {\\n\",\n \"file_path\": \"src/nal/slice/mod.rs\",\n \"rank\": 89,\n \"score\": 19.02441606870664\n },\n {\n \"content\": \" }\\n\\n}\\n\\nimpl<Ctx> Context<Ctx> {\\n\\n pub fn new(user_context: Ctx) -> Self {\\n\\n let mut seq_param_sets = vec!();\\n\\n for _ in 0..32 { seq_param_sets.push(None); }\\n\\n let mut pic_param_sets = vec!();\\n\\n for _ in 0..32 { pic_param_sets.push(None); }\\n\\n Context {\\n\\n seq_param_sets,\\n\\n pic_param_sets,\\n\\n user_context,\\n\\n }\\n\\n }\\n\\n}\\n\\nimpl<Ctx> Context<Ctx> {\\n\\n pub fn sps_by_id(&self, id: nal::pps::ParamSetId) -> Option<&nal::sps::SeqParameterSet> {\\n\\n if id.id() > 31 {\\n\\n None\\n\\n } else {\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 90,\n \"score\": 18.908585276818265\n },\n {\n \"content\": \" data: Vec::new(),\\n\\n }));\\n\\n let mock = MockReader::new(Rc::clone(&state));\\n\\n let mut r = AnnexBReader::new(mock);\\n\\n let data = vec!(\\n\\n 0, 0, 0, 1, // start-code\\n\\n 3, 0 // NAL data\\n\\n );\\n\\n let mut ctx = Context::default();\\n\\n r.start(&mut ctx);\\n\\n r.push(&mut ctx, &data[..]);\\n\\n r.end_units(&mut ctx);\\n\\n {\\n\\n let s = state.borrow();\\n\\n assert_eq!(1, s.started);\\n\\n assert_eq!(&s.data[..], &[3u8, 0u8][..]);\\n\\n assert_eq!(1, s.ended);\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/annexb.rs\",\n \"rank\": 91,\n \"score\": 18.850646725067858\n },\n {\n \"content\": \"impl HrdParameters {\\n\\n fn read(r: &mut RbspBitReader<'_>, hrd_parameters_present: &mut bool) -> Result<Option<HrdParameters>, SpsError> {\\n\\n let hrd_parameters_present_flag = r.read_bool_named(\\\"hrd_parameters_present_flag\\\")?;\\n\\n *hrd_parameters_present |= hrd_parameters_present_flag;\\n\\n Ok(if hrd_parameters_present_flag {\\n\\n let cpb_cnt_minus1 = r.read_ue_named(\\\"cpb_cnt_minus1\\\")?;\\n\\n if cpb_cnt_minus1 > 31 {\\n\\n return Err(SpsError::CpbCountOutOfRange(cpb_cnt_minus1));\\n\\n }\\n\\n let cpb_cnt = cpb_cnt_minus1 + 1;\\n\\n Some(HrdParameters {\\n\\n bit_rate_scale: r.read_u8(4)?,\\n\\n cpb_size_scale: r.read_u8(4)?,\\n\\n cpb_specs: Self::read_cpb_specs(r, cpb_cnt)?,\\n\\n initial_cpb_removal_delay_length_minus1: r.read_u8(5)?,\\n\\n cpb_removal_delay_length_minus1: r.read_u8(5)?,\\n\\n dpb_output_delay_length_minus1: r.read_u8(5)?,\\n\\n time_offset_length: r.read_u8(5)?,\\n\\n })\\n\\n } else {\\n\",\n \"file_path\": \"src/nal/sps.rs\",\n \"rank\": 92,\n \"score\": 18.79237561821609\n },\n {\n \"content\": \" use super::*;\\n\\n\\n\\n #[derive(Default)]\\n\\n struct NullRegister {\\n\\n handled: bool,\\n\\n }\\n\\n impl crate::nal::sei::user_data_registered_itu_t_t35::Register for NullRegister {\\n\\n type Ctx = ();\\n\\n\\n\\n fn handle(&mut self, _ctx: &mut crate::Context<Self::Ctx>, country_code: crate::nal::sei::user_data_registered_itu_t_t35::ItuTT35, _payload: &[u8]) {\\n\\n assert_eq!(country_code, ItuTT35::UnitedKingdom);\\n\\n self.handled = true;\\n\\n }\\n\\n }\\n\\n #[test]\\n\\n fn macro_usage() {\\n\\n tt_35_switch!{\\n\\n TestTT35Switch<()> {\\n\\n UnitedKingdom => NullRegister,\\n\\n }\\n\\n }\\n\\n\\n\\n let mut sw = TestTT35Switch::default();\\n\\n let mut ctx = crate::Context::new(());\\n\\n let data = [ 0x00u8 ];\\n\\n sw.handle(&mut ctx, ItuTT35::UnitedKingdom, &data[..]);\\n\\n assert!(sw.UnitedKingdom.handled);\\n\\n }\\n\\n}\",\n \"file_path\": \"src/nal/sei/user_data_registered_itu_t_t35.rs\",\n \"rank\": 93,\n \"score\": 18.58922861577487\n },\n {\n \"content\": \" ended: bool,\\n\\n data: Vec<u8>,\\n\\n }\\n\\n struct MockReader {\\n\\n state: Rc<RefCell<State>>\\n\\n }\\n\\n impl MockReader {\\n\\n fn new(state: Rc<RefCell<State>>) -> MockReader {\\n\\n MockReader {\\n\\n state\\n\\n }\\n\\n }\\n\\n }\\n\\n impl NalHandler for MockReader {\\n\\n type Ctx = ();\\n\\n\\n\\n fn start(&mut self, _ctx: &mut Context<Self::Ctx>, _header: NalHeader) {\\n\\n self.state.borrow_mut().started = true;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/rbsp.rs\",\n \"rank\": 94,\n \"score\": 18.455797033680764\n },\n {\n \"content\": \" error!(\\\"End of SEI data encountered having read {} bytes of payloadSize={} for header type {:?}\\\", consumed_size, payload_size, payload_type);\\n\\n self.reader.reset(ctx);\\n\\n },\\n\\n }\\n\\n self.state = SeiHeaderState::End;\\n\\n }\\n\\n}\\n\\n\\n\\npub struct SeiNalHandler<R: SeiIncrementalPayloadReader> {\\n\\n reader: RbspDecoder<SeiHeaderReader<R>>,\\n\\n}\\n\\nimpl<R: SeiIncrementalPayloadReader> SeiNalHandler<R> {\\n\\n pub fn new(r: R) -> Self {\\n\\n SeiNalHandler {\\n\\n reader: RbspDecoder::new(SeiHeaderReader::new(r)),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<R: SeiIncrementalPayloadReader> NalHandler for SeiNalHandler<R> {\\n\",\n \"file_path\": \"src/nal/sei/mod.rs\",\n \"rank\": 95,\n \"score\": 18.28286318665216\n },\n {\n \"content\": \" fn read(r: &mut RbspBitReader<'_>) -> Result<FrameMbsFlags, RbspBitReaderError> {\\n\\n let frame_mbs_only_flag = r.read_bool()?;\\n\\n if frame_mbs_only_flag {\\n\\n Ok(FrameMbsFlags::Frames)\\n\\n } else {\\n\\n Ok(FrameMbsFlags::Fields {\\n\\n mb_adaptive_frame_field_flag: r.read_bool()?\\n\\n })\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, PartialEq)]\\n\\npub struct FrameCropping {\\n\\n pub left_offset: u32,\\n\\n pub right_offset: u32,\\n\\n pub top_offset: u32,\\n\\n pub bottom_offset: u32,\\n\\n}\\n\\nimpl FrameCropping {\\n\",\n \"file_path\": \"src/nal/sps.rs\",\n \"rank\": 96,\n \"score\": 18.07512202569022\n },\n {\n \"content\": \" Ok(if colour_description_present_flag {\\n\\n Some(ColourDescription {\\n\\n colour_primaries: r.read_u8(8)?,\\n\\n transfer_characteristics: r.read_u8(8)?,\\n\\n matrix_coefficients: r.read_u8(8)?,\\n\\n })\\n\\n } else {\\n\\n None\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone)]\\n\\npub struct VideoSignalType {\\n\\n video_format: VideoFormat,\\n\\n video_full_range_flag: bool,\\n\\n colour_description: Option<ColourDescription>,\\n\\n}\\n\\nimpl VideoSignalType {\\n\\n fn read(r: &mut RbspBitReader<'_>) -> Result<Option<VideoSignalType>, RbspBitReaderError> {\\n\",\n \"file_path\": \"src/nal/sps.rs\",\n \"rank\": 97,\n \"score\": 17.8599525981965\n },\n {\n \"content\": \"//! Parser for H264 bitstream syntax. Not a video decoder.\\n\\n\\n\\n#![forbid(unsafe_code)]\\n\\n#![deny(rust_2018_idioms)]\\n\\n\\n\\npub mod rbsp;\\n\\npub mod annexb;\\n\\npub mod nal;\\n\\npub mod avcc;\\n\\n\\n\\n/// Contextual data that needs to be tracked between evaluations of different portions of H264\\n\\n/// syntax.\\n\\npub struct Context<Ctx> {\\n\\n seq_param_sets: Vec<Option<nal::sps::SeqParameterSet>>,\\n\\n pic_param_sets: Vec<Option<nal::pps::PicParameterSet>>,\\n\\n pub user_context: Ctx,\\n\\n}\\n\\nimpl Default for Context<()> {\\n\\n fn default() -> Self {\\n\\n Self::new(())\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 98,\n \"score\": 17.85760462886614\n },\n {\n \"content\": \" Progressive,\\n\\n Interlaced,\\n\\n Unknown,\\n\\n Reserved,\\n\\n}\\n\\nimpl CtType {\\n\\n fn from_id(id: u8) -> CtType {\\n\\n match id {\\n\\n 0 => CtType::Progressive,\\n\\n 1 => CtType::Interlaced,\\n\\n 2 => CtType::Unknown,\\n\\n 3 => CtType::Reserved,\\n\\n _ => panic!(\\\"unexpected ct_type {}\\\", id),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub enum CountingType {\\n\\n /// no dropping of `n_frames` values, and no use of `time_offset`\\n\",\n \"file_path\": \"src/nal/sei/pic_timing.rs\",\n \"rank\": 99,\n \"score\": 17.77957558613651\n }\n]","isConversational":false}}},{"rowIdx":1381,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/main.rs"},"repo_name":{"kind":"string","value":"gfarrell/netctl-tray"},"commit":{"kind":"string","value":"58b7ad1684bc9f949839fb2dd08cd9ef2ad0bc74"},"file_code":{"kind":"string","value":"#![feature(exclusive_range_pattern)]\n\nmod state;\n\nuse notify_rust::{Notification, Timeout};\nuse qt_gui::QIcon;\nuse qt_widgets::cpp_utils::{CppBox, MutPtr};\nuse qt_widgets::qt_core::{QString, QTimer, Slot};\nuse qt_widgets::{QActionGroup, QApplication, QMenu, QSystemTrayIcon, SlotOfActivationReason};\nuse state::{inotify_watch, scan_profiles, update_state, State};\nuse std::ffi::OsStr;\nuse std::net::SocketAddr;\nuse std::process::Command;\nuse std::sync::{Arc, Mutex};\nuse structopt::StructOpt;\nuse users::{get_current_gid, get_current_username, get_user_groups};\n\n#[derive(Debug, StructOpt)]\n#[structopt(\n name = \"netctl-tray\",\n about = \"A lightweight netctl tray app with notifications.\"\n)]\npub struct Opt {\n \n #[structopt(short, long, default_value = \"2\")]\n pub interval: f32,\n \n #[structopt(long, default_value = \"1.1.1.1:53\")]\n pub host: SocketAddr,\n \n #[structopt(short)]\n pub disable_notifications: bool,\n}\n\nfn main() {\n \n let args = Opt::from_args();\n\n \n let (in_wheel, in_network) = is_user_in_wheel_and_network();\n if !in_wheel {\n eprintln!(\"Warning! You are not in group 'wheel', netctl-tray might not work or work only partially.\");\n }\n if !in_network {\n eprintln!(\"Warning! You are not in group 'network', netctl-tray might not work or work only partially.\");\n }\n\n let mut state = State {\n link_quality: 0,\n ping: 0.0,\n all_profiles: Arc::new(Mutex::new(Vec::new())),\n active_profile: None,\n };\n\n \n if let Err(e) = scan_profiles(&mut *state.all_profiles.lock().unwrap()) {\n eprintln!(\"Error while scanning profiles: {:?}\", e);\n return;\n }\n\n let all_profiles_clone = state.all_profiles.clone();\n\n \n if let Err(e) = inotify_watch(all_profiles_clone, \"/etc/netctl\") {\n eprintln!(\"Error watching /etc/netctl: {:?}\", e);\n return;\n }\n\n \n if let Err(e) = update_state(&mut state, &args) {\n eprintln!(\"Can't update tray state: {:?}\", e);\n }\n\n \n \n \n let state_ptr: *mut State = &mut state;\n\n \n QApplication::init(|_app| {\n unsafe {\n \n let mut tray = QSystemTrayIcon::from_q_icon(get_status_icon(&mut state).as_ref());\n\n \n let tray_click = SlotOfActivationReason::new(|reason| {\n let reason = reason.to_int();\n \n if reason == 3 || reason == 4 {\n if let Err(e) = Notification::new()\n .summary(\"netctl\")\n .body(&format!(\n \"Profile: <b>{}</b>, Ping: <b>{} ms</b>, Quality: <b>{}/70</b>\",\n (*state_ptr)\n .active_profile\n .as_ref()\n .unwrap_or(&\"<i>{none}</i>\".to_string()),\n if (*state_ptr).ping == f32::INFINITY {\n \"∞\".to_string()\n } else {\n (*state_ptr).ping.round().to_string()\n },\n (*state_ptr).link_quality\n ))\n .icon(\"network-wireless\")\n .timeout(Timeout::Milliseconds(5000))\n .show()\n {\n eprintln!(\"Error sending desktop notification: {:?}\", e);\n }\n }\n });\n tray.activated().connect(&tray_click);\n\n \n let mut menu = QMenu::new();\n tray.set_context_menu(menu.as_mut_ptr());\n\n \n let profiles_submenu =\n menu.add_menu_q_string(QString::from_std_str(\"Profiles\").as_mut_ref());\n let mut profile_actions_group = QActionGroup::new(profiles_submenu);\n let group_ptr = profile_actions_group.as_mut_ptr();\n let click = Slot::new(|| {\n #[cfg(not(feature = \"auto\"))]\n {\n if let Some(current_active_profile) = &(*state_ptr).active_profile {\n \n if let Err(e) = Command::new(\"netctl\")\n .arg(\"stop\")\n .arg(current_active_profile)\n .spawn()\n {\n eprintln!(\"Couldn't run netctl stop command: {:?}\", e);\n }\n }\n \n if let Err(e) = Command::new(\"netctl\")\n .arg(\"start\")\n .arg((*group_ptr).checked_action().text().to_std_string())\n .spawn()\n {\n eprintln!(\"Couldn't run netctl start command: {:?}\", e);\n }\n }\n #[cfg(feature = \"auto\")]\n {\n \n if let Err(e) = Command::new(\"netctl-auto\")\n .arg(\"switch-to\")\n .arg((*group_ptr).checked_action().text().to_std_string())\n .spawn()\n {\n eprintln!(\"Couldn't run netctl-auto switch-to command: {:?}\", e);\n }\n }\n });\n\n \n let generate_profiles_submenu = Slot::new(|| {\n gen_profile_submenu(\n state_ptr,\n profiles_submenu,\n &mut profile_actions_group,\n &click,\n );\n });\n profiles_submenu\n .about_to_show()\n .connect(&generate_profiles_submenu);\n\n \n let exit_app = Slot::new(|| {\n std::process::exit(0);\n });\n menu.add_action_q_icon_q_string(\n QIcon::from_q_string(\n QString::from_std_str(\"/usr/share/netctl-tray/exit.svg\").as_mut_ref(),\n )\n .as_mut_ref(),\n QString::from_std_str(\"Exit\").as_mut_ref(),\n )\n .triggered()\n .connect(&exit_app);\n\n tray.show();\n\n \n let update_state = Slot::new(|| {\n let old_active_profile = (*state_ptr).active_profile.clone();\n if let Err(e) = update_state(&mut (*state_ptr), &args) {\n eprintln!(\"Can't update tray state: {:?}\", e);\n }\n if !args.disable_notifications {\n if let Err(e) = profile_notification(&mut (*state_ptr), old_active_profile) {\n eprintln!(\"Error sending desktop notification: {:?}\", e);\n }\n }\n\n \n tray.set_icon(get_status_icon(&mut (*state_ptr)).as_ref());\n });\n let mut update_timer = QTimer::new_0a();\n \n update_timer.set_interval((args.interval * 1000.0) as i32);\n update_timer.timeout().connect(&update_state);\n update_timer.start_0a();\n\n QApplication::exec()\n }\n });\n}\n\nunsafe fn gen_profile_submenu(\n state_ptr: *mut State,\n mut profiles_submenu: MutPtr<QMenu>,\n profile_actions_group: &mut CppBox<QActionGroup>,\n click: &Slot,\n) {\n profiles_submenu.clear();\n for profile in &(*(*state_ptr).all_profiles.lock().unwrap()) {\n let mut item =\n profiles_submenu.add_action_q_string(QString::from_std_str(profile).as_mut_ref());\n item.set_checkable(true);\n item.set_checked(false);\n if let Some(active_profile) = &(*state_ptr).active_profile {\n if active_profile == profile {\n item.set_checked(true);\n }\n }\n item.set_action_group(profile_actions_group.as_mut_ptr());\n item.triggered().connect(click);\n }\n}\n\nfn profile_notification(\n state: &mut State,\n old_active_profile: Option<String>,\n) -> Result<(), notify_rust::error::Error> {\n \n let text = match (&old_active_profile, &state.active_profile) {\n (None, Some(new)) => {\n \n format!(\"Profile <b>{}</b> started.\", new)\n }\n (Some(old), None) => {\n \n format!(\"Profile <b>{}</b> stopped.\", old)\n }\n (Some(old), Some(new)) => {\n if old != new {\n \n format!(\"Profile switched: from <b>{}</b> to <b>{}</b>.\", old, new)\n } else {\n \n return Ok(());\n }\n }\n _ => {\n \n return Ok(());\n }\n };\n \n Notification::new()\n .summary(\"netctl\")\n .body(&text)\n .icon(\"network-wireless\")\n .timeout(Timeout::Milliseconds(5000))\n .show()?;\n\n Ok(())\n}\n\nfn is_user_in_wheel_and_network() -> (bool, bool) {\n let username = match get_current_username() {\n Some(s) => s,\n None => {\n eprintln!(\"Can't get current user!\");\n return (false, false);\n }\n };\n\n let groups = match get_user_groups(&username, get_current_gid()) {\n Some(g) => g,\n None => {\n eprintln!(\"Couldn't get the list of groups the user is in.\");\n return (false, false);\n }\n };\n\n let mut in_wheel = false;\n let mut in_network = false;\n for group in groups {\n if group.name() == OsStr::new(\"network\") {\n in_network = true;\n } else if group.name() == OsStr::new(\"wheel\") {\n in_wheel = true;\n }\n }\n\n (in_wheel, in_network)\n}\n\nfn get_status_icon(state: &mut State) -> CppBox<QIcon> {\n let icon_path = if state.active_profile.is_none() {\n \n \"/usr/share/netctl-tray/no_profile.svg\"\n } else {\n if state.ping == f32::INFINITY {\n \n match state.link_quality {\n 0 => \"/usr/share/netctl-tray/no_signal_no_internet.svg\",\n 1..23 => \"/usr/share/netctl-tray/bad_no_internet.svg\",\n 23..47 => \"/usr/share/netctl-tray/medium_no_internet.svg\",\n _ => \"/usr/share/netctl-tray/good_no_internet.svg\",\n }\n } else {\n match state.link_quality {\n 0 => \"/usr/share/netctl-tray/no_signal.svg\",\n 1..23 => \"/usr/share/netctl-tray/bad.svg\",\n 23..47 => \"/usr/share/netctl-tray/medium.svg\",\n _ => \"/usr/share/netctl-tray/good.svg\",\n }\n }\n };\n unsafe { QIcon::from_q_string(QString::from_std_str(&icon_path).as_mut_ref()) }\n}\n"},"prefix":{"kind":"string","value":"#![feature(exclusive_range_pattern)]\n\nmod state;\n\nuse notify_rust::{Notification, Timeout};\nuse qt_gui::QIcon;\nuse qt_widgets::cpp_utils::{CppBox, MutPtr};\nuse qt_widgets::qt_core::{QString, QTimer, Slot};\nuse qt_widgets::{QActionGroup, QApplication, QMenu, QSystemTrayIcon, SlotOfActivationReason};\nuse state::{inotify_watch, scan_profiles, update_state, State};\nuse std::ffi::OsStr;\nuse std::net::SocketAddr;\nuse std::process::Command;\nuse std::sync::{Arc, Mutex};\nuse structopt::StructOpt;\nuse users::{get_current_gid, get_current_username, get_user_groups};\n\n#[derive(Debug, StructOpt)]\n#[structopt(\n name = \"netctl-tray\",\n about = \"A lightweight netctl tray app with notifications.\"\n)]\npub struct Opt {\n \n #[structopt(short, long, default_value = \"2\")]\n pub interval: f32,\n \n #[structopt(long, default_value = \"1.1.1.1:53\")]\n pub host: SocketAddr,\n \n #[structopt(short)]\n pub disable_notifications: bool,\n}\n\nfn main() {\n \n let args = Opt::from_args();\n\n \n let (in_wheel, in_network) = is_user_in_wheel_and_network();\n if !in_wheel {\n eprintln!(\"Warning! You are not in group 'wheel', netctl-tray might not work or work only partially.\");\n }\n if !in_network {\n eprintln!(\"Warning! You are not in group 'network', netctl-tray might not work or work only partially.\");\n }\n\n let mut state = State {\n link_quality: 0,\n ping: 0.0,\n all_profiles: Arc::new(Mutex::new(Vec::new())),\n active_profile: None,\n };\n\n \n if let Err(e) = scan_profiles(&mut *state.all_profiles.lock().unwrap()) {\n eprintln!(\"Error while scanning profiles: {:?}\", e);\n return;\n }\n\n let all_profiles_clone = state.all_profiles.clone();\n\n \n if let Err(e) = inotify_watch(all_profiles_clone, \"/etc/netctl\") {\n eprintln!(\"Error watching /etc/netctl: {:?}\", e);\n return;\n }\n\n \n if let Err(e) = update_state(&mut state, &args) {\n eprintln!(\"Can't update tray state: {:?}\", e);\n }\n\n \n \n \n let state_ptr: *mut State = &mut state;\n\n \n QApplication::init(|_app| {\n unsafe {\n \n let mut tray = QSystemTrayIcon::from_q_icon(get_status_icon(&mut state).as_ref());\n\n \n let tray_click = SlotOfActivationReason::new(|reason| {\n let reason = reason.to_int();\n \n if reason == 3 || reason == 4 {\n if let Err(e) = Notification::new()\n .summary(\"netctl\")\n .body(&format!(\n \"Profile: <b>{}</b>, Ping: <b>{} ms</b>, Quality: <b>{}/70</b>\",\n (*state_ptr)\n .active_profile\n .as_ref()\n .unwrap_or(&\"<i>{none}</i>\".to_string()),\n if (*state_ptr).ping == f32::INFINITY {\n \"∞\".to_string()\n } else {\n (*state_ptr).ping.round().to_string()\n },\n (*state_ptr).link_quality\n ))\n .icon(\"network-wireless\")\n .timeout(Timeout::Milliseconds(5000))\n .show()\n {\n eprintln!(\"Error sending desktop notification: {:?}\", e);\n }\n }\n });\n tray.activated().connect(&tray_click);\n\n \n let mut menu = QMenu::new();\n tray.set_context_menu(menu.as_mut_ptr());\n\n \n let profiles_submenu =\n menu.add_menu_q_string(QString::from_std_str(\"Profiles\").as_mut_ref());\n let mut profile_actions_group = QActionGroup::new(profiles_submenu);\n let group_ptr = profile_actions_group.as_mut_ptr();\n let click = Slot::new(|| {\n #[cfg(not(feature = \"auto\"))]\n {\n if let Some(current_active_profile) = &(*state_ptr).active_profile {\n \n if let Err(e) = Command::new(\"netctl\")\n .arg(\"stop\")\n .arg(current_active_profile)\n .spawn()\n {\n eprintln!(\"Couldn't run netctl stop command: {:?}\", e);\n }\n }\n \n if let Err(e) = Command::new(\"netctl\")\n .arg(\"start\")\n .arg((*group_ptr).checked_action().text().to_std_string())\n .spawn()\n {\n eprintln!(\"Couldn't run netctl start command: {:?}\", e);\n }\n }\n #[cfg(feature = \"auto\")]\n {\n \n if let Err(e) = Command::new(\"netctl-auto\")\n .arg(\"switch-to\")\n .arg((*group_ptr).checked_action().text().to_std_string())\n .spawn()\n {\n eprintln!(\"Couldn't run netctl-auto switch-to command: {:?}\", e);\n }\n }\n });\n\n \n let generate_profiles_submenu = Slot::new(|| {\n gen_profile_submenu(\n state_ptr,\n profiles_submenu,\n &mut profile_actions_group,\n &click,\n );\n });\n profiles_submenu\n .about_to_show()\n .connect(&generate_profiles_submenu);\n\n \n let exit_app = Slot::new(|| {\n std::process::exit(0);\n });\n menu.add_action_q_icon_q_string(\n QIcon::from_q_string(\n QString::from_std_str(\"/usr/share/netctl-tray/exit.svg\").as_mut_ref(),\n )\n .as_mut_ref(),\n QString::from_std_str(\"Exit\").as_mut_ref(),\n )\n .triggered()\n .connect(&exit_app);\n\n tray.show();\n\n \n let update_state = Slot::new(|| {\n let old_active_profile = (*state_ptr).active_profile.clone();\n if let Err(e) = update_state(&mut (*state_ptr), &args) {\n eprintln!(\"Can't update tray state: {:?}\", e);\n }\n if !args.disable_notifications {\n if let Err(e) = profile_notification(&mut (*state_ptr), old_active_profile) {\n eprintln!(\"Error sending desktop notification: {:?}\", e);\n }\n }\n\n \n tray.set_icon(get_status_icon(&mut (*state_ptr)).as_ref());\n });\n let mut update_timer = QTimer::new_0a();\n \n update_timer.set_interval((args.interval * 1000.0) as i32);\n update_timer.timeout().connect(&update_state);\n update_timer.start_0a();\n\n QApplication::exec()\n }\n });\n}\n\n"},"suffix":{"kind":"string","value":"\n\nfn profile_notification(\n state: &mut State,\n old_active_profile: Option<String>,\n) -> Result<(), notify_rust::error::Error> {\n \n let text = match (&old_active_profile, &state.active_profile) {\n (None, Some(new)) => {\n \n format!(\"Profile <b>{}</b> started.\", new)\n }\n (Some(old), None) => {\n \n format!(\"Profile <b>{}</b> stopped.\", old)\n }\n (Some(old), Some(new)) => {\n if old != new {\n \n format!(\"Profile switched: from <b>{}</b> to <b>{}</b>.\", old, new)\n } else {\n \n return Ok(());\n }\n }\n _ => {\n \n return Ok(());\n }\n };\n \n Notification::new()\n .summary(\"netctl\")\n .body(&text)\n .icon(\"network-wireless\")\n .timeout(Timeout::Milliseconds(5000))\n .show()?;\n\n Ok(())\n}\n\nfn is_user_in_wheel_and_network() -> (bool, bool) {\n let username = match get_current_username() {\n Some(s) => s,\n None => {\n eprintln!(\"Can't get current user!\");\n return (false, false);\n }\n };\n\n let groups = match get_user_groups(&username, get_current_gid()) {\n Some(g) => g,\n None => {\n eprintln!(\"Couldn't get the list of groups the user is in.\");\n return (false, false);\n }\n };\n\n let mut in_wheel = false;\n let mut in_network = false;\n for group in groups {\n if group.name() == OsStr::new(\"network\") {\n in_network = true;\n } else if group.name() == OsStr::new(\"wheel\") {\n in_wheel = true;\n }\n }\n\n (in_wheel, in_network)\n}\n\nfn get_status_icon(state: &mut State) -> CppBox<QIcon> {\n let icon_path = if state.active_profile.is_none() {\n \n \"/usr/share/netctl-tray/no_profile.svg\"\n } else {\n if state.ping == f32::INFINITY {\n \n match state.link_quality {\n 0 => \"/usr/share/netctl-tray/no_signal_no_internet.svg\",\n 1..23 => \"/usr/share/netctl-tray/bad_no_internet.svg\",\n 23..47 => \"/usr/share/netctl-tray/medium_no_internet.svg\",\n _ => \"/usr/share/netctl-tray/good_no_internet.svg\",\n }\n } else {\n match state.link_quality {\n 0 => \"/usr/share/netctl-tray/no_signal.svg\",\n 1..23 => \"/usr/share/netctl-tray/bad.svg\",\n 23..47 => \"/usr/share/netctl-tray/medium.svg\",\n _ => \"/usr/share/netctl-tray/good.svg\",\n }\n }\n };\n unsafe { QIcon::from_q_string(QString::from_std_str(&icon_path).as_mut_ref()) }\n}\n"},"middle":{"kind":"string","value":"unsafe fn gen_profile_submenu(\n state_ptr: *mut State,\n mut profiles_submenu: MutPtr<QMenu>,\n profile_actions_group: &mut CppBox<QActionGroup>,\n click: &Slot,\n) {\n profiles_submenu.clear();\n for profile in &(*(*state_ptr).all_profiles.lock().unwrap()) {\n let mut item =\n profiles_submenu.add_action_q_string(QString::from_std_str(profile).as_mut_ref());\n item.set_checkable(true);\n item.set_checked(false);\n if let Some(active_profile) = &(*state_ptr).active_profile {\n if active_profile == profile {\n item.set_checked(true);\n }\n }\n item.set_action_group(profile_actions_group.as_mut_ptr());\n item.triggered().connect(click);\n }\n}"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"// Updates the netctl-tray state: ping, quality and current active profile\n\npub fn update_state(state: &mut State, args: &Opt) -> Result<(), std::io::Error> {\n\n // get the current active profile\n\n #[cfg(not(feature = \"auto\"))]\n\n let raw_profiles = Command::new(\"netctl\").arg(\"list\").output()?;\n\n #[cfg(feature = \"auto\")]\n\n let raw_profiles = Command::new(\"netctl-auto\").arg(\"list\").output()?;\n\n // Iterate through each line\n\n let mut active_profile = None;\n\n for line in raw_profiles.stdout.split(|c| *c == '\\n' as u8) {\n\n if line.len() == 0 {\n\n continue;\n\n }\n\n // If the line starts with an asterisk, then the profile is active\n\n // and we need it's name\n\n if line[0] == '*' as u8 {\n\n active_profile = match std::str::from_utf8(&line[2..]) {\n\n Ok(s) => Some(s.to_owned()),\n\n Err(e) => {\n\n eprintln!(\"Can't read profile name from netctl list: {:?}\", e);\n\n break;\n","file_path":"src/state.rs","rank":0,"score":105797.13816760368},{"content":"// Scans the files in /etc/netctl and adds the profiles to the vector\n\npub fn scan_profiles(all_profiles: &mut Vec<String>) -> Result<(), std::io::Error> {\n\n // for every file or folder in /etc/netcl\n\n for entry in fs::read_dir(\"/etc/netctl/\")? {\n\n let path = entry?.path();\n\n let metadata = path.metadata()?;\n\n if metadata.is_file() {\n\n // the file name of the profile configuration\n\n // is the name of the profile.\n\n let profile_name = match path.file_name().unwrap().to_str() {\n\n Some(f) => f,\n\n None => {\n\n eprintln!(\n\n \"Can't convert OsStr to str: {:?}\",\n\n path.file_name().unwrap()\n\n );\n\n continue;\n\n }\n\n };\n\n // add the profile to the vector\n\n all_profiles.push(profile_name.to_owned());\n\n }\n\n }\n\n Ok(())\n\n}\n\n\n","file_path":"src/state.rs","rank":2,"score":78609.13901440593},{"content":"pub fn inotify_watch(\n\n all_profiles: Arc<Mutex<Vec<String>>>,\n\n dir: &str,\n\n) -> Result<(), notify::Error> {\n\n // initialize the inotify watcher\n\n let mut watcher = immediate_watcher(move |res: Result<NEvent, _>| match res {\n\n Ok(event) => {\n\n match event.kind {\n\n NEventKind::Create(_) => {\n\n // Add the new profile\n\n for path in event.paths {\n\n match path.file_name().unwrap().to_str() {\n\n Some(p) => all_profiles.lock().unwrap().push(p.to_owned()),\n\n None => {\n\n eprintln!(\n\n \"Can't convert OsStr to str: {:?}\",\n\n path.file_name().unwrap()\n\n );\n\n continue;\n\n }\n","file_path":"src/state.rs","rank":3,"score":71283.71152549019},{"content":"# netctl-tray\n\nA lightweight netctl tray app with notifications written in Rust.\n\n\n\n## Screenshots\n\n\n\n  \n\n\n\n## Usage\n\n\n\nTo launch the tray app:\n\n```\n\n$ netctl-tray\n\n```\n\nYou have to be in groups `wheel` and `network` for it to work properly. \n\nTo add an user to them, use:\n\n```\n\n# usermod -a -G wheel,network <user>\n\n```\n\n\n\n## Compiling\n\n\n\nThis application needs to be compiled for netctl and netctl-auto separately.\n\nFor `netctl`:\n\n```\n\ncargo build --release\n\n```\n\nFor `netctl-auto`:\n\n```\n\ncargo build --release --features \"auto\"\n\n```\n\n\n\n## Installation\n\n\n\nThis app is available on the AUR: [netctl-tray](https://aur.archlinux.org/packages/netctl-tray/) and [netctl-tray-auto](https://aur.archlinux.org/packages/netctl-tray-auto/)\n\n\n\n## Contributing\n\n\n\nAll contributions are welcome!\n","file_path":"README.md","rank":7,"score":20602.048414822417},{"content":"use crate::Opt;\n\nuse notify::{\n\n event::{Event as NEvent, EventKind as NEventKind},\n\n immediate_watcher, RecursiveMode, Watcher,\n\n};\n\nuse std::fs;\n\nuse std::fs::File;\n\nuse std::io::prelude::*;\n\nuse std::net::TcpStream;\n\nuse std::process::Command;\n\nuse std::sync::{Arc, Mutex};\n\nuse std::time::{Duration, Instant};\n\n\n\n#[derive(Debug)]\n\npub struct State {\n\n pub link_quality: u8,\n\n pub ping: f32,\n\n pub all_profiles: Arc<Mutex<Vec<String>>>,\n\n pub active_profile: Option<String>,\n\n}\n\n\n","file_path":"src/state.rs","rank":8,"score":15910.016670316909},{"content":" // check ping\n\n // try connecting to the given IP\n\n let now = Instant::now();\n\n if TcpStream::connect_timeout(&args.host, Duration::from_nanos(500_000_000)).is_ok() {\n\n state.ping = now.elapsed().as_millis() as f32;\n\n } else {\n\n state.ping = f32::INFINITY;\n\n }\n\n\n\n Ok(())\n\n}\n","file_path":"src/state.rs","rank":9,"score":15907.953359735882},{"content":" }\n\n };\n\n break;\n\n }\n\n }\n\n state.active_profile = active_profile;\n\n\n\n if let Some(active_profile) = &state.active_profile {\n\n // Now we need to get the interface the current profile uses\n\n let mut current_profile_file = File::open(&format!(\"/etc/netctl/{}\", active_profile))?;\n\n let mut current_profile_contents = String::new();\n\n current_profile_file.read_to_string(&mut current_profile_contents)?;\n\n // iterate over lines to find the one specifying the interface\n\n let mut profile_interface = \"\";\n\n for line in current_profile_contents.split('\\n') {\n\n if line.starts_with(\"Interface\") {\n\n let mut interface = match line.split('=').nth(1) {\n\n Some(i) => i,\n\n None => {\n\n eprintln!(\n","file_path":"src/state.rs","rank":10,"score":15906.003367149719},{"content":" // Now, as we know the used interface we can check the link quality\n\n // It can be found in /proc/net/wireless\n\n let mut file = File::open(\"/proc/net/wireless\")?;\n\n let mut contents = String::new();\n\n file.read_to_string(&mut contents)?;\n\n // iterate over lines and find the one describing our needed interface\n\n for line in contents.split('\\n').skip(2) {\n\n if line.starts_with(profile_interface) {\n\n // Found the line\n\n // find the right column\n\n let mut columns = line.split(' ').filter(|x| !x.is_empty());\n\n let mut link_quality = columns.nth(2).unwrap();\n\n // remove the last char which is a dot apparently\n\n link_quality = &link_quality[..link_quality.len() - 1];\n\n let link_quality: u8 = link_quality.parse().unwrap();\n\n state.link_quality = link_quality;\n\n }\n\n }\n\n }\n\n\n","file_path":"src/state.rs","rank":11,"score":15904.817481790798},{"content":" };\n\n }\n\n }\n\n NEventKind::Remove(_) => {\n\n // Remove the profile\n\n for path in event.paths {\n\n match path.file_name().unwrap().to_str() {\n\n Some(p) => {\n\n all_profiles.lock().unwrap().retain(|x| *x != p);\n\n }\n\n None => {\n\n eprintln!(\n\n \"Can't convert OsStr to str: {:?}\",\n\n path.file_name().unwrap()\n\n );\n\n continue;\n\n }\n\n };\n\n }\n\n }\n","file_path":"src/state.rs","rank":12,"score":15902.439555900575},{"content":" \"Profile not properly configured! Corrupted file: /etc/netctl/{}\",\n\n active_profile\n\n );\n\n continue;\n\n }\n\n }\n\n .trim();\n\n // Remove quotes if there\n\n if interface.starts_with('\"') && interface.ends_with('\"') {\n\n // double quotes\n\n interface = &interface[1..interface.len() - 1];\n\n } else if interface.starts_with('\\'') && interface.ends_with('\\'') {\n\n // single quotes\n\n interface = &interface[1..interface.len() - 1];\n\n }\n\n profile_interface = interface;\n\n break;\n\n }\n\n }\n\n\n","file_path":"src/state.rs","rank":13,"score":15902.432835868602},{"content":" _ => {}\n\n }\n\n }\n\n Err(e) => eprintln!(\"watch error: {:?}\", e),\n\n })?;\n\n\n\n watcher.watch(dir, RecursiveMode::Recursive)?;\n\n\n\n Ok(())\n\n}\n","file_path":"src/state.rs","rank":14,"score":15902.140953337595}],"string":"[\n {\n \"content\": \"// Updates the netctl-tray state: ping, quality and current active profile\\n\\npub fn update_state(state: &mut State, args: &Opt) -> Result<(), std::io::Error> {\\n\\n // get the current active profile\\n\\n #[cfg(not(feature = \\\"auto\\\"))]\\n\\n let raw_profiles = Command::new(\\\"netctl\\\").arg(\\\"list\\\").output()?;\\n\\n #[cfg(feature = \\\"auto\\\")]\\n\\n let raw_profiles = Command::new(\\\"netctl-auto\\\").arg(\\\"list\\\").output()?;\\n\\n // Iterate through each line\\n\\n let mut active_profile = None;\\n\\n for line in raw_profiles.stdout.split(|c| *c == '\\\\n' as u8) {\\n\\n if line.len() == 0 {\\n\\n continue;\\n\\n }\\n\\n // If the line starts with an asterisk, then the profile is active\\n\\n // and we need it's name\\n\\n if line[0] == '*' as u8 {\\n\\n active_profile = match std::str::from_utf8(&line[2..]) {\\n\\n Ok(s) => Some(s.to_owned()),\\n\\n Err(e) => {\\n\\n eprintln!(\\\"Can't read profile name from netctl list: {:?}\\\", e);\\n\\n break;\\n\",\n \"file_path\": \"src/state.rs\",\n \"rank\": 0,\n \"score\": 105797.13816760368\n },\n {\n \"content\": \"// Scans the files in /etc/netctl and adds the profiles to the vector\\n\\npub fn scan_profiles(all_profiles: &mut Vec<String>) -> Result<(), std::io::Error> {\\n\\n // for every file or folder in /etc/netcl\\n\\n for entry in fs::read_dir(\\\"/etc/netctl/\\\")? {\\n\\n let path = entry?.path();\\n\\n let metadata = path.metadata()?;\\n\\n if metadata.is_file() {\\n\\n // the file name of the profile configuration\\n\\n // is the name of the profile.\\n\\n let profile_name = match path.file_name().unwrap().to_str() {\\n\\n Some(f) => f,\\n\\n None => {\\n\\n eprintln!(\\n\\n \\\"Can't convert OsStr to str: {:?}\\\",\\n\\n path.file_name().unwrap()\\n\\n );\\n\\n continue;\\n\\n }\\n\\n };\\n\\n // add the profile to the vector\\n\\n all_profiles.push(profile_name.to_owned());\\n\\n }\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/state.rs\",\n \"rank\": 2,\n \"score\": 78609.13901440593\n },\n {\n \"content\": \"pub fn inotify_watch(\\n\\n all_profiles: Arc<Mutex<Vec<String>>>,\\n\\n dir: &str,\\n\\n) -> Result<(), notify::Error> {\\n\\n // initialize the inotify watcher\\n\\n let mut watcher = immediate_watcher(move |res: Result<NEvent, _>| match res {\\n\\n Ok(event) => {\\n\\n match event.kind {\\n\\n NEventKind::Create(_) => {\\n\\n // Add the new profile\\n\\n for path in event.paths {\\n\\n match path.file_name().unwrap().to_str() {\\n\\n Some(p) => all_profiles.lock().unwrap().push(p.to_owned()),\\n\\n None => {\\n\\n eprintln!(\\n\\n \\\"Can't convert OsStr to str: {:?}\\\",\\n\\n path.file_name().unwrap()\\n\\n );\\n\\n continue;\\n\\n }\\n\",\n \"file_path\": \"src/state.rs\",\n \"rank\": 3,\n \"score\": 71283.71152549019\n },\n {\n \"content\": \"# netctl-tray\\n\\nA lightweight netctl tray app with notifications written in Rust.\\n\\n\\n\\n## Screenshots\\n\\n\\n\\n  \\n\\n\\n\\n## Usage\\n\\n\\n\\nTo launch the tray app:\\n\\n```\\n\\n$ netctl-tray\\n\\n```\\n\\nYou have to be in groups `wheel` and `network` for it to work properly. \\n\\nTo add an user to them, use:\\n\\n```\\n\\n# usermod -a -G wheel,network <user>\\n\\n```\\n\\n\\n\\n## Compiling\\n\\n\\n\\nThis application needs to be compiled for netctl and netctl-auto separately.\\n\\nFor `netctl`:\\n\\n```\\n\\ncargo build --release\\n\\n```\\n\\nFor `netctl-auto`:\\n\\n```\\n\\ncargo build --release --features \\\"auto\\\"\\n\\n```\\n\\n\\n\\n## Installation\\n\\n\\n\\nThis app is available on the AUR: [netctl-tray](https://aur.archlinux.org/packages/netctl-tray/) and [netctl-tray-auto](https://aur.archlinux.org/packages/netctl-tray-auto/)\\n\\n\\n\\n## Contributing\\n\\n\\n\\nAll contributions are welcome!\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 7,\n \"score\": 20602.048414822417\n },\n {\n \"content\": \"use crate::Opt;\\n\\nuse notify::{\\n\\n event::{Event as NEvent, EventKind as NEventKind},\\n\\n immediate_watcher, RecursiveMode, Watcher,\\n\\n};\\n\\nuse std::fs;\\n\\nuse std::fs::File;\\n\\nuse std::io::prelude::*;\\n\\nuse std::net::TcpStream;\\n\\nuse std::process::Command;\\n\\nuse std::sync::{Arc, Mutex};\\n\\nuse std::time::{Duration, Instant};\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct State {\\n\\n pub link_quality: u8,\\n\\n pub ping: f32,\\n\\n pub all_profiles: Arc<Mutex<Vec<String>>>,\\n\\n pub active_profile: Option<String>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/state.rs\",\n \"rank\": 8,\n \"score\": 15910.016670316909\n },\n {\n \"content\": \" // check ping\\n\\n // try connecting to the given IP\\n\\n let now = Instant::now();\\n\\n if TcpStream::connect_timeout(&args.host, Duration::from_nanos(500_000_000)).is_ok() {\\n\\n state.ping = now.elapsed().as_millis() as f32;\\n\\n } else {\\n\\n state.ping = f32::INFINITY;\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"src/state.rs\",\n \"rank\": 9,\n \"score\": 15907.953359735882\n },\n {\n \"content\": \" }\\n\\n };\\n\\n break;\\n\\n }\\n\\n }\\n\\n state.active_profile = active_profile;\\n\\n\\n\\n if let Some(active_profile) = &state.active_profile {\\n\\n // Now we need to get the interface the current profile uses\\n\\n let mut current_profile_file = File::open(&format!(\\\"/etc/netctl/{}\\\", active_profile))?;\\n\\n let mut current_profile_contents = String::new();\\n\\n current_profile_file.read_to_string(&mut current_profile_contents)?;\\n\\n // iterate over lines to find the one specifying the interface\\n\\n let mut profile_interface = \\\"\\\";\\n\\n for line in current_profile_contents.split('\\\\n') {\\n\\n if line.starts_with(\\\"Interface\\\") {\\n\\n let mut interface = match line.split('=').nth(1) {\\n\\n Some(i) => i,\\n\\n None => {\\n\\n eprintln!(\\n\",\n \"file_path\": \"src/state.rs\",\n \"rank\": 10,\n \"score\": 15906.003367149719\n },\n {\n \"content\": \" // Now, as we know the used interface we can check the link quality\\n\\n // It can be found in /proc/net/wireless\\n\\n let mut file = File::open(\\\"/proc/net/wireless\\\")?;\\n\\n let mut contents = String::new();\\n\\n file.read_to_string(&mut contents)?;\\n\\n // iterate over lines and find the one describing our needed interface\\n\\n for line in contents.split('\\\\n').skip(2) {\\n\\n if line.starts_with(profile_interface) {\\n\\n // Found the line\\n\\n // find the right column\\n\\n let mut columns = line.split(' ').filter(|x| !x.is_empty());\\n\\n let mut link_quality = columns.nth(2).unwrap();\\n\\n // remove the last char which is a dot apparently\\n\\n link_quality = &link_quality[..link_quality.len() - 1];\\n\\n let link_quality: u8 = link_quality.parse().unwrap();\\n\\n state.link_quality = link_quality;\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/state.rs\",\n \"rank\": 11,\n \"score\": 15904.817481790798\n },\n {\n \"content\": \" };\\n\\n }\\n\\n }\\n\\n NEventKind::Remove(_) => {\\n\\n // Remove the profile\\n\\n for path in event.paths {\\n\\n match path.file_name().unwrap().to_str() {\\n\\n Some(p) => {\\n\\n all_profiles.lock().unwrap().retain(|x| *x != p);\\n\\n }\\n\\n None => {\\n\\n eprintln!(\\n\\n \\\"Can't convert OsStr to str: {:?}\\\",\\n\\n path.file_name().unwrap()\\n\\n );\\n\\n continue;\\n\\n }\\n\\n };\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/state.rs\",\n \"rank\": 12,\n \"score\": 15902.439555900575\n },\n {\n \"content\": \" \\\"Profile not properly configured! Corrupted file: /etc/netctl/{}\\\",\\n\\n active_profile\\n\\n );\\n\\n continue;\\n\\n }\\n\\n }\\n\\n .trim();\\n\\n // Remove quotes if there\\n\\n if interface.starts_with('\\\"') && interface.ends_with('\\\"') {\\n\\n // double quotes\\n\\n interface = &interface[1..interface.len() - 1];\\n\\n } else if interface.starts_with('\\\\'') && interface.ends_with('\\\\'') {\\n\\n // single quotes\\n\\n interface = &interface[1..interface.len() - 1];\\n\\n }\\n\\n profile_interface = interface;\\n\\n break;\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/state.rs\",\n \"rank\": 13,\n \"score\": 15902.432835868602\n },\n {\n \"content\": \" _ => {}\\n\\n }\\n\\n }\\n\\n Err(e) => eprintln!(\\\"watch error: {:?}\\\", e),\\n\\n })?;\\n\\n\\n\\n watcher.watch(dir, RecursiveMode::Recursive)?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"src/state.rs\",\n \"rank\": 14,\n \"score\": 15902.140953337595\n }\n]","isConversational":false}}},{"rowIdx":1382,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"examples/rpg_engine/src/character.rs"},"repo_name":{"kind":"string","value":"arn-the-long-beard/ntnu_rust_lecture"},"commit":{"kind":"string","value":"1c7d6aba84e9e5ea99f18a5e46a11a674a08aa34"},"file_code":{"kind":"string","value":"use crate::dice::SkillDice;\nuse crate::item::Weapon;\nuse crate::item::*;\nuse crate::stuff::{Stuff, StuffConfig};\nuse colored::*;\n\n#[derive(Clone)]\npub struct Character {\n name: String,\n health: f32,\n max_health: f32,\n stuff: Stuff,\n}\n\n#[allow(unused)]\nimpl Character {\n pub fn name(&self) -> &str {\n &self.name\n }\n pub fn health(&self) -> f32 {\n self.health\n }\n pub fn set_health(&mut self, health: f32) {\n self.health = health;\n }\n}\n\n#[allow(unused)]\nimpl Character {\n pub fn new(name: &str, health: f32) -> Self {\n Character {\n name: name.to_string(),\n health,\n max_health: health,\n stuff: Default::default(),\n }\n }\n\n \n \n pub fn roll_dice(&self, skill: SkillDice) -> u8 {\n skill.dices_roll_result(&self.name)\n }\n\n #[must_use]\n pub fn grab_weapon<W: Weapon + Send + Sync + 'static>(mut self, new_weapon: W) -> Self {\n self.stuff = self.stuff.equip_weapon(new_weapon);\n self\n }\n\n #[must_use]\n pub fn drop_first_weapon(mut self) -> Self {\n self.stuff.unset_first_weapon();\n self\n }\n\n #[must_use]\n pub fn drop_second_weapon(mut self) -> Self {\n self.stuff.unset_second_weapon();\n self\n }\n\n #[must_use]\n pub fn grab_armor<A: Armor + Send + Sync + 'static>(mut self, armor: A) -> Self {\n self.stuff = self.stuff.equip_armor(armor);\n self\n }\n\n \n \n fn check_blocking_damages(&self) -> Option<BlockedDamages> {\n match self.stuff.get_weapon_settings() {\n StuffConfig::DualWeapons => {\n None \n }\n StuffConfig::ShieldAndWeapon => self.stuff.get_second_weapon_blocking_damage(),\n StuffConfig::TwoHandsWeapon => self.stuff.get_first_weapon_blocking_damage(),\n StuffConfig::OnlyShied => self.stuff.get_second_weapon_blocking_damage(),\n StuffConfig::OneSingleHandWeapon => self.stuff.get_first_weapon_blocking_damage(),\n StuffConfig::OneWeaponAsSecondary => None,\n }\n }\n\n pub fn can_block(&self) -> Option<BlockedDamages> {\n self.check_blocking_damages()\n }\n\n \n \n pub fn gets_hit(&mut self, raw_damages: RawDamages) -> RawDamages {\n let mut damage_taken = raw_damages - self.get_armor();\n if damage_taken < 0.0 {\n damage_taken = raw_damages * 0.1;\n }\n self.update_health_from_taken_damage(&damage_taken);\n damage_taken\n }\n\n fn update_health_from_taken_damage(&mut self, damages: &RawDamages) {\n self.health -= *damages;\n if self.health < 0.0 {\n self.health = 0.0\n }\n }\n\n \n \n #[deprecated]\n pub fn get_attacked_by(&mut self, damages: RawDamages, attack_dice: u8, def_dice: Option<u8>) {\n \n let mut receive_damage = damages - self.get_armor();\n\n \n\n if let Some(def_result) = def_dice {\n if def_result > attack_dice {\n let blocking_damage = self.can_block().unwrap_or(0.0);\n receive_damage -= blocking_damage;\n\n println!(\n \"{} {} {} with its weapon\",\n self.name().bold(),\n \"blocked\".blue(),\n blocking_damage.to_string().red()\n )\n } else {\n println!(\n \"{} {} {} the attack \",\n self.name().bold(),\n \"failed\".red(),\n \"blocking\".underline()\n );\n }\n } else {\n println!(\"{} Will not block the attack\", self.name.bold());\n }\n if receive_damage < 0.0 {\n receive_damage = damages * 0.1;\n }\n println!(\n \"{} received {} damages\",\n self.name.bold(),\n receive_damage.to_string().red().bold()\n );\n\n self.health -= receive_damage;\n\n if self.health < 0.0 {\n self.health = 0.0\n }\n }\n fn get_armor(&self) -> BlockedDamages {\n self.stuff.get_armor_rating()\n }\n\n \n pub fn get_health_status(&self) -> HealthStatus {\n let percentage: u8 = ((self.health / self.max_health) * 100.0) as u8;\n match percentage {\n 0 => HealthStatus::Dead,\n 1..=10 => HealthStatus::AlmostDead,\n 11..=30 => HealthStatus::SeriouslyHurt,\n 31..=50 => HealthStatus::VeryHurt,\n\n 51..=75 => HealthStatus::LightlyHurt,\n 76..=99 => HealthStatus::SlightlyHurt,\n 100 => HealthStatus::Healthy,\n _ => {\n \n println!(\n \"{} % of maximum health, Did you get some magic ?\",\n percentage\n );\n HealthStatus::Healthy\n }\n }\n }\n pub fn deal_damages(&self) -> RawDamages {\n self.stuff.calculate_damages()\n }\n}\n\n#[derive(PartialEq, Debug)]\npub enum HealthStatus {\n Dead,\n AlmostDead,\n SeriouslyHurt,\n VeryHurt,\n LightlyHurt,\n SlightlyHurt,\n Healthy,\n}\n\n#[cfg(test)]\nmod test {\n use super::*;\n fn get_test_player() -> Character {\n Character::new(\"test character\", 1000.0)\n }\n fn get_long_iron_sword() -> RegularWeapon {\n RegularWeapon::new(\"Long Iron Sword\", 25.0, HandheldType::SingleHand)\n }\n fn get_long_steel_sword() -> RegularWeapon {\n RegularWeapon::new(\"Long Steel Sword\", 30.0, HandheldType::SingleHand)\n }\n fn get_steel_battle_axe() -> RegularWeapon {\n RegularWeapon::new(\"Steal battle Axe\", 65.0, HandheldType::TwoHands)\n }\n\n fn get_iron_shield() -> Shield {\n Shield::new(\"Iron Shield\", 25.0, 5.0)\n }\n\n fn get_steel_shield() -> Shield {\n Shield::new(\"Steel Shield\", 35.0, 7.0)\n }\n\n fn get_daedric_mail() -> BodyArmor {\n BodyArmor::new(\"Daedric Shield\", 45.0)\n }\n\n #[test]\n fn test_blocking_for_weapon_config() {\n let mut guard = get_test_player().grab_weapon(get_steel_battle_axe());\n\n \n assert_eq!(\n guard.check_blocking_damages().unwrap(),\n get_steel_battle_axe().damages() * 0.5\n );\n\n guard = guard.grab_weapon(get_iron_shield());\n\n assert_eq!(\n guard.check_blocking_damages().unwrap(),\n get_iron_shield().can_block_if_possible().unwrap()\n );\n\n guard = guard.grab_weapon(get_long_iron_sword());\n\n \n assert_eq!(\n guard.check_blocking_damages().unwrap(),\n get_iron_shield().can_block_if_possible().unwrap()\n );\n\n \n guard = guard.grab_weapon(get_long_iron_sword());\n assert!(guard.check_blocking_damages().is_none());\n\n guard = guard.drop_second_weapon();\n \n assert_eq!(\n guard.check_blocking_damages().unwrap(),\n get_long_iron_sword().damages() * 0.3\n );\n }\n\n #[test]\n fn check_status() {\n let mut guard_test = get_test_player();\n assert_eq!(&guard_test.get_health_status(), &HealthStatus::Healthy);\n\n guard_test.set_health(850.00);\n assert_eq!(&guard_test.get_health_status(), &HealthStatus::SlightlyHurt);\n\n guard_test.set_health(550.00);\n assert_eq!(&guard_test.get_health_status(), &HealthStatus::LightlyHurt);\n\n guard_test.set_health(350.00);\n assert_eq!(&guard_test.get_health_status(), &HealthStatus::VeryHurt);\n\n guard_test.set_health(250.00);\n assert_eq!(\n &guard_test.get_health_status(),\n &HealthStatus::SeriouslyHurt\n );\n\n guard_test.set_health(50.00);\n assert_eq!(&guard_test.get_health_status(), &HealthStatus::AlmostDead);\n\n guard_test.set_health(0.0);\n assert_eq!(&guard_test.get_health_status(), &HealthStatus::Dead);\n }\n\n #[test]\n fn kill_naked_character() {\n let mut guard = get_test_player();\n guard.get_attacked_by(1800.2, 3, None);\n assert_eq!(&guard.get_health_status(), &HealthStatus::Dead);\n }\n\n #[test]\n fn defense_armored_character() {\n let mut guard = get_test_player().grab_armor(get_daedric_mail());\n guard.get_attacked_by(100.0, 3, None);\n assert_eq!(guard.health, 945.0);\n }\n\n #[test]\n fn defense_armored_character_with_block() {\n let mut guard = get_test_player()\n .grab_armor(get_daedric_mail())\n .grab_weapon(get_iron_shield());\n guard.get_attacked_by(100.0, 3, Some(5));\n\n assert_eq!(guard.health, 970.0);\n }\n}\n"},"prefix":{"kind":"string","value":"use crate::dice::SkillDice;\nuse crate::item::Weapon;\nuse crate::item::*;\nuse crate::stuff::{Stuff, StuffConfig};\nuse colored::*;\n\n#[derive(Clone)]\npub struct Character {\n name: String,\n health: f32,\n max_health: f32,\n stuff: Stuff,\n}\n\n#[allow(unused)]\nimpl Character {\n pub fn name(&self) -> &str {\n &self.name\n }\n pub fn health(&self) -> f32 {\n self.health\n }\n pub fn set_health(&mut self, health: f32) {\n self.health = health;\n }\n}\n\n#[allow(unused)]\nimpl Character {\n pub fn new(name: &str, health: f32) -> Self {\n Character {\n name: name.to_string(),\n health,\n max_health: health,\n stuff: Default::default(),\n }\n }\n\n \n \n pub fn roll_dice(&self, skill: SkillDice) -> u8 {\n skill.dices_roll_result(&self.name)\n }\n\n #[must_use]\n pub fn grab_weapon<W: Weapon + Send + Sync + 'static>(mut self, new_weapon: W) -> Self {\n self.stuff = self.stuff.equip_weapon(new_weapon);\n self\n }\n\n #[must_use]\n pub fn drop_first_weapon(mut self) -> Self {\n self.stuff.unset_first_weapon();\n self\n }\n\n #[must_use]\n pub fn drop_second_weapon(mut self) -> Self {\n self.stuff.unset_second_weapon();\n self\n }\n\n #[must_use]\n pub fn grab_armor<A: Armor + Send + Sync + 'static>(mut self, armor: A) -> Self {\n self.stuff = self.stuff.equip_armor(armor);\n self\n }\n\n \n \n fn check_blocking_damages(&self) -> Option<BlockedDamages> {\n match self.stuff.get_weapon_settings() {\n StuffConfig::DualWeapons => {\n None \n }\n StuffConfig::ShieldAndWeapon => self.stuff.get_second_weapon_blocking_damage(),\n StuffConfig::TwoHandsWeapon => self.stuff.get_first_weapon_blocking_damage(),\n StuffConfig::OnlyShied => self.stuff.get_second_weapon_blocking_damage(),\n StuffConfig::OneSingleHandWeapon => self.stuff.get_first_weapon_blocking_damage(),\n StuffConfig::OneWeaponAsSecondary => None,\n }\n }\n\n pub fn can_block(&self) -> Option<BlockedDamages> {\n self.check_blocking_damages()\n }\n\n \n \n pub fn gets_hit(&mut s"},"suffix":{"kind":"string","value":"\n\n fn update_health_from_taken_damage(&mut self, damages: &RawDamages) {\n self.health -= *damages;\n if self.health < 0.0 {\n self.health = 0.0\n }\n }\n\n \n \n #[deprecated]\n pub fn get_attacked_by(&mut self, damages: RawDamages, attack_dice: u8, def_dice: Option<u8>) {\n \n let mut receive_damage = damages - self.get_armor();\n\n \n\n if let Some(def_result) = def_dice {\n if def_result > attack_dice {\n let blocking_damage = self.can_block().unwrap_or(0.0);\n receive_damage -= blocking_damage;\n\n println!(\n \"{} {} {} with its weapon\",\n self.name().bold(),\n \"blocked\".blue(),\n blocking_damage.to_string().red()\n )\n } else {\n println!(\n \"{} {} {} the attack \",\n self.name().bold(),\n \"failed\".red(),\n \"blocking\".underline()\n );\n }\n } else {\n println!(\"{} Will not block the attack\", self.name.bold());\n }\n if receive_damage < 0.0 {\n receive_damage = damages * 0.1;\n }\n println!(\n \"{} received {} damages\",\n self.name.bold(),\n receive_damage.to_string().red().bold()\n );\n\n self.health -= receive_damage;\n\n if self.health < 0.0 {\n self.health = 0.0\n }\n }\n fn get_armor(&self) -> BlockedDamages {\n self.stuff.get_armor_rating()\n }\n\n \n pub fn get_health_status(&self) -> HealthStatus {\n let percentage: u8 = ((self.health / self.max_health) * 100.0) as u8;\n match percentage {\n 0 => HealthStatus::Dead,\n 1..=10 => HealthStatus::AlmostDead,\n 11..=30 => HealthStatus::SeriouslyHurt,\n 31..=50 => HealthStatus::VeryHurt,\n\n 51..=75 => HealthStatus::LightlyHurt,\n 76..=99 => HealthStatus::SlightlyHurt,\n 100 => HealthStatus::Healthy,\n _ => {\n \n println!(\n \"{} % of maximum health, Did you get some magic ?\",\n percentage\n );\n HealthStatus::Healthy\n }\n }\n }\n pub fn deal_damages(&self) -> RawDamages {\n self.stuff.calculate_damages()\n }\n}\n\n#[derive(PartialEq, Debug)]\npub enum HealthStatus {\n Dead,\n AlmostDead,\n SeriouslyHurt,\n VeryHurt,\n LightlyHurt,\n SlightlyHurt,\n Healthy,\n}\n\n#[cfg(test)]\nmod test {\n use super::*;\n fn get_test_player() -> Character {\n Character::new(\"test character\", 1000.0)\n }\n fn get_long_iron_sword() -> RegularWeapon {\n RegularWeapon::new(\"Long Iron Sword\", 25.0, HandheldType::SingleHand)\n }\n fn get_long_steel_sword() -> RegularWeapon {\n RegularWeapon::new(\"Long Steel Sword\", 30.0, HandheldType::SingleHand)\n }\n fn get_steel_battle_axe() -> RegularWeapon {\n RegularWeapon::new(\"Steal battle Axe\", 65.0, HandheldType::TwoHands)\n }\n\n fn get_iron_shield() -> Shield {\n Shield::new(\"Iron Shield\", 25.0, 5.0)\n }\n\n fn get_steel_shield() -> Shield {\n Shield::new(\"Steel Shield\", 35.0, 7.0)\n }\n\n fn get_daedric_mail() -> BodyArmor {\n BodyArmor::new(\"Daedric Shield\", 45.0)\n }\n\n #[test]\n fn test_blocking_for_weapon_config() {\n let mut guard = get_test_player().grab_weapon(get_steel_battle_axe());\n\n \n assert_eq!(\n guard.check_blocking_damages().unwrap(),\n get_steel_battle_axe().damages() * 0.5\n );\n\n guard = guard.grab_weapon(get_iron_shield());\n\n assert_eq!(\n guard.check_blocking_damages().unwrap(),\n get_iron_shield().can_block_if_possible().unwrap()\n );\n\n guard = guard.grab_weapon(get_long_iron_sword());\n\n \n assert_eq!(\n guard.check_blocking_damages().unwrap(),\n get_iron_shield().can_block_if_possible().unwrap()\n );\n\n \n guard = guard.grab_weapon(get_long_iron_sword());\n assert!(guard.check_blocking_damages().is_none());\n\n guard = guard.drop_second_weapon();\n \n assert_eq!(\n guard.check_blocking_damages().unwrap(),\n get_long_iron_sword().damages() * 0.3\n );\n }\n\n #[test]\n fn check_status() {\n let mut guard_test = get_test_player();\n assert_eq!(&guard_test.get_health_status(), &HealthStatus::Healthy);\n\n guard_test.set_health(850.00);\n assert_eq!(&guard_test.get_health_status(), &HealthStatus::SlightlyHurt);\n\n guard_test.set_health(550.00);\n assert_eq!(&guard_test.get_health_status(), &HealthStatus::LightlyHurt);\n\n guard_test.set_health(350.00);\n assert_eq!(&guard_test.get_health_status(), &HealthStatus::VeryHurt);\n\n guard_test.set_health(250.00);\n assert_eq!(\n &guard_test.get_health_status(),\n &HealthStatus::SeriouslyHurt\n );\n\n guard_test.set_health(50.00);\n assert_eq!(&guard_test.get_health_status(), &HealthStatus::AlmostDead);\n\n guard_test.set_health(0.0);\n assert_eq!(&guard_test.get_health_status(), &HealthStatus::Dead);\n }\n\n #[test]\n fn kill_naked_character() {\n let mut guard = get_test_player();\n guard.get_attacked_by(1800.2, 3, None);\n assert_eq!(&guard.get_health_status(), &HealthStatus::Dead);\n }\n\n #[test]\n fn defense_armored_character() {\n let mut guard = get_test_player().grab_armor(get_daedric_mail());\n guard.get_attacked_by(100.0, 3, None);\n assert_eq!(guard.health, 945.0);\n }\n\n #[test]\n fn defense_armored_character_with_block() {\n let mut guard = get_test_player()\n .grab_armor(get_daedric_mail())\n .grab_weapon(get_iron_shield());\n guard.get_attacked_by(100.0, 3, Some(5));\n\n assert_eq!(guard.health, 970.0);\n }\n}\n"},"middle":{"kind":"string","value":"elf, raw_damages: RawDamages) -> RawDamages {\n let mut damage_taken = raw_damages - self.get_armor();\n if damage_taken < 0.0 {\n damage_taken = raw_damages * 0.1;\n }\n self.update_health_from_taken_damage(&damage_taken);\n damage_taken\n }"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"pub fn roll_dice(actor: &str, dices: &str, action: &str) -> i64 {\n\n let result = Roller::new(&format!(\"{} : {} \", dices, action))\n\n .unwrap()\n\n .roll()\n\n .unwrap();\n\n println!(\n\n \"{} rolls {} for {} \",\n\n actor.bold(),\n\n dices.underline(),\n\n action.magenta()\n\n );\n\n result.as_single().unwrap().get_total()\n\n}\n\n\n\npub enum SkillDice {\n\n Initiative,\n\n Blocking,\n\n Attack,\n\n Dodge,\n\n}\n","file_path":"examples/rpg_engine/src/dice.rs","rank":0,"score":112005.73445544412},{"content":"fn update_name(company: &mut Company, new_name: &str) {\n\n company.name = new_name.to_string();\n\n}\n\n\n","file_path":"examples/ownership/src/main.rs","rank":1,"score":100676.02401084735},{"content":"// Let's start with armor;\n\npub trait Armor: Item {\n\n fn set_armor_rating(self, armor_rating: ArmorRating) -> Self\n\n where\n\n Self: Sized;\n\n fn armor_rating(&self) -> &ArmorRating;\n\n}\n\n\n\n/// NB : We could define many different armor type.\n\npub struct BodyArmor {\n\n armor_rating: f32,\n\n name: String,\n\n}\n\n\n\nimpl Default for BodyArmor {\n\n fn default() -> Self {\n\n BodyArmor {\n\n armor_rating: 0 as f32,\n\n name: \"\".to_string(),\n\n }\n\n }\n","file_path":"examples/rpg_engine/src/item.rs","rank":2,"score":82039.43523088138},{"content":"pub trait Weapon: Item {\n\n /// Describe how much damage a weapon can deal.\n\n /// More damage a weapon deals, better quality it is .\n\n fn damages(&self) -> &RawDamages;\n\n fn set_damages(self, amount: RawDamages) -> Self\n\n where\n\n Self: Sized;\n\n // Block attack and make calculation if possible\n\n fn can_block_if_possible(&self) -> Option<BlockedDamages> {\n\n match self.handheld_type() {\n\n HandheldType::SingleHand => Some(self.damages() * 0.3),\n\n HandheldType::TwoHands => Some(self.damages() * 0.5),\n\n // A bit dummy here because we have different implementation later.\n\n HandheldType::OnlyLeft => None,\n\n }\n\n }\n\n fn set_handheld_type(self, handheld: HandheldType) -> Self\n\n where\n\n Self: Sized;\n\n fn handheld_type(&self) -> &HandheldType;\n","file_path":"examples/rpg_engine/src/item.rs","rank":3,"score":82036.01231102912},{"content":"fn rate_business(value: &u32) -> &'static str {\n\n match value {\n\n 0 => \"Bankrupt\",\n\n 1..=100 => \"Weak\",\n\n 101..=350 => \"Ok\",\n\n 351..=700 => \"Nice\",\n\n 701..=1000 => \"Maybe a bubble\",\n\n _ => \"Like seven sisters\",\n\n }\n\n}\n\n\n","file_path":"examples/ownership/src/main.rs","rank":4,"score":72352.89180362954},{"content":"struct Company {\n\n pub name: String,\n\n /// In Billion\n\n pub value: u32,\n\n}\n\n\n","file_path":"examples/ownership/src/main.rs","rank":5,"score":48413.4046604762},{"content":"fn main() {\n\n let mut facebook = Company {\n\n name: \"FaceMash\".to_string(),\n\n value: 0,\n\n };\n\n // 1 - immutability\n\n facebook.name = \"Facebook\".to_string();\n\n facebook.value = 900;\n\n\n\n println!(\"{} new name is cool \", facebook.name);\n\n\n\n // 2 - Reference with & to read data\n\n // Try to assign value with `&` and see what happens:D\n\n display_data(&facebook);\n\n\n\n println!(\"{} is super old, we need rebranding. \", facebook.name); // <- Macro stuff does auto reference https://stackoverflow.com/questions/30450399/does-println-borrow-or-own-the-variable\n\n\n\n // <- if we do not use mut here, compiler will say NO\n\n facebook.name = \"Meta\".to_string();\n\n facebook.value -= 231;\n","file_path":"examples/ownership/src/main.rs","rank":6,"score":46285.67051924822},{"content":"fn main() {\n\n let mut line = String::new();\n\n print!(\"Enter total number of students:\");\n\n std::io::stdin().read_line(&mut line).unwrap();\n\n\n\n let students_amount: u32 = line.trim().parse().expect(\"We need an integer here\");\n\n\n\n let mut class = Vec::new();\n\n\n\n println!(\"Enter grades for students\");\n\n\n\n for student in 0..students_amount {\n\n print!(\"student{} :\", student + 1);\n\n let mut line = String::new();\n\n std::io::stdin().read_line(&mut line).unwrap();\n\n println!();\n\n\n\n let grade: u32 = line.trim().parse().expect(\"We need an integer here\");\n\n\n\n class.push(grade);\n\n }\n\n\n\n println!(\"Display grades for students\");\n\n\n\n for (index, grade) in class.iter().enumerate() {\n\n println!(\"student{} : {}\", index + 1, grade);\n\n }\n\n}\n","file_path":"examples/rust_allocation/src/main.rs","rank":7,"score":45320.39136510334},{"content":"//\n\npub trait Item {\n\n fn name(&self) -> &str;\n\n fn set_name(self, name: &str) -> Self\n\n where\n\n Self: Sized;\n\n}\n\n\n","file_path":"examples/rpg_engine/src/item.rs","rank":8,"score":43446.805758282906},{"content":"fn main() {\n\n let iron_plate = BodyArmor::new(\"Iron Plate\", 32.0);\n\n let steel_plate = BodyArmor::new(\"Steel Plate\", 54.0);\n\n let daedric_armor = BodyArmor::new(\"Daedric Armor\", 25.0);\n\n let daedric_armor_2 = BodyArmor::new(\"Daedric Armor 2\", 25.0);\n\n\n\n // Lets put some shields\n\n let steel_shield = Shield::new(\"steal Shield\", 55.0, 20.0);\n\n let iron_shield = Shield::new(\"Iron Shield\", 25.0, 15.0);\n\n\n\n // Lets put some weapons.\n\n let steel_long_sword = RegularWeapon::new(\"Steel Long Sword\", 40.0, HandheldType::SingleHand);\n\n let iron_long_sword = RegularWeapon::new(\"Iron Long Sword\", 35.0, HandheldType::SingleHand);\n\n let steel_battle_axe = RegularWeapon::new(\"Steel battle Axe\", 65.0, HandheldType::TwoHands);\n\n let daedric_battle_axe = RegularWeapon::new(\"Daedric battle Axe\", 85.0, HandheldType::TwoHands);\n\n\n\n let grand_ma_skyrim = Character::new(\"Skyrim Grandma\", 300.00)\n\n .grab_weapon(steel_battle_axe)\n\n .grab_armor(daedric_armor);\n\n\n","file_path":"examples/rpg_engine/examples/multiple_fights/src/main.rs","rank":9,"score":42767.386336336785},{"content":"#[allow(unused)]\n\nfn main() {\n\n println!(\"Hello and Fight\");\n\n\n\n // Lets put some armors.\n\n let iron_plate = BodyArmor::new(\"Iron Plate\", 32.0);\n\n let steel_plate = BodyArmor::new(\"Steel Plate\", 54.0);\n\n let daedric_armor = BodyArmor::new(\"Daedric Armor\", 25.0);\n\n let daedric_armor_2 = BodyArmor::new(\"Daedric Armor 2\", 25.0);\n\n\n\n // Lets put some shields\n\n let steel_shield = Shield::new(\"steal Shield\", 55.0, 20.0);\n\n let iron_shield = Shield::new(\"Iron Shield\", 25.0, 15.0);\n\n\n\n // Lets put some weapons.\n\n let iron_long_sword = RegularWeapon::new(\"Iron Long Sword\", 35.0, HandheldType::SingleHand);\n\n let steel_battle_axe = RegularWeapon::new(\"Steel battle Axe\", 65.0, HandheldType::TwoHands);\n\n let daedric_battle_axe = RegularWeapon::new(\"Daedric battle Axe\", 85.0, HandheldType::TwoHands);\n\n\n\n let grand_ma_skyrim = Character::new(\"Skyrim Grandma\", 300.00)\n\n .grab_weapon(steel_battle_axe)\n","file_path":"examples/rpg_engine/examples/simple_fight/src/main.rs","rank":10,"score":42767.386336336785},{"content":"#[cfg(feature = \"song\")]\n\nfn add_song() {\n\n println!(\n\n \"Dovahkiin, Dovahkiin, naal ok zin los vahriin,\n\n Wah dein vokul mahfaeraak ahst vaal!\n\n Ahr fin norok paal graan fod nust hon zindro zaan,\n\n Dovahkiin fah hin kogaan mu draal!\"\n\n );\n\n thread::sleep(Duration::new(2, 0));\n\n println!(\n\n \"\n\n Huzrah nu, kul do od, wah aan bok lingrah vod,\n\n Ahrk fin tey, boziik fun, do fin gein!\n\n Wo lost fron wah ney dov, ahrk fin reyliik do jul,\n\n Voth aan suleyk wah ronit faal krein!\"\n\n );\n\n thread::sleep(Duration::new(2, 0));\n\n println!(\n\n \" Ahrk fin zul, rok drey kod, nau tol morokei frod,\n\n Rul lot Taazokaan motaad voth kein!\n\n Sahrot Thu'um, med aan tuz, bey zeim hokoron pah,\n","file_path":"examples/rpg_engine/examples/multiple_fights/src/main.rs","rank":11,"score":42014.23692119663},{"content":"fn display_data(company: &Company) {\n\n println!(\"Name : {} \", company.name);\n\n println!(\"Market Cap : {} \", company.name);\n\n println!(\"Rating {}\", rate_business(&company.value))\n\n}\n\n\n","file_path":"examples/ownership/src/main.rs","rank":12,"score":39611.71752658159},{"content":"fn rebuild_business(_: Company) -> Company {\n\n Company {\n\n name: \"Facebook 2.0\".to_string(),\n\n value: 850,\n\n }\n\n}\n\n\n","file_path":"examples/ownership/src/main.rs","rank":13,"score":38266.86489439207},{"content":"#![allow(unused)]\n\n\n\nuse crate::item::*;\n\nuse std::sync::Arc;\n\n\n\n/// https://stackoverflow.com/questions/49377231/when-to-use-rc-vs-box\n\n/// Option on Arc is maybe useless, I could use default value for Weapon & Armor as well.\n\n#[derive(Clone, Default)]\n\npub struct Stuff {\n\n armor: Option<Arc<dyn Armor + Send + Sync>>,\n\n first_weapon: Option<Arc<dyn Weapon + Send + Sync>>,\n\n second_weapon: Option<Arc<dyn Weapon + Send + Sync>>,\n\n}\n\n\n\nimpl Stuff {\n\n fn set_armor<A: 'static + Armor + Send + Sync>(&mut self, armor: A) {\n\n self.armor = Some(Arc::new(armor));\n\n }\n\n\n\n fn set_first_weapon<W: 'static + Weapon + Send + Sync>(&mut self, first_weapon: W) {\n","file_path":"examples/rpg_engine/src/stuff.rs","rank":30,"score":29351.77110957809},{"content":" self.first_weapon = Some(Arc::new(first_weapon));\n\n }\n\n\n\n fn set_second_weapon<W: 'static + Weapon + Send + Sync>(&mut self, second_weapon: W) {\n\n self.second_weapon = Some(Arc::new(second_weapon))\n\n }\n\n\n\n pub fn unset_first_weapon(&mut self) {\n\n self.first_weapon = None;\n\n }\n\n\n\n pub fn unset_second_weapon(&mut self) {\n\n self.second_weapon = None;\n\n }\n\n\n\n fn armor(&self) -> &Option<Arc<dyn Armor + Send + Sync>> {\n\n &self.armor\n\n }\n\n\n\n fn first_weapon(&self) -> &Option<Arc<dyn Weapon + Send + Sync>> {\n","file_path":"examples/rpg_engine/src/stuff.rs","rank":31,"score":29348.57049955516},{"content":" &self.first_weapon\n\n }\n\n\n\n fn second_weapon(&self) -> &Option<Arc<dyn Weapon + Send + Sync>> {\n\n &self.second_weapon\n\n }\n\n\n\n /// Will panic if you have equipped a two hand weapon as a second Weapon.\n\n /// We could have specific trait for weapons to be used with both Hands.\n\n /// Ex : SingleHand Item could have a trait \"BothHand\", and restrict this trait for second hand.\n\n #[must_use]\n\n pub fn equip_weapon<W: 'static + Weapon + Send + Sync>(mut self, weapon: W) -> Self {\n\n match weapon.handheld_type() {\n\n HandheldType::SingleHand => {\n\n if let Some(current_weapon) = self.first_weapon() {\n\n if current_weapon.handheld_type() == &HandheldType::SingleHand {\n\n self.second_weapon = Some(current_weapon.clone())\n\n }\n\n }\n\n self.set_first_weapon(weapon);\n","file_path":"examples/rpg_engine/src/stuff.rs","rank":32,"score":29345.060491359443},{"content":" pub fn get_second_weapon_blocking_damage(&self) -> Option<f32> {\n\n self.second_weapon.as_ref()?.can_block_if_possible()\n\n }\n\n}\n\n\n\n#[derive(PartialEq)]\n\npub enum StuffConfig {\n\n DualWeapons,\n\n ShieldAndWeapon,\n\n TwoHandsWeapon,\n\n OnlyShied,\n\n OneSingleHandWeapon,\n\n OneWeaponAsSecondary,\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use crate::item::{Armor, BodyArmor, HandheldType, Item, RegularWeapon, Shield, Weapon};\n\n use crate::stuff::{Stuff, StuffConfig};\n\n\n","file_path":"examples/rpg_engine/src/stuff.rs","rank":33,"score":29343.86166966887},{"content":" #[must_use]\n\n pub fn equip_armor<A: 'static + Armor + Send + Sync>(mut self, armor: A) -> Self {\n\n self.set_armor(armor);\n\n self\n\n }\n\n\n\n /// Calculate armor rating.\n\n pub fn get_armor_rating(&self) -> ArmorRating {\n\n if let Some(armor) = self.armor() {\n\n *armor.armor_rating()\n\n } else {\n\n 0.0\n\n }\n\n }\n\n\n\n pub fn calculate_blocked_damage_armor(&self) -> BlockedDamages {\n\n let armor_damages = if let Some(armor) = self.armor() {\n\n *armor.armor_rating()\n\n } else {\n\n 0.0\n","file_path":"examples/rpg_engine/src/stuff.rs","rank":34,"score":29343.16950207902},{"content":" get_long_iron_sword().name()\n\n );\n\n assert!(stuff.second_weapon.is_none());\n\n\n\n assert!(stuff.get_weapon_settings() == StuffConfig::OneSingleHandWeapon);\n\n }\n\n\n\n #[test]\n\n fn use_two_hands_weapons() {\n\n let steel_battle_axe = get_steel_battle_axe();\n\n let long_iron_sword = get_long_iron_sword();\n\n let steel_shield = get_steel_shield();\n\n let mut stuff = Stuff::default()\n\n .equip_weapon(long_iron_sword)\n\n .equip_weapon(steel_shield);\n\n\n\n stuff = stuff.equip_weapon(steel_battle_axe);\n\n\n\n assert_eq!(\n\n stuff.first_weapon.as_ref().unwrap().name().to_string(),\n","file_path":"examples/rpg_engine/src/stuff.rs","rank":35,"score":29341.46277957638},{"content":" assert_eq!(\n\n stuff.second_weapon.as_ref().unwrap().name().to_string(),\n\n get_iron_shield().name()\n\n );\n\n\n\n stuff = stuff\n\n .equip_weapon(get_iron_shield())\n\n .equip_weapon(get_steel_shield());\n\n\n\n assert_eq!(\n\n stuff.second_weapon.as_ref().unwrap().name().to_string(),\n\n get_steel_shield().name()\n\n );\n\n assert!(stuff.get_weapon_settings() == StuffConfig::ShieldAndWeapon);\n\n }\n\n\n\n #[test]\n\n fn test_damages_with_shield_and_sword() {\n\n let damages = Stuff::default()\n\n .equip_weapon(get_long_steel_sword())\n","file_path":"examples/rpg_engine/src/stuff.rs","rank":36,"score":29340.37914674709},{"content":"\n\n assert_eq!(\n\n stuff.first_weapon.as_ref().unwrap().name().to_string(),\n\n get_long_steel_sword().name()\n\n );\n\n\n\n assert_eq!(\n\n stuff.second_weapon.as_ref().unwrap().name().to_string(),\n\n get_long_iron_sword().name()\n\n );\n\n }\n\n\n\n #[test]\n\n fn replace_two_hands_weapon_with_single() {\n\n let steel_battle_axe = get_steel_battle_axe();\n\n let mut stuff = Stuff::default().equip_weapon(steel_battle_axe);\n\n let long_iron_sword = get_long_iron_sword();\n\n stuff = stuff.equip_weapon(long_iron_sword);\n\n assert_eq!(\n\n stuff.first_weapon.as_ref().unwrap().name().to_string(),\n","file_path":"examples/rpg_engine/src/stuff.rs","rank":37,"score":29340.355432618802},{"content":" assert_eq!(\n\n stuff.second_weapon.as_ref().unwrap().name().to_string(),\n\n get_long_iron_sword().name()\n\n );\n\n assert!(stuff.get_weapon_settings() == StuffConfig::DualWeapons);\n\n }\n\n\n\n #[test]\n\n /// Let's see when we move the first weapon as second\n\n /// Let's see if using just one weapon works\n\n fn replace_single_hand_weapons() {\n\n let long_iron_sword = get_long_iron_sword();\n\n let long_steel_sword = get_long_steel_sword();\n\n let steel_shield = get_steel_shield();\n\n\n\n let mut stuff = Stuff::default()\n\n .equip_weapon(long_iron_sword)\n\n .equip_weapon(steel_shield);\n\n\n\n stuff = stuff.equip_weapon(long_steel_sword);\n","file_path":"examples/rpg_engine/src/stuff.rs","rank":38,"score":29339.605343629457},{"content":" }\n\n\n\n #[test]\n\n fn use_single_hand_weapon_in_place_of_shield() {\n\n let long_iron_sword = get_long_iron_sword();\n\n let another_long_iron_sword = get_long_iron_sword();\n\n let steel_shield = get_steel_shield();\n\n\n\n let mut stuff = Stuff::default()\n\n .equip_weapon(long_iron_sword)\n\n .equip_weapon(steel_shield);\n\n\n\n // because of mut, need &mut self if we want to update partialy the object;\n\n stuff = stuff.equip_weapon(another_long_iron_sword);\n\n\n\n assert_eq!(\n\n stuff.first_weapon.as_ref().unwrap().name().to_string(),\n\n get_long_iron_sword().name()\n\n );\n\n\n","file_path":"examples/rpg_engine/src/stuff.rs","rank":39,"score":29339.480350668233},{"content":" get_steel_battle_axe().name()\n\n );\n\n\n\n assert!(stuff.second_weapon.is_none());\n\n assert!(stuff.get_weapon_settings() == StuffConfig::TwoHandsWeapon);\n\n }\n\n\n\n #[test]\n\n fn use_shields() {\n\n let long_iron_sword = get_long_iron_sword();\n\n let another_long_iron_sword = get_long_iron_sword();\n\n let steel_shield = get_steel_shield();\n\n let iron_shield = get_iron_shield();\n\n\n\n let mut stuff = Stuff::default()\n\n .equip_weapon(long_iron_sword)\n\n .equip_weapon(steel_shield);\n\n\n\n stuff = stuff.equip_weapon(iron_shield);\n\n\n","file_path":"examples/rpg_engine/src/stuff.rs","rank":40,"score":29339.34544803951},{"content":" StuffConfig::DualWeapons\n\n } else if self.is_shield_only() {\n\n StuffConfig::OnlyShied\n\n } else if self.is_shield_with_single_weapon() {\n\n StuffConfig::ShieldAndWeapon\n\n } else if self.is_single_weapon() {\n\n StuffConfig::OneSingleHandWeapon\n\n } else if self.is_two_hands_weapon() {\n\n StuffConfig::TwoHandsWeapon\n\n } else if self.is_one_single_as_secondary() {\n\n StuffConfig::OneWeaponAsSecondary\n\n } else {\n\n panic!(\"Config not found maybe no weapons have been equipped\")\n\n }\n\n }\n\n\n\n pub fn get_first_weapon_blocking_damage(&self) -> Option<f32> {\n\n self.first_weapon.as_ref()?.can_block_if_possible()\n\n }\n\n\n","file_path":"examples/rpg_engine/src/stuff.rs","rank":41,"score":29338.54462365618},{"content":" }\n\n\n\n fn is_shield_only(&self) -> bool {\n\n if let (None, Some(second_weapon)) = (self.first_weapon(), self.second_weapon()) {\n\n second_weapon.handheld_type() == &HandheldType::OnlyLeft\n\n } else {\n\n false\n\n }\n\n }\n\n\n\n fn is_one_single_as_secondary(&self) -> bool {\n\n if let (None, Some(second_weapon)) = (self.first_weapon(), self.second_weapon()) {\n\n second_weapon.handheld_type() == &HandheldType::SingleHand\n\n } else {\n\n false\n\n }\n\n }\n\n\n\n pub fn get_weapon_settings(&self) -> StuffConfig {\n\n if self.is_double_weapon() {\n","file_path":"examples/rpg_engine/src/stuff.rs","rank":42,"score":29338.225871121067},{"content":" .equip_weapon(get_steel_battle_axe())\n\n .calculate_damages();\n\n assert_eq!(&damages, get_steel_battle_axe().damages())\n\n }\n\n\n\n #[test]\n\n fn test_armor_rating_with_no_armor() {\n\n let rating = Stuff::default().get_armor_rating();\n\n\n\n assert_eq!(rating, 0.0)\n\n }\n\n\n\n #[test]\n\n fn test_armor_rating_with_armor() {\n\n let rating = Stuff::default()\n\n .equip_armor(get_daedric_mail())\n\n .get_armor_rating();\n\n\n\n assert_eq!(&rating, get_daedric_mail().armor_rating());\n\n }\n\n}\n","file_path":"examples/rpg_engine/src/stuff.rs","rank":43,"score":29335.768517259694},{"content":" };\n\n armor_damages\n\n }\n\n\n\n fn is_single_weapon(&self) -> bool {\n\n if let Some(w) = self.first_weapon() {\n\n w.handheld_type() == &HandheldType::SingleHand && self.second_weapon().is_none()\n\n } else {\n\n false\n\n }\n\n }\n\n\n\n fn is_double_weapon(&self) -> bool {\n\n if let (Some(first_weapon), Some(second_weapon)) =\n\n (self.first_weapon(), self.second_weapon())\n\n {\n\n first_weapon.handheld_type() == &HandheldType::SingleHand\n\n && second_weapon.handheld_type() == &HandheldType::SingleHand\n\n } else {\n\n false\n","file_path":"examples/rpg_engine/src/stuff.rs","rank":44,"score":29335.49845773231},{"content":" self.set_first_weapon(weapon);\n\n }\n\n }\n\n self\n\n }\n\n\n\n ///Calculate how much damage the equipped weapons can do.\n\n /// Bash damages from shield are counted\n\n pub fn calculate_damages(&self) -> RawDamages {\n\n let mut damages: RawDamages = 0.0;\n\n\n\n if let Some(first_weapon) = self.first_weapon() {\n\n damages = *first_weapon.damages();\n\n }\n\n if let Some(second_weapon) = self.second_weapon() {\n\n damages += *second_weapon.damages();\n\n }\n\n damages\n\n }\n\n\n","file_path":"examples/rpg_engine/src/stuff.rs","rank":45,"score":29333.588505057745},{"content":" }\n\n }\n\n\n\n fn is_two_hands_weapon(&self) -> bool {\n\n if let (Some(first_weapon), None) = (self.first_weapon(), self.second_weapon()) {\n\n first_weapon.handheld_type() == &HandheldType::TwoHands\n\n } else {\n\n false\n\n }\n\n }\n\n\n\n fn is_shield_with_single_weapon(&self) -> bool {\n\n if let (Some(first_weapon), Some(second_weapon)) =\n\n (self.first_weapon(), self.second_weapon())\n\n {\n\n first_weapon.handheld_type() == &HandheldType::SingleHand\n\n && second_weapon.handheld_type() == &HandheldType::OnlyLeft\n\n } else {\n\n false\n\n }\n","file_path":"examples/rpg_engine/src/stuff.rs","rank":46,"score":29333.570534418042},{"content":" fn get_long_iron_sword() -> RegularWeapon {\n\n RegularWeapon::new(\"Long Iron Sword\", 25.0, HandheldType::SingleHand)\n\n }\n\n fn get_long_steel_sword() -> RegularWeapon {\n\n RegularWeapon::new(\"Long Steel Sword\", 30.0, HandheldType::SingleHand)\n\n }\n\n fn get_steel_battle_axe() -> RegularWeapon {\n\n RegularWeapon::new(\"Steal battle Axe\", 65.0, HandheldType::TwoHands)\n\n }\n\n\n\n fn get_iron_shield() -> Shield {\n\n Shield::new(\"Iron Shield\", 25.0, 5.0)\n\n }\n\n\n\n fn get_steel_shield() -> Shield {\n\n Shield::new(\"Steel Shield\", 35.0, 7.0)\n\n }\n\n\n\n fn get_daedric_mail() -> BodyArmor {\n\n BodyArmor::new(\"Daedric Shield\", 45.0)\n","file_path":"examples/rpg_engine/src/stuff.rs","rank":47,"score":29333.205914994793},{"content":" .equip_weapon(get_steel_shield())\n\n .calculate_damages();\n\n\n\n assert_eq!(\n\n damages,\n\n get_steel_shield().damages() + get_long_steel_sword().damages()\n\n )\n\n }\n\n\n\n #[test]\n\n fn test_damages_with_shield() {\n\n let damages = Stuff::default()\n\n .equip_weapon(get_steel_shield())\n\n .calculate_damages();\n\n assert_eq!(&damages, get_steel_shield().damages())\n\n }\n\n\n\n #[test]\n\n fn test_damages_with_two_hands() {\n\n let damages = Stuff::default()\n","file_path":"examples/rpg_engine/src/stuff.rs","rank":48,"score":29332.87143058789},{"content":" }\n\n HandheldType::OnlyLeft => {\n\n if let Some(current_first_weapon) = self.first_weapon() {\n\n if current_first_weapon.handheld_type() == &HandheldType::TwoHands {\n\n self.unset_first_weapon();\n\n }\n\n }\n\n\n\n // See comment on how we could avoid this issue at compile time.\n\n // if First weapon is set or not, we do not care, left item always goes left.\n\n if let Some(current_second_weapon) = self.second_weapon() {\n\n if current_second_weapon.handheld_type() == &HandheldType::TwoHands {\n\n panic!(\"It seems you have a two hand weapon as second weapon\");\n\n }\n\n }\n\n\n\n self.set_second_weapon(weapon)\n\n }\n\n HandheldType::TwoHands => {\n\n self.unset_second_weapon();\n","file_path":"examples/rpg_engine/src/stuff.rs","rank":49,"score":29331.557400880785},{"content":"}\n\n\n\nimpl Armor for Shield {\n\n fn set_armor_rating(mut self, reduction: f32) -> Self {\n\n self.armor_rating = reduction;\n\n self\n\n }\n\n\n\n fn armor_rating(&self) -> &f32 {\n\n &self.armor_rating\n\n }\n\n}\n\n\n\nimpl Item for Shield {\n\n fn name(&self) -> &str {\n\n &self.name\n\n }\n\n\n\n fn set_name(mut self, name: &str) -> Self {\n\n self.name = name.to_string();\n\n self\n\n }\n\n}\n\n\n\nimpl Weapon for Shield {\n\n fn damages(&self) -> &RawDamages {\n\n &self.bash_damage\n\n }\n\n\n\n fn set_damages(mut self, amount: RawDamages) -> Self {\n\n self.bash_damage = amount;\n\n self\n\n }\n\n\n\n fn can_block_if_possible(&self) -> Option<BlockedDamages> {\n\n //We could have skills here to help us to calculate\n\n Some(self.armor_rating)\n\n }\n\n\n\n fn set_handheld_type(mut self, handheld: HandheldType) -> Self {\n\n self.handheld = handheld;\n\n self\n\n }\n\n\n\n fn handheld_type(&self) -> &HandheldType {\n\n &self.handheld\n\n }\n\n}\n\n\n\n// NB: I could have made multiple trait instead of enum as well.\n\n#[derive(PartialEq)]\n\npub enum HandheldType {\n\n SingleHand,\n\n OnlyLeft,\n\n TwoHands,\n\n}\n\n\n\nimpl Shield {\n\n pub fn new(name: &str, armor: f32, bash_damages: f32) -> Self {\n\n Self::default()\n\n .set_name(name)\n\n .set_armor_rating(armor)\n\n .set_handheld_type(HandheldType::OnlyLeft)\n\n .set_damages(bash_damages)\n\n }\n\n}\n\n```\n\n\n\n\n\nCheck the code for more examples.\n\n\n\nCharacter definition and Stuff definition that qualifies the weapons + armor configuration.\n\n\n\n\n","file_path":"README.md","rank":50,"score":26.136983025310542},{"content":"###### 1 - Armor & Weapons\n\n\n\n```rust\n\n// Every \"object ( weapons or armor is an item with a name )\n\npub trait Item {\n\n fn name(&self) -> &str;\n\n fn set_name(self, name: &str) -> Self\n\n where\n\n Self: Sized;\n\n}\n\n\n\n// We have some Armor\n\npub trait Armor: Item {\n\n fn set_armor_rating(self, armor_rating: ArmorRating) -> Self\n\n where\n\n Self: Sized;\n\n fn armor_rating(&self) -> &ArmorRating;\n\n}\n\n\n\npub trait Weapon: Item {\n\n /// Describe how much damage a weapon can deal.\n\n /// More damage a weapon deals, better quality it is .\n\n fn damages(&self) -> &RawDamages;\n\n fn set_damages(self, amount: RawDamages) -> Self\n\n where\n\n Self: Sized;\n\n // Block attack and make calculation if possible\n\n fn can_block_if_possible(&self) -> Option<BlockedDamages> {\n\n match self.handheld_type() {\n\n HandheldType::SingleHand => Some(self.damages() * 0.4),\n\n HandheldType::TwoHands => Some(self.damages() * 0.7),\n\n // A bit dummy here because we have different implementation later.\n\n HandheldType::OnlyLeft => None,\n\n }\n\n }\n\n fn set_handheld_type(self, handheld: HandheldType) -> Self\n\n where\n\n Self: Sized;\n\n fn handheld_type(&self) -> &HandheldType;\n\n}\n\n\n\n// Can make alias type for better semantic.\n\npub type BlockedDamages = f32;\n\npub type RawDamages = f32;\n\npub type ArmorRating = f32;\n\n```\n\n\n\n\n\n-> Now we can make some struct that implement this trait.\n\n\n\nHere is the shield which is a weapon, but it also has armor properties.\n\n\n\n```rust\n\n// ----- Rest of the Code\n\npub struct Shield {\n\n armor_rating: f32,\n\n name: String,\n\n hold: HandheldType,\n\n bash_damage: RawDamages,\n\n handheld: HandheldType,\n\n}\n\n\n\nimpl Default for Shield {\n\n fn default() -> Self {\n\n Shield {\n\n armor_rating: 0.0,\n\n name: \"\".to_string(),\n\n hold: HandheldType::OnlyLeft,\n\n bash_damage: 0.0,\n\n handheld: HandheldType::OnlyLeft,\n\n }\n\n }\n","file_path":"README.md","rank":51,"score":25.582850312128354},{"content":"###### 2 - Character\n\n```rust\n\npub struct Character {\n\n name: String,\n\n health: f32,\n\n max_health: f32,\n\n stuff: Stuff,\n\n}\n\n\n\n/// Here we store any kind of weapons and armor.\n\n/// Stuff contains specific pointers to dynamic object\n\n/// The compiler will say No to this until you tell him that the object size is know at compile time in the trait definition.\n\n/// That is why we have the word `Sized` for self in previous trait.\n\n#[derive(Default)]\n\npub struct Stuff {\n\n armor: Option<Rc<dyn Armor>>,\n\n first_weapon: Option<Rc<dyn Weapon>>,\n\n second_weapon: Option<Rc<dyn Weapon>>, // Rc is a specific reference pointer\n\n}\n\n\n\nimpl Stuff {\n\n \n\n// Many other methods \n\n/// Will panic if you have equipped a two hand weapon as a second Weapon.\n\n/// \n\npub fn equip_weapon<W: 'static + Weapon>(mut self, weapon: W) -> Self {\n\n match weapon.handheld_type() {\n\n \n\n HandheldType::SingleHand => {\n\n if let Some(current_weapon) = self.first_weapon() {\n\n if current_weapon.handheld_type() == &HandheldType::SingleHand {\n\n self.second_weapon = Some(current_weapon.clone())\n\n }\n\n }\n\n self.set_first_weapon(weapon);\n\n }\n\n \n\n HandheldType::OnlyLeft => {\n\n if let Some(current_first_weapon) = self.first_weapon() {\n\n if current_first_weapon.handheld_type() == &HandheldType::TwoHands {\n\n self.unset_first_weapon();\n\n }\n\n }\n\n\n\n // See comment on how we could avoid this issue at compile time.\n\n // if First weapon is set or not, we do not care, left item always goes left.\n\n if let Some(current_second_weapon) = self.second_weapon() {\n\n if current_second_weapon.handheld_type() == &HandheldType::TwoHands {\n\n panic!(\"It seems you have a two hand weapon as second weapon\");\n\n }\n\n }\n\n\n\n self.set_second_weapon(weapon)\n\n }\n\n HandheldType::TwoHands => {\n\n self.unset_second_weapon();\n\n self.set_first_weapon(weapon);\n\n }\n\n }\n\n self\n\n}\n\n\n\n}\n\n```\n\n\n\n\n\n\n","file_path":"README.md","rank":52,"score":23.07275436044905},{"content":"###### 3 - Fight\n\n\n\n```rust\n\npub struct Fight {\n\n winner_name: Option<String>,\n\n round: u16,\n\n opponents: (Character, Character),\n\n}\n\n\n\n#[allow(unused)]\n\nimpl Fight {\n\n pub fn winner_name(&self) -> &Option<String> {\n\n &self.winner_name\n\n }\n\n pub fn round(&self) -> u16 {\n\n self.round\n\n }\n\n pub fn opponents(&self) -> &(Character, Character) {\n\n &self.opponents\n\n }\n\n pub fn new(first_fighter: Character, second_fighter: Character) -> Self {\n\n Fight {\n\n winner_name: None,\n\n round: 0,\n\n opponents: (first_fighter, second_fighter),\n\n }\n\n }\n\n\n\n pub fn start(&mut self) {\n\n // My ugly code you can check\n\n }\n\n}\n\n\n\n```\n\n\n\n\n\n\n\nHere is how the \"game\" looks like.\n\n\n\n```rust\n\n\n\nmod character;\n\nmod dice;\n\nmod fight;\n\nmod item;\n\nmod stuff;\n\nuse crate::character::Character;\n\nuse crate::fight::Fight;\n\nuse item::*;\n\n\n\nfn main() {\n\n println!(\"Hello and Fight\");\n\n\n\n // Lets put some armors.\n\n let iron_plate = BodyArmor::new(\"Iron Plate\", 32.0);\n\n let steel_plate = BodyArmor::new(\"Steel Plate\", 54.0);\n\n let daedric_armor = BodyArmor::new(\"Daedric Armor\", 25.0);\n\n let daedric_armor_2 = BodyArmor::new(\"Daedric Armor 2\", 25.0);\n\n\n\n // Lets put some shields\n\n let steel_shield = Shield::new(\"steal Shield\", 55.0, 20.0);\n\n let iron_shield = Shield::new(\"Iron Shield\", 25.0, 15.0);\n\n\n\n // Lets put some weapons.\n\n let iron_long_sword = RegularWeapon::new(\"Iron Long Sword\", 35.0, HandheldType::SingleHand);\n\n let steel_battle_axe = RegularWeapon::new(\"Steel battle Axe\", 65.0, HandheldType::TwoHands);\n\n let daedric_battle_axe = RegularWeapon::new(\"Daedric battle Axe\", 85.0, HandheldType::TwoHands);\n\n\n\n let grand_ma_skyrim = Character::new(\"Skyrim Grandma\", 300.00)\n\n .grab_weapon(steel_battle_axe)\n\n .grab_armor(daedric_armor);\n\n\n\n let white_run_guard = Character::new(\"Olaf the dummy guard\", 300.00)\n\n .grab_weapon(steel_shield) // <- we can do it because of generic + trait objects for weapon\n\n .grab_weapon(iron_long_sword)\n","file_path":"README.md","rank":53,"score":22.834707255179488},{"content":"}\n\n\n\nimpl BodyArmor {\n\n pub fn new(name: &str, armor_rating: f32) -> Self {\n\n Self::default()\n\n .set_name(name)\n\n .set_armor_rating(armor_rating)\n\n }\n\n}\n\n\n\nimpl Armor for BodyArmor {\n\n fn set_armor_rating(mut self, reduction: f32) -> Self {\n\n self.armor_rating = reduction;\n\n self\n\n }\n\n fn armor_rating(&self) -> &f32 {\n\n &self.armor_rating\n\n }\n\n}\n\n\n","file_path":"examples/rpg_engine/src/item.rs","rank":54,"score":20.967478703069155},{"content":"use crate::character::{Character, HealthStatus};\n\nuse crate::dice::SkillDice;\n\nuse crate::item::{BlockedDamages, RawDamages};\n\nuse colored::*;\n\n\n\npub mod turn;\n\nuse crate::fight::turn::{Turn, TurnStep};\n\nuse std::collections::HashMap;\n\n\n\npub struct Fight {\n\n winner_name: Option<String>,\n\n round: u32,\n\n attack_counting: HashMap<String, u32>,\n\n opponents: (Character, Character),\n\n winner: Option<Character>,\n\n loser: Option<Character>,\n\n}\n\n\n\n#[allow(unused)]\n\nimpl Fight {\n","file_path":"examples/rpg_engine/src/fight/mod.rs","rank":55,"score":20.237343308900936},{"content":"use crate::character::{Character, HealthStatus};\n\nuse crate::dice::SkillDice;\n\nuse crate::item::{BlockedDamages, RawDamages};\n\nuse colored::*;\n\n\n\npub struct Turn {\n\n pub attacker: Character,\n\n pub defender: Character,\n\n pub number: u32,\n\n}\n\n\n\nimpl Turn {\n\n pub fn new(number: u32, attacker: Character, defender: Character) -> Self {\n\n let turn = Turn {\n\n attacker,\n\n defender,\n\n number,\n\n };\n\n\n\n turn.display_results(TurnStep::Initiative);\n","file_path":"examples/rpg_engine/src/fight/turn.rs","rank":56,"score":19.664503134141345},{"content":"impl Item for BodyArmor {\n\n fn name(&self) -> &str {\n\n &self.name\n\n }\n\n\n\n fn set_name(mut self, name: &str) -> Self {\n\n self.name = name.to_string();\n\n self\n\n }\n\n}\n\n\n","file_path":"examples/rpg_engine/src/item.rs","rank":57,"score":18.637626289364434},{"content":"\n\n fn can_block_if_possible(&self) -> Option<BlockedDamages> {\n\n //We could have skills here to help us to calculate\n\n Some(self.armor_rating)\n\n }\n\n\n\n fn set_handheld_type(mut self, handheld: HandheldType) -> Self {\n\n self.handheld = handheld;\n\n self\n\n }\n\n\n\n fn handheld_type(&self) -> &HandheldType {\n\n &self.handheld\n\n }\n\n}\n\n\n\nimpl Shield {\n\n pub fn new(name: &str, armor: f32, bash_damages: f32) -> Self {\n\n Self::default()\n\n .set_name(name)\n\n .set_armor_rating(armor)\n\n .set_handheld_type(HandheldType::OnlyLeft)\n\n .set_damages(bash_damages)\n\n }\n\n}\n","file_path":"examples/rpg_engine/src/item.rs","rank":58,"score":18.56351402560583},{"content":"}\n\n\n\n// NB: I could have made multiple trait instead of enum as well.\n\n#[derive(PartialEq)]\n\npub enum HandheldType {\n\n SingleHand,\n\n OnlyLeft,\n\n TwoHands,\n\n}\n\n\n\n/// NB : We could define many different of weapon ( like enchanted weapons for example and or melee weapons )\n\npub struct RegularWeapon {\n\n name: String,\n\n handheld: HandheldType,\n\n damages: RawDamages,\n\n}\n\n\n\nimpl RegularWeapon {\n\n pub fn new(name: &str, damages: f32, handheld: HandheldType) -> Self {\n\n RegularWeapon::default()\n","file_path":"examples/rpg_engine/src/item.rs","rank":59,"score":17.814510171752023},{"content":" pub fn roll_initiative_dice(&self) -> (String, String) {\n\n if self.opponents.1.roll_dice(SkillDice::Initiative)\n\n >= self.opponents.0.roll_dice(SkillDice::Initiative)\n\n {\n\n (\n\n self.opponents.1.name().to_string(),\n\n self.opponents.0.name().to_string(),\n\n )\n\n } else {\n\n (\n\n self.opponents.0.name().to_string(),\n\n self.opponents.1.name().to_string(),\n\n )\n\n }\n\n }\n\n\n\n pub fn resolve(mut self) -> Character {\n\n while self.winner_name.is_none() {\n\n self.round += 1;\n\n\n","file_path":"examples/rpg_engine/src/fight/mod.rs","rank":60,"score":17.386338580661487},{"content":"impl Item for Shield {\n\n fn name(&self) -> &str {\n\n &self.name\n\n }\n\n\n\n fn set_name(mut self, name: &str) -> Self {\n\n self.name = name.to_string();\n\n self\n\n }\n\n}\n\n\n\nimpl Weapon for Shield {\n\n fn damages(&self) -> &RawDamages {\n\n &self.bash_damage\n\n }\n\n\n\n fn set_damages(mut self, amount: RawDamages) -> Self {\n\n self.bash_damage = amount;\n\n self\n\n }\n","file_path":"examples/rpg_engine/src/item.rs","rank":61,"score":17.244140478931374},{"content":" pub fn winner_name(&self) -> &Option<String> {\n\n &self.winner_name\n\n }\n\n pub fn round(&self) -> u32 {\n\n self.round\n\n }\n\n pub fn opponents(&self) -> &(Character, Character) {\n\n &self.opponents\n\n }\n\n\n\n pub fn new(first_fighter: Character, second_fighter: Character) -> Self {\n\n let mut attack_counting = HashMap::new();\n\n attack_counting.insert(first_fighter.name().to_string(), 0);\n\n attack_counting.insert(second_fighter.name().to_string(), 0);\n\n Fight {\n\n winner_name: None,\n\n round: 0,\n\n attack_counting,\n\n opponents: (first_fighter, second_fighter),\n\n winner: None,\n","file_path":"examples/rpg_engine/src/fight/mod.rs","rank":62,"score":16.89652917497325},{"content":" .set_name(name)\n\n .set_damages(damages)\n\n .set_handheld_type(handheld)\n\n }\n\n}\n\n\n\nimpl Default for RegularWeapon {\n\n fn default() -> Self {\n\n RegularWeapon {\n\n name: \"Hands\".to_string(),\n\n handheld: HandheldType::SingleHand,\n\n damages: 1.0,\n\n }\n\n }\n\n}\n\n\n\nimpl Item for RegularWeapon {\n\n fn name(&self) -> &str {\n\n &self.name\n\n }\n","file_path":"examples/rpg_engine/src/item.rs","rank":63,"score":16.53880573180039},{"content":"\n\n fn set_name(mut self, name: &str) -> Self {\n\n self.name = name.to_string();\n\n self\n\n }\n\n}\n\n\n\nimpl Weapon for RegularWeapon {\n\n fn damages(&self) -> &RawDamages {\n\n &self.damages\n\n }\n\n\n\n fn set_damages(mut self, amount: RawDamages) -> Self {\n\n self.damages = amount;\n\n self\n\n }\n\n\n\n fn set_handheld_type(mut self, handheld: HandheldType) -> Self {\n\n self.handheld = handheld;\n\n self\n","file_path":"examples/rpg_engine/src/item.rs","rank":64,"score":16.120544769193994},{"content":" armor_rating: 0.0,\n\n name: \"\".to_string(),\n\n hold: HandheldType::OnlyLeft,\n\n bash_damage: 0.0,\n\n handheld: HandheldType::OnlyLeft,\n\n }\n\n }\n\n}\n\n\n\nimpl Armor for Shield {\n\n fn set_armor_rating(mut self, reduction: f32) -> Self {\n\n self.armor_rating = reduction;\n\n self\n\n }\n\n\n\n fn armor_rating(&self) -> &f32 {\n\n &self.armor_rating\n\n }\n\n}\n\n\n","file_path":"examples/rpg_engine/src/item.rs","rank":65,"score":15.917870682409905},{"content":" let first = self.opponents.0.roll_dice(SkillDice::Initiative);\n\n let second = self.opponents.1.roll_dice(SkillDice::Initiative);\n\n\n\n if first >= second {\n\n (self.opponents.1.clone(), self.opponents.0.clone())\n\n } else {\n\n (self.opponents.0.clone(), self.opponents.1.clone())\n\n }\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n\n\n use super::*;\n\n use crate::prelude::*;\n\n\n\n fn get_test_player(name: &str) -> Character {\n\n Character::new(name, 1000.0).grab_weapon(RegularWeapon::default())\n\n }\n","file_path":"examples/rpg_engine/src/fight/mod.rs","rank":66,"score":15.298252171638932},{"content":" }\n\n\n\n fn handheld_type(&self) -> &HandheldType {\n\n &self.handheld\n\n }\n\n}\n\n\n\n#[allow(unused)]\n\n/// NB : Shield could be a trait instead of a struct as well.\n\npub struct Shield {\n\n armor_rating: f32,\n\n name: String,\n\n hold: HandheldType,\n\n bash_damage: RawDamages,\n\n handheld: HandheldType,\n\n}\n\n\n\nimpl Default for Shield {\n\n fn default() -> Self {\n\n Shield {\n","file_path":"examples/rpg_engine/src/item.rs","rank":67,"score":15.012652669035273},{"content":"\n\nimpl SkillDice {\n\n pub fn dices_roll_result(&self, actor: &str) -> u8 {\n\n let res = match self {\n\n SkillDice::Initiative => roll_dice(actor, \"2d6\", \"initiative\"),\n\n SkillDice::Blocking => roll_dice(actor, \"1d6\", \"block\"),\n\n SkillDice::Attack => roll_dice(actor, \"1d10\", \"attack\"),\n\n SkillDice::Dodge => roll_dice(actor, \"1d10\", \"dodge\"),\n\n };\n\n\n\n res as u8\n\n }\n\n}\n","file_path":"examples/rpg_engine/src/dice.rs","rank":68,"score":14.318686665094566},{"content":" loser: None,\n\n }\n\n }\n\n\n\n fn update_attacks_counter(&mut self, attack_name: &str) {\n\n if let Some(number_attacks) = self.attack_counting.get_mut(attack_name) {\n\n *number_attacks += 1;\n\n }\n\n }\n\n\n\n /// SO ugly code, please use `resolve()` instead.\n\n #[deprecated]\n\n pub fn start(&mut self) {\n\n let mut attack_counting: HashMap<String, u32> = HashMap::new();\n\n\n\n attack_counting.insert(self.opponents.1.name().to_string(), 0);\n\n attack_counting.insert(self.opponents.0.name().to_string(), 0);\n\n\n\n while self.winner_name.is_none() {\n\n self.round += 1;\n","file_path":"examples/rpg_engine/src/fight/mod.rs","rank":69,"score":14.119533783997397},{"content":"#### Examples\n\n\n\n\n\n**a.** Mutability & Immutability\n\n\n\n```rust\n\n\n\nstruct Company {\n\n pub name: String,\n\n /// In Billion\n\n pub value: u32,\n\n}\n\n\n\nfn main() {\n\n let mut facebook = Company {\n\n name: \"FaceMash\".to_string(),\n\n value: 0,\n\n };\n\n \n\n // <- if we do not use mut here, compiler will say NO\n\n facebook.name = \"Facebook\".to_string();\n\n facebook.value = 900;\n\n\n\n println!(\"{} new name is cool \", facebook.name);\n\n}\n\n```\n\n\n\n**b.** Borrowing data to read it.\n\n\n\n```rust\n\n\n\n\n\nfn display_data(company: &Company) {\n\n println!(\"Name : {} \", company.name);\n\n println!(\"Market Cap : {} \", company.name);\n\n println!(\"Rating {}\", rate_business(&company.value))\n\n}\n\n\n\nfn main() {\n\n // ---- Rest of the code\n\n // 2 - Reference with `&` to read data\n\n // <- if we do not use & here, compiler will say NO because function asks for it.\n\n display_data(&facebook);\n\n}\n\n\n\n```\n\n**c.** Owning an object to move it ( to consume it ) to do stuff with it. \n\n\n\n```rust\n\n\n\n\n\nfn rebuild_business(_: Company) -> Company {\n\n Company {\n\n name: \"Facebook 2.0\".to_string(),\n\n value: 850,\n\n }\n\n}\n\n\n\n\n\nfn main() {\n\n \n\n // ---- Rest of the code\n\n println!(\"{} is super old, we need rebranding \", facebook.name);\n\n\n\n\n\n facebook.name = \"Meta\".to_string();\n\n println!(\"{} is an awesome name\", facebook.name);\n\n\n\n // <-- we move `facebook` inside the scope of the `rebuild_business` function so we cannot access it anymore .\n\n let mut new_facebook = rebuild_business(facebook);\n\n\n\n // println!(\"{} is still alive ?\", facebook.name); <-- get moved error value\n\n display_data(&new_facebook);\n\n \n\n}\n\n\n\n\n\n```\n\n\n\n\n\n**d.** Compiler check for everything for you\n\n\n\nLittle surprise with mutable references 😁\n\n\n\n```rust\n\n\n\nfn update_name(company: &mut Company, new_name: &str) {\n\n company.name = new_name.to_string();\n\n}\n\n\n\n\n\nfn main (){\n\n\n\n // --- Rest of the code ---\n","file_path":"README.md","rank":70,"score":14.046455328103516},{"content":"//! Using https://doc.rust-lang.org/book/ch17-02-trait-objects.html\n\n\n\npub type BlockedDamages = f32;\n\npub type RawDamages = f32;\n\npub type ArmorRating = f32;\n\n\n\n//\n","file_path":"examples/rpg_engine/src/item.rs","rank":71,"score":12.534888898357934},{"content":"mod character;\n\nmod dice;\n\nmod fight;\n\nmod item;\n\nmod stuff;\n\n\n\npub mod prelude {\n\n pub use crate::{character::*, dice::*, fight::*, item::*, stuff::*};\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n #[test]\n\n fn it_works() {\n\n let result = 2 + 2;\n\n assert_eq!(result, 4);\n\n }\n\n}\n","file_path":"examples/rpg_engine/src/lib.rs","rank":72,"score":11.379415293550467},{"content":" second_fight_winner.name().bold(),\n\n );\n\n\n\n println!(\n\n \"{} has {} HP\",\n\n first_fight_winner.name().bold(),\n\n first_fight_winner.health().to_string().green().bold(),\n\n );\n\n println!(\n\n \"{} has {} HP\",\n\n second_fight_winner.name().bold(),\n\n second_fight_winner.health().to_string().green().bold(),\n\n );\n\n println!();\n\n\n\n // Use the stuff bellow to make it work sequential\n\n //first_fight.join().unwrap();\n\n //second_fight.join().unwrap();\n\n let final_winner = Fight::new(first_fight_winner, second_fight_winner).resolve();\n\n\n\n println!(\n\n \"The best fighter is : {}\",\n\n final_winner.name().yellow().bold()\n\n );\n\n\n\n #[cfg(feature = \"song\")]\n\n add_song();\n\n}\n","file_path":"examples/rpg_engine/examples/multiple_fights/src/main.rs","rank":73,"score":10.538656947484998},{"content":"#Todo\n\n\n\n- [ ] Clean up deprecated methods\n\n- [ ] Add proper documentation\n\n- [ ] Refactor with unit testing\n\n- [ ] Display weapons name during blocking and attacks ( need to refactor stuff and character)\n\n\n","file_path":"examples/rpg_engine/README.md","rank":74,"score":10.407641373020102},{"content":" self.display_results(TurnStep::ResultBlocking {\n\n succeed: false,\n\n blocked_damage: damage,\n\n });\n\n None\n\n }\n\n }\n\n\n\n pub fn resolve_damages(&mut self, hit_damage: RawDamages) {\n\n let result = self.defender.gets_hit(hit_damage);\n\n self.display_results(TurnStep::DamagesTaken { damages: result })\n\n }\n\n\n\n pub fn resolve_winner_and_loser(&self) -> Option<(Character, Character)> {\n\n if self.defender.get_health_status() == HealthStatus::Dead {\n\n self.display_results(TurnStep::EndFight);\n\n Some((self.attacker.clone(), self.defender.clone()))\n\n } else {\n\n None\n\n }\n","file_path":"examples/rpg_engine/src/fight/turn.rs","rank":75,"score":10.033820597516613},{"content":"use colored::*;\n\nuse rpg_engine::prelude::*;\n\nuse std::sync::mpsc;\n\nuse std::thread;\n\nuse std::time::Duration;\n\n\n\n#[cfg(feature = \"song\")]\n","file_path":"examples/rpg_engine/examples/multiple_fights/src/main.rs","rank":76,"score":9.431958741895507},{"content":" let white_run_guard = Character::new(\"Olaf the dummy guard\", 300.00)\n\n .grab_weapon(steel_shield) // <- we can do it because of generic + trait objects for weapon\n\n .grab_weapon(iron_long_sword)\n\n .grab_armor(daedric_armor_2);\n\n\n\n let lydia = Character::new(\"Lydia\", 300.0)\n\n .grab_weapon(daedric_battle_axe)\n\n .grab_armor(iron_plate);\n\n\n\n let braith = Character::new(\"Braith\", 100.0).grab_weapon(RegularWeapon::default());\n\n\n\n let dovahkiin = Character::new(\"Dovahkiin\", 1500.0)\n\n .grab_weapon(steel_long_sword)\n\n .grab_weapon(iron_shield);\n\n\n\n let (tx_1, rx_1) = mpsc::channel();\n\n\n\n // This is OS native Thread\n\n let _ = thread::spawn(move || {\n\n let winner = Fight::new(white_run_guard, grand_ma_skyrim).resolve();\n","file_path":"examples/rpg_engine/examples/multiple_fights/src/main.rs","rank":77,"score":9.218139295485066},{"content":" }\n\n\n\n /// Should use string template make unit test.\n\n /// Displays specific message for a particular step during the turn.\n\n fn display_results(&self, turn_step: TurnStep) {\n\n let attacker_name = &self.attacker.name();\n\n let defender_name = &self.defender.name();\n\n match turn_step {\n\n TurnStep::Initiative => {\n\n println!(\n\n \"{} will attack and {} will defend\",\n\n attacker_name.bold(),\n\n defender_name.bold()\n\n );\n\n }\n\n TurnStep::Attack => {\n\n println!(\n\n \"{} {} {} {} attack\",\n\n defender_name.bold(),\n\n \"failed\".red(),\n","file_path":"examples/rpg_engine/src/fight/turn.rs","rank":78,"score":9.016343295075039},{"content":" turn\n\n }\n\n\n\n pub fn resolve_attack_defense(&self) -> Option<(u8, RawDamages)> {\n\n let attack = self.attacker.roll_dice(SkillDice::Attack);\n\n let dodge = self.defender.roll_dice(SkillDice::Dodge);\n\n\n\n if dodge > attack {\n\n self.display_results(TurnStep::Dodge);\n\n None\n\n } else {\n\n self.display_results(TurnStep::Attack);\n\n Some((attack, self.attacker.deal_damages()))\n\n }\n\n }\n\n\n\n /// Roll dice and display message for success or fail .\n\n /// And return update damages.\n\n pub fn resolve_blocking(\n\n &mut self,\n","file_path":"examples/rpg_engine/src/fight/turn.rs","rank":79,"score":8.94926610779768},{"content":" if def.is_some() {\n\n println!(\"{} tries to block {}\", defender.name(), attacker.name());\n\n }\n\n defender.get_attacked_by(damage, attack, def);\n\n }\n\n\n\n if defender.get_health_status() == HealthStatus::Dead {\n\n self.winner_name = Some(attacker.name().to_string());\n\n\n\n println!(\"{} is dead :((((((((\", defender.name());\n\n println!(\n\n \"{} won the fight and has {} hp left <3 !!!!!!!!!!!!!!!\",\n\n attacker.name(),\n\n attacker.health()\n\n );\n\n\n\n println!(\" -------------- Game statistics -------------- \");\n\n\n\n println!(\"Fight finished after {} rounds\", self.round);\n\n\n","file_path":"examples/rpg_engine/src/fight/mod.rs","rank":80,"score":8.7353747527976},{"content":" .grab_armor(daedric_armor);\n\n\n\n let white_run_guard = Character::new(\"Olaf the dummy guard\", 300.00)\n\n .grab_weapon(steel_shield) // <- we can do it because of generic + trait objects for weapon\n\n .grab_weapon(iron_long_sword)\n\n .grab_armor(daedric_armor_2);\n\n\n\n Fight::new(white_run_guard, grand_ma_skyrim).start();\n\n}\n\n\n\n//https://en.uesp.net/wiki/Skyrim:Block#Defensive_Blocking\n","file_path":"examples/rpg_engine/examples/simple_fight/src/main.rs","rank":81,"score":8.40862572041224},{"content":" println!(\n\n \" {} has attacked {} times \",\n\n loser_name.bold(),\n\n loser_nb_attacks.to_string().underline()\n\n );\n\n println!(\n\n \" {} has attacked {} times \",\n\n winner_name.bold(),\n\n winner_nb_attacks.to_string().underline()\n\n );\n\n println!()\n\n }\n\n _ => {\n\n panic!(\"Cannot display statistics because winner and loser are not resolved\")\n\n }\n\n }\n\n }\n\n\n\n /// Consume the tuple to return a new one with attacker and then defender.\n\n fn resolve_initiative(&self) -> (Character, Character) {\n","file_path":"examples/rpg_engine/src/fight/mod.rs","rank":82,"score":8.399227831661705},{"content":" \"{} {} the fight and has {} hp left <3 !!!!!!!!!!!!!!!\",\n\n &self.attacker.name().bold(),\n\n \"won\".yellow().bold(),\n\n &self.attacker.health().to_string().green().bold()\n\n );\n\n }\n\n }\n\n }\n\n}\n\n\n\npub enum TurnStep {\n\n Initiative,\n\n Attack,\n\n Dodge,\n\n TryBlocking,\n\n ResultBlocking {\n\n blocked_damage: BlockedDamages,\n\n succeed: bool,\n\n },\n\n\n\n DamagesTaken {\n\n damages: BlockedDamages,\n\n },\n\n EndFight,\n\n}\n","file_path":"examples/rpg_engine/src/fight/turn.rs","rank":83,"score":8.267331515020086},{"content":"use caith::Roller;\n\nuse colored::*;\n\n\n","file_path":"examples/rpg_engine/src/dice.rs","rank":84,"score":7.275035964842725},{"content":" turn.resolve_damages(hit_damage);\n\n\n\n if let Some((winner, loser)) = turn.resolve_winner_and_loser() {\n\n self.winner_name = Some(winner.name().to_string());\n\n self.winner = Some(winner);\n\n self.loser = Some(loser);\n\n self.show_statistics()\n\n }\n\n }\n\n // We cloned them in the first place so we need to have then.\n\n self.update_opponents(turn.attacker, turn.defender);\n\n }\n\n\n\n self.winner.unwrap()\n\n }\n\n\n\n /// Update the stored value with new ones.\n\n fn update_opponents(&mut self, fighter_1: Character, fighter_2: Character) {\n\n self.opponents = (fighter_1, fighter_2);\n\n }\n","file_path":"examples/rpg_engine/src/fight/mod.rs","rank":85,"score":7.017003959104473},{"content":"#### Resume\n\n\n\nPros :\n\n- Rules to write and read are easy \n\n- No extra syntax for these rules ( like Malloc or delete)\n\n- Everything is actually automated ( not need to delete object or do memory stuff on basic levels)\n\n- The Compiler checks everything for you\n\n- No need to think about technical detail so you can focus on business logic.\n\n\n\nCons : \n\n- Redefine the way you write code because you need to turn upside down your brain\n\n- You will hate the compiler\n\n- Get addicted to the safety\n\n\n\n\n\nIs memory safety solved?\n\n\n\n[There are bugs](https://github.com/Artisan-Lab/Rust-memory-safety-bugs)\n\nYou can do manual [memory management](https://stackoverflow.com/questions/48485454/rust-manual-memory-management) if you want in Unsafe mode\n\n\n\n\n\n\n\n---\n\n\n\n### Traits\n\n \n\n[Inheritance vs trait compositions](https://en.wikipedia.org/wiki/Composition_over_inheritance#)\n\n\n\n- Useful to have for objects that share specific behaviors\n\n\n\n- Flexible and allow having many types handled together\n\n\n\n- Can be understood as `interfaces` in some other languages\n\n\n\n##### Examples\n\n\n\nGot the idea to simulate the weapons system from Skyrim and how damages are dealt based on the stuff\n\n\n\nhttps://en.uesp.net/wiki/Skyrim:Block#Defensive_Blocking\n\n\n\n####### 1 - How to define weapons and armor\n\n\n\n####### 2 - How to define a character\n\n\n\n####### 3 - How to define a *fight*\n\n\n\n\n\nAs you will see , I took some freedom from their documentation for the calculation.\n\n\n\nNB :\n\n- Mainly kept the rules for blocking for dual_wielding, two hands weapons, shield + single weapon and one single weapon only.\n\n\n\n- Coding with the flow, no much thinking because I had tons of fun\n\n\n","file_path":"README.md","rank":86,"score":6.502073286311116},{"content":" fn get_long_iron_sword() -> RegularWeapon {\n\n RegularWeapon::new(\"Long Iron Sword\", 25.0, HandheldType::SingleHand)\n\n }\n\n fn get_long_steel_sword() -> RegularWeapon {\n\n RegularWeapon::new(\"Long Steel Sword\", 30.0, HandheldType::SingleHand)\n\n }\n\n fn get_steel_battle_axe() -> RegularWeapon {\n\n RegularWeapon::new(\"Steal battle Axe\", 65.0, HandheldType::TwoHands)\n\n }\n\n\n\n fn get_iron_shield() -> Shield {\n\n Shield::new(\"Iron Shield\", 25.0, 5.0)\n\n }\n\n\n\n fn get_steel_shield() -> Shield {\n\n Shield::new(\"Steel Shield\", 35.0, 7.0)\n\n }\n\n\n\n fn get_daedric_mail() -> BodyArmor {\n\n BodyArmor::new(\"Daedric Shield\", 45.0)\n\n }\n\n\n\n #[test]\n\n fn start() {\n\n let winner = Fight::new(get_test_player(\"player 1\"), get_test_player(\"player 2\")).resolve();\n\n assert_eq!(winner.name(), \"player 1\");\n\n }\n\n}\n","file_path":"examples/rpg_engine/src/fight/mod.rs","rank":87,"score":6.428571246907883},{"content":" let update = &mut new_facebook; // Can only make a single mutable reference.\n\n\n\n // display_data(&new_facebook); Cannot read while writing 😁\n\n // let update2 = &mut new_facebook; throw error here because we can only have mutable reference at the same time.\n\n update.name = \"Facebook 3.0\".to_string();\n\n println!(\"{} is an awesome name.\", new_facebook.name);\n\n\n\n let update2 = &mut new_facebook;\n\n update2.name = \"Facebook 4.0\".to_string();\n\n\n\n // <- Update name without taking ownership with function\n\n update_name(&mut new_facebook, \"Facebook 3000\");\n\n println!(\"{} is an awesome name.\", new_facebook.name);\n\n}\n\n\n\n```\n\n\n","file_path":"README.md","rank":88,"score":6.195187220963151},{"content":" println!(\"{} will defend \", defender_name);\n\n\n\n // Attack & Dodge dice roll.\n\n let attack = attacker.roll_dice(SkillDice::Attack);\n\n\n\n let dodge = defender.roll_dice(SkillDice::Dodge);\n\n\n\n if dodge > attack {\n\n println!(\n\n \"{} dodged {}'s attack successfully\",\n\n defender.name(),\n\n attacker.name()\n\n );\n\n } else {\n\n let damage = attacker.deal_damages();\n\n // Block dice roll.\n\n let def = defender\n\n .can_block()\n\n .map(|_| defender.roll_dice(SkillDice::Blocking));\n\n\n","file_path":"examples/rpg_engine/src/fight/mod.rs","rank":89,"score":6.115103233525856},{"content":"\n\n TurnStep::ResultBlocking {\n\n blocked_damage,\n\n succeed,\n\n } => {\n\n if succeed {\n\n println!(\n\n \"{} {} {} {} damages from {}\",\n\n defender_name.bold(),\n\n \"succeed\".green(),\n\n \"to block\".underline(),\n\n blocked_damage.to_string().red(),\n\n attacker_name.bold()\n\n );\n\n } else {\n\n println!(\n\n \"{} {} to block {} from {}\",\n\n defender_name.bold(),\n\n \"failed\".red(),\n\n blocked_damage.to_string().red(),\n","file_path":"examples/rpg_engine/src/fight/turn.rs","rank":90,"score":6.074534202815084},{"content":"##### Resume\n\n\n\nPros: \n\n- We can make many object with different types and handle them as long as they have the behavior we need.\n\n- Can make default behavior\n\n- We can store objects without specific type as long as their size is safe = we know their size at compile time\n\n- Everything is always checked by our lovely compiler\n\n- Can back up stuff with unit-test\n\n\n\nCons:\n\n- Require some training to understand Generics and trait object \n\n- Need to use specific new pointer like Rc/Arc for advanced stuff\n\n- The compiler will be painful with you\n\n\n\n\n\n\n\n---\n\n\n\n### Conditional compilation\n\n\n\nWell, you can decide what to compile or not 😁\n\n\n\n\n\n##### Example\n\n\n\n\n\n- Running tests\n\n\n\n```rust\n\n#[cfg(test)]\n\nmod test {\n\n \n\n // --- unit test \n\n}\n\n\n\n```\n\n\n\n`cargo test`\n\n\n\nThe command will compile unit test and run them.\n\n\n\n\n\n- Having specific features\n\n\n\nIn cargo.toml\n\n\n\n```toml\n\n[features]\n\nsong=[]\n\n```\n\n\n\nNow in your code\n\n\n\n```rust\n\n#[cfg(feature = \"song\")]\n\nfn add_song() {\n\n println!(\"Here is the song of the Dovakin\")\n\n}\n\n```\n\n\n\n\n\nWe add the function in main as well 😁\n\n\n\n```rust\n\nfn main() {\n\n // ------ Rest of the code\n\n #[cfg(feature = \"song\")]\n\n add_song();\n\n}\n\n```\n\n\n\n\n\nHow to run :\n\n\n\n\n\n`cargo run --features song`\n\n\n\n##### Resume\n\n\n\nPros:\n\n- You decide what you want to compile\n\n- Super useful to reduce the size of your package and use only what you need\n\n\n\nCons:\n\n- Use strings, so little helping from the IDE ( just a bit still 😁)\n\n\n\nGood example to use for this is [web_sys](https://docs.rs/web-sys/0.3.56/web_sys/) library as bridge between Rust and the Web\n\n\n\n\n\n\n\n---\n\n\n\n### Multithreading\n\n\n\n\n\n[Multiple concurrency models](https://rust-lang.github.io/async-book/01_getting_started/02_why_async.html)\n\n\n\n\n","file_path":"README.md","rank":91,"score":5.865647245274372},{"content":" println!(\"{} is an awesome name.\", facebook.name);\n\n\n\n // <-- we move `facebook` inside the scope of the `rebuild_business` function so we cannot access it anymore .\n\n let mut new_facebook = rebuild_business(facebook);\n\n\n\n // println!(\"{} is still alive ?\", facebook.name); <-- get moved error value\n\n display_data(&new_facebook);\n\n\n\n let update = &mut new_facebook; // Can only make a single mutable reference.\n\n // let update2 = &mut new_facebook; throw error here\n\n // display_data(&new_facebook); Cannot read while writing :D\n\n update.name = \"Facebook 3.0\".to_string();\n\n println!(\"{} is an awesome name.\", new_facebook.name);\n\n\n\n let update2 = &mut new_facebook;\n\n update2.name = \"Facebook 4.0\".to_string();\n\n\n\n update_name(&mut new_facebook, \"Facebook 3000\");\n\n\n\n println!(\"{} is an awesome name.\", new_facebook.name);\n\n}\n","file_path":"examples/ownership/src/main.rs","rank":92,"score":5.685136821234227},{"content":" attacker_name.bold(),\n\n );\n\n }\n\n }\n\n TurnStep::DamagesTaken { damages } => {\n\n println!(\n\n \"{} deals {} {} to {}\",\n\n attacker_name.bold(),\n\n damages.to_string().red(),\n\n \"damages\".red(),\n\n defender_name.bold()\n\n );\n\n }\n\n TurnStep::EndFight => {\n\n println!(\n\n \"{} is {} :((((((((\",\n\n &self.defender.name().bold(),\n\n \"dead\".red().bold()\n\n );\n\n println!(\n","file_path":"examples/rpg_engine/src/fight/turn.rs","rank":93,"score":5.625404358145826},{"content":"\n\n /// SHow simple statistics.\n\n fn show_statistics(&self) {\n\n println!(\" -------------- Game statistics -------------- \");\n\n\n\n println!(\"Fight finished after {} rounds\", self.round);\n\n\n\n match (&self.winner, &self.loser) {\n\n (Some(winner), Some(loser)) => {\n\n let loser_name = loser.name();\n\n let winner_name = winner.name();\n\n\n\n let loser_nb_attacks = self\n\n .attack_counting\n\n .get(loser_name)\n\n .expect(\"Should have gotten winner attack number\");\n\n let winner_nb_attacks = self\n\n .attack_counting\n\n .get(winner_name)\n\n .expect(\"Should have gotten loser attack number\");\n","file_path":"examples/rpg_engine/src/fight/mod.rs","rank":94,"score":5.382219718086269},{"content":"char const* info_compiler = \"INFO\" \":\" \"compiler[\" COMPILER_ID \"]\";\n","file_path":"examples/cpp_allocation/cmake-build-debug/CMakeFiles/3.17.5/CompilerIdC/CMakeCCompilerId.c","rank":95,"score":4.936975027519667},{"content":"char const* info_platform = \"INFO\" \":\" \"platform[\" PLATFORM_ID \"]\";\n","file_path":"examples/cpp_allocation/cmake-build-debug/CMakeFiles/3.17.5/CompilerIdC/CMakeCCompilerId.c","rank":96,"score":4.936975027519667},{"content":" tx_1.send(winner)\n\n .expect(\"Should have passed the resolved winner\");\n\n });\n\n\n\n let (tx_2, rx_2) = mpsc::channel();\n\n\n\n // This is OS native Thread\n\n let _ = thread::spawn(move || {\n\n let winner = Fight::new(lydia, dovahkiin).resolve();\n\n tx_2.send(winner)\n\n .expect(\"Should have passed the resolved winner\");\n\n });\n\n\n\n let second_fight_winner = rx_2.recv().expect(\"Should have receive the winner\");\n\n let first_fight_winner = rx_1.recv().expect(\"Should have receive the winner\");\n\n\n\n println!(\"----------------- Final Fight ----------------- \");\n\n println!(\n\n \"{} and {} will fight until only one survive\",\n\n first_fight_winner.name().bold(),\n","file_path":"examples/rpg_engine/examples/multiple_fights/src/main.rs","rank":97,"score":4.177714987534773},{"content":"##### Example\n\n\n\nLet's make 2 fights simultaneously and take the winner for the last one.\n\n\n\n\n\n```rust\n\n\n\n // ----- Rest of the Code\n\n\n\n let (tx_1, rx_1) = mpsc::channel();\n\n // This is OS native Thread\n\n let _ = thread::spawn(move || {\n\n let winner = Fight::new(white_run_guard, grand_ma_skyrim).resolve();\n\n tx_1.send(winner)\n\n .expect(\"Should have passed the resolved winner\");\n\n });\n\n\n\n let (tx_2, rx_2) = mpsc::channel();\n\n\n\n // This is OS native Thread\n\n let _ = thread::spawn(move || {\n\n let winner = Fight::new(lydia, dovakin).resolve();\n\n tx_2.send(winner)\n\n .expect(\"Should have passed the resolved winner\");\n\n });\n\n\n\n let second_fight_winner = rx_2.recv().expect(\"Should have receive the winner\");\n\n let first_fight_winner = rx_1.recv().expect(\"Should have receive the winner\");\n\n\n\n let final_winner = Fight::new(first_fight_winner, second_fight_winner).resolve();\n\n\n\n println!(\"The best fighter is : {}\", final_winner.name());\n\n\n\n```\n\n\n\n\n\nWorks like a charm. \n\nOf Course if my business logic sucks, then it won't work as expected, but that is not the compiler responsibility.\n\nBut unit-test are there for it 😁\n\n\n\n##### Resume\n\n\n\nPros:\n\n- Took me 5 minutes to make it work\n\n- No runtime bugs, if you do something wrong, the compiler will tell you 😁\n\n- You can make it simple and easy to understand\n\n\n\nCons:\n\n- The compiler complained about the Type for Stuff because I needed to add trait bounds to ensure the code was safe ( but the compiler told me again soo 😀)\n\n- Need to think the specific pointer you use such as Rc vs Arc ( but again the compiler helps with that )\n\n\n\n\n\n\n\n---\n\n\n","file_path":"README.md","rank":98,"score":4.00094022876374},{"content":" \"to dodge\".underline(),\n\n attacker_name.bold(),\n\n );\n\n }\n\n\n\n TurnStep::Dodge => {\n\n println!(\n\n \"{} dodged {} attack {}\",\n\n defender_name.bold(),\n\n attacker_name.bold(),\n\n \"successfully\".green()\n\n );\n\n }\n\n TurnStep::TryBlocking => {\n\n println!(\n\n \"{} tries to block {}\",\n\n defender_name.bold(),\n\n attacker_name.bold()\n\n );\n\n }\n","file_path":"examples/rpg_engine/src/fight/turn.rs","rank":99,"score":3.664106738120457}],"string":"[\n {\n \"content\": \"pub fn roll_dice(actor: &str, dices: &str, action: &str) -> i64 {\\n\\n let result = Roller::new(&format!(\\\"{} : {} \\\", dices, action))\\n\\n .unwrap()\\n\\n .roll()\\n\\n .unwrap();\\n\\n println!(\\n\\n \\\"{} rolls {} for {} \\\",\\n\\n actor.bold(),\\n\\n dices.underline(),\\n\\n action.magenta()\\n\\n );\\n\\n result.as_single().unwrap().get_total()\\n\\n}\\n\\n\\n\\npub enum SkillDice {\\n\\n Initiative,\\n\\n Blocking,\\n\\n Attack,\\n\\n Dodge,\\n\\n}\\n\",\n \"file_path\": \"examples/rpg_engine/src/dice.rs\",\n \"rank\": 0,\n \"score\": 112005.73445544412\n },\n {\n \"content\": \"fn update_name(company: &mut Company, new_name: &str) {\\n\\n company.name = new_name.to_string();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/ownership/src/main.rs\",\n \"rank\": 1,\n \"score\": 100676.02401084735\n },\n {\n \"content\": \"// Let's start with armor;\\n\\npub trait Armor: Item {\\n\\n fn set_armor_rating(self, armor_rating: ArmorRating) -> Self\\n\\n where\\n\\n Self: Sized;\\n\\n fn armor_rating(&self) -> &ArmorRating;\\n\\n}\\n\\n\\n\\n/// NB : We could define many different armor type.\\n\\npub struct BodyArmor {\\n\\n armor_rating: f32,\\n\\n name: String,\\n\\n}\\n\\n\\n\\nimpl Default for BodyArmor {\\n\\n fn default() -> Self {\\n\\n BodyArmor {\\n\\n armor_rating: 0 as f32,\\n\\n name: \\\"\\\".to_string(),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"examples/rpg_engine/src/item.rs\",\n \"rank\": 2,\n \"score\": 82039.43523088138\n },\n {\n \"content\": \"pub trait Weapon: Item {\\n\\n /// Describe how much damage a weapon can deal.\\n\\n /// More damage a weapon deals, better quality it is .\\n\\n fn damages(&self) -> &RawDamages;\\n\\n fn set_damages(self, amount: RawDamages) -> Self\\n\\n where\\n\\n Self: Sized;\\n\\n // Block attack and make calculation if possible\\n\\n fn can_block_if_possible(&self) -> Option<BlockedDamages> {\\n\\n match self.handheld_type() {\\n\\n HandheldType::SingleHand => Some(self.damages() * 0.3),\\n\\n HandheldType::TwoHands => Some(self.damages() * 0.5),\\n\\n // A bit dummy here because we have different implementation later.\\n\\n HandheldType::OnlyLeft => None,\\n\\n }\\n\\n }\\n\\n fn set_handheld_type(self, handheld: HandheldType) -> Self\\n\\n where\\n\\n Self: Sized;\\n\\n fn handheld_type(&self) -> &HandheldType;\\n\",\n \"file_path\": \"examples/rpg_engine/src/item.rs\",\n \"rank\": 3,\n \"score\": 82036.01231102912\n },\n {\n \"content\": \"fn rate_business(value: &u32) -> &'static str {\\n\\n match value {\\n\\n 0 => \\\"Bankrupt\\\",\\n\\n 1..=100 => \\\"Weak\\\",\\n\\n 101..=350 => \\\"Ok\\\",\\n\\n 351..=700 => \\\"Nice\\\",\\n\\n 701..=1000 => \\\"Maybe a bubble\\\",\\n\\n _ => \\\"Like seven sisters\\\",\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/ownership/src/main.rs\",\n \"rank\": 4,\n \"score\": 72352.89180362954\n },\n {\n \"content\": \"struct Company {\\n\\n pub name: String,\\n\\n /// In Billion\\n\\n pub value: u32,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/ownership/src/main.rs\",\n \"rank\": 5,\n \"score\": 48413.4046604762\n },\n {\n \"content\": \"fn main() {\\n\\n let mut facebook = Company {\\n\\n name: \\\"FaceMash\\\".to_string(),\\n\\n value: 0,\\n\\n };\\n\\n // 1 - immutability\\n\\n facebook.name = \\\"Facebook\\\".to_string();\\n\\n facebook.value = 900;\\n\\n\\n\\n println!(\\\"{} new name is cool \\\", facebook.name);\\n\\n\\n\\n // 2 - Reference with & to read data\\n\\n // Try to assign value with `&` and see what happens:D\\n\\n display_data(&facebook);\\n\\n\\n\\n println!(\\\"{} is super old, we need rebranding. \\\", facebook.name); // <- Macro stuff does auto reference https://stackoverflow.com/questions/30450399/does-println-borrow-or-own-the-variable\\n\\n\\n\\n // <- if we do not use mut here, compiler will say NO\\n\\n facebook.name = \\\"Meta\\\".to_string();\\n\\n facebook.value -= 231;\\n\",\n \"file_path\": \"examples/ownership/src/main.rs\",\n \"rank\": 6,\n \"score\": 46285.67051924822\n },\n {\n \"content\": \"fn main() {\\n\\n let mut line = String::new();\\n\\n print!(\\\"Enter total number of students:\\\");\\n\\n std::io::stdin().read_line(&mut line).unwrap();\\n\\n\\n\\n let students_amount: u32 = line.trim().parse().expect(\\\"We need an integer here\\\");\\n\\n\\n\\n let mut class = Vec::new();\\n\\n\\n\\n println!(\\\"Enter grades for students\\\");\\n\\n\\n\\n for student in 0..students_amount {\\n\\n print!(\\\"student{} :\\\", student + 1);\\n\\n let mut line = String::new();\\n\\n std::io::stdin().read_line(&mut line).unwrap();\\n\\n println!();\\n\\n\\n\\n let grade: u32 = line.trim().parse().expect(\\\"We need an integer here\\\");\\n\\n\\n\\n class.push(grade);\\n\\n }\\n\\n\\n\\n println!(\\\"Display grades for students\\\");\\n\\n\\n\\n for (index, grade) in class.iter().enumerate() {\\n\\n println!(\\\"student{} : {}\\\", index + 1, grade);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"examples/rust_allocation/src/main.rs\",\n \"rank\": 7,\n \"score\": 45320.39136510334\n },\n {\n \"content\": \"//\\n\\npub trait Item {\\n\\n fn name(&self) -> &str;\\n\\n fn set_name(self, name: &str) -> Self\\n\\n where\\n\\n Self: Sized;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/rpg_engine/src/item.rs\",\n \"rank\": 8,\n \"score\": 43446.805758282906\n },\n {\n \"content\": \"fn main() {\\n\\n let iron_plate = BodyArmor::new(\\\"Iron Plate\\\", 32.0);\\n\\n let steel_plate = BodyArmor::new(\\\"Steel Plate\\\", 54.0);\\n\\n let daedric_armor = BodyArmor::new(\\\"Daedric Armor\\\", 25.0);\\n\\n let daedric_armor_2 = BodyArmor::new(\\\"Daedric Armor 2\\\", 25.0);\\n\\n\\n\\n // Lets put some shields\\n\\n let steel_shield = Shield::new(\\\"steal Shield\\\", 55.0, 20.0);\\n\\n let iron_shield = Shield::new(\\\"Iron Shield\\\", 25.0, 15.0);\\n\\n\\n\\n // Lets put some weapons.\\n\\n let steel_long_sword = RegularWeapon::new(\\\"Steel Long Sword\\\", 40.0, HandheldType::SingleHand);\\n\\n let iron_long_sword = RegularWeapon::new(\\\"Iron Long Sword\\\", 35.0, HandheldType::SingleHand);\\n\\n let steel_battle_axe = RegularWeapon::new(\\\"Steel battle Axe\\\", 65.0, HandheldType::TwoHands);\\n\\n let daedric_battle_axe = RegularWeapon::new(\\\"Daedric battle Axe\\\", 85.0, HandheldType::TwoHands);\\n\\n\\n\\n let grand_ma_skyrim = Character::new(\\\"Skyrim Grandma\\\", 300.00)\\n\\n .grab_weapon(steel_battle_axe)\\n\\n .grab_armor(daedric_armor);\\n\\n\\n\",\n \"file_path\": \"examples/rpg_engine/examples/multiple_fights/src/main.rs\",\n \"rank\": 9,\n \"score\": 42767.386336336785\n },\n {\n \"content\": \"#[allow(unused)]\\n\\nfn main() {\\n\\n println!(\\\"Hello and Fight\\\");\\n\\n\\n\\n // Lets put some armors.\\n\\n let iron_plate = BodyArmor::new(\\\"Iron Plate\\\", 32.0);\\n\\n let steel_plate = BodyArmor::new(\\\"Steel Plate\\\", 54.0);\\n\\n let daedric_armor = BodyArmor::new(\\\"Daedric Armor\\\", 25.0);\\n\\n let daedric_armor_2 = BodyArmor::new(\\\"Daedric Armor 2\\\", 25.0);\\n\\n\\n\\n // Lets put some shields\\n\\n let steel_shield = Shield::new(\\\"steal Shield\\\", 55.0, 20.0);\\n\\n let iron_shield = Shield::new(\\\"Iron Shield\\\", 25.0, 15.0);\\n\\n\\n\\n // Lets put some weapons.\\n\\n let iron_long_sword = RegularWeapon::new(\\\"Iron Long Sword\\\", 35.0, HandheldType::SingleHand);\\n\\n let steel_battle_axe = RegularWeapon::new(\\\"Steel battle Axe\\\", 65.0, HandheldType::TwoHands);\\n\\n let daedric_battle_axe = RegularWeapon::new(\\\"Daedric battle Axe\\\", 85.0, HandheldType::TwoHands);\\n\\n\\n\\n let grand_ma_skyrim = Character::new(\\\"Skyrim Grandma\\\", 300.00)\\n\\n .grab_weapon(steel_battle_axe)\\n\",\n \"file_path\": \"examples/rpg_engine/examples/simple_fight/src/main.rs\",\n \"rank\": 10,\n \"score\": 42767.386336336785\n },\n {\n \"content\": \"#[cfg(feature = \\\"song\\\")]\\n\\nfn add_song() {\\n\\n println!(\\n\\n \\\"Dovahkiin, Dovahkiin, naal ok zin los vahriin,\\n\\n Wah dein vokul mahfaeraak ahst vaal!\\n\\n Ahr fin norok paal graan fod nust hon zindro zaan,\\n\\n Dovahkiin fah hin kogaan mu draal!\\\"\\n\\n );\\n\\n thread::sleep(Duration::new(2, 0));\\n\\n println!(\\n\\n \\\"\\n\\n Huzrah nu, kul do od, wah aan bok lingrah vod,\\n\\n Ahrk fin tey, boziik fun, do fin gein!\\n\\n Wo lost fron wah ney dov, ahrk fin reyliik do jul,\\n\\n Voth aan suleyk wah ronit faal krein!\\\"\\n\\n );\\n\\n thread::sleep(Duration::new(2, 0));\\n\\n println!(\\n\\n \\\" Ahrk fin zul, rok drey kod, nau tol morokei frod,\\n\\n Rul lot Taazokaan motaad voth kein!\\n\\n Sahrot Thu'um, med aan tuz, bey zeim hokoron pah,\\n\",\n \"file_path\": \"examples/rpg_engine/examples/multiple_fights/src/main.rs\",\n \"rank\": 11,\n \"score\": 42014.23692119663\n },\n {\n \"content\": \"fn display_data(company: &Company) {\\n\\n println!(\\\"Name : {} \\\", company.name);\\n\\n println!(\\\"Market Cap : {} \\\", company.name);\\n\\n println!(\\\"Rating {}\\\", rate_business(&company.value))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/ownership/src/main.rs\",\n \"rank\": 12,\n \"score\": 39611.71752658159\n },\n {\n \"content\": \"fn rebuild_business(_: Company) -> Company {\\n\\n Company {\\n\\n name: \\\"Facebook 2.0\\\".to_string(),\\n\\n value: 850,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/ownership/src/main.rs\",\n \"rank\": 13,\n \"score\": 38266.86489439207\n },\n {\n \"content\": \"#![allow(unused)]\\n\\n\\n\\nuse crate::item::*;\\n\\nuse std::sync::Arc;\\n\\n\\n\\n/// https://stackoverflow.com/questions/49377231/when-to-use-rc-vs-box\\n\\n/// Option on Arc is maybe useless, I could use default value for Weapon & Armor as well.\\n\\n#[derive(Clone, Default)]\\n\\npub struct Stuff {\\n\\n armor: Option<Arc<dyn Armor + Send + Sync>>,\\n\\n first_weapon: Option<Arc<dyn Weapon + Send + Sync>>,\\n\\n second_weapon: Option<Arc<dyn Weapon + Send + Sync>>,\\n\\n}\\n\\n\\n\\nimpl Stuff {\\n\\n fn set_armor<A: 'static + Armor + Send + Sync>(&mut self, armor: A) {\\n\\n self.armor = Some(Arc::new(armor));\\n\\n }\\n\\n\\n\\n fn set_first_weapon<W: 'static + Weapon + Send + Sync>(&mut self, first_weapon: W) {\\n\",\n \"file_path\": \"examples/rpg_engine/src/stuff.rs\",\n \"rank\": 30,\n \"score\": 29351.77110957809\n },\n {\n \"content\": \" self.first_weapon = Some(Arc::new(first_weapon));\\n\\n }\\n\\n\\n\\n fn set_second_weapon<W: 'static + Weapon + Send + Sync>(&mut self, second_weapon: W) {\\n\\n self.second_weapon = Some(Arc::new(second_weapon))\\n\\n }\\n\\n\\n\\n pub fn unset_first_weapon(&mut self) {\\n\\n self.first_weapon = None;\\n\\n }\\n\\n\\n\\n pub fn unset_second_weapon(&mut self) {\\n\\n self.second_weapon = None;\\n\\n }\\n\\n\\n\\n fn armor(&self) -> &Option<Arc<dyn Armor + Send + Sync>> {\\n\\n &self.armor\\n\\n }\\n\\n\\n\\n fn first_weapon(&self) -> &Option<Arc<dyn Weapon + Send + Sync>> {\\n\",\n \"file_path\": \"examples/rpg_engine/src/stuff.rs\",\n \"rank\": 31,\n \"score\": 29348.57049955516\n },\n {\n \"content\": \" &self.first_weapon\\n\\n }\\n\\n\\n\\n fn second_weapon(&self) -> &Option<Arc<dyn Weapon + Send + Sync>> {\\n\\n &self.second_weapon\\n\\n }\\n\\n\\n\\n /// Will panic if you have equipped a two hand weapon as a second Weapon.\\n\\n /// We could have specific trait for weapons to be used with both Hands.\\n\\n /// Ex : SingleHand Item could have a trait \\\"BothHand\\\", and restrict this trait for second hand.\\n\\n #[must_use]\\n\\n pub fn equip_weapon<W: 'static + Weapon + Send + Sync>(mut self, weapon: W) -> Self {\\n\\n match weapon.handheld_type() {\\n\\n HandheldType::SingleHand => {\\n\\n if let Some(current_weapon) = self.first_weapon() {\\n\\n if current_weapon.handheld_type() == &HandheldType::SingleHand {\\n\\n self.second_weapon = Some(current_weapon.clone())\\n\\n }\\n\\n }\\n\\n self.set_first_weapon(weapon);\\n\",\n \"file_path\": \"examples/rpg_engine/src/stuff.rs\",\n \"rank\": 32,\n \"score\": 29345.060491359443\n },\n {\n \"content\": \" pub fn get_second_weapon_blocking_damage(&self) -> Option<f32> {\\n\\n self.second_weapon.as_ref()?.can_block_if_possible()\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(PartialEq)]\\n\\npub enum StuffConfig {\\n\\n DualWeapons,\\n\\n ShieldAndWeapon,\\n\\n TwoHandsWeapon,\\n\\n OnlyShied,\\n\\n OneSingleHandWeapon,\\n\\n OneWeaponAsSecondary,\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use crate::item::{Armor, BodyArmor, HandheldType, Item, RegularWeapon, Shield, Weapon};\\n\\n use crate::stuff::{Stuff, StuffConfig};\\n\\n\\n\",\n \"file_path\": \"examples/rpg_engine/src/stuff.rs\",\n \"rank\": 33,\n \"score\": 29343.86166966887\n },\n {\n \"content\": \" #[must_use]\\n\\n pub fn equip_armor<A: 'static + Armor + Send + Sync>(mut self, armor: A) -> Self {\\n\\n self.set_armor(armor);\\n\\n self\\n\\n }\\n\\n\\n\\n /// Calculate armor rating.\\n\\n pub fn get_armor_rating(&self) -> ArmorRating {\\n\\n if let Some(armor) = self.armor() {\\n\\n *armor.armor_rating()\\n\\n } else {\\n\\n 0.0\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn calculate_blocked_damage_armor(&self) -> BlockedDamages {\\n\\n let armor_damages = if let Some(armor) = self.armor() {\\n\\n *armor.armor_rating()\\n\\n } else {\\n\\n 0.0\\n\",\n \"file_path\": \"examples/rpg_engine/src/stuff.rs\",\n \"rank\": 34,\n \"score\": 29343.16950207902\n },\n {\n \"content\": \" get_long_iron_sword().name()\\n\\n );\\n\\n assert!(stuff.second_weapon.is_none());\\n\\n\\n\\n assert!(stuff.get_weapon_settings() == StuffConfig::OneSingleHandWeapon);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn use_two_hands_weapons() {\\n\\n let steel_battle_axe = get_steel_battle_axe();\\n\\n let long_iron_sword = get_long_iron_sword();\\n\\n let steel_shield = get_steel_shield();\\n\\n let mut stuff = Stuff::default()\\n\\n .equip_weapon(long_iron_sword)\\n\\n .equip_weapon(steel_shield);\\n\\n\\n\\n stuff = stuff.equip_weapon(steel_battle_axe);\\n\\n\\n\\n assert_eq!(\\n\\n stuff.first_weapon.as_ref().unwrap().name().to_string(),\\n\",\n \"file_path\": \"examples/rpg_engine/src/stuff.rs\",\n \"rank\": 35,\n \"score\": 29341.46277957638\n },\n {\n \"content\": \" assert_eq!(\\n\\n stuff.second_weapon.as_ref().unwrap().name().to_string(),\\n\\n get_iron_shield().name()\\n\\n );\\n\\n\\n\\n stuff = stuff\\n\\n .equip_weapon(get_iron_shield())\\n\\n .equip_weapon(get_steel_shield());\\n\\n\\n\\n assert_eq!(\\n\\n stuff.second_weapon.as_ref().unwrap().name().to_string(),\\n\\n get_steel_shield().name()\\n\\n );\\n\\n assert!(stuff.get_weapon_settings() == StuffConfig::ShieldAndWeapon);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_damages_with_shield_and_sword() {\\n\\n let damages = Stuff::default()\\n\\n .equip_weapon(get_long_steel_sword())\\n\",\n \"file_path\": \"examples/rpg_engine/src/stuff.rs\",\n \"rank\": 36,\n \"score\": 29340.37914674709\n },\n {\n \"content\": \"\\n\\n assert_eq!(\\n\\n stuff.first_weapon.as_ref().unwrap().name().to_string(),\\n\\n get_long_steel_sword().name()\\n\\n );\\n\\n\\n\\n assert_eq!(\\n\\n stuff.second_weapon.as_ref().unwrap().name().to_string(),\\n\\n get_long_iron_sword().name()\\n\\n );\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn replace_two_hands_weapon_with_single() {\\n\\n let steel_battle_axe = get_steel_battle_axe();\\n\\n let mut stuff = Stuff::default().equip_weapon(steel_battle_axe);\\n\\n let long_iron_sword = get_long_iron_sword();\\n\\n stuff = stuff.equip_weapon(long_iron_sword);\\n\\n assert_eq!(\\n\\n stuff.first_weapon.as_ref().unwrap().name().to_string(),\\n\",\n \"file_path\": \"examples/rpg_engine/src/stuff.rs\",\n \"rank\": 37,\n \"score\": 29340.355432618802\n },\n {\n \"content\": \" assert_eq!(\\n\\n stuff.second_weapon.as_ref().unwrap().name().to_string(),\\n\\n get_long_iron_sword().name()\\n\\n );\\n\\n assert!(stuff.get_weapon_settings() == StuffConfig::DualWeapons);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n /// Let's see when we move the first weapon as second\\n\\n /// Let's see if using just one weapon works\\n\\n fn replace_single_hand_weapons() {\\n\\n let long_iron_sword = get_long_iron_sword();\\n\\n let long_steel_sword = get_long_steel_sword();\\n\\n let steel_shield = get_steel_shield();\\n\\n\\n\\n let mut stuff = Stuff::default()\\n\\n .equip_weapon(long_iron_sword)\\n\\n .equip_weapon(steel_shield);\\n\\n\\n\\n stuff = stuff.equip_weapon(long_steel_sword);\\n\",\n \"file_path\": \"examples/rpg_engine/src/stuff.rs\",\n \"rank\": 38,\n \"score\": 29339.605343629457\n },\n {\n \"content\": \" }\\n\\n\\n\\n #[test]\\n\\n fn use_single_hand_weapon_in_place_of_shield() {\\n\\n let long_iron_sword = get_long_iron_sword();\\n\\n let another_long_iron_sword = get_long_iron_sword();\\n\\n let steel_shield = get_steel_shield();\\n\\n\\n\\n let mut stuff = Stuff::default()\\n\\n .equip_weapon(long_iron_sword)\\n\\n .equip_weapon(steel_shield);\\n\\n\\n\\n // because of mut, need &mut self if we want to update partialy the object;\\n\\n stuff = stuff.equip_weapon(another_long_iron_sword);\\n\\n\\n\\n assert_eq!(\\n\\n stuff.first_weapon.as_ref().unwrap().name().to_string(),\\n\\n get_long_iron_sword().name()\\n\\n );\\n\\n\\n\",\n \"file_path\": \"examples/rpg_engine/src/stuff.rs\",\n \"rank\": 39,\n \"score\": 29339.480350668233\n },\n {\n \"content\": \" get_steel_battle_axe().name()\\n\\n );\\n\\n\\n\\n assert!(stuff.second_weapon.is_none());\\n\\n assert!(stuff.get_weapon_settings() == StuffConfig::TwoHandsWeapon);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn use_shields() {\\n\\n let long_iron_sword = get_long_iron_sword();\\n\\n let another_long_iron_sword = get_long_iron_sword();\\n\\n let steel_shield = get_steel_shield();\\n\\n let iron_shield = get_iron_shield();\\n\\n\\n\\n let mut stuff = Stuff::default()\\n\\n .equip_weapon(long_iron_sword)\\n\\n .equip_weapon(steel_shield);\\n\\n\\n\\n stuff = stuff.equip_weapon(iron_shield);\\n\\n\\n\",\n \"file_path\": \"examples/rpg_engine/src/stuff.rs\",\n \"rank\": 40,\n \"score\": 29339.34544803951\n },\n {\n \"content\": \" StuffConfig::DualWeapons\\n\\n } else if self.is_shield_only() {\\n\\n StuffConfig::OnlyShied\\n\\n } else if self.is_shield_with_single_weapon() {\\n\\n StuffConfig::ShieldAndWeapon\\n\\n } else if self.is_single_weapon() {\\n\\n StuffConfig::OneSingleHandWeapon\\n\\n } else if self.is_two_hands_weapon() {\\n\\n StuffConfig::TwoHandsWeapon\\n\\n } else if self.is_one_single_as_secondary() {\\n\\n StuffConfig::OneWeaponAsSecondary\\n\\n } else {\\n\\n panic!(\\\"Config not found maybe no weapons have been equipped\\\")\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn get_first_weapon_blocking_damage(&self) -> Option<f32> {\\n\\n self.first_weapon.as_ref()?.can_block_if_possible()\\n\\n }\\n\\n\\n\",\n \"file_path\": \"examples/rpg_engine/src/stuff.rs\",\n \"rank\": 41,\n \"score\": 29338.54462365618\n },\n {\n \"content\": \" }\\n\\n\\n\\n fn is_shield_only(&self) -> bool {\\n\\n if let (None, Some(second_weapon)) = (self.first_weapon(), self.second_weapon()) {\\n\\n second_weapon.handheld_type() == &HandheldType::OnlyLeft\\n\\n } else {\\n\\n false\\n\\n }\\n\\n }\\n\\n\\n\\n fn is_one_single_as_secondary(&self) -> bool {\\n\\n if let (None, Some(second_weapon)) = (self.first_weapon(), self.second_weapon()) {\\n\\n second_weapon.handheld_type() == &HandheldType::SingleHand\\n\\n } else {\\n\\n false\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn get_weapon_settings(&self) -> StuffConfig {\\n\\n if self.is_double_weapon() {\\n\",\n \"file_path\": \"examples/rpg_engine/src/stuff.rs\",\n \"rank\": 42,\n \"score\": 29338.225871121067\n },\n {\n \"content\": \" .equip_weapon(get_steel_battle_axe())\\n\\n .calculate_damages();\\n\\n assert_eq!(&damages, get_steel_battle_axe().damages())\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_armor_rating_with_no_armor() {\\n\\n let rating = Stuff::default().get_armor_rating();\\n\\n\\n\\n assert_eq!(rating, 0.0)\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_armor_rating_with_armor() {\\n\\n let rating = Stuff::default()\\n\\n .equip_armor(get_daedric_mail())\\n\\n .get_armor_rating();\\n\\n\\n\\n assert_eq!(&rating, get_daedric_mail().armor_rating());\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"examples/rpg_engine/src/stuff.rs\",\n \"rank\": 43,\n \"score\": 29335.768517259694\n },\n {\n \"content\": \" };\\n\\n armor_damages\\n\\n }\\n\\n\\n\\n fn is_single_weapon(&self) -> bool {\\n\\n if let Some(w) = self.first_weapon() {\\n\\n w.handheld_type() == &HandheldType::SingleHand && self.second_weapon().is_none()\\n\\n } else {\\n\\n false\\n\\n }\\n\\n }\\n\\n\\n\\n fn is_double_weapon(&self) -> bool {\\n\\n if let (Some(first_weapon), Some(second_weapon)) =\\n\\n (self.first_weapon(), self.second_weapon())\\n\\n {\\n\\n first_weapon.handheld_type() == &HandheldType::SingleHand\\n\\n && second_weapon.handheld_type() == &HandheldType::SingleHand\\n\\n } else {\\n\\n false\\n\",\n \"file_path\": \"examples/rpg_engine/src/stuff.rs\",\n \"rank\": 44,\n \"score\": 29335.49845773231\n },\n {\n \"content\": \" self.set_first_weapon(weapon);\\n\\n }\\n\\n }\\n\\n self\\n\\n }\\n\\n\\n\\n ///Calculate how much damage the equipped weapons can do.\\n\\n /// Bash damages from shield are counted\\n\\n pub fn calculate_damages(&self) -> RawDamages {\\n\\n let mut damages: RawDamages = 0.0;\\n\\n\\n\\n if let Some(first_weapon) = self.first_weapon() {\\n\\n damages = *first_weapon.damages();\\n\\n }\\n\\n if let Some(second_weapon) = self.second_weapon() {\\n\\n damages += *second_weapon.damages();\\n\\n }\\n\\n damages\\n\\n }\\n\\n\\n\",\n \"file_path\": \"examples/rpg_engine/src/stuff.rs\",\n \"rank\": 45,\n \"score\": 29333.588505057745\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n fn is_two_hands_weapon(&self) -> bool {\\n\\n if let (Some(first_weapon), None) = (self.first_weapon(), self.second_weapon()) {\\n\\n first_weapon.handheld_type() == &HandheldType::TwoHands\\n\\n } else {\\n\\n false\\n\\n }\\n\\n }\\n\\n\\n\\n fn is_shield_with_single_weapon(&self) -> bool {\\n\\n if let (Some(first_weapon), Some(second_weapon)) =\\n\\n (self.first_weapon(), self.second_weapon())\\n\\n {\\n\\n first_weapon.handheld_type() == &HandheldType::SingleHand\\n\\n && second_weapon.handheld_type() == &HandheldType::OnlyLeft\\n\\n } else {\\n\\n false\\n\\n }\\n\",\n \"file_path\": \"examples/rpg_engine/src/stuff.rs\",\n \"rank\": 46,\n \"score\": 29333.570534418042\n },\n {\n \"content\": \" fn get_long_iron_sword() -> RegularWeapon {\\n\\n RegularWeapon::new(\\\"Long Iron Sword\\\", 25.0, HandheldType::SingleHand)\\n\\n }\\n\\n fn get_long_steel_sword() -> RegularWeapon {\\n\\n RegularWeapon::new(\\\"Long Steel Sword\\\", 30.0, HandheldType::SingleHand)\\n\\n }\\n\\n fn get_steel_battle_axe() -> RegularWeapon {\\n\\n RegularWeapon::new(\\\"Steal battle Axe\\\", 65.0, HandheldType::TwoHands)\\n\\n }\\n\\n\\n\\n fn get_iron_shield() -> Shield {\\n\\n Shield::new(\\\"Iron Shield\\\", 25.0, 5.0)\\n\\n }\\n\\n\\n\\n fn get_steel_shield() -> Shield {\\n\\n Shield::new(\\\"Steel Shield\\\", 35.0, 7.0)\\n\\n }\\n\\n\\n\\n fn get_daedric_mail() -> BodyArmor {\\n\\n BodyArmor::new(\\\"Daedric Shield\\\", 45.0)\\n\",\n \"file_path\": \"examples/rpg_engine/src/stuff.rs\",\n \"rank\": 47,\n \"score\": 29333.205914994793\n },\n {\n \"content\": \" .equip_weapon(get_steel_shield())\\n\\n .calculate_damages();\\n\\n\\n\\n assert_eq!(\\n\\n damages,\\n\\n get_steel_shield().damages() + get_long_steel_sword().damages()\\n\\n )\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_damages_with_shield() {\\n\\n let damages = Stuff::default()\\n\\n .equip_weapon(get_steel_shield())\\n\\n .calculate_damages();\\n\\n assert_eq!(&damages, get_steel_shield().damages())\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_damages_with_two_hands() {\\n\\n let damages = Stuff::default()\\n\",\n \"file_path\": \"examples/rpg_engine/src/stuff.rs\",\n \"rank\": 48,\n \"score\": 29332.87143058789\n },\n {\n \"content\": \" }\\n\\n HandheldType::OnlyLeft => {\\n\\n if let Some(current_first_weapon) = self.first_weapon() {\\n\\n if current_first_weapon.handheld_type() == &HandheldType::TwoHands {\\n\\n self.unset_first_weapon();\\n\\n }\\n\\n }\\n\\n\\n\\n // See comment on how we could avoid this issue at compile time.\\n\\n // if First weapon is set or not, we do not care, left item always goes left.\\n\\n if let Some(current_second_weapon) = self.second_weapon() {\\n\\n if current_second_weapon.handheld_type() == &HandheldType::TwoHands {\\n\\n panic!(\\\"It seems you have a two hand weapon as second weapon\\\");\\n\\n }\\n\\n }\\n\\n\\n\\n self.set_second_weapon(weapon)\\n\\n }\\n\\n HandheldType::TwoHands => {\\n\\n self.unset_second_weapon();\\n\",\n \"file_path\": \"examples/rpg_engine/src/stuff.rs\",\n \"rank\": 49,\n \"score\": 29331.557400880785\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl Armor for Shield {\\n\\n fn set_armor_rating(mut self, reduction: f32) -> Self {\\n\\n self.armor_rating = reduction;\\n\\n self\\n\\n }\\n\\n\\n\\n fn armor_rating(&self) -> &f32 {\\n\\n &self.armor_rating\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Item for Shield {\\n\\n fn name(&self) -> &str {\\n\\n &self.name\\n\\n }\\n\\n\\n\\n fn set_name(mut self, name: &str) -> Self {\\n\\n self.name = name.to_string();\\n\\n self\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Weapon for Shield {\\n\\n fn damages(&self) -> &RawDamages {\\n\\n &self.bash_damage\\n\\n }\\n\\n\\n\\n fn set_damages(mut self, amount: RawDamages) -> Self {\\n\\n self.bash_damage = amount;\\n\\n self\\n\\n }\\n\\n\\n\\n fn can_block_if_possible(&self) -> Option<BlockedDamages> {\\n\\n //We could have skills here to help us to calculate\\n\\n Some(self.armor_rating)\\n\\n }\\n\\n\\n\\n fn set_handheld_type(mut self, handheld: HandheldType) -> Self {\\n\\n self.handheld = handheld;\\n\\n self\\n\\n }\\n\\n\\n\\n fn handheld_type(&self) -> &HandheldType {\\n\\n &self.handheld\\n\\n }\\n\\n}\\n\\n\\n\\n// NB: I could have made multiple trait instead of enum as well.\\n\\n#[derive(PartialEq)]\\n\\npub enum HandheldType {\\n\\n SingleHand,\\n\\n OnlyLeft,\\n\\n TwoHands,\\n\\n}\\n\\n\\n\\nimpl Shield {\\n\\n pub fn new(name: &str, armor: f32, bash_damages: f32) -> Self {\\n\\n Self::default()\\n\\n .set_name(name)\\n\\n .set_armor_rating(armor)\\n\\n .set_handheld_type(HandheldType::OnlyLeft)\\n\\n .set_damages(bash_damages)\\n\\n }\\n\\n}\\n\\n```\\n\\n\\n\\n\\n\\nCheck the code for more examples.\\n\\n\\n\\nCharacter definition and Stuff definition that qualifies the weapons + armor configuration.\\n\\n\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 50,\n \"score\": 26.136983025310542\n },\n {\n \"content\": \"###### 1 - Armor & Weapons\\n\\n\\n\\n```rust\\n\\n// Every \\\"object ( weapons or armor is an item with a name )\\n\\npub trait Item {\\n\\n fn name(&self) -> &str;\\n\\n fn set_name(self, name: &str) -> Self\\n\\n where\\n\\n Self: Sized;\\n\\n}\\n\\n\\n\\n// We have some Armor\\n\\npub trait Armor: Item {\\n\\n fn set_armor_rating(self, armor_rating: ArmorRating) -> Self\\n\\n where\\n\\n Self: Sized;\\n\\n fn armor_rating(&self) -> &ArmorRating;\\n\\n}\\n\\n\\n\\npub trait Weapon: Item {\\n\\n /// Describe how much damage a weapon can deal.\\n\\n /// More damage a weapon deals, better quality it is .\\n\\n fn damages(&self) -> &RawDamages;\\n\\n fn set_damages(self, amount: RawDamages) -> Self\\n\\n where\\n\\n Self: Sized;\\n\\n // Block attack and make calculation if possible\\n\\n fn can_block_if_possible(&self) -> Option<BlockedDamages> {\\n\\n match self.handheld_type() {\\n\\n HandheldType::SingleHand => Some(self.damages() * 0.4),\\n\\n HandheldType::TwoHands => Some(self.damages() * 0.7),\\n\\n // A bit dummy here because we have different implementation later.\\n\\n HandheldType::OnlyLeft => None,\\n\\n }\\n\\n }\\n\\n fn set_handheld_type(self, handheld: HandheldType) -> Self\\n\\n where\\n\\n Self: Sized;\\n\\n fn handheld_type(&self) -> &HandheldType;\\n\\n}\\n\\n\\n\\n// Can make alias type for better semantic.\\n\\npub type BlockedDamages = f32;\\n\\npub type RawDamages = f32;\\n\\npub type ArmorRating = f32;\\n\\n```\\n\\n\\n\\n\\n\\n-> Now we can make some struct that implement this trait.\\n\\n\\n\\nHere is the shield which is a weapon, but it also has armor properties.\\n\\n\\n\\n```rust\\n\\n// ----- Rest of the Code\\n\\npub struct Shield {\\n\\n armor_rating: f32,\\n\\n name: String,\\n\\n hold: HandheldType,\\n\\n bash_damage: RawDamages,\\n\\n handheld: HandheldType,\\n\\n}\\n\\n\\n\\nimpl Default for Shield {\\n\\n fn default() -> Self {\\n\\n Shield {\\n\\n armor_rating: 0.0,\\n\\n name: \\\"\\\".to_string(),\\n\\n hold: HandheldType::OnlyLeft,\\n\\n bash_damage: 0.0,\\n\\n handheld: HandheldType::OnlyLeft,\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 51,\n \"score\": 25.582850312128354\n },\n {\n \"content\": \"###### 2 - Character\\n\\n```rust\\n\\npub struct Character {\\n\\n name: String,\\n\\n health: f32,\\n\\n max_health: f32,\\n\\n stuff: Stuff,\\n\\n}\\n\\n\\n\\n/// Here we store any kind of weapons and armor.\\n\\n/// Stuff contains specific pointers to dynamic object\\n\\n/// The compiler will say No to this until you tell him that the object size is know at compile time in the trait definition.\\n\\n/// That is why we have the word `Sized` for self in previous trait.\\n\\n#[derive(Default)]\\n\\npub struct Stuff {\\n\\n armor: Option<Rc<dyn Armor>>,\\n\\n first_weapon: Option<Rc<dyn Weapon>>,\\n\\n second_weapon: Option<Rc<dyn Weapon>>, // Rc is a specific reference pointer\\n\\n}\\n\\n\\n\\nimpl Stuff {\\n\\n \\n\\n// Many other methods \\n\\n/// Will panic if you have equipped a two hand weapon as a second Weapon.\\n\\n/// \\n\\npub fn equip_weapon<W: 'static + Weapon>(mut self, weapon: W) -> Self {\\n\\n match weapon.handheld_type() {\\n\\n \\n\\n HandheldType::SingleHand => {\\n\\n if let Some(current_weapon) = self.first_weapon() {\\n\\n if current_weapon.handheld_type() == &HandheldType::SingleHand {\\n\\n self.second_weapon = Some(current_weapon.clone())\\n\\n }\\n\\n }\\n\\n self.set_first_weapon(weapon);\\n\\n }\\n\\n \\n\\n HandheldType::OnlyLeft => {\\n\\n if let Some(current_first_weapon) = self.first_weapon() {\\n\\n if current_first_weapon.handheld_type() == &HandheldType::TwoHands {\\n\\n self.unset_first_weapon();\\n\\n }\\n\\n }\\n\\n\\n\\n // See comment on how we could avoid this issue at compile time.\\n\\n // if First weapon is set or not, we do not care, left item always goes left.\\n\\n if let Some(current_second_weapon) = self.second_weapon() {\\n\\n if current_second_weapon.handheld_type() == &HandheldType::TwoHands {\\n\\n panic!(\\\"It seems you have a two hand weapon as second weapon\\\");\\n\\n }\\n\\n }\\n\\n\\n\\n self.set_second_weapon(weapon)\\n\\n }\\n\\n HandheldType::TwoHands => {\\n\\n self.unset_second_weapon();\\n\\n self.set_first_weapon(weapon);\\n\\n }\\n\\n }\\n\\n self\\n\\n}\\n\\n\\n\\n}\\n\\n```\\n\\n\\n\\n\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 52,\n \"score\": 23.07275436044905\n },\n {\n \"content\": \"###### 3 - Fight\\n\\n\\n\\n```rust\\n\\npub struct Fight {\\n\\n winner_name: Option<String>,\\n\\n round: u16,\\n\\n opponents: (Character, Character),\\n\\n}\\n\\n\\n\\n#[allow(unused)]\\n\\nimpl Fight {\\n\\n pub fn winner_name(&self) -> &Option<String> {\\n\\n &self.winner_name\\n\\n }\\n\\n pub fn round(&self) -> u16 {\\n\\n self.round\\n\\n }\\n\\n pub fn opponents(&self) -> &(Character, Character) {\\n\\n &self.opponents\\n\\n }\\n\\n pub fn new(first_fighter: Character, second_fighter: Character) -> Self {\\n\\n Fight {\\n\\n winner_name: None,\\n\\n round: 0,\\n\\n opponents: (first_fighter, second_fighter),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn start(&mut self) {\\n\\n // My ugly code you can check\\n\\n }\\n\\n}\\n\\n\\n\\n```\\n\\n\\n\\n\\n\\n\\n\\nHere is how the \\\"game\\\" looks like.\\n\\n\\n\\n```rust\\n\\n\\n\\nmod character;\\n\\nmod dice;\\n\\nmod fight;\\n\\nmod item;\\n\\nmod stuff;\\n\\nuse crate::character::Character;\\n\\nuse crate::fight::Fight;\\n\\nuse item::*;\\n\\n\\n\\nfn main() {\\n\\n println!(\\\"Hello and Fight\\\");\\n\\n\\n\\n // Lets put some armors.\\n\\n let iron_plate = BodyArmor::new(\\\"Iron Plate\\\", 32.0);\\n\\n let steel_plate = BodyArmor::new(\\\"Steel Plate\\\", 54.0);\\n\\n let daedric_armor = BodyArmor::new(\\\"Daedric Armor\\\", 25.0);\\n\\n let daedric_armor_2 = BodyArmor::new(\\\"Daedric Armor 2\\\", 25.0);\\n\\n\\n\\n // Lets put some shields\\n\\n let steel_shield = Shield::new(\\\"steal Shield\\\", 55.0, 20.0);\\n\\n let iron_shield = Shield::new(\\\"Iron Shield\\\", 25.0, 15.0);\\n\\n\\n\\n // Lets put some weapons.\\n\\n let iron_long_sword = RegularWeapon::new(\\\"Iron Long Sword\\\", 35.0, HandheldType::SingleHand);\\n\\n let steel_battle_axe = RegularWeapon::new(\\\"Steel battle Axe\\\", 65.0, HandheldType::TwoHands);\\n\\n let daedric_battle_axe = RegularWeapon::new(\\\"Daedric battle Axe\\\", 85.0, HandheldType::TwoHands);\\n\\n\\n\\n let grand_ma_skyrim = Character::new(\\\"Skyrim Grandma\\\", 300.00)\\n\\n .grab_weapon(steel_battle_axe)\\n\\n .grab_armor(daedric_armor);\\n\\n\\n\\n let white_run_guard = Character::new(\\\"Olaf the dummy guard\\\", 300.00)\\n\\n .grab_weapon(steel_shield) // <- we can do it because of generic + trait objects for weapon\\n\\n .grab_weapon(iron_long_sword)\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 53,\n \"score\": 22.834707255179488\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl BodyArmor {\\n\\n pub fn new(name: &str, armor_rating: f32) -> Self {\\n\\n Self::default()\\n\\n .set_name(name)\\n\\n .set_armor_rating(armor_rating)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Armor for BodyArmor {\\n\\n fn set_armor_rating(mut self, reduction: f32) -> Self {\\n\\n self.armor_rating = reduction;\\n\\n self\\n\\n }\\n\\n fn armor_rating(&self) -> &f32 {\\n\\n &self.armor_rating\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/rpg_engine/src/item.rs\",\n \"rank\": 54,\n \"score\": 20.967478703069155\n },\n {\n \"content\": \"use crate::character::{Character, HealthStatus};\\n\\nuse crate::dice::SkillDice;\\n\\nuse crate::item::{BlockedDamages, RawDamages};\\n\\nuse colored::*;\\n\\n\\n\\npub mod turn;\\n\\nuse crate::fight::turn::{Turn, TurnStep};\\n\\nuse std::collections::HashMap;\\n\\n\\n\\npub struct Fight {\\n\\n winner_name: Option<String>,\\n\\n round: u32,\\n\\n attack_counting: HashMap<String, u32>,\\n\\n opponents: (Character, Character),\\n\\n winner: Option<Character>,\\n\\n loser: Option<Character>,\\n\\n}\\n\\n\\n\\n#[allow(unused)]\\n\\nimpl Fight {\\n\",\n \"file_path\": \"examples/rpg_engine/src/fight/mod.rs\",\n \"rank\": 55,\n \"score\": 20.237343308900936\n },\n {\n \"content\": \"use crate::character::{Character, HealthStatus};\\n\\nuse crate::dice::SkillDice;\\n\\nuse crate::item::{BlockedDamages, RawDamages};\\n\\nuse colored::*;\\n\\n\\n\\npub struct Turn {\\n\\n pub attacker: Character,\\n\\n pub defender: Character,\\n\\n pub number: u32,\\n\\n}\\n\\n\\n\\nimpl Turn {\\n\\n pub fn new(number: u32, attacker: Character, defender: Character) -> Self {\\n\\n let turn = Turn {\\n\\n attacker,\\n\\n defender,\\n\\n number,\\n\\n };\\n\\n\\n\\n turn.display_results(TurnStep::Initiative);\\n\",\n \"file_path\": \"examples/rpg_engine/src/fight/turn.rs\",\n \"rank\": 56,\n \"score\": 19.664503134141345\n },\n {\n \"content\": \"impl Item for BodyArmor {\\n\\n fn name(&self) -> &str {\\n\\n &self.name\\n\\n }\\n\\n\\n\\n fn set_name(mut self, name: &str) -> Self {\\n\\n self.name = name.to_string();\\n\\n self\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/rpg_engine/src/item.rs\",\n \"rank\": 57,\n \"score\": 18.637626289364434\n },\n {\n \"content\": \"\\n\\n fn can_block_if_possible(&self) -> Option<BlockedDamages> {\\n\\n //We could have skills here to help us to calculate\\n\\n Some(self.armor_rating)\\n\\n }\\n\\n\\n\\n fn set_handheld_type(mut self, handheld: HandheldType) -> Self {\\n\\n self.handheld = handheld;\\n\\n self\\n\\n }\\n\\n\\n\\n fn handheld_type(&self) -> &HandheldType {\\n\\n &self.handheld\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Shield {\\n\\n pub fn new(name: &str, armor: f32, bash_damages: f32) -> Self {\\n\\n Self::default()\\n\\n .set_name(name)\\n\\n .set_armor_rating(armor)\\n\\n .set_handheld_type(HandheldType::OnlyLeft)\\n\\n .set_damages(bash_damages)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"examples/rpg_engine/src/item.rs\",\n \"rank\": 58,\n \"score\": 18.56351402560583\n },\n {\n \"content\": \"}\\n\\n\\n\\n// NB: I could have made multiple trait instead of enum as well.\\n\\n#[derive(PartialEq)]\\n\\npub enum HandheldType {\\n\\n SingleHand,\\n\\n OnlyLeft,\\n\\n TwoHands,\\n\\n}\\n\\n\\n\\n/// NB : We could define many different of weapon ( like enchanted weapons for example and or melee weapons )\\n\\npub struct RegularWeapon {\\n\\n name: String,\\n\\n handheld: HandheldType,\\n\\n damages: RawDamages,\\n\\n}\\n\\n\\n\\nimpl RegularWeapon {\\n\\n pub fn new(name: &str, damages: f32, handheld: HandheldType) -> Self {\\n\\n RegularWeapon::default()\\n\",\n \"file_path\": \"examples/rpg_engine/src/item.rs\",\n \"rank\": 59,\n \"score\": 17.814510171752023\n },\n {\n \"content\": \" pub fn roll_initiative_dice(&self) -> (String, String) {\\n\\n if self.opponents.1.roll_dice(SkillDice::Initiative)\\n\\n >= self.opponents.0.roll_dice(SkillDice::Initiative)\\n\\n {\\n\\n (\\n\\n self.opponents.1.name().to_string(),\\n\\n self.opponents.0.name().to_string(),\\n\\n )\\n\\n } else {\\n\\n (\\n\\n self.opponents.0.name().to_string(),\\n\\n self.opponents.1.name().to_string(),\\n\\n )\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn resolve(mut self) -> Character {\\n\\n while self.winner_name.is_none() {\\n\\n self.round += 1;\\n\\n\\n\",\n \"file_path\": \"examples/rpg_engine/src/fight/mod.rs\",\n \"rank\": 60,\n \"score\": 17.386338580661487\n },\n {\n \"content\": \"impl Item for Shield {\\n\\n fn name(&self) -> &str {\\n\\n &self.name\\n\\n }\\n\\n\\n\\n fn set_name(mut self, name: &str) -> Self {\\n\\n self.name = name.to_string();\\n\\n self\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Weapon for Shield {\\n\\n fn damages(&self) -> &RawDamages {\\n\\n &self.bash_damage\\n\\n }\\n\\n\\n\\n fn set_damages(mut self, amount: RawDamages) -> Self {\\n\\n self.bash_damage = amount;\\n\\n self\\n\\n }\\n\",\n \"file_path\": \"examples/rpg_engine/src/item.rs\",\n \"rank\": 61,\n \"score\": 17.244140478931374\n },\n {\n \"content\": \" pub fn winner_name(&self) -> &Option<String> {\\n\\n &self.winner_name\\n\\n }\\n\\n pub fn round(&self) -> u32 {\\n\\n self.round\\n\\n }\\n\\n pub fn opponents(&self) -> &(Character, Character) {\\n\\n &self.opponents\\n\\n }\\n\\n\\n\\n pub fn new(first_fighter: Character, second_fighter: Character) -> Self {\\n\\n let mut attack_counting = HashMap::new();\\n\\n attack_counting.insert(first_fighter.name().to_string(), 0);\\n\\n attack_counting.insert(second_fighter.name().to_string(), 0);\\n\\n Fight {\\n\\n winner_name: None,\\n\\n round: 0,\\n\\n attack_counting,\\n\\n opponents: (first_fighter, second_fighter),\\n\\n winner: None,\\n\",\n \"file_path\": \"examples/rpg_engine/src/fight/mod.rs\",\n \"rank\": 62,\n \"score\": 16.89652917497325\n },\n {\n \"content\": \" .set_name(name)\\n\\n .set_damages(damages)\\n\\n .set_handheld_type(handheld)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Default for RegularWeapon {\\n\\n fn default() -> Self {\\n\\n RegularWeapon {\\n\\n name: \\\"Hands\\\".to_string(),\\n\\n handheld: HandheldType::SingleHand,\\n\\n damages: 1.0,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Item for RegularWeapon {\\n\\n fn name(&self) -> &str {\\n\\n &self.name\\n\\n }\\n\",\n \"file_path\": \"examples/rpg_engine/src/item.rs\",\n \"rank\": 63,\n \"score\": 16.53880573180039\n },\n {\n \"content\": \"\\n\\n fn set_name(mut self, name: &str) -> Self {\\n\\n self.name = name.to_string();\\n\\n self\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Weapon for RegularWeapon {\\n\\n fn damages(&self) -> &RawDamages {\\n\\n &self.damages\\n\\n }\\n\\n\\n\\n fn set_damages(mut self, amount: RawDamages) -> Self {\\n\\n self.damages = amount;\\n\\n self\\n\\n }\\n\\n\\n\\n fn set_handheld_type(mut self, handheld: HandheldType) -> Self {\\n\\n self.handheld = handheld;\\n\\n self\\n\",\n \"file_path\": \"examples/rpg_engine/src/item.rs\",\n \"rank\": 64,\n \"score\": 16.120544769193994\n },\n {\n \"content\": \" armor_rating: 0.0,\\n\\n name: \\\"\\\".to_string(),\\n\\n hold: HandheldType::OnlyLeft,\\n\\n bash_damage: 0.0,\\n\\n handheld: HandheldType::OnlyLeft,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Armor for Shield {\\n\\n fn set_armor_rating(mut self, reduction: f32) -> Self {\\n\\n self.armor_rating = reduction;\\n\\n self\\n\\n }\\n\\n\\n\\n fn armor_rating(&self) -> &f32 {\\n\\n &self.armor_rating\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/rpg_engine/src/item.rs\",\n \"rank\": 65,\n \"score\": 15.917870682409905\n },\n {\n \"content\": \" let first = self.opponents.0.roll_dice(SkillDice::Initiative);\\n\\n let second = self.opponents.1.roll_dice(SkillDice::Initiative);\\n\\n\\n\\n if first >= second {\\n\\n (self.opponents.1.clone(), self.opponents.0.clone())\\n\\n } else {\\n\\n (self.opponents.0.clone(), self.opponents.1.clone())\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n\\n\\n use super::*;\\n\\n use crate::prelude::*;\\n\\n\\n\\n fn get_test_player(name: &str) -> Character {\\n\\n Character::new(name, 1000.0).grab_weapon(RegularWeapon::default())\\n\\n }\\n\",\n \"file_path\": \"examples/rpg_engine/src/fight/mod.rs\",\n \"rank\": 66,\n \"score\": 15.298252171638932\n },\n {\n \"content\": \" }\\n\\n\\n\\n fn handheld_type(&self) -> &HandheldType {\\n\\n &self.handheld\\n\\n }\\n\\n}\\n\\n\\n\\n#[allow(unused)]\\n\\n/// NB : Shield could be a trait instead of a struct as well.\\n\\npub struct Shield {\\n\\n armor_rating: f32,\\n\\n name: String,\\n\\n hold: HandheldType,\\n\\n bash_damage: RawDamages,\\n\\n handheld: HandheldType,\\n\\n}\\n\\n\\n\\nimpl Default for Shield {\\n\\n fn default() -> Self {\\n\\n Shield {\\n\",\n \"file_path\": \"examples/rpg_engine/src/item.rs\",\n \"rank\": 67,\n \"score\": 15.012652669035273\n },\n {\n \"content\": \"\\n\\nimpl SkillDice {\\n\\n pub fn dices_roll_result(&self, actor: &str) -> u8 {\\n\\n let res = match self {\\n\\n SkillDice::Initiative => roll_dice(actor, \\\"2d6\\\", \\\"initiative\\\"),\\n\\n SkillDice::Blocking => roll_dice(actor, \\\"1d6\\\", \\\"block\\\"),\\n\\n SkillDice::Attack => roll_dice(actor, \\\"1d10\\\", \\\"attack\\\"),\\n\\n SkillDice::Dodge => roll_dice(actor, \\\"1d10\\\", \\\"dodge\\\"),\\n\\n };\\n\\n\\n\\n res as u8\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"examples/rpg_engine/src/dice.rs\",\n \"rank\": 68,\n \"score\": 14.318686665094566\n },\n {\n \"content\": \" loser: None,\\n\\n }\\n\\n }\\n\\n\\n\\n fn update_attacks_counter(&mut self, attack_name: &str) {\\n\\n if let Some(number_attacks) = self.attack_counting.get_mut(attack_name) {\\n\\n *number_attacks += 1;\\n\\n }\\n\\n }\\n\\n\\n\\n /// SO ugly code, please use `resolve()` instead.\\n\\n #[deprecated]\\n\\n pub fn start(&mut self) {\\n\\n let mut attack_counting: HashMap<String, u32> = HashMap::new();\\n\\n\\n\\n attack_counting.insert(self.opponents.1.name().to_string(), 0);\\n\\n attack_counting.insert(self.opponents.0.name().to_string(), 0);\\n\\n\\n\\n while self.winner_name.is_none() {\\n\\n self.round += 1;\\n\",\n \"file_path\": \"examples/rpg_engine/src/fight/mod.rs\",\n \"rank\": 69,\n \"score\": 14.119533783997397\n },\n {\n \"content\": \"#### Examples\\n\\n\\n\\n\\n\\n**a.** Mutability & Immutability\\n\\n\\n\\n```rust\\n\\n\\n\\nstruct Company {\\n\\n pub name: String,\\n\\n /// In Billion\\n\\n pub value: u32,\\n\\n}\\n\\n\\n\\nfn main() {\\n\\n let mut facebook = Company {\\n\\n name: \\\"FaceMash\\\".to_string(),\\n\\n value: 0,\\n\\n };\\n\\n \\n\\n // <- if we do not use mut here, compiler will say NO\\n\\n facebook.name = \\\"Facebook\\\".to_string();\\n\\n facebook.value = 900;\\n\\n\\n\\n println!(\\\"{} new name is cool \\\", facebook.name);\\n\\n}\\n\\n```\\n\\n\\n\\n**b.** Borrowing data to read it.\\n\\n\\n\\n```rust\\n\\n\\n\\n\\n\\nfn display_data(company: &Company) {\\n\\n println!(\\\"Name : {} \\\", company.name);\\n\\n println!(\\\"Market Cap : {} \\\", company.name);\\n\\n println!(\\\"Rating {}\\\", rate_business(&company.value))\\n\\n}\\n\\n\\n\\nfn main() {\\n\\n // ---- Rest of the code\\n\\n // 2 - Reference with `&` to read data\\n\\n // <- if we do not use & here, compiler will say NO because function asks for it.\\n\\n display_data(&facebook);\\n\\n}\\n\\n\\n\\n```\\n\\n**c.** Owning an object to move it ( to consume it ) to do stuff with it. \\n\\n\\n\\n```rust\\n\\n\\n\\n\\n\\nfn rebuild_business(_: Company) -> Company {\\n\\n Company {\\n\\n name: \\\"Facebook 2.0\\\".to_string(),\\n\\n value: 850,\\n\\n }\\n\\n}\\n\\n\\n\\n\\n\\nfn main() {\\n\\n \\n\\n // ---- Rest of the code\\n\\n println!(\\\"{} is super old, we need rebranding \\\", facebook.name);\\n\\n\\n\\n\\n\\n facebook.name = \\\"Meta\\\".to_string();\\n\\n println!(\\\"{} is an awesome name\\\", facebook.name);\\n\\n\\n\\n // <-- we move `facebook` inside the scope of the `rebuild_business` function so we cannot access it anymore .\\n\\n let mut new_facebook = rebuild_business(facebook);\\n\\n\\n\\n // println!(\\\"{} is still alive ?\\\", facebook.name); <-- get moved error value\\n\\n display_data(&new_facebook);\\n\\n \\n\\n}\\n\\n\\n\\n\\n\\n```\\n\\n\\n\\n\\n\\n**d.** Compiler check for everything for you\\n\\n\\n\\nLittle surprise with mutable references 😁\\n\\n\\n\\n```rust\\n\\n\\n\\nfn update_name(company: &mut Company, new_name: &str) {\\n\\n company.name = new_name.to_string();\\n\\n}\\n\\n\\n\\n\\n\\nfn main (){\\n\\n\\n\\n // --- Rest of the code ---\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 70,\n \"score\": 14.046455328103516\n },\n {\n \"content\": \"//! Using https://doc.rust-lang.org/book/ch17-02-trait-objects.html\\n\\n\\n\\npub type BlockedDamages = f32;\\n\\npub type RawDamages = f32;\\n\\npub type ArmorRating = f32;\\n\\n\\n\\n//\\n\",\n \"file_path\": \"examples/rpg_engine/src/item.rs\",\n \"rank\": 71,\n \"score\": 12.534888898357934\n },\n {\n \"content\": \"mod character;\\n\\nmod dice;\\n\\nmod fight;\\n\\nmod item;\\n\\nmod stuff;\\n\\n\\n\\npub mod prelude {\\n\\n pub use crate::{character::*, dice::*, fight::*, item::*, stuff::*};\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n #[test]\\n\\n fn it_works() {\\n\\n let result = 2 + 2;\\n\\n assert_eq!(result, 4);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"examples/rpg_engine/src/lib.rs\",\n \"rank\": 72,\n \"score\": 11.379415293550467\n },\n {\n \"content\": \" second_fight_winner.name().bold(),\\n\\n );\\n\\n\\n\\n println!(\\n\\n \\\"{} has {} HP\\\",\\n\\n first_fight_winner.name().bold(),\\n\\n first_fight_winner.health().to_string().green().bold(),\\n\\n );\\n\\n println!(\\n\\n \\\"{} has {} HP\\\",\\n\\n second_fight_winner.name().bold(),\\n\\n second_fight_winner.health().to_string().green().bold(),\\n\\n );\\n\\n println!();\\n\\n\\n\\n // Use the stuff bellow to make it work sequential\\n\\n //first_fight.join().unwrap();\\n\\n //second_fight.join().unwrap();\\n\\n let final_winner = Fight::new(first_fight_winner, second_fight_winner).resolve();\\n\\n\\n\\n println!(\\n\\n \\\"The best fighter is : {}\\\",\\n\\n final_winner.name().yellow().bold()\\n\\n );\\n\\n\\n\\n #[cfg(feature = \\\"song\\\")]\\n\\n add_song();\\n\\n}\\n\",\n \"file_path\": \"examples/rpg_engine/examples/multiple_fights/src/main.rs\",\n \"rank\": 73,\n \"score\": 10.538656947484998\n },\n {\n \"content\": \"#Todo\\n\\n\\n\\n- [ ] Clean up deprecated methods\\n\\n- [ ] Add proper documentation\\n\\n- [ ] Refactor with unit testing\\n\\n- [ ] Display weapons name during blocking and attacks ( need to refactor stuff and character)\\n\\n\\n\",\n \"file_path\": \"examples/rpg_engine/README.md\",\n \"rank\": 74,\n \"score\": 10.407641373020102\n },\n {\n \"content\": \" self.display_results(TurnStep::ResultBlocking {\\n\\n succeed: false,\\n\\n blocked_damage: damage,\\n\\n });\\n\\n None\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn resolve_damages(&mut self, hit_damage: RawDamages) {\\n\\n let result = self.defender.gets_hit(hit_damage);\\n\\n self.display_results(TurnStep::DamagesTaken { damages: result })\\n\\n }\\n\\n\\n\\n pub fn resolve_winner_and_loser(&self) -> Option<(Character, Character)> {\\n\\n if self.defender.get_health_status() == HealthStatus::Dead {\\n\\n self.display_results(TurnStep::EndFight);\\n\\n Some((self.attacker.clone(), self.defender.clone()))\\n\\n } else {\\n\\n None\\n\\n }\\n\",\n \"file_path\": \"examples/rpg_engine/src/fight/turn.rs\",\n \"rank\": 75,\n \"score\": 10.033820597516613\n },\n {\n \"content\": \"use colored::*;\\n\\nuse rpg_engine::prelude::*;\\n\\nuse std::sync::mpsc;\\n\\nuse std::thread;\\n\\nuse std::time::Duration;\\n\\n\\n\\n#[cfg(feature = \\\"song\\\")]\\n\",\n \"file_path\": \"examples/rpg_engine/examples/multiple_fights/src/main.rs\",\n \"rank\": 76,\n \"score\": 9.431958741895507\n },\n {\n \"content\": \" let white_run_guard = Character::new(\\\"Olaf the dummy guard\\\", 300.00)\\n\\n .grab_weapon(steel_shield) // <- we can do it because of generic + trait objects for weapon\\n\\n .grab_weapon(iron_long_sword)\\n\\n .grab_armor(daedric_armor_2);\\n\\n\\n\\n let lydia = Character::new(\\\"Lydia\\\", 300.0)\\n\\n .grab_weapon(daedric_battle_axe)\\n\\n .grab_armor(iron_plate);\\n\\n\\n\\n let braith = Character::new(\\\"Braith\\\", 100.0).grab_weapon(RegularWeapon::default());\\n\\n\\n\\n let dovahkiin = Character::new(\\\"Dovahkiin\\\", 1500.0)\\n\\n .grab_weapon(steel_long_sword)\\n\\n .grab_weapon(iron_shield);\\n\\n\\n\\n let (tx_1, rx_1) = mpsc::channel();\\n\\n\\n\\n // This is OS native Thread\\n\\n let _ = thread::spawn(move || {\\n\\n let winner = Fight::new(white_run_guard, grand_ma_skyrim).resolve();\\n\",\n \"file_path\": \"examples/rpg_engine/examples/multiple_fights/src/main.rs\",\n \"rank\": 77,\n \"score\": 9.218139295485066\n },\n {\n \"content\": \" }\\n\\n\\n\\n /// Should use string template make unit test.\\n\\n /// Displays specific message for a particular step during the turn.\\n\\n fn display_results(&self, turn_step: TurnStep) {\\n\\n let attacker_name = &self.attacker.name();\\n\\n let defender_name = &self.defender.name();\\n\\n match turn_step {\\n\\n TurnStep::Initiative => {\\n\\n println!(\\n\\n \\\"{} will attack and {} will defend\\\",\\n\\n attacker_name.bold(),\\n\\n defender_name.bold()\\n\\n );\\n\\n }\\n\\n TurnStep::Attack => {\\n\\n println!(\\n\\n \\\"{} {} {} {} attack\\\",\\n\\n defender_name.bold(),\\n\\n \\\"failed\\\".red(),\\n\",\n \"file_path\": \"examples/rpg_engine/src/fight/turn.rs\",\n \"rank\": 78,\n \"score\": 9.016343295075039\n },\n {\n \"content\": \" turn\\n\\n }\\n\\n\\n\\n pub fn resolve_attack_defense(&self) -> Option<(u8, RawDamages)> {\\n\\n let attack = self.attacker.roll_dice(SkillDice::Attack);\\n\\n let dodge = self.defender.roll_dice(SkillDice::Dodge);\\n\\n\\n\\n if dodge > attack {\\n\\n self.display_results(TurnStep::Dodge);\\n\\n None\\n\\n } else {\\n\\n self.display_results(TurnStep::Attack);\\n\\n Some((attack, self.attacker.deal_damages()))\\n\\n }\\n\\n }\\n\\n\\n\\n /// Roll dice and display message for success or fail .\\n\\n /// And return update damages.\\n\\n pub fn resolve_blocking(\\n\\n &mut self,\\n\",\n \"file_path\": \"examples/rpg_engine/src/fight/turn.rs\",\n \"rank\": 79,\n \"score\": 8.94926610779768\n },\n {\n \"content\": \" if def.is_some() {\\n\\n println!(\\\"{} tries to block {}\\\", defender.name(), attacker.name());\\n\\n }\\n\\n defender.get_attacked_by(damage, attack, def);\\n\\n }\\n\\n\\n\\n if defender.get_health_status() == HealthStatus::Dead {\\n\\n self.winner_name = Some(attacker.name().to_string());\\n\\n\\n\\n println!(\\\"{} is dead :((((((((\\\", defender.name());\\n\\n println!(\\n\\n \\\"{} won the fight and has {} hp left <3 !!!!!!!!!!!!!!!\\\",\\n\\n attacker.name(),\\n\\n attacker.health()\\n\\n );\\n\\n\\n\\n println!(\\\" -------------- Game statistics -------------- \\\");\\n\\n\\n\\n println!(\\\"Fight finished after {} rounds\\\", self.round);\\n\\n\\n\",\n \"file_path\": \"examples/rpg_engine/src/fight/mod.rs\",\n \"rank\": 80,\n \"score\": 8.7353747527976\n },\n {\n \"content\": \" .grab_armor(daedric_armor);\\n\\n\\n\\n let white_run_guard = Character::new(\\\"Olaf the dummy guard\\\", 300.00)\\n\\n .grab_weapon(steel_shield) // <- we can do it because of generic + trait objects for weapon\\n\\n .grab_weapon(iron_long_sword)\\n\\n .grab_armor(daedric_armor_2);\\n\\n\\n\\n Fight::new(white_run_guard, grand_ma_skyrim).start();\\n\\n}\\n\\n\\n\\n//https://en.uesp.net/wiki/Skyrim:Block#Defensive_Blocking\\n\",\n \"file_path\": \"examples/rpg_engine/examples/simple_fight/src/main.rs\",\n \"rank\": 81,\n \"score\": 8.40862572041224\n },\n {\n \"content\": \" println!(\\n\\n \\\" {} has attacked {} times \\\",\\n\\n loser_name.bold(),\\n\\n loser_nb_attacks.to_string().underline()\\n\\n );\\n\\n println!(\\n\\n \\\" {} has attacked {} times \\\",\\n\\n winner_name.bold(),\\n\\n winner_nb_attacks.to_string().underline()\\n\\n );\\n\\n println!()\\n\\n }\\n\\n _ => {\\n\\n panic!(\\\"Cannot display statistics because winner and loser are not resolved\\\")\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n /// Consume the tuple to return a new one with attacker and then defender.\\n\\n fn resolve_initiative(&self) -> (Character, Character) {\\n\",\n \"file_path\": \"examples/rpg_engine/src/fight/mod.rs\",\n \"rank\": 82,\n \"score\": 8.399227831661705\n },\n {\n \"content\": \" \\\"{} {} the fight and has {} hp left <3 !!!!!!!!!!!!!!!\\\",\\n\\n &self.attacker.name().bold(),\\n\\n \\\"won\\\".yellow().bold(),\\n\\n &self.attacker.health().to_string().green().bold()\\n\\n );\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\npub enum TurnStep {\\n\\n Initiative,\\n\\n Attack,\\n\\n Dodge,\\n\\n TryBlocking,\\n\\n ResultBlocking {\\n\\n blocked_damage: BlockedDamages,\\n\\n succeed: bool,\\n\\n },\\n\\n\\n\\n DamagesTaken {\\n\\n damages: BlockedDamages,\\n\\n },\\n\\n EndFight,\\n\\n}\\n\",\n \"file_path\": \"examples/rpg_engine/src/fight/turn.rs\",\n \"rank\": 83,\n \"score\": 8.267331515020086\n },\n {\n \"content\": \"use caith::Roller;\\n\\nuse colored::*;\\n\\n\\n\",\n \"file_path\": \"examples/rpg_engine/src/dice.rs\",\n \"rank\": 84,\n \"score\": 7.275035964842725\n },\n {\n \"content\": \" turn.resolve_damages(hit_damage);\\n\\n\\n\\n if let Some((winner, loser)) = turn.resolve_winner_and_loser() {\\n\\n self.winner_name = Some(winner.name().to_string());\\n\\n self.winner = Some(winner);\\n\\n self.loser = Some(loser);\\n\\n self.show_statistics()\\n\\n }\\n\\n }\\n\\n // We cloned them in the first place so we need to have then.\\n\\n self.update_opponents(turn.attacker, turn.defender);\\n\\n }\\n\\n\\n\\n self.winner.unwrap()\\n\\n }\\n\\n\\n\\n /// Update the stored value with new ones.\\n\\n fn update_opponents(&mut self, fighter_1: Character, fighter_2: Character) {\\n\\n self.opponents = (fighter_1, fighter_2);\\n\\n }\\n\",\n \"file_path\": \"examples/rpg_engine/src/fight/mod.rs\",\n \"rank\": 85,\n \"score\": 7.017003959104473\n },\n {\n \"content\": \"#### Resume\\n\\n\\n\\nPros :\\n\\n- Rules to write and read are easy \\n\\n- No extra syntax for these rules ( like Malloc or delete)\\n\\n- Everything is actually automated ( not need to delete object or do memory stuff on basic levels)\\n\\n- The Compiler checks everything for you\\n\\n- No need to think about technical detail so you can focus on business logic.\\n\\n\\n\\nCons : \\n\\n- Redefine the way you write code because you need to turn upside down your brain\\n\\n- You will hate the compiler\\n\\n- Get addicted to the safety\\n\\n\\n\\n\\n\\nIs memory safety solved?\\n\\n\\n\\n[There are bugs](https://github.com/Artisan-Lab/Rust-memory-safety-bugs)\\n\\nYou can do manual [memory management](https://stackoverflow.com/questions/48485454/rust-manual-memory-management) if you want in Unsafe mode\\n\\n\\n\\n\\n\\n\\n\\n---\\n\\n\\n\\n### Traits\\n\\n \\n\\n[Inheritance vs trait compositions](https://en.wikipedia.org/wiki/Composition_over_inheritance#)\\n\\n\\n\\n- Useful to have for objects that share specific behaviors\\n\\n\\n\\n- Flexible and allow having many types handled together\\n\\n\\n\\n- Can be understood as `interfaces` in some other languages\\n\\n\\n\\n##### Examples\\n\\n\\n\\nGot the idea to simulate the weapons system from Skyrim and how damages are dealt based on the stuff\\n\\n\\n\\nhttps://en.uesp.net/wiki/Skyrim:Block#Defensive_Blocking\\n\\n\\n\\n####### 1 - How to define weapons and armor\\n\\n\\n\\n####### 2 - How to define a character\\n\\n\\n\\n####### 3 - How to define a *fight*\\n\\n\\n\\n\\n\\nAs you will see , I took some freedom from their documentation for the calculation.\\n\\n\\n\\nNB :\\n\\n- Mainly kept the rules for blocking for dual_wielding, two hands weapons, shield + single weapon and one single weapon only.\\n\\n\\n\\n- Coding with the flow, no much thinking because I had tons of fun\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 86,\n \"score\": 6.502073286311116\n },\n {\n \"content\": \" fn get_long_iron_sword() -> RegularWeapon {\\n\\n RegularWeapon::new(\\\"Long Iron Sword\\\", 25.0, HandheldType::SingleHand)\\n\\n }\\n\\n fn get_long_steel_sword() -> RegularWeapon {\\n\\n RegularWeapon::new(\\\"Long Steel Sword\\\", 30.0, HandheldType::SingleHand)\\n\\n }\\n\\n fn get_steel_battle_axe() -> RegularWeapon {\\n\\n RegularWeapon::new(\\\"Steal battle Axe\\\", 65.0, HandheldType::TwoHands)\\n\\n }\\n\\n\\n\\n fn get_iron_shield() -> Shield {\\n\\n Shield::new(\\\"Iron Shield\\\", 25.0, 5.0)\\n\\n }\\n\\n\\n\\n fn get_steel_shield() -> Shield {\\n\\n Shield::new(\\\"Steel Shield\\\", 35.0, 7.0)\\n\\n }\\n\\n\\n\\n fn get_daedric_mail() -> BodyArmor {\\n\\n BodyArmor::new(\\\"Daedric Shield\\\", 45.0)\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn start() {\\n\\n let winner = Fight::new(get_test_player(\\\"player 1\\\"), get_test_player(\\\"player 2\\\")).resolve();\\n\\n assert_eq!(winner.name(), \\\"player 1\\\");\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"examples/rpg_engine/src/fight/mod.rs\",\n \"rank\": 87,\n \"score\": 6.428571246907883\n },\n {\n \"content\": \" let update = &mut new_facebook; // Can only make a single mutable reference.\\n\\n\\n\\n // display_data(&new_facebook); Cannot read while writing 😁\\n\\n // let update2 = &mut new_facebook; throw error here because we can only have mutable reference at the same time.\\n\\n update.name = \\\"Facebook 3.0\\\".to_string();\\n\\n println!(\\\"{} is an awesome name.\\\", new_facebook.name);\\n\\n\\n\\n let update2 = &mut new_facebook;\\n\\n update2.name = \\\"Facebook 4.0\\\".to_string();\\n\\n\\n\\n // <- Update name without taking ownership with function\\n\\n update_name(&mut new_facebook, \\\"Facebook 3000\\\");\\n\\n println!(\\\"{} is an awesome name.\\\", new_facebook.name);\\n\\n}\\n\\n\\n\\n```\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 88,\n \"score\": 6.195187220963151\n },\n {\n \"content\": \" println!(\\\"{} will defend \\\", defender_name);\\n\\n\\n\\n // Attack & Dodge dice roll.\\n\\n let attack = attacker.roll_dice(SkillDice::Attack);\\n\\n\\n\\n let dodge = defender.roll_dice(SkillDice::Dodge);\\n\\n\\n\\n if dodge > attack {\\n\\n println!(\\n\\n \\\"{} dodged {}'s attack successfully\\\",\\n\\n defender.name(),\\n\\n attacker.name()\\n\\n );\\n\\n } else {\\n\\n let damage = attacker.deal_damages();\\n\\n // Block dice roll.\\n\\n let def = defender\\n\\n .can_block()\\n\\n .map(|_| defender.roll_dice(SkillDice::Blocking));\\n\\n\\n\",\n \"file_path\": \"examples/rpg_engine/src/fight/mod.rs\",\n \"rank\": 89,\n \"score\": 6.115103233525856\n },\n {\n \"content\": \"\\n\\n TurnStep::ResultBlocking {\\n\\n blocked_damage,\\n\\n succeed,\\n\\n } => {\\n\\n if succeed {\\n\\n println!(\\n\\n \\\"{} {} {} {} damages from {}\\\",\\n\\n defender_name.bold(),\\n\\n \\\"succeed\\\".green(),\\n\\n \\\"to block\\\".underline(),\\n\\n blocked_damage.to_string().red(),\\n\\n attacker_name.bold()\\n\\n );\\n\\n } else {\\n\\n println!(\\n\\n \\\"{} {} to block {} from {}\\\",\\n\\n defender_name.bold(),\\n\\n \\\"failed\\\".red(),\\n\\n blocked_damage.to_string().red(),\\n\",\n \"file_path\": \"examples/rpg_engine/src/fight/turn.rs\",\n \"rank\": 90,\n \"score\": 6.074534202815084\n },\n {\n \"content\": \"##### Resume\\n\\n\\n\\nPros: \\n\\n- We can make many object with different types and handle them as long as they have the behavior we need.\\n\\n- Can make default behavior\\n\\n- We can store objects without specific type as long as their size is safe = we know their size at compile time\\n\\n- Everything is always checked by our lovely compiler\\n\\n- Can back up stuff with unit-test\\n\\n\\n\\nCons:\\n\\n- Require some training to understand Generics and trait object \\n\\n- Need to use specific new pointer like Rc/Arc for advanced stuff\\n\\n- The compiler will be painful with you\\n\\n\\n\\n\\n\\n\\n\\n---\\n\\n\\n\\n### Conditional compilation\\n\\n\\n\\nWell, you can decide what to compile or not 😁\\n\\n\\n\\n\\n\\n##### Example\\n\\n\\n\\n\\n\\n- Running tests\\n\\n\\n\\n```rust\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n \\n\\n // --- unit test \\n\\n}\\n\\n\\n\\n```\\n\\n\\n\\n`cargo test`\\n\\n\\n\\nThe command will compile unit test and run them.\\n\\n\\n\\n\\n\\n- Having specific features\\n\\n\\n\\nIn cargo.toml\\n\\n\\n\\n```toml\\n\\n[features]\\n\\nsong=[]\\n\\n```\\n\\n\\n\\nNow in your code\\n\\n\\n\\n```rust\\n\\n#[cfg(feature = \\\"song\\\")]\\n\\nfn add_song() {\\n\\n println!(\\\"Here is the song of the Dovakin\\\")\\n\\n}\\n\\n```\\n\\n\\n\\n\\n\\nWe add the function in main as well 😁\\n\\n\\n\\n```rust\\n\\nfn main() {\\n\\n // ------ Rest of the code\\n\\n #[cfg(feature = \\\"song\\\")]\\n\\n add_song();\\n\\n}\\n\\n```\\n\\n\\n\\n\\n\\nHow to run :\\n\\n\\n\\n\\n\\n`cargo run --features song`\\n\\n\\n\\n##### Resume\\n\\n\\n\\nPros:\\n\\n- You decide what you want to compile\\n\\n- Super useful to reduce the size of your package and use only what you need\\n\\n\\n\\nCons:\\n\\n- Use strings, so little helping from the IDE ( just a bit still 😁)\\n\\n\\n\\nGood example to use for this is [web_sys](https://docs.rs/web-sys/0.3.56/web_sys/) library as bridge between Rust and the Web\\n\\n\\n\\n\\n\\n\\n\\n---\\n\\n\\n\\n### Multithreading\\n\\n\\n\\n\\n\\n[Multiple concurrency models](https://rust-lang.github.io/async-book/01_getting_started/02_why_async.html)\\n\\n\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 91,\n \"score\": 5.865647245274372\n },\n {\n \"content\": \" println!(\\\"{} is an awesome name.\\\", facebook.name);\\n\\n\\n\\n // <-- we move `facebook` inside the scope of the `rebuild_business` function so we cannot access it anymore .\\n\\n let mut new_facebook = rebuild_business(facebook);\\n\\n\\n\\n // println!(\\\"{} is still alive ?\\\", facebook.name); <-- get moved error value\\n\\n display_data(&new_facebook);\\n\\n\\n\\n let update = &mut new_facebook; // Can only make a single mutable reference.\\n\\n // let update2 = &mut new_facebook; throw error here\\n\\n // display_data(&new_facebook); Cannot read while writing :D\\n\\n update.name = \\\"Facebook 3.0\\\".to_string();\\n\\n println!(\\\"{} is an awesome name.\\\", new_facebook.name);\\n\\n\\n\\n let update2 = &mut new_facebook;\\n\\n update2.name = \\\"Facebook 4.0\\\".to_string();\\n\\n\\n\\n update_name(&mut new_facebook, \\\"Facebook 3000\\\");\\n\\n\\n\\n println!(\\\"{} is an awesome name.\\\", new_facebook.name);\\n\\n}\\n\",\n \"file_path\": \"examples/ownership/src/main.rs\",\n \"rank\": 92,\n \"score\": 5.685136821234227\n },\n {\n \"content\": \" attacker_name.bold(),\\n\\n );\\n\\n }\\n\\n }\\n\\n TurnStep::DamagesTaken { damages } => {\\n\\n println!(\\n\\n \\\"{} deals {} {} to {}\\\",\\n\\n attacker_name.bold(),\\n\\n damages.to_string().red(),\\n\\n \\\"damages\\\".red(),\\n\\n defender_name.bold()\\n\\n );\\n\\n }\\n\\n TurnStep::EndFight => {\\n\\n println!(\\n\\n \\\"{} is {} :((((((((\\\",\\n\\n &self.defender.name().bold(),\\n\\n \\\"dead\\\".red().bold()\\n\\n );\\n\\n println!(\\n\",\n \"file_path\": \"examples/rpg_engine/src/fight/turn.rs\",\n \"rank\": 93,\n \"score\": 5.625404358145826\n },\n {\n \"content\": \"\\n\\n /// SHow simple statistics.\\n\\n fn show_statistics(&self) {\\n\\n println!(\\\" -------------- Game statistics -------------- \\\");\\n\\n\\n\\n println!(\\\"Fight finished after {} rounds\\\", self.round);\\n\\n\\n\\n match (&self.winner, &self.loser) {\\n\\n (Some(winner), Some(loser)) => {\\n\\n let loser_name = loser.name();\\n\\n let winner_name = winner.name();\\n\\n\\n\\n let loser_nb_attacks = self\\n\\n .attack_counting\\n\\n .get(loser_name)\\n\\n .expect(\\\"Should have gotten winner attack number\\\");\\n\\n let winner_nb_attacks = self\\n\\n .attack_counting\\n\\n .get(winner_name)\\n\\n .expect(\\\"Should have gotten loser attack number\\\");\\n\",\n \"file_path\": \"examples/rpg_engine/src/fight/mod.rs\",\n \"rank\": 94,\n \"score\": 5.382219718086269\n },\n {\n \"content\": \"char const* info_compiler = \\\"INFO\\\" \\\":\\\" \\\"compiler[\\\" COMPILER_ID \\\"]\\\";\\n\",\n \"file_path\": \"examples/cpp_allocation/cmake-build-debug/CMakeFiles/3.17.5/CompilerIdC/CMakeCCompilerId.c\",\n \"rank\": 95,\n \"score\": 4.936975027519667\n },\n {\n \"content\": \"char const* info_platform = \\\"INFO\\\" \\\":\\\" \\\"platform[\\\" PLATFORM_ID \\\"]\\\";\\n\",\n \"file_path\": \"examples/cpp_allocation/cmake-build-debug/CMakeFiles/3.17.5/CompilerIdC/CMakeCCompilerId.c\",\n \"rank\": 96,\n \"score\": 4.936975027519667\n },\n {\n \"content\": \" tx_1.send(winner)\\n\\n .expect(\\\"Should have passed the resolved winner\\\");\\n\\n });\\n\\n\\n\\n let (tx_2, rx_2) = mpsc::channel();\\n\\n\\n\\n // This is OS native Thread\\n\\n let _ = thread::spawn(move || {\\n\\n let winner = Fight::new(lydia, dovahkiin).resolve();\\n\\n tx_2.send(winner)\\n\\n .expect(\\\"Should have passed the resolved winner\\\");\\n\\n });\\n\\n\\n\\n let second_fight_winner = rx_2.recv().expect(\\\"Should have receive the winner\\\");\\n\\n let first_fight_winner = rx_1.recv().expect(\\\"Should have receive the winner\\\");\\n\\n\\n\\n println!(\\\"----------------- Final Fight ----------------- \\\");\\n\\n println!(\\n\\n \\\"{} and {} will fight until only one survive\\\",\\n\\n first_fight_winner.name().bold(),\\n\",\n \"file_path\": \"examples/rpg_engine/examples/multiple_fights/src/main.rs\",\n \"rank\": 97,\n \"score\": 4.177714987534773\n },\n {\n \"content\": \"##### Example\\n\\n\\n\\nLet's make 2 fights simultaneously and take the winner for the last one.\\n\\n\\n\\n\\n\\n```rust\\n\\n\\n\\n // ----- Rest of the Code\\n\\n\\n\\n let (tx_1, rx_1) = mpsc::channel();\\n\\n // This is OS native Thread\\n\\n let _ = thread::spawn(move || {\\n\\n let winner = Fight::new(white_run_guard, grand_ma_skyrim).resolve();\\n\\n tx_1.send(winner)\\n\\n .expect(\\\"Should have passed the resolved winner\\\");\\n\\n });\\n\\n\\n\\n let (tx_2, rx_2) = mpsc::channel();\\n\\n\\n\\n // This is OS native Thread\\n\\n let _ = thread::spawn(move || {\\n\\n let winner = Fight::new(lydia, dovakin).resolve();\\n\\n tx_2.send(winner)\\n\\n .expect(\\\"Should have passed the resolved winner\\\");\\n\\n });\\n\\n\\n\\n let second_fight_winner = rx_2.recv().expect(\\\"Should have receive the winner\\\");\\n\\n let first_fight_winner = rx_1.recv().expect(\\\"Should have receive the winner\\\");\\n\\n\\n\\n let final_winner = Fight::new(first_fight_winner, second_fight_winner).resolve();\\n\\n\\n\\n println!(\\\"The best fighter is : {}\\\", final_winner.name());\\n\\n\\n\\n```\\n\\n\\n\\n\\n\\nWorks like a charm. \\n\\nOf Course if my business logic sucks, then it won't work as expected, but that is not the compiler responsibility.\\n\\nBut unit-test are there for it 😁\\n\\n\\n\\n##### Resume\\n\\n\\n\\nPros:\\n\\n- Took me 5 minutes to make it work\\n\\n- No runtime bugs, if you do something wrong, the compiler will tell you 😁\\n\\n- You can make it simple and easy to understand\\n\\n\\n\\nCons:\\n\\n- The compiler complained about the Type for Stuff because I needed to add trait bounds to ensure the code was safe ( but the compiler told me again soo 😀)\\n\\n- Need to think the specific pointer you use such as Rc vs Arc ( but again the compiler helps with that )\\n\\n\\n\\n\\n\\n\\n\\n---\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 98,\n \"score\": 4.00094022876374\n },\n {\n \"content\": \" \\\"to dodge\\\".underline(),\\n\\n attacker_name.bold(),\\n\\n );\\n\\n }\\n\\n\\n\\n TurnStep::Dodge => {\\n\\n println!(\\n\\n \\\"{} dodged {} attack {}\\\",\\n\\n defender_name.bold(),\\n\\n attacker_name.bold(),\\n\\n \\\"successfully\\\".green()\\n\\n );\\n\\n }\\n\\n TurnStep::TryBlocking => {\\n\\n println!(\\n\\n \\\"{} tries to block {}\\\",\\n\\n defender_name.bold(),\\n\\n attacker_name.bold()\\n\\n );\\n\\n }\\n\",\n \"file_path\": \"examples/rpg_engine/src/fight/turn.rs\",\n \"rank\": 99,\n \"score\": 3.664106738120457\n }\n]","isConversational":false}}},{"rowIdx":1383,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/bin/roughenough-kms.rs"},"repo_name":{"kind":"string","value":"lachesis/roughenough"},"commit":{"kind":"string","value":"a5e29a47646cc57bdd8e3603818cc9bd46f81bfc"},"file_code":{"kind":"string","value":"\n\n#[macro_use]\nextern crate log;\n\nuse clap::{App, Arg};\nuse data_encoding::{Encoding, HEXLOWER_PERMISSIVE};\nuse log::LevelFilter;\nuse simple_logger::SimpleLogger;\n\n#[allow(unused_imports)]\nuse roughenough::kms::{EnvelopeEncryption, KmsProvider};\nuse roughenough::roughenough_version;\n\nconst HEX: Encoding = HEXLOWER_PERMISSIVE;\n\n#[cfg(not(any(feature = \"awskms\", feature = \"gcpkms\")))]\nfn encrypt_seed(_: &str, _: &str) {\n \n unreachable!()\n}\n\n#[cfg(any(feature = \"awskms\", feature = \"gcpkms\"))]\nfn encrypt_seed(kms_key: &str, hex_seed: &str) {\n let kms_client = get_kms(kms_key);\n\n let plaintext_seed = HEX.decode(hex_seed.as_ref()).expect(\"Error decoding hex seed value\");\n\n if plaintext_seed.len() != 32 {\n panic!(\n \"Seed must be 32 bytes long; provided seed is {}\",\n plaintext_seed.len()\n );\n }\n\n match EnvelopeEncryption::encrypt_seed(&kms_client, &plaintext_seed) {\n Ok(encrypted_blob) => {\n println!(\"kms_protection: \\\"{}\\\"\", kms_key);\n println!(\"seed: {}\", HEX.encode(&encrypted_blob));\n }\n Err(e) => {\n error!(\"Error: {:?}\", e);\n }\n }\n}\n\n#[cfg(not(any(feature = \"awskms\", feature = \"gcpkms\")))]\nfn decrypt_blob(_: &str, _: &str) {\n \n unreachable!()\n}\n\n#[cfg(any(feature = \"awskms\", feature = \"gcpkms\"))]\nfn decrypt_blob(kms_key: &str, hex_blob: &str) {\n let kms_client = get_kms(kms_key);\n let ciphertext = HEX.decode(hex_blob.as_ref()).expect(\"Error decoding hex blob value\");\n\n match EnvelopeEncryption::decrypt_seed(&kms_client, ciphertext.as_ref()) {\n Ok(plaintext) => {\n println!(\"{}\", HEX.encode(&plaintext));\n }\n Err(e) => {\n error!(\"Error: {:?}\", e);\n }\n }\n}\n\n#[cfg(feature = \"awskms\")]\nfn get_kms(kms_key: &str) -> impl KmsProvider {\n use roughenough::kms::AwsKms;\n AwsKms::from_arn(kms_key).unwrap()\n}\n\n#[cfg(feature = \"gcpkms\")]\nfn get_kms(kms_key: &str) -> impl KmsProvider {\n use roughenough::kms::GcpKms;\n GcpKms::from_resource_id(kms_key).unwrap()\n}\n\n#[allow(unused_variables)]\npub fn main() {\n SimpleLogger::new()\n .with_level(LevelFilter::Info)\n .init()\n .unwrap();\n\n if !(cfg!(feature = \"gcpkms\") || cfg!(feature = \"awskms\")) {\n warn!(\"KMS support was not compiled into this build; nothing to do.\");\n warn!(\"See the Roughenough documentation for information on KMS support.\");\n warn!(\" https://github.com/int08h/roughenough/blob/master/doc/OPTIONAL-FEATURES.md\");\n return;\n }\n\n let matches = App::new(\"roughenough-kms\")\n .version(roughenough_version().as_ref())\n .long_about(\"Encrypt and decrypt Roughenough long-term server seeds using a KMS\")\n .arg(\n Arg::with_name(\"KEY_ID\")\n .short(\"k\")\n .long(\"kms-key\")\n .takes_value(true)\n .required(true)\n .help(\"Identity of the KMS key to be used\"),\n )\n .arg(\n Arg::with_name(\"DECRYPT\")\n .short(\"d\")\n .long(\"decrypt\")\n .takes_value(true)\n .required(false)\n .help(\"Previously encrypted blob to decrypt to plaintext\"),\n )\n .arg(\n Arg::with_name(\"SEED\")\n .short(\"s\")\n .long(\"seed\")\n .takes_value(true)\n .required(false)\n .help(\"32 byte hex seed for the server's long-term identity\"),\n )\n .get_matches();\n\n let kms_key = matches.value_of(\"KEY_ID\").expect(\"Invalid KMS key id\");\n\n if matches.is_present(\"SEED\") {\n let hex_seed = matches.value_of(\"SEED\").expect(\"Invalid seed value\");\n encrypt_seed(kms_key, hex_seed);\n } else if matches.is_present(\"DECRYPT\") {\n let hex_blob = matches.value_of(\"DECRYPT\").expect(\"Invalid blob value\");\n decrypt_blob(kms_key, hex_blob);\n } else {\n error!(\"Neither seed encryption (-s) or blob decryption (-d) was specified.\");\n error!(\"One of them is required.\");\n }\n}\n"},"prefix":{"kind":"string","value":"\n\n#[macro_use]\nextern crate log;\n\nuse clap::{App, Arg};\nuse data_encoding::{Encoding, HEXLOWER_PERMISSIVE};\nuse log::LevelFilter;\nuse simple_logger::SimpleLogger;\n\n#[allow(unused_imports)]\nuse roughenough::kms::{EnvelopeEncryption, KmsProvider};\nuse roughenough::roughenough_version;\n\nconst HEX: Encoding = HEXLOWER_PERMISSIVE;\n\n#[cfg(not(any(feature = \"awskms\", feature = \"gcpkms\")))]\nfn encrypt_seed(_: &str, _: &str) {\n \n unreachable!()\n}\n\n#[cfg(any(feature = \"awskms\", feature = \"gcpkms\"))]\nfn encrypt_seed(kms_key: &str, hex_seed: &str) {\n let kms_client = get_kms(kms_key);\n\n let plaintext_seed = HEX.decode(hex_seed.as_ref()).expect(\"Error decoding hex seed value\");\n\n if plaintext_seed.len() != 32 {\n panic!(\n \"Seed must be 32 bytes long; provided seed is {}\",\n plaintext_seed.len()\n );\n }\n\n match EnvelopeEncryption::encrypt_seed(&kms_client, &plaintext_seed) {\n Ok(encrypted_blob) => {\n println!(\"kms_protection: \\\"{}\\\"\", kms_key);\n println!(\"seed: {}\", HEX.encode(&encrypted_blob));\n }\n Err(e) => {\n error!(\"Error: {:?}\", e);\n }\n }\n}\n\n#[cfg(not(any(feature = \"awskms\", feature = \"gcpkms\")))]\nfn decrypt_blob(_: &str, _: &str) {\n \n unreachable!()\n}\n\n#[cfg(any(feature = \"awskms\", feature = \"gcpkms\"))]\nfn decrypt_blob(kms_key: &str, hex_blob: &str) {\n let kms_client = get_kms(kms_key);\n let ciphertext = HEX.decode(hex_blob.as_ref()).expect(\"Error decoding hex blob value\");\n\n match EnvelopeEncryption::decrypt_seed(&kms_client, ciphertext.as_ref()) {\n Ok(plaintext) => {\n println!(\"{}\", HEX.encode(&plaintext));\n }\n Err(e) => {\n error!(\"Error: {:?}\", e);\n }\n }\n}\n\n#[cfg(feature = \"awskms\")]\nfn get_kms(kms_key: &str) -> impl KmsProvider {\n use roughenough::kms::AwsKms;\n AwsKms::from_arn(kms_key).unwrap()\n}\n\n#[cfg(feature = \"gcpkms\")]\nfn get_kms(kms_key: &str) -> impl KmsProvider {\n use roughenough::kms::GcpKms;\n GcpKms::from_resource_id(kms_key).unwrap()\n}\n\n#[allow(unused_variables)]\npub fn main() {\n SimpleLogger::new()\n .with_level(LevelFilter::Info)\n .init()\n .unwrap();\n\n if !(cfg!(feature = \"gcpkms\") || cfg!(feature = \"awskms\")) {\n warn!(\"KMS support was not compiled into this build; nothing to do.\");\n warn!(\"See the Roughenough documentation for information on KMS support.\");\n warn!(\" https://github.com/int08h/roughenough/blob/master/doc/OPTIONAL-FEATURES.md\");\n return;\n }\n\n "},"suffix":{"kind":"string","value":"\n\n let kms_key = matches.value_of(\"KEY_ID\").expect(\"Invalid KMS key id\");\n\n if matches.is_present(\"SEED\") {\n let hex_seed = matches.value_of(\"SEED\").expect(\"Invalid seed value\");\n encrypt_seed(kms_key, hex_seed);\n } else if matches.is_present(\"DECRYPT\") {\n let hex_blob = matches.value_of(\"DECRYPT\").expect(\"Invalid blob value\");\n decrypt_blob(kms_key, hex_blob);\n } else {\n error!(\"Neither seed encryption (-s) or blob decryption (-d) was specified.\");\n error!(\"One of them is required.\");\n }\n}\n"},"middle":{"kind":"string","value":"let matches = App::new(\"roughenough-kms\")\n .version(roughenough_version().as_ref())\n .long_about(\"Encrypt and decrypt Roughenough long-term server seeds using a KMS\")\n .arg(\n Arg::with_name(\"KEY_ID\")\n .short(\"k\")\n .long(\"kms-key\")\n .takes_value(true)\n .required(true)\n .help(\"Identity of the KMS key to be used\"),\n )\n .arg(\n Arg::with_name(\"DECRYPT\")\n .short(\"d\")\n .long(\"decrypt\")\n .takes_value(true)\n .required(false)\n .help(\"Previously encrypted blob to decrypt to plaintext\"),\n )\n .arg(\n Arg::with_name(\"SEED\")\n .short(\"s\")\n .long(\"seed\")\n .takes_value(true)\n .required(false)\n .help(\"32 byte hex seed for the server's long-term identity\"),\n )\n .get_matches();"},"strategy":{"kind":"string","value":"assignment_statement"},"context_items":{"kind":"list like","value":[{"content":"/// Factory function to create a `ServerConfig` _trait object_ based on the value\n\n/// of the provided `arg`.\n\n///\n\n/// * `ENV` will return an [`EnvironmentConfig`](struct.EnvironmentConfig.html)\n\n/// * any other value returns a [`FileConfig`](struct.FileConfig.html)\n\n///\n\npub fn make_config(arg: &str) -> Result<Box<dyn ServerConfig>, Error> {\n\n if arg == \"ENV\" {\n\n match EnvironmentConfig::new() {\n\n Ok(cfg) => Ok(Box::new(cfg)),\n\n Err(e) => Err(e),\n\n }\n\n } else {\n\n match FileConfig::new(arg) {\n\n Ok(cfg) => Ok(Box::new(cfg)),\n\n Err(e) => Err(e),\n\n }\n\n }\n\n}\n\n\n\n///\n\n/// Validate configuration settings. Returns `true` if the config is valid, `false` otherwise.\n\n///\n","file_path":"src/config/mod.rs","rank":0,"score":120468.40105180875},{"content":"/// Roughenough version string enriched with any compile-time optional features\n\npub fn roughenough_version() -> String {\n\n let kms_str = if cfg!(feature = \"awskms\") {\n\n \" (+AWS KMS)\"\n\n } else if cfg!(feature = \"gcpkms\") {\n\n \" (+GCP KMS)\"\n\n } else {\n\n \"\"\n\n };\n\n\n\n format!(\"{}{}\", VERSION, kms_str)\n\n}\n\n\n\n// Constants and magic numbers of the Roughtime protocol\n\n\n\n/// Minimum size (in bytes) of a client request\n\npub const MIN_REQUEST_LENGTH: u32 = 1024;\n\n\n\n/// Size (in bytes) of seeds used to derive private keys\n\npub const SEED_LENGTH: u32 = 32;\n\n\n","file_path":"src/lib.rs","rank":1,"score":105556.69495275454},{"content":"#[cfg(not(any(feature = \"awskms\", feature = \"gcpkms\")))]\n\npub fn load_seed(config: &dyn ServerConfig) -> Result<Vec<u8>, error::Error> {\n\n match config.kms_protection() {\n\n KmsProtection::Plaintext => Ok(config.seed()),\n\n v => Err(error::Error::InvalidConfiguration(format!(\n\n \"kms_protection '{}' requires KMS, but server was not compiled with KMS support\",\n\n v\n\n ))),\n\n }\n\n}\n","file_path":"src/kms/mod.rs","rank":2,"score":73804.99768809955},{"content":"/// Guess which protocol the request is using and extract the client's nonce from the request\n\npub fn nonce_from_request(buf: &[u8], num_bytes: usize) -> Result<(Vec<u8>, Version), Error> {\n\n if num_bytes < MIN_REQUEST_LENGTH as usize {\n\n return Err(Error::RequestTooShort);\n\n }\n\n\n\n match guess_protocol_version(buf) {\n\n Version::Classic => nonce_from_classic_request(&buf[..num_bytes]),\n\n Version::Rfc => nonce_from_rfc_request(&buf[..num_bytes]),\n\n }\n\n}\n\n\n","file_path":"src/request.rs","rank":3,"score":73046.71167608433},{"content":"///\n\n/// A key management system that wraps/unwraps a data encryption key (DEK).\n\n///\n\npub trait KmsProvider {\n\n /// Make a blocking request to encrypt (wrap) the provided plaintext data encryption key.\n\n fn encrypt_dek(&self, plaintext_dek: &PlaintextDEK) -> Result<EncryptedDEK, KmsError>;\n\n\n\n /// Make a blocking request to decrypt (unwrap) a previously encrypted data encryption key.\n\n fn decrypt_dek(&self, encrypted_dek: &EncryptedDEK) -> Result<PlaintextDEK, KmsError>;\n\n}\n\n\n\n#[cfg(feature = \"awskms\")]\n\nmod awskms;\n\n\n\n/// Load the seed value for the long-term key.\n\n///\n\n/// Loading behavior depends on the value of `config.kms_protection()`:\n\n///\n\n/// * If `config.kms_protection() == Plaintext` then the value returned from `config.seed()`\n\n/// is used as-is and assumed to be a 32-byte hexadecimal value.\n\n///\n\n/// * Otherwise `config.seed()` is assumed to be an encrypted opaque blob generated from\n\n/// a prior `EnvelopeEncryption::encrypt_seed` call. The value of `config.kms_protection()`\n\n/// is parsed as a KMS key id and `EnvelopeEncryption::decrypt_seed` is called to obtain\n\n/// the plaintext seed value.\n\n///\n","file_path":"src/kms/mod.rs","rank":4,"score":70164.18147173194},{"content":"#[allow(clippy::useless_let_if_seq)]\n\npub fn is_valid_config(cfg: &dyn ServerConfig) -> bool {\n\n let mut is_valid = true;\n\n\n\n if cfg.port() == 0 {\n\n error!(\"server port not set: {}\", cfg.port());\n\n is_valid = false;\n\n }\n\n\n\n if cfg.interface().is_empty() {\n\n error!(\"'interface' is missing\");\n\n is_valid = false;\n\n }\n\n\n\n if cfg.seed().is_empty() {\n\n error!(\"'seed' value is missing\");\n\n is_valid = false;\n\n } else if *cfg.kms_protection() == KmsProtection::Plaintext\n\n && cfg.seed().len() != SEED_LENGTH as usize\n\n {\n\n error!(\n","file_path":"src/config/mod.rs","rank":5,"score":64421.31983843311},{"content":"fn has_supported_version(msg: &RtMessage) -> bool {\n\n let expected_ver_bytes = Version::Rfc.wire_bytes();\n\n\n\n if let Some(tag_bytes) = msg.get_field(Tag::VER) {\n\n // Iterate the list of supplied versions, looking for a match\n\n for found_ver_bytes in tag_bytes.chunks(4) {\n\n if found_ver_bytes == expected_ver_bytes {\n\n return true;\n\n }\n\n }\n\n }\n\n\n\n false\n\n}\n","file_path":"src/request.rs","rank":6,"score":59062.79032629927},{"content":"fn create_nested_message(c: &mut Criterion) {\n\n let pad = [0u8; 400];\n\n\n\n c.bench_function(\"create nested message\", move |b| {\n\n b.iter(|| {\n\n let mut msg1 = RtMessage::with_capacity(4);\n\n msg1.add_field(Tag::SIG, \"0987\".as_bytes()).unwrap();\n\n msg1.add_field(Tag::NONC, \"wxyz\".as_bytes()).unwrap();\n\n msg1.add_field(Tag::DELE, \"1234\".as_bytes()).unwrap();\n\n msg1.add_field(Tag::PATH, \"abcd\".as_bytes()).unwrap();\n\n\n\n let mut msg2 = RtMessage::with_capacity(2);\n\n msg2.add_field(Tag::PUBK, \"1234567890\".as_bytes()).unwrap();\n\n msg2.add_field(Tag::PAD_CLASSIC, pad.as_ref()).unwrap();\n\n })\n\n });\n\n}\n\n\n\nstatic SIZES: &[u8] = &[1, 3, 9, 17, 200];\n\nstatic DATA: &[u8] = &[1u8; 64];\n\n\n","file_path":"benches/roughenough-bench.rs","rank":7,"score":58474.447568798125},{"content":"fn reuse_merkle_trees(c: &mut Criterion) {\n\n let mut tree = MerkleTree::new();\n\n\n\n c.bench_function_over_inputs(\n\n \"reuse existing merkle tree\",\n\n move |b, &size| {\n\n b.iter(|| {\n\n tree.reset();\n\n for _ in 0..*size {\n\n tree.push_leaf(DATA);\n\n }\n\n black_box(tree.compute_root());\n\n })\n\n },\n\n SIZES,\n\n );\n\n}\n\n\n\ncriterion_group!(\n\n message_creation,\n","file_path":"benches/roughenough-bench.rs","rank":8,"score":58474.447568798125},{"content":"fn create_empty_message(c: &mut Criterion) {\n\n c.bench_function(\"create empty message\", |b| {\n\n b.iter(|| RtMessage::with_capacity(0))\n\n });\n\n}\n\n\n","file_path":"benches/roughenough-bench.rs","rank":9,"score":58474.447568798125},{"content":"fn create_two_field_message(c: &mut Criterion) {\n\n c.bench_function(\"create two field message\", |b| {\n\n b.iter(|| {\n\n let mut msg = RtMessage::with_capacity(2);\n\n msg.add_field(Tag::NONC, \"1234\".as_bytes()).unwrap();\n\n msg.add_field(Tag::PAD_CLASSIC, \"abcd\".as_bytes()).unwrap();\n\n })\n\n });\n\n}\n\n\n","file_path":"benches/roughenough-bench.rs","rank":10,"score":56508.76199786539},{"content":"fn create_four_field_message(c: &mut Criterion) {\n\n c.bench_function(\"create four field message\", |b| {\n\n b.iter(|| {\n\n let mut msg = RtMessage::with_capacity(4);\n\n msg.add_field(Tag::SIG, \"0987\".as_bytes()).unwrap();\n\n msg.add_field(Tag::NONC, \"wxyz\".as_bytes()).unwrap();\n\n msg.add_field(Tag::DELE, \"1234\".as_bytes()).unwrap();\n\n msg.add_field(Tag::PATH, \"abcd\".as_bytes()).unwrap();\n\n })\n\n });\n\n}\n\n\n","file_path":"benches/roughenough-bench.rs","rank":11,"score":56508.76199786539},{"content":"fn create_single_field_message(c: &mut Criterion) {\n\n c.bench_function(\"create single field message\", |b| {\n\n b.iter(|| {\n\n let mut msg = RtMessage::with_capacity(1);\n\n msg.add_field(Tag::NONC, \"1234\".as_bytes()).unwrap();\n\n })\n\n });\n\n}\n\n\n","file_path":"benches/roughenough-bench.rs","rank":12,"score":56508.76199786539},{"content":"fn create_new_merkle_tree(c: &mut Criterion) {\n\n c.bench_function_over_inputs(\n\n \"create new merkle trees\",\n\n move |b, &size| {\n\n b.iter(|| {\n\n let mut tree = MerkleTree::new();\n\n for _ in 0..*size {\n\n tree.push_leaf(DATA);\n\n }\n\n black_box(tree.compute_root())\n\n })\n\n },\n\n SIZES,\n\n );\n\n}\n\n\n","file_path":"benches/roughenough-bench.rs","rank":13,"score":56508.76199786539},{"content":"///\n\n/// Specifies parameters needed to configure a Roughenough server.\n\n///\n\n/// Parameters labeled \"**Required**\" must always be provided and have no default value\n\n/// while those labeled \"**Optional**\" provide sane default values that can be overridden.\n\n///\n\n/// YAML Key | Environment Variable | Necessity | Description\n\n/// --- | --- | --- | ---\n\n/// `interface` | `ROUGHENOUGH_INTERFACE` | Required | IP address or interface name for listening to client requests\n\n/// `port` | `ROUGHENOUGH_PORT` | Required | UDP port to listen for requests\n\n/// `seed` | `ROUGHENOUGH_SEED` | Required | A 32-byte hexadecimal value used to generate the server's long-term key pair. **This is a secret value and must be un-guessable**, treat it with care. (If compiled with KMS support, length will vary)\n\n/// `batch_size` | `ROUGHENOUGH_BATCH_SIZE` | Optional | The maximum number of requests to process in one batch. All nonces in a batch are used to build a Merkle tree, the root of which is signed. Default is `64` requests per batch.\n\n/// `status_interval` | `ROUGHENOUGH_STATUS_INTERVAL` | Optional | Number of _seconds_ between each logged status update. Default is `600` seconds (10 minutes).\n\n/// `health_check_port` | `ROUGHENOUGH_HEALTH_CHECK_PORT` | Optional | If present, enable an HTTP health check responder on the provided port. **Use with caution**.\n\n/// `kms_protection` | `ROUGHENOUGH_KMS_PROTECTION` | Optional | If compiled with KMS support, the ID of the KMS key used to protect the long-term identity.\n\n/// `client_stats` | `ROUGHENOUGH_CLIENT_STATS` | Optional | A value of `on` or `yes` will enable tracking of per-client request statistics that will be output each time server status is logged. Default is `off` (disabled).\n\n/// `fault_percentage` | `ROUGHENOUGH_FAULT_PERCENTAGE` | Optional | Likelihood (as a percentage) that the server will intentionally return an invalid client response. An integer range from `0` (disabled, all responses valid) to `50` (50% of responses will be invalid). Default is `0` (disabled).\n\n///\n\n/// Implementations of this trait obtain a valid configuration from different back-end\n\n/// sources. See:\n\n/// * [FileConfig](struct.FileConfig.html) - configure via a YAML file\n\n/// * [EnvironmentConfig](struct.EnvironmentConfig.html) - configure via environment variables\n\n/// * [MemoryConfig](struct.MemoryConfig.html) - in-memory configuration for testing\n\n///\n\npub trait ServerConfig {\n\n /// [Required] IP address or interface name to listen for client requests\n\n fn interface(&self) -> &str;\n\n\n\n /// [Required] UDP port to listen for requests\n\n fn port(&self) -> u16;\n\n\n\n /// [Required] A 32-byte hexadecimal value used to generate the server's\n\n /// long-term key pair. **This is a secret value and must be un-guessable**,\n\n /// treat it with care.\n\n fn seed(&self) -> Vec<u8>;\n\n\n\n /// [Optional] The maximum number of requests to process in one batch. All\n\n /// nonces in a batch are used to build a Merkle tree, the root of which is signed.\n\n /// Defaults to [DEFAULT_BATCH_SIZE](constant.DEFAULT_BATCH_SIZE.html)\n\n fn batch_size(&self) -> u8;\n\n\n\n /// [Optional] Amount of time between each logged status update.\n\n /// Defaults to [DEFAULT_STATUS_INTERVAL](constant.DEFAULT_STATUS_INTERVAL.html)\n\n fn status_interval(&self) -> Duration;\n","file_path":"src/config/mod.rs","rank":14,"score":43101.65419070414},{"content":"///\n\n/// Implementations of this trait record client activity\n\n///\n\npub trait ServerStats {\n\n fn add_rfc_request(&mut self, addr: &IpAddr);\n\n\n\n fn add_classic_request(&mut self, addr: &IpAddr);\n\n\n\n fn add_invalid_request(&mut self, addr: &IpAddr);\n\n\n\n fn add_health_check(&mut self, addr: &IpAddr);\n\n\n\n fn add_rfc_response(&mut self, addr: &IpAddr, bytes_sent: usize);\n\n\n\n fn add_classic_response(&mut self, addr: &IpAddr, bytes_sent: usize);\n\n\n\n fn total_valid_requests(&self) -> u64;\n\n\n\n fn num_rfc_requests(&self) -> u64;\n\n\n\n fn num_classic_requests(&self) -> u64;\n\n\n\n fn total_invalid_requests(&self) -> u64;\n","file_path":"src/stats/mod.rs","rank":15,"score":43076.40420006202},{"content":"## Description \n\n\n\nThe server's long-term identity can be protected by encrypting it, storing the encrypted value\n\nin the configuration, and invoking a cloud key management system to temporarily decrypt \n\n(in memory) the long-term identity at server start-up. \n\n\n\nThis way the server's long-term identity is never stored in plaintext. Instead the encrypted \n\nlong-term identity \"blob\" is safe to store on disk, on Github, in a container, etc. Ability \n\nto access the unencrypted identity is controlled \"out of band\" by the KMS system.\n\n\n\n## How to enable KMS support\n\n\n\nKMS support must be compiled-in. To enable:\n\n\n\n```bash\n\n# Build with Google Cloud KMS support\n\n$ cargo build --release --features \"gcpkms\"\n\n\n\n# Build with AWS KMS support\n\n$ cargo build --release --features \"awskms\"\n\n```\n\n\n\n## Google or Amazon: choose one and one only\n\n\n\nSadly, due to incompatibilities with dependencies of the KMS libraries, only **one** \n\nKMS system can be enabled at a time. Attempting `--features \"awskms,gcpkms\"` will result\n\nin a build failure.\n\n\n\n## Using `roughtime-kms` to encrypt the long-term seed\n\n\n\nUse the command line tool `roughtime-kms` to encrypt the seed value for the \n\nserver's long-term identity. To do this you will need: \n\n\n\n 1. The long-term key seed value \n\n 2. Access credentials for your cloud of choice\n\n 3. An identifier for the KMS key to be used\n\n 4. Necessary permissions to perform symmetric encrypt/decrypt operations\n\n using the selected key\n\n\n\nFor Amazon the key identifier is an ARN in the form:\n\n```\n\narn:aws:kms:SOME_AWS_REGION:111122223333:key/1234abcd-12ab-34cd-56ef-1234567890ab\n\n```\n\n\n\nFor Google the key identifier is a resource ID in the form:\n\n```\n\nprojects/PROJECT_NAME/locations/GCP_LOCATION/keyRings/KEYRING_NAME/cryptoKeys/KEY_NAME\n\n```\n\n\n\n### AWS Example\n\n\n","file_path":"doc/OPTIONAL-FEATURES.md","rank":16,"score":39097.99916666816},{"content":"#### Credentials \n\n\n\n[Rusoto](https://rusoto.org/) is used by Roughenough to access AWS. If your system\n\nhas AWS credentials in the typical `~/.aws/credentials` then everything should \"just work\".\n\n\n\nOtherwise Rusoto supports alternative ways to provide AWS credentials. See \n\n[Rusoto's documentation](https://github.com/rusoto/rusoto/blob/master/AWS-CREDENTIALS.md) \n\nfor details.\n\n\n\n#### `roughenough-kms` Command line\n\n\n\n```bash\n\n# Provide AWS credentials as described in the Rusoto docs\n\n\n\n# Build roughenough with AWS KMS support\n\n$ cargo build --release --features \"awskms\"\n\n\n\n# Encrypt the seed value\n\n$ target/release/roughenough-kms \\\n\n -k arn:aws:kms:SOME_AWS_REGION:111122223333:key/1234abcd-12ab-34cd-56ef-1234567890ab \\\n\n -s a0a31d76900080c3cdc42fe69de8dd0086d6b54de7814004befd0b9c4447757e\n\n \n\n# Output of above will be something like this\n\nkms_protection: \"arn:aws:kms:SOME_AWS_REGION:111122223333:key/1234abcd-12ab-34cd-56ef-1234567890ab\"\n\nseed: b8000c000102020078d39e85c7386e9e2bed1f30fac6dd322db96b8aaac8974fc6c0e0f566f8f6c971012fca1e69fffffd947fe82a9e505baf580000007e307c06092a864886f70d010706a06f306d020100306806092a864886f70d010701301e060960864801650304012e3011040c55d16d891b3b2a1ae2587a9c020110803bcc74dd96336009087772b28ec908c40e4113b1ab9b98934bd3b4f3dd3c1e8cdc6da82a4321fd8378ad0e2e0507bf0c5ea0e28d447e5f8482533baa423b7af8459ae87736f381d87fe38c21a805fae1c25c43d59200f42cae0d07f741e787a04c0ad72774942dddf818be0767e4963fe5a810f734a0125c\n\n```\n\n\n","file_path":"doc/OPTIONAL-FEATURES.md","rank":17,"score":39097.80912678349},{"content":"# Optional Features\n\n\n\nThese features are **disabled by default** and must be explicitly enabled as \n\ndescribed below.\n\n\n\n* [HTTP Health Check responder](#http-health-check)\n\n* [Key Management System (KMS) support](#key-management-system-kms-support)\n\n\n\n# HTTP Health Check\n\n\n\n## Description \n\n\n\nIntended for use by load balancers or other control plane facilities to monitor \n\nthe state of Roughenough servers and remove unhealthy instances automatically. \n\n\n\nThe server unconditionally emits a response to *any TCP connection* to the health\n\ncheck port, then closes the connection:\n\n\n\n```http\n\nHTTP/1.1 200 OK\n\nContent-Length: 0\n\nConnection: Close\n\n\n\n```\n\n\n\nNo attempt is made to parse the request, the server *always* emits this response. \n\n\n\n## How to enable\n\n\n\nProvide a value for the `health_check_port` setting. This enables the HTTP \n\nhealth check responder on the configured port. \n\n\n\n```yaml\n\ninterface: 127.0.0.1\n\nport: 8686\n\nseed: f61075c988feb9cb700a4a6a3291bfbc9cab11b9c9eca8c802468eb38a43d7d3\n\nhealth_check_port: 8000\n\n```\n\n\n\n## DoS Warning\n\n\n\n**An unprotected health-check port can be used to DoS the server. Do NOT expose \n\nthe health check port to the internet!** \n\n\n\nTo accurately reflect the ability of a Roughenough server to respond to requests, \n\nthe health check socket is serviced in the same event loop executing the primary Roughtime \n\nprotocol. Abuse of the health-check port can denial-of-service the whole server.\n\n\n\nIf enabled, ensure the health check port is accessible only to the *intended load-balancer(s)\n\nand/or control plane components*.\n\n\n\n\n\n# Key Management System (KMS) Support\n\n\n","file_path":"doc/OPTIONAL-FEATURES.md","rank":18,"score":39088.73699598725},{"content":"#### Credentials\n\n\n\nOnly **Service Account credentials** (in `.json` format) are currently supported. OAuth, bearer tokens, \n\nGAE default credentials, and GCE default credentials are **not** supported (contributions to\n\nadd support are particularly welcome!).\n\n\n\nTo obtain Service Account credentials if you don't already have them:\n\n\n\n* Creating a new service account?\n\n 1. Create the account \n\n 2. Download the credentials when prompted\n\n \n\n* Existing service account?\n\n 1. Open the Cloud Console (https://console.cloud.google.com)\n\n 2. Navigate to `IAM -> Service accounts`\n\n 3. Locate the service account row, click on its \"Actions\" menu (the three dots on the right) \n\n 4. Choose `Create key` and `JSON` format\n\n 5. Download the credentials when prompted\n\n\n\nMake note of the full path where the credentials are saved, it's needed in the next step.\n\n\n\n#### `roughenough-kms` Command line\n\n\n\n```bash\n\n# Set environment variable pointing to downloaded Service Account credentials\n\n$ export GOOGLE_APPLICATION_CREDENTIALS=/path/to/creds.json \n\n\n\n# Build roughenough with Google KMS support\n\n$ cargo build --release --features \"gcpkms\"\n\n\n\n# Encrypt the seed value\n\n$ target/release/roughenough-kms \\\n\n -k projects/PROJECT_NAME/locations/GCP_LOCATION/keyRings/KEYRING_NAME/cryptoKeys/KEY_NAME \\\n\n -s a0a31d76900080c3cdc42fe69de8dd0086d6b54de7814004befd0b9c4447757e\n\n \n\n# Output of above will be something like this\n\nkms_protection: \"projects/PROJECT_NAME/locations/GCP_LOCATION/keyRings/KEYRING_NAME/cryptoKeys/KEY_NAME\"\n\nseed: 71000c000a2400c7f2553954873ef29aeb37384c25d7a937d389221207c3368657870129d601d084c8da1249008d6fd4640f815596788e97bb3ce02fd007bc25a1019ca51945c3b99283d3945baacd77b1b991f5f6f8848c549a5767f57c9c999e97fe6d28fdb17db1d63c2ea966d8236d20c71e8e9c757c5bab62472c65b48376bc8951700aceb22545fce58d77e7cc147f7134da7a2cca790b54f29e4798442cee6e0d34e57f80ce983f7e5928cceff2\n\n```\n\n\n","file_path":"doc/OPTIONAL-FEATURES.md","rank":19,"score":39085.2872324983},{"content":"#### Configuration\n\n\n\nCopy and paste the output `kms_protection` and `seed` values into a config or\n\nset the corresponding environment variables. The `roughenough-server` will detect that\n\nAWS KMS is being used and decrypt the seed automatically. For example:\n\n\n\n```yaml\n\ninterface: 127.0.0.1\n\nport: 8686\n\nkms_protection: \"arn:aws:kms:SOME_AWS_REGION:111122223333:key/1234abcd-12ab-34cd-56ef-1234567890ab\"\n\nseed: b8000c000102020078d39e85c7386e9e2bed1f30fac6dd322db96b8aaac8974fc6c0e0f566f8f6c971012fca1e69fffffd947fe82a9e505baf580000007e307c06092a864886f70d010706a06f306d020100306806092a864886f70d010701301e060960864801650304012e3011040c55d16d891b3b2a1ae2587a9c020110803bcc74dd96336009087772b28ec908c40e4113b1ab9b98934bd3b4f3dd3c1e8cdc6da82a4321fd8378ad0e2e0507bf0c5ea0e28d447e5f8482533baa423b7af8459ae87736f381d87fe38c21a805fae1c25c43d59200f42cae0d07f741e787a04c0ad72774942dddf818be0767e4963fe5a810f734a0125c\n\n```\n\n\n\nor using environment based configuration:\n\n\n\n```bash\n\n$ export ROUGHENOUGH_INTERFACE=127.0.0.1\n\n$ export ROUGHENOUGH_PORT=8686\n\n$ export ROUGHENOUGH_KMS_PROTECTION=\"arn:aws:kms:SOME_AWS_REGION:111122223333:key/1234abcd-12ab-34cd-56ef-1234567890ab\"\n\n$ export ROUGHENOUGH_SEED=b8000c000102020078d39e85c7386e9e2bed1f30fac6dd322db96b8aaac8974fc6c0e0f566f8f6c971012fca1e69fffffd947fe82a9e505baf580000007e307c06092a864886f70d010706a06f306d020100306806092a864886f70d010701301e060960864801650304012e3011040c55d16d891b3b2a1ae2587a9c020110803bcc74dd96336009087772b28ec908c40e4113b1ab9b98934bd3b4f3dd3c1e8cdc6da82a4321fd8378ad0e2e0507bf0c5ea0e28d447e5f8482533baa423b7af8459ae87736f381d87fe38c21a805fae1c25c43d59200f42cae0d07f741e787a04c0ad72774942dddf818be0767e4963fe5a810f734a0125c\n\n```\n\n\n\n### GCP Example\n\n\n","file_path":"doc/OPTIONAL-FEATURES.md","rank":20,"score":39085.030252563076},{"content":"#### Configuration\n\n\n\nCopy and paste the output `kms_protection` and `seed` values into a config or\n\nset the corresponding environment variables. `roughenough-server` will detect that\n\nGoogle KMS is being used and decrypt the seed automatically. For example:\n\n\n\n```yaml\n\ninterface: 127.0.0.1\n\nport: 8686\n\nkms_protection: \"projects/PROJECT_NAME/locations/GCP_LOCATION/keyRings/KEYRING_NAME/cryptoKeys/KEY_NAME\"\n\nseed: 71000c000a2400c7f2553954873ef29aeb37384c25d7a937d389221207c3368657870129d601d084c8da1249008d6fd4640f815596788e97bb3ce02fd007bc25a1019ca51945c3b99283d3945baacd77b1b991f5f6f8848c549a5767f57c9c999e97fe6d28fdb17db1d63c2ea966d8236d20c71e8e9c757c5bab62472c65b48376bc8951700aceb22545fce58d77e7cc147f7134da7a2cca790b54f29e4798442cee6e0d34e57f80ce983f7e5928cceff2\n\n```\n\n\n\nor using environment based configuration:\n\n\n\n```bash\n\n$ export ROUGHENOUGH_INTERFACE=127.0.0.1\n\n$ export ROUGHENOUGH_PORT=8686\n\n$ export ROUGHENOUGH_KMS_PROTECTION=\"projects/PROJECT_NAME/locations/GCP_LOCATION/keyRings/KEYRING_NAME/cryptoKeys/KEY_NAME\"\n\n$ export ROUGHENOUGH_SEED=71000c000a2400c7f2553954873ef29aeb37384c25d7a937d389221207c3368657870129d601d084c8da1249008d6fd4640f815596788e97bb3ce02fd007bc25a1019ca51945c3b99283d3945baacd77b1b991f5f6f8848c549a5767f57c9c999e97fe6d28fdb17db1d63c2ea966d8236d20c71e8e9c757c5bab62472c65b48376bc8951700aceb22545fce58d77e7cc147f7134da7a2cca790b54f29e4798442cee6e0d34e57f80ce983f7e5928cceff2\n\n```\n","file_path":"doc/OPTIONAL-FEATURES.md","rank":21,"score":39084.838538343916},{"content":"/// Inspect the message in `buf` and guess which Roughtime protocol it corresponds to.\n\nfn guess_protocol_version(buf: &[u8]) -> Version {\n\n if &buf[0..8] == RFC_REQUEST_FRAME_BYTES {\n\n Version::Rfc\n\n } else {\n\n Version::Classic\n\n }\n\n}\n\n\n","file_path":"src/request.rs","rank":22,"score":34257.038781619616},{"content":"// Convenience function to create zero-filled Vec of given size\n\nfn vec_zero_filled(len: usize) -> Vec<u8> {\n\n (0..len).map(|_| 0).collect()\n\n}\n\n\n\n/// Envelope encryption of the long-term key seed value.\n\n///\n\n/// The seed is encrypted using AES-GCM-256 with:\n\n///\n\n/// * 32 byte (256 bit) random key\n\n/// * 12 byte (96 bit) random nonce\n\n/// * 16 byte (128 bit) authentication tag\n\n///\n\n/// Randomness obtained from\n\n/// [`ring::rand::SecureRandom`](https://briansmith.org/rustdoc/ring/rand/trait.SecureRandom.html).\n\n///\n\n/// The key used to encrypt the seed is wrapped (encrypted) using a\n\n/// [`KmsProvider`](trait.KmsProvider.html) implementation.\n\n///\n\npub struct EnvelopeEncryption;\n\n\n","file_path":"src/kms/envelope.rs","rank":23,"score":31720.957229524443},{"content":" use std::fmt;\n\n use std::fmt::Formatter;\n\n use std::str::FromStr;\n\n\n\n use bytes::Bytes;\n\n use futures::executor::block_on;\n\n use rusoto_core::Region;\n\n use rusoto_kms::{DecryptRequest, EncryptRequest, Kms, KmsClient};\n\n\n\n use crate::kms::{AD, DEK_LEN_BYTES, EncryptedDEK, KmsError, KmsProvider, PlaintextDEK};\n\n\n\n /// Amazon Web Services Key Management Service\n\n /// https://aws.amazon.com/kms/\n\n pub struct AwsKms {\n\n kms_client: KmsClient,\n\n key_id: String,\n\n }\n\n\n\n impl AwsKms {\n\n /// Create a new instance from the full ARN of a AWS KMS key. The ARN is expected\n","file_path":"src/kms/awskms.rs","rank":24,"score":31293.560368147304},{"content":"// Copyright 2017-2021 int08h LLC\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n\n\n#[cfg(feature = \"awskms\")]\n\npub mod inner {\n\n extern crate bytes;\n\n\n\n use std::collections::HashMap;\n\n use std::default::Default;\n","file_path":"src/kms/awskms.rs","rank":25,"score":31291.695737295366},{"content":"\n\n match block_on(self.kms_client.encrypt(encrypt_req)) {\n\n Ok(result) => {\n\n if let Some(ciphertext) = result.ciphertext_blob {\n\n Ok(ciphertext.to_vec())\n\n } else {\n\n Err(KmsError::OperationFailed(\n\n \"no ciphertext despite successful response\".to_string(),\n\n ))\n\n }\n\n }\n\n Err(e) => Err(KmsError::OperationFailed(e.to_string())),\n\n }\n\n }\n\n\n\n fn decrypt_dek(&self, encrypted_dek: &EncryptedDEK) -> Result<PlaintextDEK, KmsError> {\n\n let mut decrypt_req: DecryptRequest = Default::default();\n\n decrypt_req.ciphertext_blob = Bytes::from(encrypted_dek.to_vec());\n\n\n\n let mut dec_context = HashMap::new();\n","file_path":"src/kms/awskms.rs","rank":26,"score":31290.602695005746},{"content":" Err(e) => Err(KmsError::OperationFailed(e.to_string())),\n\n }\n\n }\n\n }\n\n\n\n #[cfg(feature = \"awskms\")]\n\n impl fmt::Display for AwsKms {\n\n fn fmt(&self, f: &mut Formatter) -> fmt::Result {\n\n write!(f, \"{}\", self.key_id)\n\n }\n\n }\n\n}\n","file_path":"src/kms/awskms.rs","rank":27,"score":31288.637531104483},{"content":" /// to be of the form `arn:aws:kms:some-aws-region:111122223333:key/1234abcd-12ab-34cd-56ef-1234567890ab`\n\n pub fn from_arn(arn: &str) -> Result<Self, KmsError> {\n\n let parts: Vec<&str> = arn.split(':').collect();\n\n\n\n if parts.len() != 6 {\n\n return Err(KmsError::InvalidConfiguration(format!(\n\n \"invalid KMS arn: too few parts {}\",\n\n parts.len()\n\n )));\n\n }\n\n\n\n let region_part = parts.get(3).expect(\"region is missing\");\n\n let region = match Region::from_str(region_part) {\n\n Ok(r) => r,\n\n Err(e) => return Err(KmsError::InvalidConfiguration(e.to_string())),\n\n };\n\n\n\n Ok(AwsKms {\n\n kms_client: KmsClient::new(region),\n\n key_id: arn.to_string(),\n","file_path":"src/kms/awskms.rs","rank":28,"score":31286.366257586822},{"content":" })\n\n }\n\n }\n\n\n\n impl KmsProvider for AwsKms {\n\n fn encrypt_dek(&self, plaintext_dek: &PlaintextDEK) -> Result<EncryptedDEK, KmsError> {\n\n if plaintext_dek.len() != DEK_LEN_BYTES {\n\n return Err(KmsError::InvalidKey(format!(\n\n \"provided DEK wrong length: {}\",\n\n plaintext_dek.len()\n\n )));\n\n }\n\n\n\n let mut encrypt_req: EncryptRequest = Default::default();\n\n encrypt_req.key_id = self.key_id.clone();\n\n encrypt_req.plaintext = Bytes::from(plaintext_dek.to_vec());\n\n\n\n let mut enc_context = HashMap::new();\n\n enc_context.insert(\"AD\".to_string(), AD.to_string());\n\n encrypt_req.encryption_context = Some(enc_context);\n","file_path":"src/kms/awskms.rs","rank":29,"score":31285.087277019764},{"content":" dec_context.insert(\"AD\".to_string(), AD.to_string());\n\n decrypt_req.encryption_context = Some(dec_context);\n\n\n\n match block_on(self.kms_client.decrypt(decrypt_req)) {\n\n Ok(result) => {\n\n if let Some(plaintext_dek) = result.plaintext {\n\n if plaintext_dek.len() == DEK_LEN_BYTES {\n\n Ok(plaintext_dek.to_vec())\n\n } else {\n\n Err(KmsError::InvalidKey(format!(\n\n \"decrypted DEK wrong length: {}\",\n\n plaintext_dek.len()\n\n )))\n\n }\n\n } else {\n\n Err(KmsError::OperationFailed(\n\n \"decrypted payload is empty\".to_string(),\n\n ))\n\n }\n\n }\n","file_path":"src/kms/awskms.rs","rank":30,"score":31282.875625302047},{"content":"#[macro_use]\n\nextern crate criterion;\n\nextern crate roughenough;\n\n\n\nuse criterion::{black_box, Criterion};\n\n\n\nuse roughenough::merkle::{MerkleTree, root_from_paths};\n\nuse roughenough::RtMessage;\n\nuse roughenough::Tag;\n\n\n","file_path":"benches/roughenough-bench.rs","rank":31,"score":30683.74755529729},{"content":" create_empty_message,\n\n create_single_field_message,\n\n create_two_field_message,\n\n create_four_field_message,\n\n create_nested_message\n\n);\n\n\n\ncriterion_group!(merkle_tree, create_new_merkle_tree, reuse_merkle_trees);\n\n\n\ncriterion_main!(message_creation, merkle_tree);\n","file_path":"benches/roughenough-bench.rs","rank":32,"score":30669.799644616527},{"content":"fn nonce_from_rfc_request(buf: &[u8]) -> Result<(Vec<u8>, Version), Error> {\n\n // first 8 bytes were RFC_REQUEST_FRAME_BYTES, [0..8]\n\n let mut cur = Cursor::new(&buf[8..12]);\n\n let reported_len = cur.read_u32::<LittleEndian>()?;\n\n let actual_len = (buf.len() - 12) as u32;\n\n\n\n if reported_len != actual_len {\n\n return Err(Error::LengthMismatch(reported_len, actual_len));\n\n }\n\n\n\n let msg = RtMessage::from_bytes(&buf[12..])?;\n\n\n\n if !has_supported_version(&msg) {\n\n return Err(Error::NoCompatibleVersion);\n\n }\n\n\n\n match msg.get_field(Tag::NONC) {\n\n Some(nonce) => Ok((nonce.to_vec(), Version::Rfc)),\n\n None => Err(Error::InvalidRequest),\n\n }\n\n}\n\n\n","file_path":"src/request.rs","rank":33,"score":28601.618426542107},{"content":"fn nonce_from_classic_request(buf: &[u8]) -> Result<(Vec<u8>, Version), Error> {\n\n let msg = RtMessage::from_bytes(buf)?;\n\n match msg.get_field(Tag::NONC) {\n\n Some(nonce) => Ok((nonce.to_vec(), Version::Classic)),\n\n None => Err(Error::InvalidRequest),\n\n }\n\n}\n\n\n","file_path":"src/request.rs","rank":34,"score":28601.618426542107},{"content":"# The public key of 'roughtime.int08h.com' is stored in a DNS TXT record \n\n$ host -t TXT roughtime.int08h.com\n\nroughtime.int08h.com descriptive text \"016e6e0284d24c37c6e4d7d8d5b4e1d3c1949ceaa545bf875616c9dce0c9bec1\"\n\n\n\n# Validate the server response using its public key\n\n$ target/release/roughenough-client -v roughtime.int08h.com 2002 -p 016e6e0284d24c37c6e4d7d8d5b4e1d3c1949ceaa545bf875616c9dce0c9bec1\n\nRequesting time from: \"roughtime.int08h.com\":2002\n\nReceived time from server: midpoint=\"Oct 26 2018 23:22:20\", radius=1000000, verified=Yes (merkle_index=0)\n\nOct 26 2018 23:22:20\n\n```\n\n\n\nThe **`verified=Yes`** in the output confirms that the server's response had a valid signature.\n\n\n\n### Server Configuration\n\n\n\nThere are two (mutually exclusive) ways to configure the Roughenough server: \n\n\n\n1. A YAML file, or\n\n2. Environment variables\n\n\n\nThe server accepts the following configuration parameters:\n\n\n\nYAML Key | Environment Variable | Necessity | Description\n\n--- | --- | --- | ---\n\n`interface` | `ROUGHENOUGH_INTERFACE` | Required | IP address or interface name for listening to client requests\n\n`port` | `ROUGHENOUGH_PORT` | Required | UDP port to listen for requests\n\n`seed` | `ROUGHENOUGH_SEED` | Required | A 32-byte hexadecimal value used to generate the server's long-term key pair. **This is a secret value and must be un-guessable**, treat it with care. (If compiled with KMS support, length will vary; see [Optional Features](#optional-features))\n\n`batch_size` | `ROUGHENOUGH_BATCH_SIZE` | Optional | The maximum number of requests to process in one batch. All nonces in a batch are used to build a Merkle tree, the root of which is signed. Default is `64` requests per batch.\n\n`status_interval` | `ROUGHENOUGH_STATUS_INTERVAL` | Optional | Number of _seconds_ between each logged status update. Default is `600` seconds (10 minutes).\n\n`health_check_port` | `ROUGHENOUGH_HEALTH_CHECK_PORT` | Optional | If present, enable an HTTP health check responder on the provided port. **Use with caution**, see [Optional Features](#optional-features).\n\n`kms_protection` | `ROUGHENOUGH_KMS_PROTECTION` | Optional | If compiled with KMS support, the ID of the KMS key used to protect the long-term identity. See [Optional Features](#optional-features).\n\n`fault_percentage` | `ROUGHENOUGH_FAULT_PERCENTAGE` | Optional | Likelihood (as a percentage) that the server will intentionally return an invalid client response. An integer range from `0` (disabled, all responses valid) to `50` (50% of responses will be invalid). Default is `0` (disabled).\n\n\n","file_path":"README.md","rank":35,"score":20754.27537364356},{"content":"# Or using environment variables\n\n$ export ROUGHENOUGH_INTERFACE=127.0.0.1\n\n$ export ROUGHENOUGH_PORT=8686\n\n$ export ROUGHENOUGH_SEED=f61075c988feb9cb700a4a6a3291bfbc9cab11b9c9eca8c802468eb38a43d7d3\n\n$ target/release/roughenough-server ENV\n\n2018-07-25 00:05:09 INFO [server] Roughenough server v1.0.5 starting\n\n2018-07-25 00:05:09 INFO [server] Long-term public key: d0756ee69ff5fe96cbcf9273208fec53124b1dd3a24d3910e07c7c54e2473012\n\n2018-07-25 00:05:09 INFO [server] Ephemeral public key: 25fd5dc31ceee241aed3e643534e95ed0609e9a20982a45ac0312a5f55e2cc66\n\n2018-07-25 00:05:09 INFO [server] Server listening on 127.0.0.1:8686\n\n```\n\n\n\nThe resulting binary is `target/release/roughenough-server`. After building you can copy the \n\nbinary and run on its own (no `cargo` needed):\n\n\n\n```bash\n\n$ cp target/release/roughenough-server /usr/local/bin \n\n```\n\n\n\n### Stopping the Server\n\n\n\nUse Ctrl-C or `kill` the process.\n\n\n\n\n\n## Optional Features\n\n\n\nRoughenough has two opt-in (disabled by default) features that are enabled either \n\nA) via a config setting, or B) at compile-time.\n\n\n\n* [HTTP Health Check responder](doc/OPTIONAL-FEATURES.md#http-health-check) \n\n to facilitate detection and replacement of \"sick\" Roughenough servers.\n\n* [Key Management System (KMS) support](doc/OPTIONAL-FEATURES.md#key-management-system-kms-support)\n\n to protect the long-term server identity using envelope encryption and \n\n AWS or Google KMS.\n\n\n\nSee [OPTIONAL-FEATURES.md](doc/OPTIONAL-FEATURES.md) for details and instructions\n\nhow to enable and use.\n\n\n\n\n\n## Limitations\n\n\n\nRoughtime features not implemented by the server:\n\n\n\n* On-line (while server is running) key rotation. The server must be restarted to generate a new delegated key. \n\n* The Roughenough server depends on the host's time source to comply with the smeared leap-second \n\n requirement of the Roughtime protocol. A Roughenough server sourcing time from \n\n [Google's public NTP servers](https://developers.google.com/time/) would produce compliant\n\n smeared leap-seconds but time sourced from members of `pool.ntp.org` likely will not.\n\n\n","file_path":"README.md","rank":36,"score":20748.935338094987},{"content":"## Version 1.1.0\n\n\n\n* Optional HTTP health check (requested in #8), see the\n\n [feature's documentation](https://github.com/int08h/roughenough/blob/master/doc/OPTIONAL-FEATURES.md#http-health-check)\n\n* Support AWS and Google Key Management Systems (KMS) to protect the server's long-term key.\n\n See the [KMS documentation](https://github.com/int08h/roughenough/blob/master/doc/OPTIONAL-FEATURES.md#key-management-system-kms-support).\n\n* Numerous refactorings and clean ups to support fuzzing of \n\n server components (b801eda, thanks to @Aaron1011)\n\n\n\n## Version 1.0.6\n\n\n\n* As pointed out in #10, the client and server binary names were too generic. Rename \n\n them to be packaging friendly. Thank you @grempe. (b43bcb27ad)\n\n \n\n## Version 1.0.5\n\n\n\n* The server now supports configuration from \n\n [environment variables](https://github.com/int08h/roughenough#server-configuration)\n\n \n\n## Version 1.0.4\n\n\n\n* Update `untrusted` dependency to incorporate security fix (see https://github.com/RustSec/advisory-db/pull/24). \n\n Fixes #6 reported by @tirkarthi (383b0347).\n\n \n\n## Release 1.0.3\n\n\n\n* Limit the number of tags in a message to 1024 (0b8c965)\n\n\n\n## Release 1.0.2\n\n\n\n* Merge input validation and error handling improvements from #5. Fuzzing FTW.\n\n* Misc docstring and README updates\n\n* Fix incorrect range-check introduced in 9656fda and released as 1.0.1.\n\n\n\n## Release 1.0.1 (yanked)\n\n\n\n* Release 1.0.1 was removed from Github and yanked from crates.io due to a range-check bug. \n\n 1.0.2 is its replacement. \n\n \n\n## Release 1.0.0\n\n\n\nThanks to @Aaron1011's work, Roughenough has 1.0 level of functionality.\n\n\n\n* Server batches responses and signs Merkle tree root (3471e04, ee38933f, and 31bf8b3)\n\n* `mio` error handling improvement (613fb01f)\n\n* Build on Rust Nightly (350b23a)\n","file_path":"CHANGELOG.md","rank":37,"score":20746.520369998954},{"content":"# Roughenough \n\n\n\n[](https://crates.io/crates/roughenough)\n\n[](https://travis-ci.org/int08h/roughenough)\n\n[](https://www.apache.org/licenses/LICENSE-2.0.txt)\n\n\n\n**Roughenough** is an RFC-draft compliant [Roughtime](https://roughtime.googlesource.com/roughtime) secure time \n\nsynchronization client and server implementation in Rust. \n\n\n\nRoughenough's server and client are functionally complete and \n\nat feature parity with the reference C++ and Golang implementations. \n\n\n\nRequires latest stable Rust to compile. Contributions welcome, see\n\n[CONTRIBUTING](../master/CONTRIBUTING.md) for instructions and [limitations](#limitations) for areas that could use attention.\n\n\n\n## RFC Work-In-Progress\n\n\n\nRoughenough implements the Roughtime protocol as specified in [the draft-5 RFC](https://www.ietf.org/archive/id/draft-ietf-ntp-roughtime-05.html).\n\n \n\n**Important differences from the draft RFC**\n\n1. Roughenough uses SHA-512/256 to compute the Merkle tree. Draft-5 of the RFC uses a\n\n bespoke 32-byte SHA-512 prefix without rationale or justification. Given that \n\n standardized 32-byte SHA-512/256 exists and is already implemented widely, I'm \n\n sticking with it while I advocate for the RFC to move away from the custom prefix\n\n and adopt SHA-512/256.\n\n2. The server and client send/expect RFC protocol version `1` (VER tag is `0x00000001`) \n\n instead of the draft's suggested `0x80000000 + version`.\n\n\n\nThe Roughenough server operates both the \"classic\" protocol **and** the RFC compliant \n\nprotocol at the same time on a single serving port (the 8-byte magic frame value added \n","file_path":"README.md","rank":38,"score":20746.20565054545},{"content":"#### YAML Configuration \n\n\n\nThe table above lists the YAML keys available in the config file. An example:\n\n\n\n```yaml\n\ninterface: 127.0.0.1\n\nport: 8686\n\nseed: f61075c988feb9cb700a4a6a3291bfbc9cab11b9c9eca8c802468eb38a43d7d3\n\n```\n\n\n\nProvide the config file as the single command-line argument to the Roughenough server binary:\n\n\n\n```bash\n\n$ /path/to/roughenough-server /path/to/config.yaml\n\n```\n\n\n\n#### Environment Configuration\n\n\n\nRoughenough can be configured via the `ROUGHENOUGH_*` [environment variables](https://12factor.net/config) \n\nlisted in the table above. Start the server with a single `ENV` argument to have Roughenough configure itself\n\nfrom the environment. Example:\n\n\n\n```bash\n\n$ export ROUGHENOUGH_INTERFACE=127.0.0.1\n\n$ export ROUGHENOUGH_PORT=8686\n\n$ export ROUGHENOUGH_SEED=f61075c988feb9cb700a4a6a3291bfbc9cab11b9c9eca8c802468eb38a43d7d3\n\n$ /path/to/roughenough-server ENV\n\n```\n\n\n\n### Starting the Server\n\n\n\n```bash\n\n# Build roughenough\n\n$ cargo build --release\n\n\n\n# Via a config file\n\n$ target/release/roughenough-server example.cfg\n\n2018-07-25 00:05:09 INFO [server] Roughenough server v1.0.5 starting\n\n2018-07-25 00:05:09 INFO [server] Long-term public key: d0756ee69ff5fe96cbcf9273208fec53124b1dd3a24d3910e07c7c54e2473012\n\n2018-07-25 00:05:09 INFO [server] Ephemeral public key: 25fd5dc31ceee241aed3e643534e95ed0609e9a20982a45ac0312a5f55e2cc66\n\n2018-07-25 00:05:09 INFO [server] Server listening on 127.0.0.1:8686\n\n\n","file_path":"README.md","rank":39,"score":20743.0006065057},{"content":"# send RFC protocol Roughtime requests\n\n$ roughenough-client -p 1 roughtime.int08h.com 2002\n\n```\n\n\n\n## Links\n\n* [Roughenough Github repo](https://github.com/int08h/roughenough)\n\n* Original [Roughtime project](https://roughtime.googlesource.com/roughtime)\n\n* My blog posts giving a [technical deep-dive into Roughtime](https://int08h.com/post/to-catch-a-lying-timeserver/) and\n\n exploring details of [on-the-wire Roughtime messages](https://int08h.com/post/roughtime-message-anatomy/).\n\n* Cloudflare's fantastic [blog post](https://blog.cloudflare.com/roughtime/) and accompanying \n\n [open-source project](https://developers.cloudflare.com/roughtime/).\n\n\n\n## Building and Running\n\n\n\n### Minimum Supported Rust Version (MSRV)\n\n\n\nRoughenough uses [2018 edition](https://rust-lang-nursery.github.io/edition-guide/rust-2018/index.html) \n\nfeatures and requires Rust 1.31 or newer to build.\n\n\n\n### Building\n\n\n\n```bash\n\n# Build roughenough\n\n$ cargo build --release\n\n```\n\n\n\nThe client binary is `target/release/roughenough-client`. After building you can copy the \n\nbinary and run on its own (no `cargo` needed) if you wish.\n\n\n\n```bash\n\n$ cp target/release/roughenough-client /usr/local/bin \n\n```\n\n\n\n### Using the Client to Query a Roughtime Server \n\n\n\n```bash\n\n$ target/release/roughenough-client -v roughtime.int08h.com 2002\n\nRequesting time from: \"roughtime.int08h.com\":2002\n\nReceived time from server: midpoint=\"Oct 26 2018 23:20:44\", radius=1000000, verified=No (merkle_index=0)\n\nOct 26 2018 23:20:44\n\n```\n\n\n\n### Setting The System Time on Linux\n\n\n\nYou can use the `date` utility on Linux machines to set the system time to the time determined by the Roughenough client:\n\n\n\n```bash\n\nsudo date --utc --set \"$(roughenough-client -z roughtime.int08h.com 2002)\"\n\n```\n\n\n\n### Validating Server Responses \n\n\n\nUse the `-p` flag with the client to validate the server's response with its public key.\n\n\n\n```bash\n","file_path":"README.md","rank":40,"score":20742.356588898107},{"content":"## Version 1.2.0-draft-5\n\n* Roughenough (mostly) implements the Roughtime protocol as specified in [the draft-5 RFC](https://www.ietf.org/archive/id/draft-ietf-ntp-roughtime-05.html).\n\n \n\n **Important differences from the draft RFC**\n\n 1. Roughenough uses SHA-512/256 to compute the Merkle tree. Draft-5 of the RFC uses a\n\n bespoke 32-byte SHA-512 prefix without rationale or justification. Given that\n\n standardized 32-byte SHA-512/256 exists and is already implemented widely, I'm \n\n sticking with it while I advocate for the RFC to move away from the custom prefix\n\n and adopt SHA-512/256.\n\n 2. The server and client send/expect RFC protocol version `1` (VER tag is `0x00000001`) \n\n instead of the draft's suggested `0x80000000 + version`.\n\n\n\n* The Roughenough server operates both the \"classic\" protocol **and** the RFC compliant \n\n protocol at the same time on a single serving port (the 8-byte magic frame value added \n\n by the RFC is used to distinguish classic vs. rfc requests).\n\n\n\n The new `-p/--protocol` flag of `roughenough-client` controls the protocol version to\n\n use in requests (`0` = classic protocol, `1` = RFC protocol). The default is `0` the\n\n \"classic\" protocol, until the RFC is finalized:\n\n\n\n ```\n\n # send RFC protocol Roughtime requests\n\n $ roughenough-client -p 1 roughtime.int08h.com 2002\n\n ```\n\n* Added `-d/--dump` to `roughenough-client` that will pretty-print text representations \n\n of the messages it sends and receives.\n\n\n\n## Version 1.1.9\n\n\n\nHousekeeping:\n\n* 8f088f1 Overdue Ring update 0.13 -> 0.16\n\n* 43b1de3 GCK KMS updated to the latest dependencies\n\n* 7ff2e53 AWS KMS also updated to latest dependencies \n\n\n\n## Version 1.1.8\n\n\n\nNew feature:\n\n* 407f12d client: output local time by default, add -z/--zulu for UTC \n\n\n\nHousekeeping:\n\n* 02212e2 Switch to std::time and drop use of 'time' crate \n\n* d42db50 Upgrade several dependencies to latest versions \n\n* e13d6fd Remove deprecated `std::error::Error::description` calls \n\n* 32f11aa Update Dockerfile to Rust 1.42 \n\n\n","file_path":"CHANGELOG.md","rank":41,"score":20742.030387574512},{"content":"## Version 1.1.7\n\n\n\n* Improved options for client output thanks to @zicklag (f1f834e8c).\n\n\n\n By default the client now outputs just the time reported by the queried server. \n\n The `-v` or `--verbose` flag will print additional information such as the response's \n\n midpoint and radius. `-j` or `--json` outputs responses in JSON format instead.\n\n\n\n Non-response text output is written to standard error to enable verbose output \n\n while redirecting the response(s) to a file or pipe like so:\n\n \n\n ```\n\n $ roughenough-client -v roughtime.int08h.com 2002 > time.txt\n\n Requesting time from: \"roughtime.int08h.com\":2002\n\n Received time from server: midpoint=\"Oct 08 2019 18:40:38\", radius=1000000, verified=No (merkle_index=0)\n\n \n\n $ cat time.txt\n\n Oct 08 2019 18:40:38\n\n ```\n\n\n\n## Version 1.1.6\n\n\n\n* Fix several Clippy items (266f1adc9) \n\n* Update to latest Rusoto (6ff01af52)\n\n* Update to latest google-cloudkms (a0165c019)\n\n* Update Dockerfile to Rust 1.38 (a14c2e8)\n\n\n\n## Version 1.1.5\n\n\n\n* Improved error messages (3841942)\n\n* Update fuzzer server target to sync with roughenough-fuzz\n\n* Add Dockerfile to create a server container\n\n\n\n## Version 1.1.4\n\n\n\n* Implement Roughtime ecosystem response mangling (177372f, f851deb)\n\n* Doc fix from @Muncan90 (20ba144)\n\n\n\n## Version 1.1.3\n\n\n\n* Add decrypt option to `roughenough-kms` \n\n\n\n## Version 1.1.2 \n\n\n\n* Add client request statistics tracking.\n\n* Clean-up and simplification of server inner loop.\n\n* Rust 2018 edition required to compile.\n\n\n\n## Version 1.1.1\n\n\n\n* Provide auxiliary data to the AWS KMS decryption call. The auxiliary data _was_ provided in encrypt, but not decrypt, resulting in unconditional failure when unwrapping the long-term identity. See https://github.com/int08h/roughenough/commit/846128d08bd3fcd72f23b3123b332d0692782e41#diff-7f7c3059af30a5ded26269301caf8531R102\n\n\n","file_path":"CHANGELOG.md","rank":42,"score":20740.198873588204},{"content":"# Contributing to Roughenough\n\n\n\nDo you enjoy working on obscure cryptographically secure time synchronization protocols? \n\n\n\n:+1::tada: nice, me too!\n\n\n\n# Contribute via Pull Requests\n\n\n\nPlease open a pull request (PR) for your changes and include:\n\n\n\n* An overall description/rationale of the PR\n\n* Tests for any new or modified functionality\n\n* Code formatted with `rustfmt` default style settings \n\n* License (Apache 2.0) and copyright statements for your code\n\n* A Developer Certificate of Origin (DCO) sign-off as described below\n\n* A willingness to iterate and make changes ;)\n\n\n\n`Roughenough` targets **stable Rust** only. Contributions that don't compile\n\non `stable` will be declined. Sorry.\n\n\n\n# Developer Certificate of Origin\n\n\n\nTo provide assurance of the provenance and integrity of contributions \n\nRoughenough uses the [Developer Certificate of Origin](https://developercertificate.org/)\n\ncreated by the Linux Foundation instead of lengthy Contributor License \n\nAgreements (CLAs). \n\n\n\nPlease include *verbatim* and *unchanged* the full DCO statement \n\nbelow with your PR:\n\n\n\n```\n\nDeveloper Certificate of Origin\n\nVersion 1.1\n\n\n\nCopyright (C) 2004, 2006 The Linux Foundation and its contributors.\n\n1 Letterman Drive\n\nSuite D4700\n\nSan Francisco, CA, 94129\n\n\n\nEveryone is permitted to copy and distribute verbatim copies of this\n\nlicense document, but changing it is not allowed.\n\n\n\nDeveloper's Certificate of Origin 1.1\n\n\n\nBy making a contribution to this project, I certify that:\n\n\n\n(a) The contribution was created in whole or in part by me and I\n\n have the right to submit it under the open source license\n\n indicated in the file; or\n\n\n\n(b) The contribution is based upon previous work that, to the best\n\n of my knowledge, is covered under an appropriate open source\n\n license and I have the right under that license to submit that\n\n work with modifications, whether created in whole or in part\n\n by me, under the same open source license (unless I am\n\n permitted to submit under a different license), as indicated\n","file_path":"CONTRIBUTING.md","rank":43,"score":20737.62226235527},{"content":"by the RFC is used to distinguish classic vs. rfc requests).\n\n\n\nThe new `-p/--protocol` flag of `roughenough-client` controls the protocol version to\n\nuse in requests (`0` = classic protocol, `1` = RFC protocol). The default is `0` the\n\n\"classic\" protocol, until the RFC is finalized:\n\n\n\n```\n","file_path":"README.md","rank":44,"score":20736.22188013426},{"content":" in the file; or\n\n\n\n(c) The contribution was provided directly to me by some other\n\n person who certified (a), (b) or (c) and I have not modified\n\n it.\n\n\n\n(d) I understand and agree that this project and the contribution\n\n are public and that a record of the contribution (including all\n\n personal information I submit with it, including my sign-off) is\n\n maintained indefinitely and may be redistributed consistent with\n\n this project or the open source license(s) involved.\n\n```\n\n\n","file_path":"CONTRIBUTING.md","rank":45,"score":20735.86324062343},{"content":"## About the Roughtime Protocol\n\n[Roughtime](https://roughtime.googlesource.com/roughtime) is a protocol that aims to achieve rough \n\ntime synchronisation in a secure way that doesn't depend on any particular time server, and in such\n\na way that, if a time server does misbehave, clients end up with cryptographic proof of it. It was \n\ncreated by Adam Langley and Robert Obryk.\n\n \n\n## Contributors\n\n* Stuart Stock (stuart {at} int08h.com)\n\n* Aaron Hill (aa1ronham {at} gmail.com)\n\n* Peter Todd (pete {at} petertodd.org)\n\n* Muncan90 (github.com/muncan90)\n\n* Zicklag (github.com/zicklag)\n\n\n\n## Copyright and License\n\nRoughenough is copyright (c) 2017-2021 int08h LLC. All rights reserved. \n\n\n\nint08h LLC licenses Roughenough (the \"Software\") to you under the Apache License, version 2.0 \n\n(the \"License\"); you may not use this Software except in compliance with the License. You may obtain \n\na copy of the License from the [LICENSE](../master/LICENSE) file included with the Software or at:\n\n\n\n http://www.apache.org/licenses/LICENSE-2.0\n\n\n\nUnless required by applicable law or agreed to in writing, software distributed under the License \n\nis distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or \n\nimplied. See the License for the specific language governing permissions and limitations under \n\nthe License.\n","file_path":"README.md","rank":46,"score":20733.760952665063},{"content":"# Thanks In Advance for Helping Roughenough!\n\n\n\nStuart @int08h\n","file_path":"CONTRIBUTING.md","rank":47,"score":20733.560382657583},{"content":"## Restore the 1024 byte minimum request size requirement\n\n\n\nDraft 02 states that: \n\n\n\n Responding to requests shorter than 1024 bytes is OPTIONAL \n\n and servers MUST NOT send responses larger than the requests \n\n they are replying to.\n\n\n\nThe minimum request size requirement exists to prevent a roughtime server from becoming\n\na DDoS amplifier [CF-DDoS]. A minimum request size of of 1024 bytes ensures that even \n\na busy roughtime server signing a Merkle tree of 64 requests generates a response *smaller* \n\nthan the 1024 byte request minimum (response would be 744 bytes, see [int08h]).\n\n\n\nIf requests smaller than 1024 bytes are permitted, how small could a request be? A valid \n\nRoughtime request *without* a PAD field would be 72 bytes long: \n\n\n\n 4 bytes number of fields \n\n 4 bytes NONC tag \n\n 64 bytes NONC value\n\n \n\nGiven that the *minimum* Server response size is 360 bytes [int08h], a minimal size request \n\npresents a DDoS attacker with a potential 5x gain in size. \n\n\n\nMaking the minimum response size OPTIONAL requires Roughtime server operators to decide \n\n\"how small is too small\" and a wrong choice will create more DDoS amplifiers in the world.\n\n\n\nSuggestion: mandate requests >= 1024 bytes\n\n\n","file_path":"doc/rfc-commentary.md","rank":48,"score":19346.449925651235},{"content":"## The LEAP field is not necessary \n\n\n\nRoughtime can handle leap seconds and time uncertainty/discontinuity complications without the \n\naddition of new tags/fields. The RADI field already provides a method for a Roughtime \n\nimplementation to express time uncertainty in responses [draf02]: \n\n\n\n The RADI tag value is a uint32 representing the server's estimate of\n\n the accuracy of MIDP in microseconds. Servers MUST ensure that the\n\n true time is within (MIDP-RADI, MIDP+RADI) at the time they compose\n\n the response message.\n\n\n\nIn the case of a leap second, a Roughtime server can increase the value returned in \n\nthe RADI field to account for the uncertainty introduced by a leap second. The increase \n\nin RADI value can persist as long as necessary (the duration of a leap second \"smear\" \n\nfor example [AWS-smear] and [Google-smear]).\n\n \n\nSuggestion: remove DUT, DTAI, and LEAP fields along with int32 type\n\n\n\n## Introduction of a signed int32 type creates a new security risk \n\n\n\nThe addition of the signed int32 field type (required to support the DUT, DTAI, and \n\nLEAP fields) exposes Roughtime implementations to a new *class* of software errors\n\naround sign/unsigned conversions. \n\n\n\nThe Common Weaknesses Enumeration Top 25 Most Dangerous Software Errors [CWE-TOP25] \n\nlists \"Integer Overflow or Wraparound\" as the #8 most frequent software weakness. The \n\ndetail page on integer overflow [CWE-190] identifies signed/unsigned confusion, \n\nunintentional wrap-around, and lack of range checks as sources of software errors.\n\n\n\nIntroducing a signed integer type into Roughtime does not guarantee these issues\n\noccur. However it does introduces an entirely new area of concern that would not\n\nexist if these signed fields were omitted. \n\n\n\nSuggestion: remove DUT, DTAI, and LEAP fields along with int32 type\n\n\n","file_path":"doc/rfc-commentary.md","rank":49,"score":19346.070920375896},{"content":"## Checking response vs. request size complicates server implementation\n\n\n\nIn Draft 02: \n\n\n\n Responding to requests shorter than 1024 bytes is OPTIONAL \n\n and servers MUST NOT send responses larger than the requests \n\n they are replying to.\n\n\n\nRoughtime servers can batch multiple requests into a single response making response \n\nsize a function of server load/batching parameters plus concurrent requests. Roughtime \n\nServer implementations may gather or buffer client requests prior to constructing the \n\nresponse. \n\n\n\n\"...servers MUST NOT send responses larger than the requests...\" will require implementations\n\nto perform additional tracking of per-request sizes and then compute the resulting response\n\nsize once the response *after* batch size has been determined. \n\n\n\nThis is more complex and incurs additional processing compared to simply rejecting all \n\nrequests <1024 bytes.\n\n\n\nSuggestion: mandate requests >= 1024 bytes\n\n\n\n## The \"ROUGHTIM\" packet format is redundant\n\n\n\nThe addition of the constant \"ROUGHTIM\" plus additional length field is redundant to \n\nthe message format (which also has a length field). The value this additional \n\npacket format is not clear.\n\n\n\nSuggestion: use \"bare\" Roughtime messages as the packet format \n\n\n\n## Stick with SHA-512; eliminate use of truncated SHA-512/256 \n\n\n\nTruncated SHA-512/256 is performed by a) compute SHA-512, then b) truncate the result. \n\nThe resulting computational effort of SHA-512 and SHA-512/256 is equivalent. \n\n\n\nThe draft utilizes SHA-512/256 for its 32 byte output, as opposed to 64 bytes for\n\nSHA-512. The motivation for this change is unclear and it complicates implementations\n\nwhich now need two hashing primitives (SHA-512/256 initialization is different than SHA-512).\n\n\n\nSuggestion: use SHA-512 throughout and drop any use of SHA-512/256\n\n\n\n## References \n\n\n\n* [AWS-smear] https://aws.amazon.com/blogs/aws/look-before-you-leap-the-coming-leap-second-and-aws/\n\n* [CF-DDoS] https://www.cloudflare.com/learning/ddos/ntp-amplification-ddos-attack/\n\n* [CWE-190] https://cwe.mitre.org/data/definitions/190.html\n\n* [CWE-TOP25] https://cwe.mitre.org/top25/archive/2019/2019_cwe_top25.html\n\n* [draft02] https://tools.ietf.org/html/draft-ietf-ntp-roughtime-02\n\n* [Google-smear] https://developers.google.com/time/smear\n\n* [int08h] https://int08h.com/post/to-catch-a-lying-timeserver/#keeping-response-sizes-compact\n\n* [roughtime] https://roughtime.googlesource.com/roughtime\n\n\n","file_path":"doc/rfc-commentary.md","rank":50,"score":19345.17244966042},{"content":"# Comments on draft-ietf-ntp-roughtime-02\n\n\n\nAuthor: Stuart Stock\n\nDate : 2020-06-14\n\n\n\n## Introduction\n\n\n\nI am the original creator and current maintainer of two Roughtime implementations:\n\n\n\n * Roughenough (Rust) https://github.com/int08h/roughenough\n\n * Nearenough (Java) https://github.com/int08h/nearenough\n\n\n\nHave written deep-dive articles about the Roughtime protocol: \n\n\n\n * https://int08h.com/post/to-catch-a-lying-timeserver/\n\n * https://int08h.com/post/roughtime-message-anatomy/\n\n \n\nAnd operate the longest running publicly accessible (non-Googler) Roughtime server \n\non the internet\n\n\n\n * roughtime.int08h.com:2002\n\n \n\nI offer my comments on draft-ietf-ntp-roughtime-02 as someone well versed in the Roughtime \n\nprotocol and intimately familiar with its implementation and trade-offs.\n\n\n\n## Keep the \"rough\" in \"Roughtime\"\n\n\n\nThe authors of the original Roughtime protocol definition [roughtime] state that a \n\ndeliberate goal of the Roughtime protocol was \"...time synchronisation to within 10 \n\nseconds of the correct time.\" Those authors go on to state that \"[i]f you have \n\n_serious_ time synchronisation needs you‘ll want the machinery in NTP or even PTP...\"\n\n\n\nAddition of the DUT, DTAI, and LEAP fields run contrary to this design intent. These fields\n\nprovide time synchronization features that duplicate those in NTP and PTP. Precise time \n\nsync should be delegated to NTP and PTP and their ecosystems.\n\n\n\nSimplicity of the Roughtime protocol encourages simple implementations. Simplicity\n\nin implementation is a key to assurance that implementations are correct and secure. \n\nIncreasing the number of fields and field types that must be implemented runs contrary \n\nto ease of implementation. Simplicity, and by extension security, should be a deliberate \n\nand top-of-mind design goal of the Roughtime standardization process.\n\n\n\nMultiple existing IETF protocols address needs of highly accurate time synchronization \n\nand should be used where timing precision requires. Keep Roughtime \"rough\".\n\n\n\nSuggestion: remove DUT, DTAI, and LEAP fields along with int32 type\n\n\n","file_path":"doc/rfc-commentary.md","rank":51,"score":19343.95215021442},{"content":" client_stats: false,\n\n fault_percentage: 0,\n\n };\n\n\n\n for (key, value) in cfg[0].as_hash().unwrap() {\n\n match key.as_str().unwrap() {\n\n \"port\" => config.port = value.as_i64().unwrap() as u16,\n\n \"interface\" => config.interface = value.as_str().unwrap().to_string(),\n\n \"batch_size\" => config.batch_size = value.as_i64().unwrap() as u8,\n\n \"seed\" => {\n\n let val = value.as_str().unwrap().to_string();\n\n config.seed = HEX\n\n .decode(val.as_bytes())\n\n .expect(\"seed value invalid; 'seed' must be a valid hex value\");\n\n }\n\n \"status_interval\" => {\n\n let val = value.as_i64().expect(\"status_interval value invalid\");\n\n config.status_interval = Duration::from_secs(val as u64)\n\n }\n\n \"kms_protection\" => {\n","file_path":"src/config/file.rs","rank":52,"score":27.686003752542824},{"content":" .parse()\n\n .unwrap_or_else(|_| panic!(\"invalid port: {}\", port));\n\n };\n\n\n\n if let Ok(interface) = env::var(ROUGHENOUGH_INTERFACE) {\n\n cfg.interface = interface.to_string();\n\n };\n\n\n\n if let Ok(seed) = env::var(ROUGHENOUGH_SEED) {\n\n cfg.seed = HEX\n\n .decode(seed.as_bytes())\n\n .expect(\"invalid seed value; 'seed' should be a hex value\");\n\n };\n\n\n\n if let Ok(batch_size) = env::var(ROUGHENOUGH_BATCH_SIZE) {\n\n cfg.batch_size = batch_size\n\n .parse()\n\n .unwrap_or_else(|_| panic!(\"invalid batch_size: {}\", batch_size));\n\n };\n\n\n","file_path":"src/config/environment.rs","rank":53,"score":26.850809330150312},{"content":" assert!(ciphertext_blob.len() < MIN_PAYLOAD_SIZE);\n\n\n\n let kms = MockKmsProvider {};\n\n let result = EnvelopeEncryption::decrypt_seed(&kms, ciphertext_blob.as_bytes());\n\n\n\n match result.expect_err(\"expected KmsError\") {\n\n KmsError::InvalidData(msg) => assert!(msg.contains(\"ciphertext too short\")),\n\n e => panic!(\"Unexpected error {:?}\", e),\n\n }\n\n }\n\n\n\n #[test]\n\n fn encrypt_decrypt_round_trip() {\n\n let kms = MockKmsProvider {};\n\n let plaintext = Vec::from(\"This is the plaintext used for this test 1\");\n\n\n\n let enc_result = EnvelopeEncryption::encrypt_seed(&kms, &plaintext);\n\n assert_eq!(enc_result.is_ok(), true);\n\n\n\n let ciphertext = enc_result.unwrap();\n","file_path":"src/kms/envelope.rs","rank":54,"score":26.113755650455992},{"content":"pub const DEFAULT_BATCH_SIZE: u8 = 64;\n\n\n\n/// Amount of time between each logged status update.\n\npub const DEFAULT_STATUS_INTERVAL: Duration = Duration::from_secs(600);\n\n\n\n///\n\n/// Specifies parameters needed to configure a Roughenough server.\n\n///\n\n/// Parameters labeled \"**Required**\" must always be provided and have no default value\n\n/// while those labeled \"**Optional**\" provide sane default values that can be overridden.\n\n///\n\n/// YAML Key | Environment Variable | Necessity | Description\n\n/// --- | --- | --- | ---\n\n/// `interface` | `ROUGHENOUGH_INTERFACE` | Required | IP address or interface name for listening to client requests\n\n/// `port` | `ROUGHENOUGH_PORT` | Required | UDP port to listen for requests\n\n/// `seed` | `ROUGHENOUGH_SEED` | Required | A 32-byte hexadecimal value used to generate the server's long-term key pair. **This is a secret value and must be un-guessable**, treat it with care. (If compiled with KMS support, length will vary)\n\n/// `batch_size` | `ROUGHENOUGH_BATCH_SIZE` | Optional | The maximum number of requests to process in one batch. All nonces in a batch are used to build a Merkle tree, the root of which is signed. Default is `64` requests per batch.\n\n/// `status_interval` | `ROUGHENOUGH_STATUS_INTERVAL` | Optional | Number of _seconds_ between each logged status update. Default is `600` seconds (10 minutes).\n\n/// `health_check_port` | `ROUGHENOUGH_HEALTH_CHECK_PORT` | Optional | If present, enable an HTTP health check responder on the provided port. **Use with caution**.\n\n/// `kms_protection` | `ROUGHENOUGH_KMS_PROTECTION` | Optional | If compiled with KMS support, the ID of the KMS key used to protect the long-term identity.\n\n/// `client_stats` | `ROUGHENOUGH_CLIENT_STATS` | Optional | A value of `on` or `yes` will enable tracking of per-client request statistics that will be output each time server status is logged. Default is `off` (disabled).\n\n/// `fault_percentage` | `ROUGHENOUGH_FAULT_PERCENTAGE` | Optional | Likelihood (as a percentage) that the server will intentionally return an invalid client response. An integer range from `0` (disabled, all responses valid) to `50` (50% of responses will be invalid). Default is `0` (disabled).\n\n///\n\n/// Implementations of this trait obtain a valid configuration from different back-end\n\n/// sources. See:\n\n/// * [FileConfig](struct.FileConfig.html) - configure via a YAML file\n\n/// * [EnvironmentConfig](struct.EnvironmentConfig.html) - configure via environment variables\n\n/// * [MemoryConfig](struct.MemoryConfig.html) - in-memory configuration for testing\n\n///\n","file_path":"src/config/mod.rs","rank":55,"score":25.87719205307963},{"content":"\n\nuse byteorder::{LittleEndian, ReadBytesExt, WriteBytesExt};\n\nuse data_encoding::{Encoding, HEXLOWER_PERMISSIVE};\n\n\n\nuse crate::error::Error;\n\nuse crate::RFC_REQUEST_FRAME_BYTES;\n\nuse crate::tag::Tag;\n\n\n\nconst HEX: Encoding = HEXLOWER_PERMISSIVE;\n\n\n\n///\n\n/// A Roughtime protocol message; a map of u32 tags to arbitrary byte-strings.\n\n///\n\n#[derive(Debug, Clone)]\n\npub struct RtMessage {\n\n tags: Vec<Tag>,\n\n values: Vec<Vec<u8>>,\n\n}\n\n\n\nimpl RtMessage {\n","file_path":"src/message.rs","rank":56,"score":24.876111238983725},{"content":"\n\n /// Create a CERT message with a DELE containing the provided online key\n\n /// and a SIG of the DELE value signed by the long-term key\n\n pub fn make_cert(&mut self, online_key: &OnlineKey) -> RtMessage {\n\n let dele_bytes = online_key.make_dele().encode().unwrap();\n\n\n\n self.signer.update(CERTIFICATE_CONTEXT.as_bytes());\n\n self.signer.update(&dele_bytes);\n\n\n\n let dele_signature = self.signer.sign();\n\n\n\n let mut cert_msg = RtMessage::with_capacity(2);\n\n cert_msg.add_field(Tag::SIG, &dele_signature).unwrap();\n\n cert_msg.add_field(Tag::DELE, &dele_bytes).unwrap();\n\n\n\n cert_msg\n\n }\n\n\n\n /// Return the public key for the provided seed\n\n pub fn public_key(&self) -> &[u8] {\n","file_path":"src/key/longterm.rs","rank":57,"score":23.553744771745027},{"content":"\n\nuse crate::CERTIFICATE_CONTEXT;\n\nuse crate::key::OnlineKey;\n\nuse crate::message::RtMessage;\n\nuse crate::sign::Signer;\n\nuse crate::tag::Tag;\n\n\n\n///\n\n/// Represents the server's long-term identity.\n\n///\n\npub struct LongTermKey {\n\n signer: Signer,\n\n}\n\n\n\nimpl LongTermKey {\n\n pub fn new(seed: &[u8]) -> Self {\n\n LongTermKey {\n\n signer: Signer::from_seed(seed),\n\n }\n\n }\n","file_path":"src/key/longterm.rs","rank":58,"score":22.6152522866697},{"content":"\n\nuse byteorder::{LittleEndian, WriteBytesExt};\n\nuse data_encoding::{Encoding, HEXLOWER_PERMISSIVE};\n\nuse mio::net::UdpSocket;\n\n\n\nuse crate::{RtMessage, Tag};\n\nuse crate::config::ServerConfig;\n\nuse crate::grease::Grease;\n\nuse crate::key::{LongTermKey, OnlineKey};\n\nuse crate::merkle::MerkleTree;\n\nuse crate::stats::ServerStats;\n\nuse crate::version::Version;\n\n\n\nconst HEX: Encoding = HEXLOWER_PERMISSIVE;\n\n\n\npub struct Responder {\n\n version: Version,\n\n online_key: OnlineKey,\n\n long_term_public_key: String,\n\n cert_bytes: Vec<u8>,\n","file_path":"src/responder.rs","rank":59,"score":22.568473263776212},{"content":"pub use crate::error::Error;\n\npub use crate::message::RtMessage;\n\npub use crate::tag::Tag;\n\n\n\nmod error;\n\nmod message;\n\nmod tag;\n\n\n\npub mod config;\n\npub mod grease;\n\npub mod key;\n\npub mod kms;\n\npub mod merkle;\n\npub mod request;\n\npub mod responder;\n\npub mod server;\n\npub mod sign;\n\npub mod stats;\n\npub mod version;\n\n\n\n/// Version of Roughenough\n\npub const VERSION: &str = \"1.2.0-draft-5\";\n\n\n\n/// Roughenough version string enriched with any compile-time optional features\n","file_path":"src/lib.rs","rank":60,"score":21.716071381167772},{"content":" // Invoke KMS to decrypt the DEK\n\n let dek = kms.decrypt_dek(&encrypted_dek)?;\n\n\n\n // Decrypt the seed value using the DEK\n\n let unbound_dek = UnboundKey::new(&AES_256_GCM, &dek)?;\n\n let dek_opening_key = LessSafeKey::new(unbound_dek);\n\n match dek_opening_key.open_in_place(nonce, Aad::from(AD), &mut encrypted_seed) {\n\n Ok(plaintext) => Ok(plaintext.to_vec()),\n\n Err(_) => Err(KmsError::OperationFailed(\n\n \"failed to decrypt plaintext seed\".to_string(),\n\n )),\n\n }\n\n }\n\n\n\n ///\n\n /// Encrypt the seed value and protect the seed's encryption key using a\n\n /// [`KmsProvider`](trait.KmsProvider.html).\n\n ///\n\n /// The returned encrypted byte blob is safe to store on unsecured media.\n\n ///\n","file_path":"src/kms/envelope.rs","rank":61,"score":21.636798553439654},{"content":" let dec_result = EnvelopeEncryption::decrypt_seed(&kms, &ciphertext_copy);\n\n match dec_result.expect_err(\"expected an error\") {\n\n KmsError::InvalidData(msg) => assert!(msg.contains(\"nonce (1)\")),\n\n e => panic!(\"unexpected error {:?}\", e),\n\n }\n\n }\n\n\n\n #[test]\n\n fn modified_ciphertext_is_detected() {\n\n let kms = MockKmsProvider {};\n\n let plaintext = Vec::from(\"This is the plaintext used for this test 4\");\n\n\n\n let enc_result = EnvelopeEncryption::encrypt_seed(&kms, &plaintext);\n\n assert_eq!(enc_result.is_ok(), true);\n\n\n\n let ciphertext = enc_result.unwrap();\n\n assert_ne!(plaintext, ciphertext);\n\n\n\n // start corruption 4 bytes in, after the DEK and NONCE length fields\n\n for i in (DEK_LEN_FIELD + NONCE_LEN_FIELD)..ciphertext.len() {\n","file_path":"src/kms/envelope.rs","rank":62,"score":21.552732184807194},{"content":"use crate::key::KmsProtection;\n\n\n\nconst HEX: Encoding = HEXLOWER_PERMISSIVE;\n\n\n\n/// A purely in-memory Roughenough config for testing purposes.\n\n///\n\n/// This is useful for testing or fuzzing a server without the need to create additional files.\n\npub struct MemoryConfig {\n\n pub port: u16,\n\n pub interface: String,\n\n pub seed: Vec<u8>,\n\n pub batch_size: u8,\n\n pub status_interval: Duration,\n\n pub kms_protection: KmsProtection,\n\n pub health_check_port: Option<u16>,\n\n pub client_stats: bool,\n\n pub fault_percentage: u8,\n\n}\n\n\n\nimpl MemoryConfig {\n","file_path":"src/config/memory.rs","rank":63,"score":21.157763257227657},{"content":" ciphertext_copy[1] = 99;\n\n let dec_result = EnvelopeEncryption::decrypt_seed(&kms, &ciphertext_copy);\n\n match dec_result.expect_err(\"expected an error\") {\n\n KmsError::InvalidData(msg) => assert!(msg.contains(\"invalid DEK\")),\n\n e => panic!(\"unexpected error {:?}\", e),\n\n }\n\n }\n\n\n\n #[test]\n\n fn invalid_nonce_length_detected() {\n\n let kms = MockKmsProvider {};\n\n let plaintext = Vec::from(\"This is the plaintext used for this test 3\");\n\n\n\n let enc_result = EnvelopeEncryption::encrypt_seed(&kms, &plaintext);\n\n assert_eq!(enc_result.is_ok(), true);\n\n\n\n let ciphertext = enc_result.unwrap();\n\n let mut ciphertext_copy = ciphertext.clone();\n\n\n\n ciphertext_copy[2] = 1;\n","file_path":"src/kms/envelope.rs","rank":64,"score":20.6000397847875},{"content":"\n\n match result {\n\n Ok((http_resp, enc_resp)) => {\n\n if http_resp.status() == StatusCode::OK {\n\n let ciphertext = enc_resp.ciphertext.unwrap();\n\n let ct = BASE64.decode(ciphertext.as_bytes())?;\n\n Ok(ct)\n\n } else {\n\n Err(self.pretty_http_error(&http_resp))\n\n }\n\n }\n\n Err(e) => Err(KmsError::OperationFailed(format!(\"encrypt_dek() {:?}\", e))),\n\n }\n\n }\n\n\n\n fn decrypt_dek(&self, encrypted_dek: &EncryptedDEK) -> Result<PlaintextDEK, KmsError> {\n\n let mut request = DecryptRequest::default();\n\n request.ciphertext = Some(BASE64.encode(encrypted_dek));\n\n request.additional_authenticated_data = Some(BASE64.encode(AD.as_bytes()));\n\n\n","file_path":"src/kms/gcpkms.rs","rank":65,"score":20.341562285010866},{"content":"impl EnvelopeEncryption {\n\n /// Decrypt a seed previously encrypted with `encrypt_seed()`\n\n pub fn decrypt_seed(\n\n kms: &dyn KmsProvider,\n\n ciphertext_blob: &[u8],\n\n ) -> Result<Vec<u8>, KmsError> {\n\n if ciphertext_blob.len() < MIN_PAYLOAD_SIZE {\n\n return Err(KmsError::InvalidData(format!(\n\n \"ciphertext too short: min {}, found {}\",\n\n MIN_PAYLOAD_SIZE,\n\n ciphertext_blob.len()\n\n )));\n\n }\n\n\n\n let mut tmp = Cursor::new(ciphertext_blob);\n\n\n\n // Read the lengths of the wrapped DEK and of the nonce\n\n let dek_len = tmp.read_u16::<LittleEndian>()? as usize;\n\n let nonce_len = tmp.read_u16::<LittleEndian>()? as usize;\n\n\n","file_path":"src/kms/envelope.rs","rank":66,"score":20.31883959760549},{"content":"const NONCE_LEN_BYTES: usize = 12;\n\n\n\n// Size of the AEAD authentication tag in bytes.\n\nconst TAG_LEN_BYTES: usize = 16;\n\n\n\n// Size of the 256-bit Data Encryption Key (DEK) in bytes.\n\nconst DEK_LEN_BYTES: usize = 32;\n\n\n\n// Trivial domain separation to guard against KMS key reuse\n\nconst AD: &str = \"roughenough\";\n\n\n\n/// An unencrypted (plaintext) 256-bit Data Encryption Key (DEK).\n\npub type PlaintextDEK = Vec<u8>;\n\n\n\n/// A Data Encryption Key (DEK) that has been encrypted (wrapped) by a Key Management System (KMS).\n\n///\n\n/// This is an opaque, implementation-specific value. AEAD tag size, nonce size,\n\n/// provider metadata, and so on will vary between [`KmsProvider`](trait.KmsProvider.html)\n\n/// implementations.\n\npub type EncryptedDEK = Vec<u8>;\n\n\n\n///\n\n/// A key management system that wraps/unwraps a data encryption key (DEK).\n\n///\n","file_path":"src/kms/mod.rs","rank":67,"score":19.66499171502273},{"content":" pub fn new(port: u16) -> Self {\n\n let seed = b\"a32049da0ffde0ded92ce10a0230d35fe615ec8461c14986baa63fe3b3bac3db\";\n\n MemoryConfig {\n\n port,\n\n interface: \"127.0.0.1\".to_string(),\n\n seed: HEX.decode(seed).unwrap(),\n\n batch_size: DEFAULT_BATCH_SIZE,\n\n status_interval: DEFAULT_STATUS_INTERVAL,\n\n kms_protection: KmsProtection::Plaintext,\n\n health_check_port: None,\n\n client_stats: false,\n\n fault_percentage: 0,\n\n }\n\n }\n\n}\n\n\n\nimpl ServerConfig for MemoryConfig {\n\n fn interface(&self) -> &str {\n\n self.interface.as_ref()\n\n }\n","file_path":"src/config/memory.rs","rank":68,"score":19.496726169340434},{"content":" response.add_field(Tag::CERT, cert_bytes).unwrap();\n\n response.add_field(Tag::INDX, &index).unwrap();\n\n\n\n response\n\n }\n\n\n\n /// Returns a reference to the long-term public key\n\n pub fn get_public_key(&self) -> &str {\n\n &self.long_term_public_key\n\n }\n\n\n\n /// Returns a reference to the on-line (delegated) key\n\n pub fn get_online_key(&self) -> &OnlineKey {\n\n &self.online_key\n\n }\n\n}\n","file_path":"src/responder.rs","rank":69,"score":19.46895231377104},{"content":"use crate::config::ServerConfig;\n\nuse crate::Error;\n\nuse crate::key::KmsProtection;\n\n\n\nconst HEX: Encoding = HEXLOWER_PERMISSIVE;\n\n\n\n///\n\n/// Obtain a Roughenough server configuration ([ServerConfig](trait.ServerConfig.html))\n\n/// from environment variables.\n\n///\n\n/// Config parameter | Environment Variable\n\n/// ---------------- | --------------------\n\n/// port | `ROUGHENOUGH_PORT`\n\n/// interface | `ROUGHENOUGH_INTERFACE`\n\n/// seed | `ROUGHENOUGH_SEED`\n\n/// batch_size | `ROUGHENOUGH_BATCH_SIZE`\n\n/// status_interval | `ROUGHENOUGH_STATUS_INTERVAL`\n\n/// kms_protection | `ROUGHENOUGH_KMS_PROTECTION`\n\n/// health_check_port | `ROUGHENOUGH_HEALTH_CHECK_PORT`\n\n/// client_stats | `ROUGHENOUGH_CLIENT_STATS`\n","file_path":"src/config/environment.rs","rank":70,"score":19.36556511506295},{"content":"\n\nuse crate::config::{DEFAULT_BATCH_SIZE, DEFAULT_STATUS_INTERVAL};\n\nuse crate::config::ServerConfig;\n\nuse crate::Error;\n\nuse crate::key::KmsProtection;\n\n\n\nconst HEX: Encoding = HEXLOWER_PERMISSIVE;\n\n\n\n///\n\n/// Read a Roughenough server configuration ([ServerConfig](trait.ServerConfig.html))\n\n/// from a YAML file.\n\n///\n\n/// Example minimal config:\n\n///\n\n/// ```yaml\n\n/// interface: 127.0.0.1\n\n/// port: 8686\n\n/// seed: f61075c988feb9cb700a4a6a3291bfbc9cab11b9c9eca8c802468eb38a43d7d3\n\n/// ```\n\n///\n","file_path":"src/config/file.rs","rank":71,"score":18.88428506251361},{"content":"// Copyright 2017-2021 int08h LLC\n\n//\n\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n\n// you may not use this file except in compliance with the License.\n\n// You may obtain a copy of the License at\n\n//\n\n// http://www.apache.org/licenses/LICENSE-2.0\n\n//\n\n// Unless required by applicable law or agreed to in writing, software\n\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\n// See the License for the specific language governing permissions and\n\n// limitations under the License.\n\n\n\n//!\n\n//! Protect the server's long-term key with envelope encryption and a key management system.\n\n//!\n\n//! Note: KMS support must be enabled at compile time, see the Roughenough's [documentation\n\n//! on optional features](https://github.com/int08h/roughenough/blob/master/doc/OPTIONAL-FEATURES.md#key-management-system-kms-support)\n\n//! for instructions.\n","file_path":"src/kms/mod.rs","rank":72,"score":18.556314814850282},{"content":"use crate::config::ServerConfig;\n\nuse crate::error;\n\nuse crate::key::KmsProtection;\n\n#[cfg(feature = \"awskms\")]\n\npub use crate::kms::awskms::inner::AwsKms;\n\n#[cfg(feature = \"gcpkms\")]\n\npub use crate::kms::gcpkms::inner::GcpKms;\n\n\n\npub use self::envelope::EnvelopeEncryption;\n\n\n\nmod envelope;\n\n\n\n/// Errors generated by KMS operations\n\n#[derive(Debug, PartialEq, Eq, PartialOrd, Hash, Clone)]\n\npub enum KmsError {\n\n OperationFailed(String),\n\n InvalidConfiguration(String),\n\n InvalidData(String),\n\n InvalidKey(String),\n\n}\n","file_path":"src/kms/mod.rs","rank":73,"score":18.4565171862957},{"content":"\n\nuse data_encoding::{Encoding, HEXLOWER_PERMISSIVE};\n\nuse ring::rand;\n\nuse ring::rand::SecureRandom;\n\nuse ring::signature::{self, Ed25519KeyPair, KeyPair};\n\n\n\nconst HEX: Encoding = HEXLOWER_PERMISSIVE;\n\n\n\nconst INITIAL_BUF_SIZE: usize = 1024;\n\n\n\n/// A multi-step (init-update-finish) interface for verifying an Ed25519 signature\n\n#[derive(Debug)]\n\npub struct Verifier {\n\n pubkey: Vec<u8>,\n\n buf: Vec<u8>,\n\n}\n\n\n\nimpl Verifier {\n\n pub fn new(pubkey: &[u8]) -> Self {\n\n Verifier {\n","file_path":"src/sign.rs","rank":74,"score":18.34684140210263},{"content":"\n\n let expected_sig = hex::decode(\n\n \"d9868d52c2bebce5f3fa5a79891970f309cb6591e3e1702a70276fa97c24b3a8e58606c38c9758529da50ee31b8219cba45271c689afa60b0ea26c99db19b00c\"\n\n ).unwrap();\n\n\n\n let mut s = Signer::from_seed(&seed);\n\n s.update(&message);\n\n let sig = s.sign();\n\n assert_eq!(sig, expected_sig);\n\n }\n\n\n\n #[test]\n\n fn sign_verify_round_trip() {\n\n let seed = hex::decode(\"334a05b07352a5436e180356da0ae6efa0345ff7fb1572575772e8005ed978e9\")\n\n .unwrap();\n\n\n\n let message = \"Hello world\".as_bytes();\n\n\n\n let mut signer = Signer::from_seed(&seed);\n\n signer.update(&message);\n","file_path":"src/sign.rs","rank":75,"score":17.947153566770965},{"content":" extern crate tokio;\n\n extern crate yup_oauth2 as oauth2;\n\n\n\n use std::default::Default;\n\n use std::env;\n\n use std::path::Path;\n\n use std::result::Result;\n\n\n\n use data_encoding::BASE64;\n\n use tokio::runtime::Runtime;\n\n\n\n use crate::kms::{AD, EncryptedDEK, KmsError, KmsProvider, PlaintextDEK};\n\n\n\n use self::cloudkms1::api::{DecryptRequest, EncryptRequest};\n\n use self::cloudkms1::CloudKMS;\n\n use self::hyper::{Body, StatusCode};\n\n use self::oauth2::ServiceAccountKey;\n\n\n\n const GOOGLE_APP_CREDS: &str = &\"GOOGLE_APPLICATION_CREDENTIALS\";\n\n\n","file_path":"src/kms/gcpkms.rs","rank":76,"score":17.870414253500776},{"content":" pub fn public_key_bytes(&self) -> &[u8] {\n\n self.key_pair.public_key().as_ref()\n\n }\n\n}\n\n\n\nimpl fmt::Display for Signer {\n\n fn fmt(&self, f: &mut Formatter) -> fmt::Result {\n\n write!(f, \"{}\", HEX.encode(self.public_key_bytes()))\n\n }\n\n}\n\n\n\nimpl fmt::Debug for Signer {\n\n fn fmt(&self, f: &mut Formatter) -> fmt::Result {\n\n write!(\n\n f,\n\n \"Signer({}, {:?})\",\n\n HEX.encode(self.public_key_bytes()),\n\n self.buf\n\n )\n\n }\n","file_path":"src/sign.rs","rank":77,"score":17.680551417190358},{"content":"use std::str::FromStr;\n\n\n\npub use self::longterm::LongTermKey;\n\npub use self::online::OnlineKey;\n\n\n\nmod longterm;\n\nmod online;\n\n\n\n/// Methods for protecting the server's long-term identity\n\n#[derive(Debug, PartialEq, Eq, PartialOrd, Hash, Clone)]\n\npub enum KmsProtection {\n\n /// No protection, seed is in plaintext\n\n Plaintext,\n\n\n\n /// Envelope encryption of the seed using AWS Key Management Service\n\n AwsKmsEnvelope(String),\n\n\n\n /// Envelope encryption of the seed using Google Cloud Key Management Service\n\n GoogleKmsEnvelope(String),\n\n}\n","file_path":"src/key/mod.rs","rank":78,"score":17.619224713266348},{"content":"\n\n /// Returns a slice of the tags in the message\n\n pub fn tags(&self) -> &[Tag] {\n\n &self.tags\n\n }\n\n\n\n /// Returns a slice of the values in the message\n\n pub fn values(&self) -> &[Vec<u8>] {\n\n &self.values\n\n }\n\n\n\n /// Converts the message into a `HashMap` mapping each tag to its value\n\n pub fn into_hash_map(self) -> HashMap<Tag, Vec<u8>> {\n\n self.tags.into_iter().zip(self.values.into_iter()).collect()\n\n }\n\n\n\n /// Encode this message into an on-the-wire representation prefixed with RFC framing.\n\n pub fn encode_framed(&self) -> Result<Vec<u8>, Error> {\n\n let encoded = self.encode()?;\n\n let mut frame = Vec::with_capacity(RFC_REQUEST_FRAME_BYTES.len() + 4 + encoded.len());\n","file_path":"src/message.rs","rank":79,"score":17.614830271856157},{"content":" use std::io::{Cursor, Read};\n\n\n\n use byteorder::{LittleEndian, ReadBytesExt};\n\n\n\n use crate::message::*;\n\n use crate::tag::Tag;\n\n\n\n #[test]\n\n fn empty_message_size() {\n\n let msg = RtMessage::with_capacity(0);\n\n\n\n assert_eq!(msg.num_fields(), 0);\n\n // Empty message is 4 bytes, a single num_tags value\n\n assert_eq!(msg.encoded_size(), 4);\n\n }\n\n\n\n #[test]\n\n fn single_field_message_size() {\n\n let mut msg = RtMessage::with_capacity(1);\n\n msg.add_field(Tag::NONC, \"1234\".as_bytes()).unwrap();\n","file_path":"src/message.rs","rank":80,"score":17.566203998567065},{"content":" use crate::kms::{KmsError, KmsProvider};\n\n use crate::kms::envelope::{DEK_LEN_FIELD, MIN_PAYLOAD_SIZE, NONCE_LEN_FIELD};\n\n use crate::kms::EnvelopeEncryption;\n\n\n\n struct MockKmsProvider {}\n\n\n\n // Mock provider that returns a copy of the input\n\n impl KmsProvider for MockKmsProvider {\n\n fn encrypt_dek(&self, plaintext_dek: &Vec<u8>) -> Result<Vec<u8>, KmsError> {\n\n Ok(plaintext_dek.to_vec())\n\n }\n\n\n\n fn decrypt_dek(&self, encrypted_dek: &Vec<u8>) -> Result<Vec<u8>, KmsError> {\n\n Ok(encrypted_dek.to_vec())\n\n }\n\n }\n\n\n\n #[test]\n\n fn decryption_reject_input_too_short() {\n\n let ciphertext_blob = \"1234567890\";\n","file_path":"src/kms/envelope.rs","rank":81,"score":17.523290792840143},{"content":" Classic,\n\n\n\n /// IETF standardized version\n\n Rfc,\n\n}\n\n\n\n// RFC version 1\n\nconst VERSION_1: &'static [u8] = &[0x01, 0x00, 0x00, 0x00];\n\n\n\nimpl Version {\n\n /// On-the-wire representation of the version value\n\n pub fn wire_bytes(self) -> &'static [u8] {\n\n match self {\n\n Version::Classic => unreachable!(\"invalid, no version bytes for Classic\"),\n\n Version::Rfc => VERSION_1,\n\n }\n\n }\n\n\n\n /// A short (non-canonical) string representation of the `Version`\n\n pub fn to_string(&self) -> String {\n","file_path":"src/version.rs","rank":82,"score":17.345976126192177},{"content":" #[test]\n\n fn sign_ed25519_empty_message() {\n\n let seed = hex::decode(\"9d61b19deffd5a60ba844af492ec2cc44449c5697b326919703bac031cae7f60\")\n\n .unwrap();\n\n\n\n let expected_sig = hex::decode(\n\n \"e5564300c360ac729086e2cc806e828a84877f1eb8e5d974d873e065224901555fb8821590a33bacc61e39701cf9b46bd25bf5f0595bbe24655141438e7a100b\"\n\n ).unwrap();\n\n\n\n let mut s = Signer::from_seed(&seed);\n\n let sig = s.sign();\n\n assert_eq!(sig, expected_sig);\n\n }\n\n\n\n #[test]\n\n fn sign_ed25519_message() {\n\n let seed = hex::decode(\"0d4a05b07352a5436e180356da0ae6efa0345ff7fb1572575772e8005ed978e9\")\n\n .unwrap();\n\n\n\n let message = hex::decode(\"cbc77b\").unwrap();\n","file_path":"src/sign.rs","rank":83,"score":17.315637332203245},{"content":" \"plaintext seed value must be 32 characters long, found {}\",\n\n cfg.seed().len()\n\n );\n\n is_valid = false;\n\n } else if *cfg.kms_protection() != KmsProtection::Plaintext\n\n && cfg.seed().len() <= SEED_LENGTH as usize\n\n {\n\n error!(\"KMS use enabled but seed value is too short to be an encrypted blob\");\n\n is_valid = false;\n\n }\n\n\n\n if cfg.batch_size() < 1 || cfg.batch_size() > 64 {\n\n error!(\n\n \"batch_size {} is invalid; valid range 1-64\",\n\n cfg.batch_size()\n\n );\n\n is_valid = false;\n\n }\n\n\n\n if cfg.fault_percentage() > 50 {\n","file_path":"src/config/mod.rs","rank":84,"score":17.30678753873255},{"content":"#[derive(Debug)]\n\npub enum Error {\n\n /// The associated tag was added to an `RtMessage` in non-increasing order.\n\n TagNotStrictlyIncreasing(Tag),\n\n\n\n /// The associated byte sequence does not correspond to a valid Roughtime tag.\n\n InvalidTag(Box<[u8]>),\n\n\n\n /// Invalid number of tags specified\n\n InvalidNumTags(u32),\n\n\n\n /// Tag value length exceeds length of source bytes\n\n InvalidValueLength(Tag, u32),\n\n\n\n /// Encoding failed. The associated `std::io::Error` should provide more information.\n\n EncodingFailure(std::io::Error),\n\n\n\n /// Request was less than 1024 bytes\n\n RequestTooShort,\n\n\n","file_path":"src/error.rs","rank":85,"score":16.525515841522164},{"content":" let val =\n\n value.as_str().unwrap().parse().unwrap_or_else(|_| {\n\n panic!(\"invalid kms_protection value: {:?}\", value)\n\n });\n\n config.kms_protection = val\n\n }\n\n \"health_check_port\" => {\n\n let val = value.as_i64().unwrap() as u16;\n\n config.health_check_port = Some(val);\n\n }\n\n \"client_stats\" => {\n\n let val = value.as_str().unwrap().to_ascii_lowercase();\n\n config.client_stats = val == \"yes\" || val == \"on\";\n\n }\n\n \"fault_percentage\" => {\n\n let val = value.as_i64().unwrap() as u8;\n\n config.fault_percentage = val;\n\n }\n\n unknown => {\n\n return Err(Error::InvalidConfiguration(format!(\n","file_path":"src/config/file.rs","rank":86,"score":16.48155911299641},{"content":"}\n\n\n\n#[rustfmt::skip] // rustfmt errors on the long signature strings\n\n#[cfg(test)]\n\nmod test {\n\n use super::*;\n\n\n\n #[test]\n\n fn verify_ed25519_sig_on_empty_message() {\n\n let pubkey = hex::decode(\n\n \"d75a980182b10ab7d54bfed3c964073a0ee172f3daa62325af021a68f707511a\",\n\n ).unwrap();\n\n\n\n let signature = hex::decode(\n\n \"e5564300c360ac729086e2cc806e828a84877f1eb8e5d974d873e065224901555fb8821590a33bacc61e39701cf9b46bd25bf5f0595bbe24655141438e7a100b\"\n\n ).unwrap();\n\n\n\n let v = Verifier::new(&pubkey);\n\n let result = v.verify(&signature);\n\n assert_eq!(result, true);\n","file_path":"src/sign.rs","rank":87,"score":16.456218234569725},{"content":"/// A multi-step (init-update-finish) interface for creating an Ed25519 signature\n\npub struct Signer {\n\n key_pair: Ed25519KeyPair,\n\n buf: Vec<u8>,\n\n}\n\n\n\nimpl Default for Signer {\n\n fn default() -> Self {\n\n Self::new()\n\n }\n\n}\n\n\n\nimpl Signer {\n\n pub fn new() -> Self {\n\n let rng = rand::SystemRandom::new();\n\n let mut seed = [0u8; 32];\n\n rng.fill(&mut seed).unwrap();\n\n\n\n Signer::from_seed(&seed)\n\n }\n","file_path":"src/sign.rs","rank":88,"score":16.390687017295658},{"content":" result.push_str(&HEX.encode(value));\n\n result.push_str(\"\\n\");\n\n }\n\n }\n\n\n\n result.push_str(&indent1);\n\n result.push_str(\"}\\n\");\n\n\n\n result\n\n }\n\n}\n\n\n\nimpl Display for RtMessage {\n\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\n\n write!(f, \"{}\", self.to_string(1))\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n","file_path":"src/message.rs","rank":89,"score":16.23589900337493},{"content":"use crate::kms::{AD, DEK_LEN_BYTES, KmsError, KmsProvider, NONCE_LEN_BYTES, TAG_LEN_BYTES};\n\nuse crate::SEED_LENGTH;\n\n\n\nconst DEK_LEN_FIELD: usize = 2;\n\nconst NONCE_LEN_FIELD: usize = 2;\n\n\n\n// 2 bytes - encrypted DEK length\n\n// 2 bytes - nonce length\n\n// n bytes - encrypted DEK\n\n// n bytes - nonce\n\n// n bytes - opaque (AEAD encrypted seed + tag)\n\nconst MIN_PAYLOAD_SIZE: usize = DEK_LEN_FIELD\n\n + NONCE_LEN_FIELD\n\n + DEK_LEN_BYTES\n\n + NONCE_LEN_BYTES\n\n + SEED_LENGTH as usize\n\n + TAG_LEN_BYTES;\n\n\n\n// Convenience function to create zero-filled Vec of given size\n","file_path":"src/kms/envelope.rs","rank":90,"score":15.942970797289878},{"content":"use crate::message::RtMessage;\n\nuse crate::sign::Signer;\n\nuse crate::SIGNED_RESPONSE_CONTEXT;\n\nuse crate::tag::Tag;\n\n\n\n///\n\n/// Represents the delegated Roughtime ephemeral online key.\n\n///\n\npub struct OnlineKey {\n\n signer: Signer,\n\n}\n\n\n\nimpl Default for OnlineKey {\n\n fn default() -> Self {\n\n Self::new()\n\n }\n\n}\n\n\n\nimpl OnlineKey {\n\n pub fn new() -> Self {\n","file_path":"src/key/online.rs","rank":91,"score":15.405958318771885},{"content":" let mut ciphertext_copy = ciphertext.clone();\n\n // flip some bits\n\n ciphertext_copy[i] = ciphertext[i].wrapping_add(1);\n\n\n\n let dec_result = EnvelopeEncryption::decrypt_seed(&kms, &ciphertext_copy);\n\n\n\n match dec_result.expect_err(\"Expected a KmsError error here\") {\n\n KmsError::OperationFailed(msg) => assert!(msg.contains(\"failed to decrypt\")),\n\n e => panic!(\"unexpected result {:?}\", e),\n\n }\n\n }\n\n }\n\n}\n","file_path":"src/kms/envelope.rs","rank":92,"score":15.331490169242826},{"content":"\n\n /// Returns the length in bytes of this message's on-the-wire representation.\n\n pub fn encoded_size(&self) -> usize {\n\n let num_tags = self.tags.len();\n\n let tags_size = 4 * num_tags;\n\n let offsets_size = if num_tags < 2 { 0 } else { 4 * (num_tags - 1) };\n\n let values_size: usize = self.values.iter().map(|v| v.len()).sum();\n\n\n\n 4 + tags_size + offsets_size + values_size\n\n }\n\n\n\n /// Calculate the length of PAD value such that the final encoded size of this message\n\n /// will be at least 1KB.\n\n pub fn calculate_padding_length(&mut self) -> usize {\n\n let size = self.encoded_size();\n\n if size >= 1024 {\n\n return 0;\n\n }\n\n\n\n let mut padding_needed = 1024 - size;\n","file_path":"src/message.rs","rank":93,"score":15.302632022470409},{"content":"//! system (KMS). The resulting opaque encrypted \"blob\" (encrypted seed + encrypted DEK) is\n\n//! stored in the Roughenough configuration.\n\n//!\n\n//! At server start-up the KMS is used to decrypt the DEK, which is then used to (in memory)\n\n//! decrypt the seed. The seed is used to generate the\n\n//! [delegated on-line key](../key/struct.OnlineKey.html) after which the seed and DEK are erased\n\n//! from memory.\n\n//!\n\n//! See\n\n//! * [`EnvelopeEncryption`](struct.EnvelopeEncryption.html) for Roughenough's implementation.\n\n//! * [Google](https://cloud.google.com/kms/docs/envelope-encryption) or\n\n//! [Amazon](https://docs.aws.amazon.com/kms/latest/developerguide/concepts.html#enveloping)\n\n//! for more in-depth explanations of envelope encryption.\n\n//!\n\n\n\nuse std;\n\n\n\nuse data_encoding;\n\nuse ring;\n\n\n","file_path":"src/kms/mod.rs","rank":94,"score":15.132062391034816},{"content":"//!\n\n\n\nuse rand::{FromEntropy, Rng};\n\nuse rand::distributions::Bernoulli;\n\nuse rand::rngs::SmallRng;\n\nuse rand::seq::index::sample as index_sample;\n\nuse rand::seq::SliceRandom;\n\n\n\nuse crate::grease::Pathologies::*;\n\nuse crate::RtMessage;\n\nuse crate::SIGNATURE_LENGTH;\n\nuse crate::tag::Tag;\n\n\n\n///\n\n/// Ways that a message can be made invalid.\n\n///\n\npub enum Pathologies {\n\n /// Randomly re-order the (tag, value) pairs in the message. This violates the protocol's\n\n /// requirement that tags must be in strictly increasing order.\n\n RandomlyOrderTags,\n","file_path":"src/grease.rs","rank":95,"score":15.095921039725532},{"content":" assert_ne!(plaintext, ciphertext);\n\n\n\n let dec_result = EnvelopeEncryption::decrypt_seed(&kms, &ciphertext);\n\n assert_eq!(dec_result.is_ok(), true);\n\n\n\n let new_plaintext = dec_result.unwrap();\n\n assert_eq!(plaintext, new_plaintext);\n\n }\n\n\n\n #[test]\n\n fn invalid_dek_length_detected() {\n\n let kms = MockKmsProvider {};\n\n let plaintext = Vec::from(\"This is the plaintext used for this test 2\");\n\n\n\n let enc_result = EnvelopeEncryption::encrypt_seed(&kms, &plaintext);\n\n assert_eq!(enc_result.is_ok(), true);\n\n\n\n let ciphertext = enc_result.unwrap();\n\n let mut ciphertext_copy = ciphertext.clone();\n\n\n","file_path":"src/kms/envelope.rs","rank":96,"score":15.03936637009204},{"content":" pub fn encrypt_seed(kms: &dyn KmsProvider, plaintext_seed: &[u8]) -> Result<Vec<u8>, KmsError> {\n\n // Generate random DEK and nonce\n\n let rng = SystemRandom::new();\n\n let mut raw_dek = [0u8; DEK_LEN_BYTES];\n\n let mut raw_nonce = [0u8; NONCE_LEN_BYTES];\n\n rng.fill(&mut raw_dek)?;\n\n rng.fill(&mut raw_nonce)?;\n\n\n\n // Ring will overwrite plaintext with ciphertext+tag in this buffer\n\n let mut buf = plaintext_seed.to_vec();\n\n\n\n // Encrypt the plaintext seed (in buf) using the DEK\n\n let nonce = Nonce::assume_unique_for_key(raw_nonce);\n\n let unbound_dek = UnboundKey::new(&AES_256_GCM, &raw_dek)?;\n\n let dek_seal_key = LessSafeKey::new(unbound_dek);\n\n\n\n // Output overwrites context of 'buf' and appends auth tag to 'buf'\n\n if let Err(_) = dek_seal_key.seal_in_place_append_tag(nonce, Aad::from(AD), &mut buf) {\n\n return Err(KmsError::OperationFailed(\n\n \"failed to encrypt plaintext seed\".to_string(),\n","file_path":"src/kms/envelope.rs","rank":97,"score":15.017686984316757},{"content":" fn handle_health_check(&mut self) {\n\n let listener = self.health_listener.as_ref().unwrap();\n\n match listener.accept() {\n\n Ok((ref mut stream, src_addr)) => {\n\n info!(\"health check from {}\", src_addr);\n\n self.stats.add_health_check(&src_addr.ip());\n\n\n\n match stream.write(HTTP_RESPONSE.as_bytes()) {\n\n Ok(_) => (),\n\n Err(e) => warn!(\"error writing health check {}\", e),\n\n };\n\n\n\n match stream.shutdown(Shutdown::Both) {\n\n Ok(_) => (),\n\n Err(e) => warn!(\"error in health check socket shutdown {}\", e),\n\n }\n\n }\n\n Err(ref e) if e.kind() == ErrorKind::WouldBlock => {\n\n debug!(\"blocking in TCP health check\");\n\n }\n","file_path":"src/server.rs","rank":98,"score":15.000561066992105},{"content":"\n\n /// Request did not provide versions compatible with this implementation\n\n NoCompatibleVersion,\n\n}\n\n\n\nimpl From<std::io::Error> for Error {\n\n fn from(err: std::io::Error) -> Self {\n\n Error::EncodingFailure(err)\n\n }\n\n}\n\n\n\nimpl From<KmsError> for Error {\n\n fn from(err: KmsError) -> Self {\n\n match err {\n\n KmsError::OperationFailed(m) => {\n\n Error::InvalidConfiguration(format!(\"KMS operation failed: {}\", m))\n\n }\n\n KmsError::InvalidConfiguration(m) => {\n\n Error::InvalidConfiguration(format!(\"invalid KMS config: {}\", m))\n\n }\n","file_path":"src/error.rs","rank":99,"score":14.998406067825659}],"string":"[\n {\n \"content\": \"/// Factory function to create a `ServerConfig` _trait object_ based on the value\\n\\n/// of the provided `arg`.\\n\\n///\\n\\n/// * `ENV` will return an [`EnvironmentConfig`](struct.EnvironmentConfig.html)\\n\\n/// * any other value returns a [`FileConfig`](struct.FileConfig.html)\\n\\n///\\n\\npub fn make_config(arg: &str) -> Result<Box<dyn ServerConfig>, Error> {\\n\\n if arg == \\\"ENV\\\" {\\n\\n match EnvironmentConfig::new() {\\n\\n Ok(cfg) => Ok(Box::new(cfg)),\\n\\n Err(e) => Err(e),\\n\\n }\\n\\n } else {\\n\\n match FileConfig::new(arg) {\\n\\n Ok(cfg) => Ok(Box::new(cfg)),\\n\\n Err(e) => Err(e),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n///\\n\\n/// Validate configuration settings. Returns `true` if the config is valid, `false` otherwise.\\n\\n///\\n\",\n \"file_path\": \"src/config/mod.rs\",\n \"rank\": 0,\n \"score\": 120468.40105180875\n },\n {\n \"content\": \"/// Roughenough version string enriched with any compile-time optional features\\n\\npub fn roughenough_version() -> String {\\n\\n let kms_str = if cfg!(feature = \\\"awskms\\\") {\\n\\n \\\" (+AWS KMS)\\\"\\n\\n } else if cfg!(feature = \\\"gcpkms\\\") {\\n\\n \\\" (+GCP KMS)\\\"\\n\\n } else {\\n\\n \\\"\\\"\\n\\n };\\n\\n\\n\\n format!(\\\"{}{}\\\", VERSION, kms_str)\\n\\n}\\n\\n\\n\\n// Constants and magic numbers of the Roughtime protocol\\n\\n\\n\\n/// Minimum size (in bytes) of a client request\\n\\npub const MIN_REQUEST_LENGTH: u32 = 1024;\\n\\n\\n\\n/// Size (in bytes) of seeds used to derive private keys\\n\\npub const SEED_LENGTH: u32 = 32;\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 1,\n \"score\": 105556.69495275454\n },\n {\n \"content\": \"#[cfg(not(any(feature = \\\"awskms\\\", feature = \\\"gcpkms\\\")))]\\n\\npub fn load_seed(config: &dyn ServerConfig) -> Result<Vec<u8>, error::Error> {\\n\\n match config.kms_protection() {\\n\\n KmsProtection::Plaintext => Ok(config.seed()),\\n\\n v => Err(error::Error::InvalidConfiguration(format!(\\n\\n \\\"kms_protection '{}' requires KMS, but server was not compiled with KMS support\\\",\\n\\n v\\n\\n ))),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/kms/mod.rs\",\n \"rank\": 2,\n \"score\": 73804.99768809955\n },\n {\n \"content\": \"/// Guess which protocol the request is using and extract the client's nonce from the request\\n\\npub fn nonce_from_request(buf: &[u8], num_bytes: usize) -> Result<(Vec<u8>, Version), Error> {\\n\\n if num_bytes < MIN_REQUEST_LENGTH as usize {\\n\\n return Err(Error::RequestTooShort);\\n\\n }\\n\\n\\n\\n match guess_protocol_version(buf) {\\n\\n Version::Classic => nonce_from_classic_request(&buf[..num_bytes]),\\n\\n Version::Rfc => nonce_from_rfc_request(&buf[..num_bytes]),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/request.rs\",\n \"rank\": 3,\n \"score\": 73046.71167608433\n },\n {\n \"content\": \"///\\n\\n/// A key management system that wraps/unwraps a data encryption key (DEK).\\n\\n///\\n\\npub trait KmsProvider {\\n\\n /// Make a blocking request to encrypt (wrap) the provided plaintext data encryption key.\\n\\n fn encrypt_dek(&self, plaintext_dek: &PlaintextDEK) -> Result<EncryptedDEK, KmsError>;\\n\\n\\n\\n /// Make a blocking request to decrypt (unwrap) a previously encrypted data encryption key.\\n\\n fn decrypt_dek(&self, encrypted_dek: &EncryptedDEK) -> Result<PlaintextDEK, KmsError>;\\n\\n}\\n\\n\\n\\n#[cfg(feature = \\\"awskms\\\")]\\n\\nmod awskms;\\n\\n\\n\\n/// Load the seed value for the long-term key.\\n\\n///\\n\\n/// Loading behavior depends on the value of `config.kms_protection()`:\\n\\n///\\n\\n/// * If `config.kms_protection() == Plaintext` then the value returned from `config.seed()`\\n\\n/// is used as-is and assumed to be a 32-byte hexadecimal value.\\n\\n///\\n\\n/// * Otherwise `config.seed()` is assumed to be an encrypted opaque blob generated from\\n\\n/// a prior `EnvelopeEncryption::encrypt_seed` call. The value of `config.kms_protection()`\\n\\n/// is parsed as a KMS key id and `EnvelopeEncryption::decrypt_seed` is called to obtain\\n\\n/// the plaintext seed value.\\n\\n///\\n\",\n \"file_path\": \"src/kms/mod.rs\",\n \"rank\": 4,\n \"score\": 70164.18147173194\n },\n {\n \"content\": \"#[allow(clippy::useless_let_if_seq)]\\n\\npub fn is_valid_config(cfg: &dyn ServerConfig) -> bool {\\n\\n let mut is_valid = true;\\n\\n\\n\\n if cfg.port() == 0 {\\n\\n error!(\\\"server port not set: {}\\\", cfg.port());\\n\\n is_valid = false;\\n\\n }\\n\\n\\n\\n if cfg.interface().is_empty() {\\n\\n error!(\\\"'interface' is missing\\\");\\n\\n is_valid = false;\\n\\n }\\n\\n\\n\\n if cfg.seed().is_empty() {\\n\\n error!(\\\"'seed' value is missing\\\");\\n\\n is_valid = false;\\n\\n } else if *cfg.kms_protection() == KmsProtection::Plaintext\\n\\n && cfg.seed().len() != SEED_LENGTH as usize\\n\\n {\\n\\n error!(\\n\",\n \"file_path\": \"src/config/mod.rs\",\n \"rank\": 5,\n \"score\": 64421.31983843311\n },\n {\n \"content\": \"fn has_supported_version(msg: &RtMessage) -> bool {\\n\\n let expected_ver_bytes = Version::Rfc.wire_bytes();\\n\\n\\n\\n if let Some(tag_bytes) = msg.get_field(Tag::VER) {\\n\\n // Iterate the list of supplied versions, looking for a match\\n\\n for found_ver_bytes in tag_bytes.chunks(4) {\\n\\n if found_ver_bytes == expected_ver_bytes {\\n\\n return true;\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n false\\n\\n}\\n\",\n \"file_path\": \"src/request.rs\",\n \"rank\": 6,\n \"score\": 59062.79032629927\n },\n {\n \"content\": \"fn create_nested_message(c: &mut Criterion) {\\n\\n let pad = [0u8; 400];\\n\\n\\n\\n c.bench_function(\\\"create nested message\\\", move |b| {\\n\\n b.iter(|| {\\n\\n let mut msg1 = RtMessage::with_capacity(4);\\n\\n msg1.add_field(Tag::SIG, \\\"0987\\\".as_bytes()).unwrap();\\n\\n msg1.add_field(Tag::NONC, \\\"wxyz\\\".as_bytes()).unwrap();\\n\\n msg1.add_field(Tag::DELE, \\\"1234\\\".as_bytes()).unwrap();\\n\\n msg1.add_field(Tag::PATH, \\\"abcd\\\".as_bytes()).unwrap();\\n\\n\\n\\n let mut msg2 = RtMessage::with_capacity(2);\\n\\n msg2.add_field(Tag::PUBK, \\\"1234567890\\\".as_bytes()).unwrap();\\n\\n msg2.add_field(Tag::PAD_CLASSIC, pad.as_ref()).unwrap();\\n\\n })\\n\\n });\\n\\n}\\n\\n\\n\\nstatic SIZES: &[u8] = &[1, 3, 9, 17, 200];\\n\\nstatic DATA: &[u8] = &[1u8; 64];\\n\\n\\n\",\n \"file_path\": \"benches/roughenough-bench.rs\",\n \"rank\": 7,\n \"score\": 58474.447568798125\n },\n {\n \"content\": \"fn reuse_merkle_trees(c: &mut Criterion) {\\n\\n let mut tree = MerkleTree::new();\\n\\n\\n\\n c.bench_function_over_inputs(\\n\\n \\\"reuse existing merkle tree\\\",\\n\\n move |b, &size| {\\n\\n b.iter(|| {\\n\\n tree.reset();\\n\\n for _ in 0..*size {\\n\\n tree.push_leaf(DATA);\\n\\n }\\n\\n black_box(tree.compute_root());\\n\\n })\\n\\n },\\n\\n SIZES,\\n\\n );\\n\\n}\\n\\n\\n\\ncriterion_group!(\\n\\n message_creation,\\n\",\n \"file_path\": \"benches/roughenough-bench.rs\",\n \"rank\": 8,\n \"score\": 58474.447568798125\n },\n {\n \"content\": \"fn create_empty_message(c: &mut Criterion) {\\n\\n c.bench_function(\\\"create empty message\\\", |b| {\\n\\n b.iter(|| RtMessage::with_capacity(0))\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/roughenough-bench.rs\",\n \"rank\": 9,\n \"score\": 58474.447568798125\n },\n {\n \"content\": \"fn create_two_field_message(c: &mut Criterion) {\\n\\n c.bench_function(\\\"create two field message\\\", |b| {\\n\\n b.iter(|| {\\n\\n let mut msg = RtMessage::with_capacity(2);\\n\\n msg.add_field(Tag::NONC, \\\"1234\\\".as_bytes()).unwrap();\\n\\n msg.add_field(Tag::PAD_CLASSIC, \\\"abcd\\\".as_bytes()).unwrap();\\n\\n })\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/roughenough-bench.rs\",\n \"rank\": 10,\n \"score\": 56508.76199786539\n },\n {\n \"content\": \"fn create_four_field_message(c: &mut Criterion) {\\n\\n c.bench_function(\\\"create four field message\\\", |b| {\\n\\n b.iter(|| {\\n\\n let mut msg = RtMessage::with_capacity(4);\\n\\n msg.add_field(Tag::SIG, \\\"0987\\\".as_bytes()).unwrap();\\n\\n msg.add_field(Tag::NONC, \\\"wxyz\\\".as_bytes()).unwrap();\\n\\n msg.add_field(Tag::DELE, \\\"1234\\\".as_bytes()).unwrap();\\n\\n msg.add_field(Tag::PATH, \\\"abcd\\\".as_bytes()).unwrap();\\n\\n })\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/roughenough-bench.rs\",\n \"rank\": 11,\n \"score\": 56508.76199786539\n },\n {\n \"content\": \"fn create_single_field_message(c: &mut Criterion) {\\n\\n c.bench_function(\\\"create single field message\\\", |b| {\\n\\n b.iter(|| {\\n\\n let mut msg = RtMessage::with_capacity(1);\\n\\n msg.add_field(Tag::NONC, \\\"1234\\\".as_bytes()).unwrap();\\n\\n })\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/roughenough-bench.rs\",\n \"rank\": 12,\n \"score\": 56508.76199786539\n },\n {\n \"content\": \"fn create_new_merkle_tree(c: &mut Criterion) {\\n\\n c.bench_function_over_inputs(\\n\\n \\\"create new merkle trees\\\",\\n\\n move |b, &size| {\\n\\n b.iter(|| {\\n\\n let mut tree = MerkleTree::new();\\n\\n for _ in 0..*size {\\n\\n tree.push_leaf(DATA);\\n\\n }\\n\\n black_box(tree.compute_root())\\n\\n })\\n\\n },\\n\\n SIZES,\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/roughenough-bench.rs\",\n \"rank\": 13,\n \"score\": 56508.76199786539\n },\n {\n \"content\": \"///\\n\\n/// Specifies parameters needed to configure a Roughenough server.\\n\\n///\\n\\n/// Parameters labeled \\\"**Required**\\\" must always be provided and have no default value\\n\\n/// while those labeled \\\"**Optional**\\\" provide sane default values that can be overridden.\\n\\n///\\n\\n/// YAML Key | Environment Variable | Necessity | Description\\n\\n/// --- | --- | --- | ---\\n\\n/// `interface` | `ROUGHENOUGH_INTERFACE` | Required | IP address or interface name for listening to client requests\\n\\n/// `port` | `ROUGHENOUGH_PORT` | Required | UDP port to listen for requests\\n\\n/// `seed` | `ROUGHENOUGH_SEED` | Required | A 32-byte hexadecimal value used to generate the server's long-term key pair. **This is a secret value and must be un-guessable**, treat it with care. (If compiled with KMS support, length will vary)\\n\\n/// `batch_size` | `ROUGHENOUGH_BATCH_SIZE` | Optional | The maximum number of requests to process in one batch. All nonces in a batch are used to build a Merkle tree, the root of which is signed. Default is `64` requests per batch.\\n\\n/// `status_interval` | `ROUGHENOUGH_STATUS_INTERVAL` | Optional | Number of _seconds_ between each logged status update. Default is `600` seconds (10 minutes).\\n\\n/// `health_check_port` | `ROUGHENOUGH_HEALTH_CHECK_PORT` | Optional | If present, enable an HTTP health check responder on the provided port. **Use with caution**.\\n\\n/// `kms_protection` | `ROUGHENOUGH_KMS_PROTECTION` | Optional | If compiled with KMS support, the ID of the KMS key used to protect the long-term identity.\\n\\n/// `client_stats` | `ROUGHENOUGH_CLIENT_STATS` | Optional | A value of `on` or `yes` will enable tracking of per-client request statistics that will be output each time server status is logged. Default is `off` (disabled).\\n\\n/// `fault_percentage` | `ROUGHENOUGH_FAULT_PERCENTAGE` | Optional | Likelihood (as a percentage) that the server will intentionally return an invalid client response. An integer range from `0` (disabled, all responses valid) to `50` (50% of responses will be invalid). Default is `0` (disabled).\\n\\n///\\n\\n/// Implementations of this trait obtain a valid configuration from different back-end\\n\\n/// sources. See:\\n\\n/// * [FileConfig](struct.FileConfig.html) - configure via a YAML file\\n\\n/// * [EnvironmentConfig](struct.EnvironmentConfig.html) - configure via environment variables\\n\\n/// * [MemoryConfig](struct.MemoryConfig.html) - in-memory configuration for testing\\n\\n///\\n\\npub trait ServerConfig {\\n\\n /// [Required] IP address or interface name to listen for client requests\\n\\n fn interface(&self) -> &str;\\n\\n\\n\\n /// [Required] UDP port to listen for requests\\n\\n fn port(&self) -> u16;\\n\\n\\n\\n /// [Required] A 32-byte hexadecimal value used to generate the server's\\n\\n /// long-term key pair. **This is a secret value and must be un-guessable**,\\n\\n /// treat it with care.\\n\\n fn seed(&self) -> Vec<u8>;\\n\\n\\n\\n /// [Optional] The maximum number of requests to process in one batch. All\\n\\n /// nonces in a batch are used to build a Merkle tree, the root of which is signed.\\n\\n /// Defaults to [DEFAULT_BATCH_SIZE](constant.DEFAULT_BATCH_SIZE.html)\\n\\n fn batch_size(&self) -> u8;\\n\\n\\n\\n /// [Optional] Amount of time between each logged status update.\\n\\n /// Defaults to [DEFAULT_STATUS_INTERVAL](constant.DEFAULT_STATUS_INTERVAL.html)\\n\\n fn status_interval(&self) -> Duration;\\n\",\n \"file_path\": \"src/config/mod.rs\",\n \"rank\": 14,\n \"score\": 43101.65419070414\n },\n {\n \"content\": \"///\\n\\n/// Implementations of this trait record client activity\\n\\n///\\n\\npub trait ServerStats {\\n\\n fn add_rfc_request(&mut self, addr: &IpAddr);\\n\\n\\n\\n fn add_classic_request(&mut self, addr: &IpAddr);\\n\\n\\n\\n fn add_invalid_request(&mut self, addr: &IpAddr);\\n\\n\\n\\n fn add_health_check(&mut self, addr: &IpAddr);\\n\\n\\n\\n fn add_rfc_response(&mut self, addr: &IpAddr, bytes_sent: usize);\\n\\n\\n\\n fn add_classic_response(&mut self, addr: &IpAddr, bytes_sent: usize);\\n\\n\\n\\n fn total_valid_requests(&self) -> u64;\\n\\n\\n\\n fn num_rfc_requests(&self) -> u64;\\n\\n\\n\\n fn num_classic_requests(&self) -> u64;\\n\\n\\n\\n fn total_invalid_requests(&self) -> u64;\\n\",\n \"file_path\": \"src/stats/mod.rs\",\n \"rank\": 15,\n \"score\": 43076.40420006202\n },\n {\n \"content\": \"## Description \\n\\n\\n\\nThe server's long-term identity can be protected by encrypting it, storing the encrypted value\\n\\nin the configuration, and invoking a cloud key management system to temporarily decrypt \\n\\n(in memory) the long-term identity at server start-up. \\n\\n\\n\\nThis way the server's long-term identity is never stored in plaintext. Instead the encrypted \\n\\nlong-term identity \\\"blob\\\" is safe to store on disk, on Github, in a container, etc. Ability \\n\\nto access the unencrypted identity is controlled \\\"out of band\\\" by the KMS system.\\n\\n\\n\\n## How to enable KMS support\\n\\n\\n\\nKMS support must be compiled-in. To enable:\\n\\n\\n\\n```bash\\n\\n# Build with Google Cloud KMS support\\n\\n$ cargo build --release --features \\\"gcpkms\\\"\\n\\n\\n\\n# Build with AWS KMS support\\n\\n$ cargo build --release --features \\\"awskms\\\"\\n\\n```\\n\\n\\n\\n## Google or Amazon: choose one and one only\\n\\n\\n\\nSadly, due to incompatibilities with dependencies of the KMS libraries, only **one** \\n\\nKMS system can be enabled at a time. Attempting `--features \\\"awskms,gcpkms\\\"` will result\\n\\nin a build failure.\\n\\n\\n\\n## Using `roughtime-kms` to encrypt the long-term seed\\n\\n\\n\\nUse the command line tool `roughtime-kms` to encrypt the seed value for the \\n\\nserver's long-term identity. To do this you will need: \\n\\n\\n\\n 1. The long-term key seed value \\n\\n 2. Access credentials for your cloud of choice\\n\\n 3. An identifier for the KMS key to be used\\n\\n 4. Necessary permissions to perform symmetric encrypt/decrypt operations\\n\\n using the selected key\\n\\n\\n\\nFor Amazon the key identifier is an ARN in the form:\\n\\n```\\n\\narn:aws:kms:SOME_AWS_REGION:111122223333:key/1234abcd-12ab-34cd-56ef-1234567890ab\\n\\n```\\n\\n\\n\\nFor Google the key identifier is a resource ID in the form:\\n\\n```\\n\\nprojects/PROJECT_NAME/locations/GCP_LOCATION/keyRings/KEYRING_NAME/cryptoKeys/KEY_NAME\\n\\n```\\n\\n\\n\\n### AWS Example\\n\\n\\n\",\n \"file_path\": \"doc/OPTIONAL-FEATURES.md\",\n \"rank\": 16,\n \"score\": 39097.99916666816\n },\n {\n \"content\": \"#### Credentials \\n\\n\\n\\n[Rusoto](https://rusoto.org/) is used by Roughenough to access AWS. If your system\\n\\nhas AWS credentials in the typical `~/.aws/credentials` then everything should \\\"just work\\\".\\n\\n\\n\\nOtherwise Rusoto supports alternative ways to provide AWS credentials. See \\n\\n[Rusoto's documentation](https://github.com/rusoto/rusoto/blob/master/AWS-CREDENTIALS.md) \\n\\nfor details.\\n\\n\\n\\n#### `roughenough-kms` Command line\\n\\n\\n\\n```bash\\n\\n# Provide AWS credentials as described in the Rusoto docs\\n\\n\\n\\n# Build roughenough with AWS KMS support\\n\\n$ cargo build --release --features \\\"awskms\\\"\\n\\n\\n\\n# Encrypt the seed value\\n\\n$ target/release/roughenough-kms \\\\\\n\\n -k arn:aws:kms:SOME_AWS_REGION:111122223333:key/1234abcd-12ab-34cd-56ef-1234567890ab \\\\\\n\\n -s a0a31d76900080c3cdc42fe69de8dd0086d6b54de7814004befd0b9c4447757e\\n\\n \\n\\n# Output of above will be something like this\\n\\nkms_protection: \\\"arn:aws:kms:SOME_AWS_REGION:111122223333:key/1234abcd-12ab-34cd-56ef-1234567890ab\\\"\\n\\nseed: b8000c000102020078d39e85c7386e9e2bed1f30fac6dd322db96b8aaac8974fc6c0e0f566f8f6c971012fca1e69fffffd947fe82a9e505baf580000007e307c06092a864886f70d010706a06f306d020100306806092a864886f70d010701301e060960864801650304012e3011040c55d16d891b3b2a1ae2587a9c020110803bcc74dd96336009087772b28ec908c40e4113b1ab9b98934bd3b4f3dd3c1e8cdc6da82a4321fd8378ad0e2e0507bf0c5ea0e28d447e5f8482533baa423b7af8459ae87736f381d87fe38c21a805fae1c25c43d59200f42cae0d07f741e787a04c0ad72774942dddf818be0767e4963fe5a810f734a0125c\\n\\n```\\n\\n\\n\",\n \"file_path\": \"doc/OPTIONAL-FEATURES.md\",\n \"rank\": 17,\n \"score\": 39097.80912678349\n },\n {\n \"content\": \"# Optional Features\\n\\n\\n\\nThese features are **disabled by default** and must be explicitly enabled as \\n\\ndescribed below.\\n\\n\\n\\n* [HTTP Health Check responder](#http-health-check)\\n\\n* [Key Management System (KMS) support](#key-management-system-kms-support)\\n\\n\\n\\n# HTTP Health Check\\n\\n\\n\\n## Description \\n\\n\\n\\nIntended for use by load balancers or other control plane facilities to monitor \\n\\nthe state of Roughenough servers and remove unhealthy instances automatically. \\n\\n\\n\\nThe server unconditionally emits a response to *any TCP connection* to the health\\n\\ncheck port, then closes the connection:\\n\\n\\n\\n```http\\n\\nHTTP/1.1 200 OK\\n\\nContent-Length: 0\\n\\nConnection: Close\\n\\n\\n\\n```\\n\\n\\n\\nNo attempt is made to parse the request, the server *always* emits this response. \\n\\n\\n\\n## How to enable\\n\\n\\n\\nProvide a value for the `health_check_port` setting. This enables the HTTP \\n\\nhealth check responder on the configured port. \\n\\n\\n\\n```yaml\\n\\ninterface: 127.0.0.1\\n\\nport: 8686\\n\\nseed: f61075c988feb9cb700a4a6a3291bfbc9cab11b9c9eca8c802468eb38a43d7d3\\n\\nhealth_check_port: 8000\\n\\n```\\n\\n\\n\\n## DoS Warning\\n\\n\\n\\n**An unprotected health-check port can be used to DoS the server. Do NOT expose \\n\\nthe health check port to the internet!** \\n\\n\\n\\nTo accurately reflect the ability of a Roughenough server to respond to requests, \\n\\nthe health check socket is serviced in the same event loop executing the primary Roughtime \\n\\nprotocol. Abuse of the health-check port can denial-of-service the whole server.\\n\\n\\n\\nIf enabled, ensure the health check port is accessible only to the *intended load-balancer(s)\\n\\nand/or control plane components*.\\n\\n\\n\\n\\n\\n# Key Management System (KMS) Support\\n\\n\\n\",\n \"file_path\": \"doc/OPTIONAL-FEATURES.md\",\n \"rank\": 18,\n \"score\": 39088.73699598725\n },\n {\n \"content\": \"#### Credentials\\n\\n\\n\\nOnly **Service Account credentials** (in `.json` format) are currently supported. OAuth, bearer tokens, \\n\\nGAE default credentials, and GCE default credentials are **not** supported (contributions to\\n\\nadd support are particularly welcome!).\\n\\n\\n\\nTo obtain Service Account credentials if you don't already have them:\\n\\n\\n\\n* Creating a new service account?\\n\\n 1. Create the account \\n\\n 2. Download the credentials when prompted\\n\\n \\n\\n* Existing service account?\\n\\n 1. Open the Cloud Console (https://console.cloud.google.com)\\n\\n 2. Navigate to `IAM -> Service accounts`\\n\\n 3. Locate the service account row, click on its \\\"Actions\\\" menu (the three dots on the right) \\n\\n 4. Choose `Create key` and `JSON` format\\n\\n 5. Download the credentials when prompted\\n\\n\\n\\nMake note of the full path where the credentials are saved, it's needed in the next step.\\n\\n\\n\\n#### `roughenough-kms` Command line\\n\\n\\n\\n```bash\\n\\n# Set environment variable pointing to downloaded Service Account credentials\\n\\n$ export GOOGLE_APPLICATION_CREDENTIALS=/path/to/creds.json \\n\\n\\n\\n# Build roughenough with Google KMS support\\n\\n$ cargo build --release --features \\\"gcpkms\\\"\\n\\n\\n\\n# Encrypt the seed value\\n\\n$ target/release/roughenough-kms \\\\\\n\\n -k projects/PROJECT_NAME/locations/GCP_LOCATION/keyRings/KEYRING_NAME/cryptoKeys/KEY_NAME \\\\\\n\\n -s a0a31d76900080c3cdc42fe69de8dd0086d6b54de7814004befd0b9c4447757e\\n\\n \\n\\n# Output of above will be something like this\\n\\nkms_protection: \\\"projects/PROJECT_NAME/locations/GCP_LOCATION/keyRings/KEYRING_NAME/cryptoKeys/KEY_NAME\\\"\\n\\nseed: 71000c000a2400c7f2553954873ef29aeb37384c25d7a937d389221207c3368657870129d601d084c8da1249008d6fd4640f815596788e97bb3ce02fd007bc25a1019ca51945c3b99283d3945baacd77b1b991f5f6f8848c549a5767f57c9c999e97fe6d28fdb17db1d63c2ea966d8236d20c71e8e9c757c5bab62472c65b48376bc8951700aceb22545fce58d77e7cc147f7134da7a2cca790b54f29e4798442cee6e0d34e57f80ce983f7e5928cceff2\\n\\n```\\n\\n\\n\",\n \"file_path\": \"doc/OPTIONAL-FEATURES.md\",\n \"rank\": 19,\n \"score\": 39085.2872324983\n },\n {\n \"content\": \"#### Configuration\\n\\n\\n\\nCopy and paste the output `kms_protection` and `seed` values into a config or\\n\\nset the corresponding environment variables. The `roughenough-server` will detect that\\n\\nAWS KMS is being used and decrypt the seed automatically. For example:\\n\\n\\n\\n```yaml\\n\\ninterface: 127.0.0.1\\n\\nport: 8686\\n\\nkms_protection: \\\"arn:aws:kms:SOME_AWS_REGION:111122223333:key/1234abcd-12ab-34cd-56ef-1234567890ab\\\"\\n\\nseed: b8000c000102020078d39e85c7386e9e2bed1f30fac6dd322db96b8aaac8974fc6c0e0f566f8f6c971012fca1e69fffffd947fe82a9e505baf580000007e307c06092a864886f70d010706a06f306d020100306806092a864886f70d010701301e060960864801650304012e3011040c55d16d891b3b2a1ae2587a9c020110803bcc74dd96336009087772b28ec908c40e4113b1ab9b98934bd3b4f3dd3c1e8cdc6da82a4321fd8378ad0e2e0507bf0c5ea0e28d447e5f8482533baa423b7af8459ae87736f381d87fe38c21a805fae1c25c43d59200f42cae0d07f741e787a04c0ad72774942dddf818be0767e4963fe5a810f734a0125c\\n\\n```\\n\\n\\n\\nor using environment based configuration:\\n\\n\\n\\n```bash\\n\\n$ export ROUGHENOUGH_INTERFACE=127.0.0.1\\n\\n$ export ROUGHENOUGH_PORT=8686\\n\\n$ export ROUGHENOUGH_KMS_PROTECTION=\\\"arn:aws:kms:SOME_AWS_REGION:111122223333:key/1234abcd-12ab-34cd-56ef-1234567890ab\\\"\\n\\n$ export ROUGHENOUGH_SEED=b8000c000102020078d39e85c7386e9e2bed1f30fac6dd322db96b8aaac8974fc6c0e0f566f8f6c971012fca1e69fffffd947fe82a9e505baf580000007e307c06092a864886f70d010706a06f306d020100306806092a864886f70d010701301e060960864801650304012e3011040c55d16d891b3b2a1ae2587a9c020110803bcc74dd96336009087772b28ec908c40e4113b1ab9b98934bd3b4f3dd3c1e8cdc6da82a4321fd8378ad0e2e0507bf0c5ea0e28d447e5f8482533baa423b7af8459ae87736f381d87fe38c21a805fae1c25c43d59200f42cae0d07f741e787a04c0ad72774942dddf818be0767e4963fe5a810f734a0125c\\n\\n```\\n\\n\\n\\n### GCP Example\\n\\n\\n\",\n \"file_path\": \"doc/OPTIONAL-FEATURES.md\",\n \"rank\": 20,\n \"score\": 39085.030252563076\n },\n {\n \"content\": \"#### Configuration\\n\\n\\n\\nCopy and paste the output `kms_protection` and `seed` values into a config or\\n\\nset the corresponding environment variables. `roughenough-server` will detect that\\n\\nGoogle KMS is being used and decrypt the seed automatically. For example:\\n\\n\\n\\n```yaml\\n\\ninterface: 127.0.0.1\\n\\nport: 8686\\n\\nkms_protection: \\\"projects/PROJECT_NAME/locations/GCP_LOCATION/keyRings/KEYRING_NAME/cryptoKeys/KEY_NAME\\\"\\n\\nseed: 71000c000a2400c7f2553954873ef29aeb37384c25d7a937d389221207c3368657870129d601d084c8da1249008d6fd4640f815596788e97bb3ce02fd007bc25a1019ca51945c3b99283d3945baacd77b1b991f5f6f8848c549a5767f57c9c999e97fe6d28fdb17db1d63c2ea966d8236d20c71e8e9c757c5bab62472c65b48376bc8951700aceb22545fce58d77e7cc147f7134da7a2cca790b54f29e4798442cee6e0d34e57f80ce983f7e5928cceff2\\n\\n```\\n\\n\\n\\nor using environment based configuration:\\n\\n\\n\\n```bash\\n\\n$ export ROUGHENOUGH_INTERFACE=127.0.0.1\\n\\n$ export ROUGHENOUGH_PORT=8686\\n\\n$ export ROUGHENOUGH_KMS_PROTECTION=\\\"projects/PROJECT_NAME/locations/GCP_LOCATION/keyRings/KEYRING_NAME/cryptoKeys/KEY_NAME\\\"\\n\\n$ export ROUGHENOUGH_SEED=71000c000a2400c7f2553954873ef29aeb37384c25d7a937d389221207c3368657870129d601d084c8da1249008d6fd4640f815596788e97bb3ce02fd007bc25a1019ca51945c3b99283d3945baacd77b1b991f5f6f8848c549a5767f57c9c999e97fe6d28fdb17db1d63c2ea966d8236d20c71e8e9c757c5bab62472c65b48376bc8951700aceb22545fce58d77e7cc147f7134da7a2cca790b54f29e4798442cee6e0d34e57f80ce983f7e5928cceff2\\n\\n```\\n\",\n \"file_path\": \"doc/OPTIONAL-FEATURES.md\",\n \"rank\": 21,\n \"score\": 39084.838538343916\n },\n {\n \"content\": \"/// Inspect the message in `buf` and guess which Roughtime protocol it corresponds to.\\n\\nfn guess_protocol_version(buf: &[u8]) -> Version {\\n\\n if &buf[0..8] == RFC_REQUEST_FRAME_BYTES {\\n\\n Version::Rfc\\n\\n } else {\\n\\n Version::Classic\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/request.rs\",\n \"rank\": 22,\n \"score\": 34257.038781619616\n },\n {\n \"content\": \"// Convenience function to create zero-filled Vec of given size\\n\\nfn vec_zero_filled(len: usize) -> Vec<u8> {\\n\\n (0..len).map(|_| 0).collect()\\n\\n}\\n\\n\\n\\n/// Envelope encryption of the long-term key seed value.\\n\\n///\\n\\n/// The seed is encrypted using AES-GCM-256 with:\\n\\n///\\n\\n/// * 32 byte (256 bit) random key\\n\\n/// * 12 byte (96 bit) random nonce\\n\\n/// * 16 byte (128 bit) authentication tag\\n\\n///\\n\\n/// Randomness obtained from\\n\\n/// [`ring::rand::SecureRandom`](https://briansmith.org/rustdoc/ring/rand/trait.SecureRandom.html).\\n\\n///\\n\\n/// The key used to encrypt the seed is wrapped (encrypted) using a\\n\\n/// [`KmsProvider`](trait.KmsProvider.html) implementation.\\n\\n///\\n\\npub struct EnvelopeEncryption;\\n\\n\\n\",\n \"file_path\": \"src/kms/envelope.rs\",\n \"rank\": 23,\n \"score\": 31720.957229524443\n },\n {\n \"content\": \" use std::fmt;\\n\\n use std::fmt::Formatter;\\n\\n use std::str::FromStr;\\n\\n\\n\\n use bytes::Bytes;\\n\\n use futures::executor::block_on;\\n\\n use rusoto_core::Region;\\n\\n use rusoto_kms::{DecryptRequest, EncryptRequest, Kms, KmsClient};\\n\\n\\n\\n use crate::kms::{AD, DEK_LEN_BYTES, EncryptedDEK, KmsError, KmsProvider, PlaintextDEK};\\n\\n\\n\\n /// Amazon Web Services Key Management Service\\n\\n /// https://aws.amazon.com/kms/\\n\\n pub struct AwsKms {\\n\\n kms_client: KmsClient,\\n\\n key_id: String,\\n\\n }\\n\\n\\n\\n impl AwsKms {\\n\\n /// Create a new instance from the full ARN of a AWS KMS key. The ARN is expected\\n\",\n \"file_path\": \"src/kms/awskms.rs\",\n \"rank\": 24,\n \"score\": 31293.560368147304\n },\n {\n \"content\": \"// Copyright 2017-2021 int08h LLC\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n\\n\\n#[cfg(feature = \\\"awskms\\\")]\\n\\npub mod inner {\\n\\n extern crate bytes;\\n\\n\\n\\n use std::collections::HashMap;\\n\\n use std::default::Default;\\n\",\n \"file_path\": \"src/kms/awskms.rs\",\n \"rank\": 25,\n \"score\": 31291.695737295366\n },\n {\n \"content\": \"\\n\\n match block_on(self.kms_client.encrypt(encrypt_req)) {\\n\\n Ok(result) => {\\n\\n if let Some(ciphertext) = result.ciphertext_blob {\\n\\n Ok(ciphertext.to_vec())\\n\\n } else {\\n\\n Err(KmsError::OperationFailed(\\n\\n \\\"no ciphertext despite successful response\\\".to_string(),\\n\\n ))\\n\\n }\\n\\n }\\n\\n Err(e) => Err(KmsError::OperationFailed(e.to_string())),\\n\\n }\\n\\n }\\n\\n\\n\\n fn decrypt_dek(&self, encrypted_dek: &EncryptedDEK) -> Result<PlaintextDEK, KmsError> {\\n\\n let mut decrypt_req: DecryptRequest = Default::default();\\n\\n decrypt_req.ciphertext_blob = Bytes::from(encrypted_dek.to_vec());\\n\\n\\n\\n let mut dec_context = HashMap::new();\\n\",\n \"file_path\": \"src/kms/awskms.rs\",\n \"rank\": 26,\n \"score\": 31290.602695005746\n },\n {\n \"content\": \" Err(e) => Err(KmsError::OperationFailed(e.to_string())),\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n #[cfg(feature = \\\"awskms\\\")]\\n\\n impl fmt::Display for AwsKms {\\n\\n fn fmt(&self, f: &mut Formatter) -> fmt::Result {\\n\\n write!(f, \\\"{}\\\", self.key_id)\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/kms/awskms.rs\",\n \"rank\": 27,\n \"score\": 31288.637531104483\n },\n {\n \"content\": \" /// to be of the form `arn:aws:kms:some-aws-region:111122223333:key/1234abcd-12ab-34cd-56ef-1234567890ab`\\n\\n pub fn from_arn(arn: &str) -> Result<Self, KmsError> {\\n\\n let parts: Vec<&str> = arn.split(':').collect();\\n\\n\\n\\n if parts.len() != 6 {\\n\\n return Err(KmsError::InvalidConfiguration(format!(\\n\\n \\\"invalid KMS arn: too few parts {}\\\",\\n\\n parts.len()\\n\\n )));\\n\\n }\\n\\n\\n\\n let region_part = parts.get(3).expect(\\\"region is missing\\\");\\n\\n let region = match Region::from_str(region_part) {\\n\\n Ok(r) => r,\\n\\n Err(e) => return Err(KmsError::InvalidConfiguration(e.to_string())),\\n\\n };\\n\\n\\n\\n Ok(AwsKms {\\n\\n kms_client: KmsClient::new(region),\\n\\n key_id: arn.to_string(),\\n\",\n \"file_path\": \"src/kms/awskms.rs\",\n \"rank\": 28,\n \"score\": 31286.366257586822\n },\n {\n \"content\": \" })\\n\\n }\\n\\n }\\n\\n\\n\\n impl KmsProvider for AwsKms {\\n\\n fn encrypt_dek(&self, plaintext_dek: &PlaintextDEK) -> Result<EncryptedDEK, KmsError> {\\n\\n if plaintext_dek.len() != DEK_LEN_BYTES {\\n\\n return Err(KmsError::InvalidKey(format!(\\n\\n \\\"provided DEK wrong length: {}\\\",\\n\\n plaintext_dek.len()\\n\\n )));\\n\\n }\\n\\n\\n\\n let mut encrypt_req: EncryptRequest = Default::default();\\n\\n encrypt_req.key_id = self.key_id.clone();\\n\\n encrypt_req.plaintext = Bytes::from(plaintext_dek.to_vec());\\n\\n\\n\\n let mut enc_context = HashMap::new();\\n\\n enc_context.insert(\\\"AD\\\".to_string(), AD.to_string());\\n\\n encrypt_req.encryption_context = Some(enc_context);\\n\",\n \"file_path\": \"src/kms/awskms.rs\",\n \"rank\": 29,\n \"score\": 31285.087277019764\n },\n {\n \"content\": \" dec_context.insert(\\\"AD\\\".to_string(), AD.to_string());\\n\\n decrypt_req.encryption_context = Some(dec_context);\\n\\n\\n\\n match block_on(self.kms_client.decrypt(decrypt_req)) {\\n\\n Ok(result) => {\\n\\n if let Some(plaintext_dek) = result.plaintext {\\n\\n if plaintext_dek.len() == DEK_LEN_BYTES {\\n\\n Ok(plaintext_dek.to_vec())\\n\\n } else {\\n\\n Err(KmsError::InvalidKey(format!(\\n\\n \\\"decrypted DEK wrong length: {}\\\",\\n\\n plaintext_dek.len()\\n\\n )))\\n\\n }\\n\\n } else {\\n\\n Err(KmsError::OperationFailed(\\n\\n \\\"decrypted payload is empty\\\".to_string(),\\n\\n ))\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/kms/awskms.rs\",\n \"rank\": 30,\n \"score\": 31282.875625302047\n },\n {\n \"content\": \"#[macro_use]\\n\\nextern crate criterion;\\n\\nextern crate roughenough;\\n\\n\\n\\nuse criterion::{black_box, Criterion};\\n\\n\\n\\nuse roughenough::merkle::{MerkleTree, root_from_paths};\\n\\nuse roughenough::RtMessage;\\n\\nuse roughenough::Tag;\\n\\n\\n\",\n \"file_path\": \"benches/roughenough-bench.rs\",\n \"rank\": 31,\n \"score\": 30683.74755529729\n },\n {\n \"content\": \" create_empty_message,\\n\\n create_single_field_message,\\n\\n create_two_field_message,\\n\\n create_four_field_message,\\n\\n create_nested_message\\n\\n);\\n\\n\\n\\ncriterion_group!(merkle_tree, create_new_merkle_tree, reuse_merkle_trees);\\n\\n\\n\\ncriterion_main!(message_creation, merkle_tree);\\n\",\n \"file_path\": \"benches/roughenough-bench.rs\",\n \"rank\": 32,\n \"score\": 30669.799644616527\n },\n {\n \"content\": \"fn nonce_from_rfc_request(buf: &[u8]) -> Result<(Vec<u8>, Version), Error> {\\n\\n // first 8 bytes were RFC_REQUEST_FRAME_BYTES, [0..8]\\n\\n let mut cur = Cursor::new(&buf[8..12]);\\n\\n let reported_len = cur.read_u32::<LittleEndian>()?;\\n\\n let actual_len = (buf.len() - 12) as u32;\\n\\n\\n\\n if reported_len != actual_len {\\n\\n return Err(Error::LengthMismatch(reported_len, actual_len));\\n\\n }\\n\\n\\n\\n let msg = RtMessage::from_bytes(&buf[12..])?;\\n\\n\\n\\n if !has_supported_version(&msg) {\\n\\n return Err(Error::NoCompatibleVersion);\\n\\n }\\n\\n\\n\\n match msg.get_field(Tag::NONC) {\\n\\n Some(nonce) => Ok((nonce.to_vec(), Version::Rfc)),\\n\\n None => Err(Error::InvalidRequest),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/request.rs\",\n \"rank\": 33,\n \"score\": 28601.618426542107\n },\n {\n \"content\": \"fn nonce_from_classic_request(buf: &[u8]) -> Result<(Vec<u8>, Version), Error> {\\n\\n let msg = RtMessage::from_bytes(buf)?;\\n\\n match msg.get_field(Tag::NONC) {\\n\\n Some(nonce) => Ok((nonce.to_vec(), Version::Classic)),\\n\\n None => Err(Error::InvalidRequest),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/request.rs\",\n \"rank\": 34,\n \"score\": 28601.618426542107\n },\n {\n \"content\": \"# The public key of 'roughtime.int08h.com' is stored in a DNS TXT record \\n\\n$ host -t TXT roughtime.int08h.com\\n\\nroughtime.int08h.com descriptive text \\\"016e6e0284d24c37c6e4d7d8d5b4e1d3c1949ceaa545bf875616c9dce0c9bec1\\\"\\n\\n\\n\\n# Validate the server response using its public key\\n\\n$ target/release/roughenough-client -v roughtime.int08h.com 2002 -p 016e6e0284d24c37c6e4d7d8d5b4e1d3c1949ceaa545bf875616c9dce0c9bec1\\n\\nRequesting time from: \\\"roughtime.int08h.com\\\":2002\\n\\nReceived time from server: midpoint=\\\"Oct 26 2018 23:22:20\\\", radius=1000000, verified=Yes (merkle_index=0)\\n\\nOct 26 2018 23:22:20\\n\\n```\\n\\n\\n\\nThe **`verified=Yes`** in the output confirms that the server's response had a valid signature.\\n\\n\\n\\n### Server Configuration\\n\\n\\n\\nThere are two (mutually exclusive) ways to configure the Roughenough server: \\n\\n\\n\\n1. A YAML file, or\\n\\n2. Environment variables\\n\\n\\n\\nThe server accepts the following configuration parameters:\\n\\n\\n\\nYAML Key | Environment Variable | Necessity | Description\\n\\n--- | --- | --- | ---\\n\\n`interface` | `ROUGHENOUGH_INTERFACE` | Required | IP address or interface name for listening to client requests\\n\\n`port` | `ROUGHENOUGH_PORT` | Required | UDP port to listen for requests\\n\\n`seed` | `ROUGHENOUGH_SEED` | Required | A 32-byte hexadecimal value used to generate the server's long-term key pair. **This is a secret value and must be un-guessable**, treat it with care. (If compiled with KMS support, length will vary; see [Optional Features](#optional-features))\\n\\n`batch_size` | `ROUGHENOUGH_BATCH_SIZE` | Optional | The maximum number of requests to process in one batch. All nonces in a batch are used to build a Merkle tree, the root of which is signed. Default is `64` requests per batch.\\n\\n`status_interval` | `ROUGHENOUGH_STATUS_INTERVAL` | Optional | Number of _seconds_ between each logged status update. Default is `600` seconds (10 minutes).\\n\\n`health_check_port` | `ROUGHENOUGH_HEALTH_CHECK_PORT` | Optional | If present, enable an HTTP health check responder on the provided port. **Use with caution**, see [Optional Features](#optional-features).\\n\\n`kms_protection` | `ROUGHENOUGH_KMS_PROTECTION` | Optional | If compiled with KMS support, the ID of the KMS key used to protect the long-term identity. See [Optional Features](#optional-features).\\n\\n`fault_percentage` | `ROUGHENOUGH_FAULT_PERCENTAGE` | Optional | Likelihood (as a percentage) that the server will intentionally return an invalid client response. An integer range from `0` (disabled, all responses valid) to `50` (50% of responses will be invalid). Default is `0` (disabled).\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 35,\n \"score\": 20754.27537364356\n },\n {\n \"content\": \"# Or using environment variables\\n\\n$ export ROUGHENOUGH_INTERFACE=127.0.0.1\\n\\n$ export ROUGHENOUGH_PORT=8686\\n\\n$ export ROUGHENOUGH_SEED=f61075c988feb9cb700a4a6a3291bfbc9cab11b9c9eca8c802468eb38a43d7d3\\n\\n$ target/release/roughenough-server ENV\\n\\n2018-07-25 00:05:09 INFO [server] Roughenough server v1.0.5 starting\\n\\n2018-07-25 00:05:09 INFO [server] Long-term public key: d0756ee69ff5fe96cbcf9273208fec53124b1dd3a24d3910e07c7c54e2473012\\n\\n2018-07-25 00:05:09 INFO [server] Ephemeral public key: 25fd5dc31ceee241aed3e643534e95ed0609e9a20982a45ac0312a5f55e2cc66\\n\\n2018-07-25 00:05:09 INFO [server] Server listening on 127.0.0.1:8686\\n\\n```\\n\\n\\n\\nThe resulting binary is `target/release/roughenough-server`. After building you can copy the \\n\\nbinary and run on its own (no `cargo` needed):\\n\\n\\n\\n```bash\\n\\n$ cp target/release/roughenough-server /usr/local/bin \\n\\n```\\n\\n\\n\\n### Stopping the Server\\n\\n\\n\\nUse Ctrl-C or `kill` the process.\\n\\n\\n\\n\\n\\n## Optional Features\\n\\n\\n\\nRoughenough has two opt-in (disabled by default) features that are enabled either \\n\\nA) via a config setting, or B) at compile-time.\\n\\n\\n\\n* [HTTP Health Check responder](doc/OPTIONAL-FEATURES.md#http-health-check) \\n\\n to facilitate detection and replacement of \\\"sick\\\" Roughenough servers.\\n\\n* [Key Management System (KMS) support](doc/OPTIONAL-FEATURES.md#key-management-system-kms-support)\\n\\n to protect the long-term server identity using envelope encryption and \\n\\n AWS or Google KMS.\\n\\n\\n\\nSee [OPTIONAL-FEATURES.md](doc/OPTIONAL-FEATURES.md) for details and instructions\\n\\nhow to enable and use.\\n\\n\\n\\n\\n\\n## Limitations\\n\\n\\n\\nRoughtime features not implemented by the server:\\n\\n\\n\\n* On-line (while server is running) key rotation. The server must be restarted to generate a new delegated key. \\n\\n* The Roughenough server depends on the host's time source to comply with the smeared leap-second \\n\\n requirement of the Roughtime protocol. A Roughenough server sourcing time from \\n\\n [Google's public NTP servers](https://developers.google.com/time/) would produce compliant\\n\\n smeared leap-seconds but time sourced from members of `pool.ntp.org` likely will not.\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 36,\n \"score\": 20748.935338094987\n },\n {\n \"content\": \"## Version 1.1.0\\n\\n\\n\\n* Optional HTTP health check (requested in #8), see the\\n\\n [feature's documentation](https://github.com/int08h/roughenough/blob/master/doc/OPTIONAL-FEATURES.md#http-health-check)\\n\\n* Support AWS and Google Key Management Systems (KMS) to protect the server's long-term key.\\n\\n See the [KMS documentation](https://github.com/int08h/roughenough/blob/master/doc/OPTIONAL-FEATURES.md#key-management-system-kms-support).\\n\\n* Numerous refactorings and clean ups to support fuzzing of \\n\\n server components (b801eda, thanks to @Aaron1011)\\n\\n\\n\\n## Version 1.0.6\\n\\n\\n\\n* As pointed out in #10, the client and server binary names were too generic. Rename \\n\\n them to be packaging friendly. Thank you @grempe. (b43bcb27ad)\\n\\n \\n\\n## Version 1.0.5\\n\\n\\n\\n* The server now supports configuration from \\n\\n [environment variables](https://github.com/int08h/roughenough#server-configuration)\\n\\n \\n\\n## Version 1.0.4\\n\\n\\n\\n* Update `untrusted` dependency to incorporate security fix (see https://github.com/RustSec/advisory-db/pull/24). \\n\\n Fixes #6 reported by @tirkarthi (383b0347).\\n\\n \\n\\n## Release 1.0.3\\n\\n\\n\\n* Limit the number of tags in a message to 1024 (0b8c965)\\n\\n\\n\\n## Release 1.0.2\\n\\n\\n\\n* Merge input validation and error handling improvements from #5. Fuzzing FTW.\\n\\n* Misc docstring and README updates\\n\\n* Fix incorrect range-check introduced in 9656fda and released as 1.0.1.\\n\\n\\n\\n## Release 1.0.1 (yanked)\\n\\n\\n\\n* Release 1.0.1 was removed from Github and yanked from crates.io due to a range-check bug. \\n\\n 1.0.2 is its replacement. \\n\\n \\n\\n## Release 1.0.0\\n\\n\\n\\nThanks to @Aaron1011's work, Roughenough has 1.0 level of functionality.\\n\\n\\n\\n* Server batches responses and signs Merkle tree root (3471e04, ee38933f, and 31bf8b3)\\n\\n* `mio` error handling improvement (613fb01f)\\n\\n* Build on Rust Nightly (350b23a)\\n\",\n \"file_path\": \"CHANGELOG.md\",\n \"rank\": 37,\n \"score\": 20746.520369998954\n },\n {\n \"content\": \"# Roughenough \\n\\n\\n\\n[](https://crates.io/crates/roughenough)\\n\\n[](https://travis-ci.org/int08h/roughenough)\\n\\n[](https://www.apache.org/licenses/LICENSE-2.0.txt)\\n\\n\\n\\n**Roughenough** is an RFC-draft compliant [Roughtime](https://roughtime.googlesource.com/roughtime) secure time \\n\\nsynchronization client and server implementation in Rust. \\n\\n\\n\\nRoughenough's server and client are functionally complete and \\n\\nat feature parity with the reference C++ and Golang implementations. \\n\\n\\n\\nRequires latest stable Rust to compile. Contributions welcome, see\\n\\n[CONTRIBUTING](../master/CONTRIBUTING.md) for instructions and [limitations](#limitations) for areas that could use attention.\\n\\n\\n\\n## RFC Work-In-Progress\\n\\n\\n\\nRoughenough implements the Roughtime protocol as specified in [the draft-5 RFC](https://www.ietf.org/archive/id/draft-ietf-ntp-roughtime-05.html).\\n\\n \\n\\n**Important differences from the draft RFC**\\n\\n1. Roughenough uses SHA-512/256 to compute the Merkle tree. Draft-5 of the RFC uses a\\n\\n bespoke 32-byte SHA-512 prefix without rationale or justification. Given that \\n\\n standardized 32-byte SHA-512/256 exists and is already implemented widely, I'm \\n\\n sticking with it while I advocate for the RFC to move away from the custom prefix\\n\\n and adopt SHA-512/256.\\n\\n2. The server and client send/expect RFC protocol version `1` (VER tag is `0x00000001`) \\n\\n instead of the draft's suggested `0x80000000 + version`.\\n\\n\\n\\nThe Roughenough server operates both the \\\"classic\\\" protocol **and** the RFC compliant \\n\\nprotocol at the same time on a single serving port (the 8-byte magic frame value added \\n\",\n \"file_path\": \"README.md\",\n \"rank\": 38,\n \"score\": 20746.20565054545\n },\n {\n \"content\": \"#### YAML Configuration \\n\\n\\n\\nThe table above lists the YAML keys available in the config file. An example:\\n\\n\\n\\n```yaml\\n\\ninterface: 127.0.0.1\\n\\nport: 8686\\n\\nseed: f61075c988feb9cb700a4a6a3291bfbc9cab11b9c9eca8c802468eb38a43d7d3\\n\\n```\\n\\n\\n\\nProvide the config file as the single command-line argument to the Roughenough server binary:\\n\\n\\n\\n```bash\\n\\n$ /path/to/roughenough-server /path/to/config.yaml\\n\\n```\\n\\n\\n\\n#### Environment Configuration\\n\\n\\n\\nRoughenough can be configured via the `ROUGHENOUGH_*` [environment variables](https://12factor.net/config) \\n\\nlisted in the table above. Start the server with a single `ENV` argument to have Roughenough configure itself\\n\\nfrom the environment. Example:\\n\\n\\n\\n```bash\\n\\n$ export ROUGHENOUGH_INTERFACE=127.0.0.1\\n\\n$ export ROUGHENOUGH_PORT=8686\\n\\n$ export ROUGHENOUGH_SEED=f61075c988feb9cb700a4a6a3291bfbc9cab11b9c9eca8c802468eb38a43d7d3\\n\\n$ /path/to/roughenough-server ENV\\n\\n```\\n\\n\\n\\n### Starting the Server\\n\\n\\n\\n```bash\\n\\n# Build roughenough\\n\\n$ cargo build --release\\n\\n\\n\\n# Via a config file\\n\\n$ target/release/roughenough-server example.cfg\\n\\n2018-07-25 00:05:09 INFO [server] Roughenough server v1.0.5 starting\\n\\n2018-07-25 00:05:09 INFO [server] Long-term public key: d0756ee69ff5fe96cbcf9273208fec53124b1dd3a24d3910e07c7c54e2473012\\n\\n2018-07-25 00:05:09 INFO [server] Ephemeral public key: 25fd5dc31ceee241aed3e643534e95ed0609e9a20982a45ac0312a5f55e2cc66\\n\\n2018-07-25 00:05:09 INFO [server] Server listening on 127.0.0.1:8686\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 39,\n \"score\": 20743.0006065057\n },\n {\n \"content\": \"# send RFC protocol Roughtime requests\\n\\n$ roughenough-client -p 1 roughtime.int08h.com 2002\\n\\n```\\n\\n\\n\\n## Links\\n\\n* [Roughenough Github repo](https://github.com/int08h/roughenough)\\n\\n* Original [Roughtime project](https://roughtime.googlesource.com/roughtime)\\n\\n* My blog posts giving a [technical deep-dive into Roughtime](https://int08h.com/post/to-catch-a-lying-timeserver/) and\\n\\n exploring details of [on-the-wire Roughtime messages](https://int08h.com/post/roughtime-message-anatomy/).\\n\\n* Cloudflare's fantastic [blog post](https://blog.cloudflare.com/roughtime/) and accompanying \\n\\n [open-source project](https://developers.cloudflare.com/roughtime/).\\n\\n\\n\\n## Building and Running\\n\\n\\n\\n### Minimum Supported Rust Version (MSRV)\\n\\n\\n\\nRoughenough uses [2018 edition](https://rust-lang-nursery.github.io/edition-guide/rust-2018/index.html) \\n\\nfeatures and requires Rust 1.31 or newer to build.\\n\\n\\n\\n### Building\\n\\n\\n\\n```bash\\n\\n# Build roughenough\\n\\n$ cargo build --release\\n\\n```\\n\\n\\n\\nThe client binary is `target/release/roughenough-client`. After building you can copy the \\n\\nbinary and run on its own (no `cargo` needed) if you wish.\\n\\n\\n\\n```bash\\n\\n$ cp target/release/roughenough-client /usr/local/bin \\n\\n```\\n\\n\\n\\n### Using the Client to Query a Roughtime Server \\n\\n\\n\\n```bash\\n\\n$ target/release/roughenough-client -v roughtime.int08h.com 2002\\n\\nRequesting time from: \\\"roughtime.int08h.com\\\":2002\\n\\nReceived time from server: midpoint=\\\"Oct 26 2018 23:20:44\\\", radius=1000000, verified=No (merkle_index=0)\\n\\nOct 26 2018 23:20:44\\n\\n```\\n\\n\\n\\n### Setting The System Time on Linux\\n\\n\\n\\nYou can use the `date` utility on Linux machines to set the system time to the time determined by the Roughenough client:\\n\\n\\n\\n```bash\\n\\nsudo date --utc --set \\\"$(roughenough-client -z roughtime.int08h.com 2002)\\\"\\n\\n```\\n\\n\\n\\n### Validating Server Responses \\n\\n\\n\\nUse the `-p` flag with the client to validate the server's response with its public key.\\n\\n\\n\\n```bash\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 40,\n \"score\": 20742.356588898107\n },\n {\n \"content\": \"## Version 1.2.0-draft-5\\n\\n* Roughenough (mostly) implements the Roughtime protocol as specified in [the draft-5 RFC](https://www.ietf.org/archive/id/draft-ietf-ntp-roughtime-05.html).\\n\\n \\n\\n **Important differences from the draft RFC**\\n\\n 1. Roughenough uses SHA-512/256 to compute the Merkle tree. Draft-5 of the RFC uses a\\n\\n bespoke 32-byte SHA-512 prefix without rationale or justification. Given that\\n\\n standardized 32-byte SHA-512/256 exists and is already implemented widely, I'm \\n\\n sticking with it while I advocate for the RFC to move away from the custom prefix\\n\\n and adopt SHA-512/256.\\n\\n 2. The server and client send/expect RFC protocol version `1` (VER tag is `0x00000001`) \\n\\n instead of the draft's suggested `0x80000000 + version`.\\n\\n\\n\\n* The Roughenough server operates both the \\\"classic\\\" protocol **and** the RFC compliant \\n\\n protocol at the same time on a single serving port (the 8-byte magic frame value added \\n\\n by the RFC is used to distinguish classic vs. rfc requests).\\n\\n\\n\\n The new `-p/--protocol` flag of `roughenough-client` controls the protocol version to\\n\\n use in requests (`0` = classic protocol, `1` = RFC protocol). The default is `0` the\\n\\n \\\"classic\\\" protocol, until the RFC is finalized:\\n\\n\\n\\n ```\\n\\n # send RFC protocol Roughtime requests\\n\\n $ roughenough-client -p 1 roughtime.int08h.com 2002\\n\\n ```\\n\\n* Added `-d/--dump` to `roughenough-client` that will pretty-print text representations \\n\\n of the messages it sends and receives.\\n\\n\\n\\n## Version 1.1.9\\n\\n\\n\\nHousekeeping:\\n\\n* 8f088f1 Overdue Ring update 0.13 -> 0.16\\n\\n* 43b1de3 GCK KMS updated to the latest dependencies\\n\\n* 7ff2e53 AWS KMS also updated to latest dependencies \\n\\n\\n\\n## Version 1.1.8\\n\\n\\n\\nNew feature:\\n\\n* 407f12d client: output local time by default, add -z/--zulu for UTC \\n\\n\\n\\nHousekeeping:\\n\\n* 02212e2 Switch to std::time and drop use of 'time' crate \\n\\n* d42db50 Upgrade several dependencies to latest versions \\n\\n* e13d6fd Remove deprecated `std::error::Error::description` calls \\n\\n* 32f11aa Update Dockerfile to Rust 1.42 \\n\\n\\n\",\n \"file_path\": \"CHANGELOG.md\",\n \"rank\": 41,\n \"score\": 20742.030387574512\n },\n {\n \"content\": \"## Version 1.1.7\\n\\n\\n\\n* Improved options for client output thanks to @zicklag (f1f834e8c).\\n\\n\\n\\n By default the client now outputs just the time reported by the queried server. \\n\\n The `-v` or `--verbose` flag will print additional information such as the response's \\n\\n midpoint and radius. `-j` or `--json` outputs responses in JSON format instead.\\n\\n\\n\\n Non-response text output is written to standard error to enable verbose output \\n\\n while redirecting the response(s) to a file or pipe like so:\\n\\n \\n\\n ```\\n\\n $ roughenough-client -v roughtime.int08h.com 2002 > time.txt\\n\\n Requesting time from: \\\"roughtime.int08h.com\\\":2002\\n\\n Received time from server: midpoint=\\\"Oct 08 2019 18:40:38\\\", radius=1000000, verified=No (merkle_index=0)\\n\\n \\n\\n $ cat time.txt\\n\\n Oct 08 2019 18:40:38\\n\\n ```\\n\\n\\n\\n## Version 1.1.6\\n\\n\\n\\n* Fix several Clippy items (266f1adc9) \\n\\n* Update to latest Rusoto (6ff01af52)\\n\\n* Update to latest google-cloudkms (a0165c019)\\n\\n* Update Dockerfile to Rust 1.38 (a14c2e8)\\n\\n\\n\\n## Version 1.1.5\\n\\n\\n\\n* Improved error messages (3841942)\\n\\n* Update fuzzer server target to sync with roughenough-fuzz\\n\\n* Add Dockerfile to create a server container\\n\\n\\n\\n## Version 1.1.4\\n\\n\\n\\n* Implement Roughtime ecosystem response mangling (177372f, f851deb)\\n\\n* Doc fix from @Muncan90 (20ba144)\\n\\n\\n\\n## Version 1.1.3\\n\\n\\n\\n* Add decrypt option to `roughenough-kms` \\n\\n\\n\\n## Version 1.1.2 \\n\\n\\n\\n* Add client request statistics tracking.\\n\\n* Clean-up and simplification of server inner loop.\\n\\n* Rust 2018 edition required to compile.\\n\\n\\n\\n## Version 1.1.1\\n\\n\\n\\n* Provide auxiliary data to the AWS KMS decryption call. The auxiliary data _was_ provided in encrypt, but not decrypt, resulting in unconditional failure when unwrapping the long-term identity. See https://github.com/int08h/roughenough/commit/846128d08bd3fcd72f23b3123b332d0692782e41#diff-7f7c3059af30a5ded26269301caf8531R102\\n\\n\\n\",\n \"file_path\": \"CHANGELOG.md\",\n \"rank\": 42,\n \"score\": 20740.198873588204\n },\n {\n \"content\": \"# Contributing to Roughenough\\n\\n\\n\\nDo you enjoy working on obscure cryptographically secure time synchronization protocols? \\n\\n\\n\\n:+1::tada: nice, me too!\\n\\n\\n\\n# Contribute via Pull Requests\\n\\n\\n\\nPlease open a pull request (PR) for your changes and include:\\n\\n\\n\\n* An overall description/rationale of the PR\\n\\n* Tests for any new or modified functionality\\n\\n* Code formatted with `rustfmt` default style settings \\n\\n* License (Apache 2.0) and copyright statements for your code\\n\\n* A Developer Certificate of Origin (DCO) sign-off as described below\\n\\n* A willingness to iterate and make changes ;)\\n\\n\\n\\n`Roughenough` targets **stable Rust** only. Contributions that don't compile\\n\\non `stable` will be declined. Sorry.\\n\\n\\n\\n# Developer Certificate of Origin\\n\\n\\n\\nTo provide assurance of the provenance and integrity of contributions \\n\\nRoughenough uses the [Developer Certificate of Origin](https://developercertificate.org/)\\n\\ncreated by the Linux Foundation instead of lengthy Contributor License \\n\\nAgreements (CLAs). \\n\\n\\n\\nPlease include *verbatim* and *unchanged* the full DCO statement \\n\\nbelow with your PR:\\n\\n\\n\\n```\\n\\nDeveloper Certificate of Origin\\n\\nVersion 1.1\\n\\n\\n\\nCopyright (C) 2004, 2006 The Linux Foundation and its contributors.\\n\\n1 Letterman Drive\\n\\nSuite D4700\\n\\nSan Francisco, CA, 94129\\n\\n\\n\\nEveryone is permitted to copy and distribute verbatim copies of this\\n\\nlicense document, but changing it is not allowed.\\n\\n\\n\\nDeveloper's Certificate of Origin 1.1\\n\\n\\n\\nBy making a contribution to this project, I certify that:\\n\\n\\n\\n(a) The contribution was created in whole or in part by me and I\\n\\n have the right to submit it under the open source license\\n\\n indicated in the file; or\\n\\n\\n\\n(b) The contribution is based upon previous work that, to the best\\n\\n of my knowledge, is covered under an appropriate open source\\n\\n license and I have the right under that license to submit that\\n\\n work with modifications, whether created in whole or in part\\n\\n by me, under the same open source license (unless I am\\n\\n permitted to submit under a different license), as indicated\\n\",\n \"file_path\": \"CONTRIBUTING.md\",\n \"rank\": 43,\n \"score\": 20737.62226235527\n },\n {\n \"content\": \"by the RFC is used to distinguish classic vs. rfc requests).\\n\\n\\n\\nThe new `-p/--protocol` flag of `roughenough-client` controls the protocol version to\\n\\nuse in requests (`0` = classic protocol, `1` = RFC protocol). The default is `0` the\\n\\n\\\"classic\\\" protocol, until the RFC is finalized:\\n\\n\\n\\n```\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 44,\n \"score\": 20736.22188013426\n },\n {\n \"content\": \" in the file; or\\n\\n\\n\\n(c) The contribution was provided directly to me by some other\\n\\n person who certified (a), (b) or (c) and I have not modified\\n\\n it.\\n\\n\\n\\n(d) I understand and agree that this project and the contribution\\n\\n are public and that a record of the contribution (including all\\n\\n personal information I submit with it, including my sign-off) is\\n\\n maintained indefinitely and may be redistributed consistent with\\n\\n this project or the open source license(s) involved.\\n\\n```\\n\\n\\n\",\n \"file_path\": \"CONTRIBUTING.md\",\n \"rank\": 45,\n \"score\": 20735.86324062343\n },\n {\n \"content\": \"## About the Roughtime Protocol\\n\\n[Roughtime](https://roughtime.googlesource.com/roughtime) is a protocol that aims to achieve rough \\n\\ntime synchronisation in a secure way that doesn't depend on any particular time server, and in such\\n\\na way that, if a time server does misbehave, clients end up with cryptographic proof of it. It was \\n\\ncreated by Adam Langley and Robert Obryk.\\n\\n \\n\\n## Contributors\\n\\n* Stuart Stock (stuart {at} int08h.com)\\n\\n* Aaron Hill (aa1ronham {at} gmail.com)\\n\\n* Peter Todd (pete {at} petertodd.org)\\n\\n* Muncan90 (github.com/muncan90)\\n\\n* Zicklag (github.com/zicklag)\\n\\n\\n\\n## Copyright and License\\n\\nRoughenough is copyright (c) 2017-2021 int08h LLC. All rights reserved. \\n\\n\\n\\nint08h LLC licenses Roughenough (the \\\"Software\\\") to you under the Apache License, version 2.0 \\n\\n(the \\\"License\\\"); you may not use this Software except in compliance with the License. You may obtain \\n\\na copy of the License from the [LICENSE](../master/LICENSE) file included with the Software or at:\\n\\n\\n\\n http://www.apache.org/licenses/LICENSE-2.0\\n\\n\\n\\nUnless required by applicable law or agreed to in writing, software distributed under the License \\n\\nis distributed on an \\\"AS IS\\\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or \\n\\nimplied. See the License for the specific language governing permissions and limitations under \\n\\nthe License.\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 46,\n \"score\": 20733.760952665063\n },\n {\n \"content\": \"# Thanks In Advance for Helping Roughenough!\\n\\n\\n\\nStuart @int08h\\n\",\n \"file_path\": \"CONTRIBUTING.md\",\n \"rank\": 47,\n \"score\": 20733.560382657583\n },\n {\n \"content\": \"## Restore the 1024 byte minimum request size requirement\\n\\n\\n\\nDraft 02 states that: \\n\\n\\n\\n Responding to requests shorter than 1024 bytes is OPTIONAL \\n\\n and servers MUST NOT send responses larger than the requests \\n\\n they are replying to.\\n\\n\\n\\nThe minimum request size requirement exists to prevent a roughtime server from becoming\\n\\na DDoS amplifier [CF-DDoS]. A minimum request size of of 1024 bytes ensures that even \\n\\na busy roughtime server signing a Merkle tree of 64 requests generates a response *smaller* \\n\\nthan the 1024 byte request minimum (response would be 744 bytes, see [int08h]).\\n\\n\\n\\nIf requests smaller than 1024 bytes are permitted, how small could a request be? A valid \\n\\nRoughtime request *without* a PAD field would be 72 bytes long: \\n\\n\\n\\n 4 bytes number of fields \\n\\n 4 bytes NONC tag \\n\\n 64 bytes NONC value\\n\\n \\n\\nGiven that the *minimum* Server response size is 360 bytes [int08h], a minimal size request \\n\\npresents a DDoS attacker with a potential 5x gain in size. \\n\\n\\n\\nMaking the minimum response size OPTIONAL requires Roughtime server operators to decide \\n\\n\\\"how small is too small\\\" and a wrong choice will create more DDoS amplifiers in the world.\\n\\n\\n\\nSuggestion: mandate requests >= 1024 bytes\\n\\n\\n\",\n \"file_path\": \"doc/rfc-commentary.md\",\n \"rank\": 48,\n \"score\": 19346.449925651235\n },\n {\n \"content\": \"## The LEAP field is not necessary \\n\\n\\n\\nRoughtime can handle leap seconds and time uncertainty/discontinuity complications without the \\n\\naddition of new tags/fields. The RADI field already provides a method for a Roughtime \\n\\nimplementation to express time uncertainty in responses [draf02]: \\n\\n\\n\\n The RADI tag value is a uint32 representing the server's estimate of\\n\\n the accuracy of MIDP in microseconds. Servers MUST ensure that the\\n\\n true time is within (MIDP-RADI, MIDP+RADI) at the time they compose\\n\\n the response message.\\n\\n\\n\\nIn the case of a leap second, a Roughtime server can increase the value returned in \\n\\nthe RADI field to account for the uncertainty introduced by a leap second. The increase \\n\\nin RADI value can persist as long as necessary (the duration of a leap second \\\"smear\\\" \\n\\nfor example [AWS-smear] and [Google-smear]).\\n\\n \\n\\nSuggestion: remove DUT, DTAI, and LEAP fields along with int32 type\\n\\n\\n\\n## Introduction of a signed int32 type creates a new security risk \\n\\n\\n\\nThe addition of the signed int32 field type (required to support the DUT, DTAI, and \\n\\nLEAP fields) exposes Roughtime implementations to a new *class* of software errors\\n\\naround sign/unsigned conversions. \\n\\n\\n\\nThe Common Weaknesses Enumeration Top 25 Most Dangerous Software Errors [CWE-TOP25] \\n\\nlists \\\"Integer Overflow or Wraparound\\\" as the #8 most frequent software weakness. The \\n\\ndetail page on integer overflow [CWE-190] identifies signed/unsigned confusion, \\n\\nunintentional wrap-around, and lack of range checks as sources of software errors.\\n\\n\\n\\nIntroducing a signed integer type into Roughtime does not guarantee these issues\\n\\noccur. However it does introduces an entirely new area of concern that would not\\n\\nexist if these signed fields were omitted. \\n\\n\\n\\nSuggestion: remove DUT, DTAI, and LEAP fields along with int32 type\\n\\n\\n\",\n \"file_path\": \"doc/rfc-commentary.md\",\n \"rank\": 49,\n \"score\": 19346.070920375896\n },\n {\n \"content\": \"## Checking response vs. request size complicates server implementation\\n\\n\\n\\nIn Draft 02: \\n\\n\\n\\n Responding to requests shorter than 1024 bytes is OPTIONAL \\n\\n and servers MUST NOT send responses larger than the requests \\n\\n they are replying to.\\n\\n\\n\\nRoughtime servers can batch multiple requests into a single response making response \\n\\nsize a function of server load/batching parameters plus concurrent requests. Roughtime \\n\\nServer implementations may gather or buffer client requests prior to constructing the \\n\\nresponse. \\n\\n\\n\\n\\\"...servers MUST NOT send responses larger than the requests...\\\" will require implementations\\n\\nto perform additional tracking of per-request sizes and then compute the resulting response\\n\\nsize once the response *after* batch size has been determined. \\n\\n\\n\\nThis is more complex and incurs additional processing compared to simply rejecting all \\n\\nrequests <1024 bytes.\\n\\n\\n\\nSuggestion: mandate requests >= 1024 bytes\\n\\n\\n\\n## The \\\"ROUGHTIM\\\" packet format is redundant\\n\\n\\n\\nThe addition of the constant \\\"ROUGHTIM\\\" plus additional length field is redundant to \\n\\nthe message format (which also has a length field). The value this additional \\n\\npacket format is not clear.\\n\\n\\n\\nSuggestion: use \\\"bare\\\" Roughtime messages as the packet format \\n\\n\\n\\n## Stick with SHA-512; eliminate use of truncated SHA-512/256 \\n\\n\\n\\nTruncated SHA-512/256 is performed by a) compute SHA-512, then b) truncate the result. \\n\\nThe resulting computational effort of SHA-512 and SHA-512/256 is equivalent. \\n\\n\\n\\nThe draft utilizes SHA-512/256 for its 32 byte output, as opposed to 64 bytes for\\n\\nSHA-512. The motivation for this change is unclear and it complicates implementations\\n\\nwhich now need two hashing primitives (SHA-512/256 initialization is different than SHA-512).\\n\\n\\n\\nSuggestion: use SHA-512 throughout and drop any use of SHA-512/256\\n\\n\\n\\n## References \\n\\n\\n\\n* [AWS-smear] https://aws.amazon.com/blogs/aws/look-before-you-leap-the-coming-leap-second-and-aws/\\n\\n* [CF-DDoS] https://www.cloudflare.com/learning/ddos/ntp-amplification-ddos-attack/\\n\\n* [CWE-190] https://cwe.mitre.org/data/definitions/190.html\\n\\n* [CWE-TOP25] https://cwe.mitre.org/top25/archive/2019/2019_cwe_top25.html\\n\\n* [draft02] https://tools.ietf.org/html/draft-ietf-ntp-roughtime-02\\n\\n* [Google-smear] https://developers.google.com/time/smear\\n\\n* [int08h] https://int08h.com/post/to-catch-a-lying-timeserver/#keeping-response-sizes-compact\\n\\n* [roughtime] https://roughtime.googlesource.com/roughtime\\n\\n\\n\",\n \"file_path\": \"doc/rfc-commentary.md\",\n \"rank\": 50,\n \"score\": 19345.17244966042\n },\n {\n \"content\": \"# Comments on draft-ietf-ntp-roughtime-02\\n\\n\\n\\nAuthor: Stuart Stock\\n\\nDate : 2020-06-14\\n\\n\\n\\n## Introduction\\n\\n\\n\\nI am the original creator and current maintainer of two Roughtime implementations:\\n\\n\\n\\n * Roughenough (Rust) https://github.com/int08h/roughenough\\n\\n * Nearenough (Java) https://github.com/int08h/nearenough\\n\\n\\n\\nHave written deep-dive articles about the Roughtime protocol: \\n\\n\\n\\n * https://int08h.com/post/to-catch-a-lying-timeserver/\\n\\n * https://int08h.com/post/roughtime-message-anatomy/\\n\\n \\n\\nAnd operate the longest running publicly accessible (non-Googler) Roughtime server \\n\\non the internet\\n\\n\\n\\n * roughtime.int08h.com:2002\\n\\n \\n\\nI offer my comments on draft-ietf-ntp-roughtime-02 as someone well versed in the Roughtime \\n\\nprotocol and intimately familiar with its implementation and trade-offs.\\n\\n\\n\\n## Keep the \\\"rough\\\" in \\\"Roughtime\\\"\\n\\n\\n\\nThe authors of the original Roughtime protocol definition [roughtime] state that a \\n\\ndeliberate goal of the Roughtime protocol was \\\"...time synchronisation to within 10 \\n\\nseconds of the correct time.\\\" Those authors go on to state that \\\"[i]f you have \\n\\n_serious_ time synchronisation needs you‘ll want the machinery in NTP or even PTP...\\\"\\n\\n\\n\\nAddition of the DUT, DTAI, and LEAP fields run contrary to this design intent. These fields\\n\\nprovide time synchronization features that duplicate those in NTP and PTP. Precise time \\n\\nsync should be delegated to NTP and PTP and their ecosystems.\\n\\n\\n\\nSimplicity of the Roughtime protocol encourages simple implementations. Simplicity\\n\\nin implementation is a key to assurance that implementations are correct and secure. \\n\\nIncreasing the number of fields and field types that must be implemented runs contrary \\n\\nto ease of implementation. Simplicity, and by extension security, should be a deliberate \\n\\nand top-of-mind design goal of the Roughtime standardization process.\\n\\n\\n\\nMultiple existing IETF protocols address needs of highly accurate time synchronization \\n\\nand should be used where timing precision requires. Keep Roughtime \\\"rough\\\".\\n\\n\\n\\nSuggestion: remove DUT, DTAI, and LEAP fields along with int32 type\\n\\n\\n\",\n \"file_path\": \"doc/rfc-commentary.md\",\n \"rank\": 51,\n \"score\": 19343.95215021442\n },\n {\n \"content\": \" client_stats: false,\\n\\n fault_percentage: 0,\\n\\n };\\n\\n\\n\\n for (key, value) in cfg[0].as_hash().unwrap() {\\n\\n match key.as_str().unwrap() {\\n\\n \\\"port\\\" => config.port = value.as_i64().unwrap() as u16,\\n\\n \\\"interface\\\" => config.interface = value.as_str().unwrap().to_string(),\\n\\n \\\"batch_size\\\" => config.batch_size = value.as_i64().unwrap() as u8,\\n\\n \\\"seed\\\" => {\\n\\n let val = value.as_str().unwrap().to_string();\\n\\n config.seed = HEX\\n\\n .decode(val.as_bytes())\\n\\n .expect(\\\"seed value invalid; 'seed' must be a valid hex value\\\");\\n\\n }\\n\\n \\\"status_interval\\\" => {\\n\\n let val = value.as_i64().expect(\\\"status_interval value invalid\\\");\\n\\n config.status_interval = Duration::from_secs(val as u64)\\n\\n }\\n\\n \\\"kms_protection\\\" => {\\n\",\n \"file_path\": \"src/config/file.rs\",\n \"rank\": 52,\n \"score\": 27.686003752542824\n },\n {\n \"content\": \" .parse()\\n\\n .unwrap_or_else(|_| panic!(\\\"invalid port: {}\\\", port));\\n\\n };\\n\\n\\n\\n if let Ok(interface) = env::var(ROUGHENOUGH_INTERFACE) {\\n\\n cfg.interface = interface.to_string();\\n\\n };\\n\\n\\n\\n if let Ok(seed) = env::var(ROUGHENOUGH_SEED) {\\n\\n cfg.seed = HEX\\n\\n .decode(seed.as_bytes())\\n\\n .expect(\\\"invalid seed value; 'seed' should be a hex value\\\");\\n\\n };\\n\\n\\n\\n if let Ok(batch_size) = env::var(ROUGHENOUGH_BATCH_SIZE) {\\n\\n cfg.batch_size = batch_size\\n\\n .parse()\\n\\n .unwrap_or_else(|_| panic!(\\\"invalid batch_size: {}\\\", batch_size));\\n\\n };\\n\\n\\n\",\n \"file_path\": \"src/config/environment.rs\",\n \"rank\": 53,\n \"score\": 26.850809330150312\n },\n {\n \"content\": \" assert!(ciphertext_blob.len() < MIN_PAYLOAD_SIZE);\\n\\n\\n\\n let kms = MockKmsProvider {};\\n\\n let result = EnvelopeEncryption::decrypt_seed(&kms, ciphertext_blob.as_bytes());\\n\\n\\n\\n match result.expect_err(\\\"expected KmsError\\\") {\\n\\n KmsError::InvalidData(msg) => assert!(msg.contains(\\\"ciphertext too short\\\")),\\n\\n e => panic!(\\\"Unexpected error {:?}\\\", e),\\n\\n }\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn encrypt_decrypt_round_trip() {\\n\\n let kms = MockKmsProvider {};\\n\\n let plaintext = Vec::from(\\\"This is the plaintext used for this test 1\\\");\\n\\n\\n\\n let enc_result = EnvelopeEncryption::encrypt_seed(&kms, &plaintext);\\n\\n assert_eq!(enc_result.is_ok(), true);\\n\\n\\n\\n let ciphertext = enc_result.unwrap();\\n\",\n \"file_path\": \"src/kms/envelope.rs\",\n \"rank\": 54,\n \"score\": 26.113755650455992\n },\n {\n \"content\": \"pub const DEFAULT_BATCH_SIZE: u8 = 64;\\n\\n\\n\\n/// Amount of time between each logged status update.\\n\\npub const DEFAULT_STATUS_INTERVAL: Duration = Duration::from_secs(600);\\n\\n\\n\\n///\\n\\n/// Specifies parameters needed to configure a Roughenough server.\\n\\n///\\n\\n/// Parameters labeled \\\"**Required**\\\" must always be provided and have no default value\\n\\n/// while those labeled \\\"**Optional**\\\" provide sane default values that can be overridden.\\n\\n///\\n\\n/// YAML Key | Environment Variable | Necessity | Description\\n\\n/// --- | --- | --- | ---\\n\\n/// `interface` | `ROUGHENOUGH_INTERFACE` | Required | IP address or interface name for listening to client requests\\n\\n/// `port` | `ROUGHENOUGH_PORT` | Required | UDP port to listen for requests\\n\\n/// `seed` | `ROUGHENOUGH_SEED` | Required | A 32-byte hexadecimal value used to generate the server's long-term key pair. **This is a secret value and must be un-guessable**, treat it with care. (If compiled with KMS support, length will vary)\\n\\n/// `batch_size` | `ROUGHENOUGH_BATCH_SIZE` | Optional | The maximum number of requests to process in one batch. All nonces in a batch are used to build a Merkle tree, the root of which is signed. Default is `64` requests per batch.\\n\\n/// `status_interval` | `ROUGHENOUGH_STATUS_INTERVAL` | Optional | Number of _seconds_ between each logged status update. Default is `600` seconds (10 minutes).\\n\\n/// `health_check_port` | `ROUGHENOUGH_HEALTH_CHECK_PORT` | Optional | If present, enable an HTTP health check responder on the provided port. **Use with caution**.\\n\\n/// `kms_protection` | `ROUGHENOUGH_KMS_PROTECTION` | Optional | If compiled with KMS support, the ID of the KMS key used to protect the long-term identity.\\n\\n/// `client_stats` | `ROUGHENOUGH_CLIENT_STATS` | Optional | A value of `on` or `yes` will enable tracking of per-client request statistics that will be output each time server status is logged. Default is `off` (disabled).\\n\\n/// `fault_percentage` | `ROUGHENOUGH_FAULT_PERCENTAGE` | Optional | Likelihood (as a percentage) that the server will intentionally return an invalid client response. An integer range from `0` (disabled, all responses valid) to `50` (50% of responses will be invalid). Default is `0` (disabled).\\n\\n///\\n\\n/// Implementations of this trait obtain a valid configuration from different back-end\\n\\n/// sources. See:\\n\\n/// * [FileConfig](struct.FileConfig.html) - configure via a YAML file\\n\\n/// * [EnvironmentConfig](struct.EnvironmentConfig.html) - configure via environment variables\\n\\n/// * [MemoryConfig](struct.MemoryConfig.html) - in-memory configuration for testing\\n\\n///\\n\",\n \"file_path\": \"src/config/mod.rs\",\n \"rank\": 55,\n \"score\": 25.87719205307963\n },\n {\n \"content\": \"\\n\\nuse byteorder::{LittleEndian, ReadBytesExt, WriteBytesExt};\\n\\nuse data_encoding::{Encoding, HEXLOWER_PERMISSIVE};\\n\\n\\n\\nuse crate::error::Error;\\n\\nuse crate::RFC_REQUEST_FRAME_BYTES;\\n\\nuse crate::tag::Tag;\\n\\n\\n\\nconst HEX: Encoding = HEXLOWER_PERMISSIVE;\\n\\n\\n\\n///\\n\\n/// A Roughtime protocol message; a map of u32 tags to arbitrary byte-strings.\\n\\n///\\n\\n#[derive(Debug, Clone)]\\n\\npub struct RtMessage {\\n\\n tags: Vec<Tag>,\\n\\n values: Vec<Vec<u8>>,\\n\\n}\\n\\n\\n\\nimpl RtMessage {\\n\",\n \"file_path\": \"src/message.rs\",\n \"rank\": 56,\n \"score\": 24.876111238983725\n },\n {\n \"content\": \"\\n\\n /// Create a CERT message with a DELE containing the provided online key\\n\\n /// and a SIG of the DELE value signed by the long-term key\\n\\n pub fn make_cert(&mut self, online_key: &OnlineKey) -> RtMessage {\\n\\n let dele_bytes = online_key.make_dele().encode().unwrap();\\n\\n\\n\\n self.signer.update(CERTIFICATE_CONTEXT.as_bytes());\\n\\n self.signer.update(&dele_bytes);\\n\\n\\n\\n let dele_signature = self.signer.sign();\\n\\n\\n\\n let mut cert_msg = RtMessage::with_capacity(2);\\n\\n cert_msg.add_field(Tag::SIG, &dele_signature).unwrap();\\n\\n cert_msg.add_field(Tag::DELE, &dele_bytes).unwrap();\\n\\n\\n\\n cert_msg\\n\\n }\\n\\n\\n\\n /// Return the public key for the provided seed\\n\\n pub fn public_key(&self) -> &[u8] {\\n\",\n \"file_path\": \"src/key/longterm.rs\",\n \"rank\": 57,\n \"score\": 23.553744771745027\n },\n {\n \"content\": \"\\n\\nuse crate::CERTIFICATE_CONTEXT;\\n\\nuse crate::key::OnlineKey;\\n\\nuse crate::message::RtMessage;\\n\\nuse crate::sign::Signer;\\n\\nuse crate::tag::Tag;\\n\\n\\n\\n///\\n\\n/// Represents the server's long-term identity.\\n\\n///\\n\\npub struct LongTermKey {\\n\\n signer: Signer,\\n\\n}\\n\\n\\n\\nimpl LongTermKey {\\n\\n pub fn new(seed: &[u8]) -> Self {\\n\\n LongTermKey {\\n\\n signer: Signer::from_seed(seed),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/key/longterm.rs\",\n \"rank\": 58,\n \"score\": 22.6152522866697\n },\n {\n \"content\": \"\\n\\nuse byteorder::{LittleEndian, WriteBytesExt};\\n\\nuse data_encoding::{Encoding, HEXLOWER_PERMISSIVE};\\n\\nuse mio::net::UdpSocket;\\n\\n\\n\\nuse crate::{RtMessage, Tag};\\n\\nuse crate::config::ServerConfig;\\n\\nuse crate::grease::Grease;\\n\\nuse crate::key::{LongTermKey, OnlineKey};\\n\\nuse crate::merkle::MerkleTree;\\n\\nuse crate::stats::ServerStats;\\n\\nuse crate::version::Version;\\n\\n\\n\\nconst HEX: Encoding = HEXLOWER_PERMISSIVE;\\n\\n\\n\\npub struct Responder {\\n\\n version: Version,\\n\\n online_key: OnlineKey,\\n\\n long_term_public_key: String,\\n\\n cert_bytes: Vec<u8>,\\n\",\n \"file_path\": \"src/responder.rs\",\n \"rank\": 59,\n \"score\": 22.568473263776212\n },\n {\n \"content\": \"pub use crate::error::Error;\\n\\npub use crate::message::RtMessage;\\n\\npub use crate::tag::Tag;\\n\\n\\n\\nmod error;\\n\\nmod message;\\n\\nmod tag;\\n\\n\\n\\npub mod config;\\n\\npub mod grease;\\n\\npub mod key;\\n\\npub mod kms;\\n\\npub mod merkle;\\n\\npub mod request;\\n\\npub mod responder;\\n\\npub mod server;\\n\\npub mod sign;\\n\\npub mod stats;\\n\\npub mod version;\\n\\n\\n\\n/// Version of Roughenough\\n\\npub const VERSION: &str = \\\"1.2.0-draft-5\\\";\\n\\n\\n\\n/// Roughenough version string enriched with any compile-time optional features\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 60,\n \"score\": 21.716071381167772\n },\n {\n \"content\": \" // Invoke KMS to decrypt the DEK\\n\\n let dek = kms.decrypt_dek(&encrypted_dek)?;\\n\\n\\n\\n // Decrypt the seed value using the DEK\\n\\n let unbound_dek = UnboundKey::new(&AES_256_GCM, &dek)?;\\n\\n let dek_opening_key = LessSafeKey::new(unbound_dek);\\n\\n match dek_opening_key.open_in_place(nonce, Aad::from(AD), &mut encrypted_seed) {\\n\\n Ok(plaintext) => Ok(plaintext.to_vec()),\\n\\n Err(_) => Err(KmsError::OperationFailed(\\n\\n \\\"failed to decrypt plaintext seed\\\".to_string(),\\n\\n )),\\n\\n }\\n\\n }\\n\\n\\n\\n ///\\n\\n /// Encrypt the seed value and protect the seed's encryption key using a\\n\\n /// [`KmsProvider`](trait.KmsProvider.html).\\n\\n ///\\n\\n /// The returned encrypted byte blob is safe to store on unsecured media.\\n\\n ///\\n\",\n \"file_path\": \"src/kms/envelope.rs\",\n \"rank\": 61,\n \"score\": 21.636798553439654\n },\n {\n \"content\": \" let dec_result = EnvelopeEncryption::decrypt_seed(&kms, &ciphertext_copy);\\n\\n match dec_result.expect_err(\\\"expected an error\\\") {\\n\\n KmsError::InvalidData(msg) => assert!(msg.contains(\\\"nonce (1)\\\")),\\n\\n e => panic!(\\\"unexpected error {:?}\\\", e),\\n\\n }\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn modified_ciphertext_is_detected() {\\n\\n let kms = MockKmsProvider {};\\n\\n let plaintext = Vec::from(\\\"This is the plaintext used for this test 4\\\");\\n\\n\\n\\n let enc_result = EnvelopeEncryption::encrypt_seed(&kms, &plaintext);\\n\\n assert_eq!(enc_result.is_ok(), true);\\n\\n\\n\\n let ciphertext = enc_result.unwrap();\\n\\n assert_ne!(plaintext, ciphertext);\\n\\n\\n\\n // start corruption 4 bytes in, after the DEK and NONCE length fields\\n\\n for i in (DEK_LEN_FIELD + NONCE_LEN_FIELD)..ciphertext.len() {\\n\",\n \"file_path\": \"src/kms/envelope.rs\",\n \"rank\": 62,\n \"score\": 21.552732184807194\n },\n {\n \"content\": \"use crate::key::KmsProtection;\\n\\n\\n\\nconst HEX: Encoding = HEXLOWER_PERMISSIVE;\\n\\n\\n\\n/// A purely in-memory Roughenough config for testing purposes.\\n\\n///\\n\\n/// This is useful for testing or fuzzing a server without the need to create additional files.\\n\\npub struct MemoryConfig {\\n\\n pub port: u16,\\n\\n pub interface: String,\\n\\n pub seed: Vec<u8>,\\n\\n pub batch_size: u8,\\n\\n pub status_interval: Duration,\\n\\n pub kms_protection: KmsProtection,\\n\\n pub health_check_port: Option<u16>,\\n\\n pub client_stats: bool,\\n\\n pub fault_percentage: u8,\\n\\n}\\n\\n\\n\\nimpl MemoryConfig {\\n\",\n \"file_path\": \"src/config/memory.rs\",\n \"rank\": 63,\n \"score\": 21.157763257227657\n },\n {\n \"content\": \" ciphertext_copy[1] = 99;\\n\\n let dec_result = EnvelopeEncryption::decrypt_seed(&kms, &ciphertext_copy);\\n\\n match dec_result.expect_err(\\\"expected an error\\\") {\\n\\n KmsError::InvalidData(msg) => assert!(msg.contains(\\\"invalid DEK\\\")),\\n\\n e => panic!(\\\"unexpected error {:?}\\\", e),\\n\\n }\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn invalid_nonce_length_detected() {\\n\\n let kms = MockKmsProvider {};\\n\\n let plaintext = Vec::from(\\\"This is the plaintext used for this test 3\\\");\\n\\n\\n\\n let enc_result = EnvelopeEncryption::encrypt_seed(&kms, &plaintext);\\n\\n assert_eq!(enc_result.is_ok(), true);\\n\\n\\n\\n let ciphertext = enc_result.unwrap();\\n\\n let mut ciphertext_copy = ciphertext.clone();\\n\\n\\n\\n ciphertext_copy[2] = 1;\\n\",\n \"file_path\": \"src/kms/envelope.rs\",\n \"rank\": 64,\n \"score\": 20.6000397847875\n },\n {\n \"content\": \"\\n\\n match result {\\n\\n Ok((http_resp, enc_resp)) => {\\n\\n if http_resp.status() == StatusCode::OK {\\n\\n let ciphertext = enc_resp.ciphertext.unwrap();\\n\\n let ct = BASE64.decode(ciphertext.as_bytes())?;\\n\\n Ok(ct)\\n\\n } else {\\n\\n Err(self.pretty_http_error(&http_resp))\\n\\n }\\n\\n }\\n\\n Err(e) => Err(KmsError::OperationFailed(format!(\\\"encrypt_dek() {:?}\\\", e))),\\n\\n }\\n\\n }\\n\\n\\n\\n fn decrypt_dek(&self, encrypted_dek: &EncryptedDEK) -> Result<PlaintextDEK, KmsError> {\\n\\n let mut request = DecryptRequest::default();\\n\\n request.ciphertext = Some(BASE64.encode(encrypted_dek));\\n\\n request.additional_authenticated_data = Some(BASE64.encode(AD.as_bytes()));\\n\\n\\n\",\n \"file_path\": \"src/kms/gcpkms.rs\",\n \"rank\": 65,\n \"score\": 20.341562285010866\n },\n {\n \"content\": \"impl EnvelopeEncryption {\\n\\n /// Decrypt a seed previously encrypted with `encrypt_seed()`\\n\\n pub fn decrypt_seed(\\n\\n kms: &dyn KmsProvider,\\n\\n ciphertext_blob: &[u8],\\n\\n ) -> Result<Vec<u8>, KmsError> {\\n\\n if ciphertext_blob.len() < MIN_PAYLOAD_SIZE {\\n\\n return Err(KmsError::InvalidData(format!(\\n\\n \\\"ciphertext too short: min {}, found {}\\\",\\n\\n MIN_PAYLOAD_SIZE,\\n\\n ciphertext_blob.len()\\n\\n )));\\n\\n }\\n\\n\\n\\n let mut tmp = Cursor::new(ciphertext_blob);\\n\\n\\n\\n // Read the lengths of the wrapped DEK and of the nonce\\n\\n let dek_len = tmp.read_u16::<LittleEndian>()? as usize;\\n\\n let nonce_len = tmp.read_u16::<LittleEndian>()? as usize;\\n\\n\\n\",\n \"file_path\": \"src/kms/envelope.rs\",\n \"rank\": 66,\n \"score\": 20.31883959760549\n },\n {\n \"content\": \"const NONCE_LEN_BYTES: usize = 12;\\n\\n\\n\\n// Size of the AEAD authentication tag in bytes.\\n\\nconst TAG_LEN_BYTES: usize = 16;\\n\\n\\n\\n// Size of the 256-bit Data Encryption Key (DEK) in bytes.\\n\\nconst DEK_LEN_BYTES: usize = 32;\\n\\n\\n\\n// Trivial domain separation to guard against KMS key reuse\\n\\nconst AD: &str = \\\"roughenough\\\";\\n\\n\\n\\n/// An unencrypted (plaintext) 256-bit Data Encryption Key (DEK).\\n\\npub type PlaintextDEK = Vec<u8>;\\n\\n\\n\\n/// A Data Encryption Key (DEK) that has been encrypted (wrapped) by a Key Management System (KMS).\\n\\n///\\n\\n/// This is an opaque, implementation-specific value. AEAD tag size, nonce size,\\n\\n/// provider metadata, and so on will vary between [`KmsProvider`](trait.KmsProvider.html)\\n\\n/// implementations.\\n\\npub type EncryptedDEK = Vec<u8>;\\n\\n\\n\\n///\\n\\n/// A key management system that wraps/unwraps a data encryption key (DEK).\\n\\n///\\n\",\n \"file_path\": \"src/kms/mod.rs\",\n \"rank\": 67,\n \"score\": 19.66499171502273\n },\n {\n \"content\": \" pub fn new(port: u16) -> Self {\\n\\n let seed = b\\\"a32049da0ffde0ded92ce10a0230d35fe615ec8461c14986baa63fe3b3bac3db\\\";\\n\\n MemoryConfig {\\n\\n port,\\n\\n interface: \\\"127.0.0.1\\\".to_string(),\\n\\n seed: HEX.decode(seed).unwrap(),\\n\\n batch_size: DEFAULT_BATCH_SIZE,\\n\\n status_interval: DEFAULT_STATUS_INTERVAL,\\n\\n kms_protection: KmsProtection::Plaintext,\\n\\n health_check_port: None,\\n\\n client_stats: false,\\n\\n fault_percentage: 0,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl ServerConfig for MemoryConfig {\\n\\n fn interface(&self) -> &str {\\n\\n self.interface.as_ref()\\n\\n }\\n\",\n \"file_path\": \"src/config/memory.rs\",\n \"rank\": 68,\n \"score\": 19.496726169340434\n },\n {\n \"content\": \" response.add_field(Tag::CERT, cert_bytes).unwrap();\\n\\n response.add_field(Tag::INDX, &index).unwrap();\\n\\n\\n\\n response\\n\\n }\\n\\n\\n\\n /// Returns a reference to the long-term public key\\n\\n pub fn get_public_key(&self) -> &str {\\n\\n &self.long_term_public_key\\n\\n }\\n\\n\\n\\n /// Returns a reference to the on-line (delegated) key\\n\\n pub fn get_online_key(&self) -> &OnlineKey {\\n\\n &self.online_key\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/responder.rs\",\n \"rank\": 69,\n \"score\": 19.46895231377104\n },\n {\n \"content\": \"use crate::config::ServerConfig;\\n\\nuse crate::Error;\\n\\nuse crate::key::KmsProtection;\\n\\n\\n\\nconst HEX: Encoding = HEXLOWER_PERMISSIVE;\\n\\n\\n\\n///\\n\\n/// Obtain a Roughenough server configuration ([ServerConfig](trait.ServerConfig.html))\\n\\n/// from environment variables.\\n\\n///\\n\\n/// Config parameter | Environment Variable\\n\\n/// ---------------- | --------------------\\n\\n/// port | `ROUGHENOUGH_PORT`\\n\\n/// interface | `ROUGHENOUGH_INTERFACE`\\n\\n/// seed | `ROUGHENOUGH_SEED`\\n\\n/// batch_size | `ROUGHENOUGH_BATCH_SIZE`\\n\\n/// status_interval | `ROUGHENOUGH_STATUS_INTERVAL`\\n\\n/// kms_protection | `ROUGHENOUGH_KMS_PROTECTION`\\n\\n/// health_check_port | `ROUGHENOUGH_HEALTH_CHECK_PORT`\\n\\n/// client_stats | `ROUGHENOUGH_CLIENT_STATS`\\n\",\n \"file_path\": \"src/config/environment.rs\",\n \"rank\": 70,\n \"score\": 19.36556511506295\n },\n {\n \"content\": \"\\n\\nuse crate::config::{DEFAULT_BATCH_SIZE, DEFAULT_STATUS_INTERVAL};\\n\\nuse crate::config::ServerConfig;\\n\\nuse crate::Error;\\n\\nuse crate::key::KmsProtection;\\n\\n\\n\\nconst HEX: Encoding = HEXLOWER_PERMISSIVE;\\n\\n\\n\\n///\\n\\n/// Read a Roughenough server configuration ([ServerConfig](trait.ServerConfig.html))\\n\\n/// from a YAML file.\\n\\n///\\n\\n/// Example minimal config:\\n\\n///\\n\\n/// ```yaml\\n\\n/// interface: 127.0.0.1\\n\\n/// port: 8686\\n\\n/// seed: f61075c988feb9cb700a4a6a3291bfbc9cab11b9c9eca8c802468eb38a43d7d3\\n\\n/// ```\\n\\n///\\n\",\n \"file_path\": \"src/config/file.rs\",\n \"rank\": 71,\n \"score\": 18.88428506251361\n },\n {\n \"content\": \"// Copyright 2017-2021 int08h LLC\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 (the \\\"License\\\");\\n\\n// you may not use this file except in compliance with the License.\\n\\n// You may obtain a copy of the License at\\n\\n//\\n\\n// http://www.apache.org/licenses/LICENSE-2.0\\n\\n//\\n\\n// Unless required by applicable law or agreed to in writing, software\\n\\n// distributed under the License is distributed on an \\\"AS IS\\\" BASIS,\\n\\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\\n\\n// See the License for the specific language governing permissions and\\n\\n// limitations under the License.\\n\\n\\n\\n//!\\n\\n//! Protect the server's long-term key with envelope encryption and a key management system.\\n\\n//!\\n\\n//! Note: KMS support must be enabled at compile time, see the Roughenough's [documentation\\n\\n//! on optional features](https://github.com/int08h/roughenough/blob/master/doc/OPTIONAL-FEATURES.md#key-management-system-kms-support)\\n\\n//! for instructions.\\n\",\n \"file_path\": \"src/kms/mod.rs\",\n \"rank\": 72,\n \"score\": 18.556314814850282\n },\n {\n \"content\": \"use crate::config::ServerConfig;\\n\\nuse crate::error;\\n\\nuse crate::key::KmsProtection;\\n\\n#[cfg(feature = \\\"awskms\\\")]\\n\\npub use crate::kms::awskms::inner::AwsKms;\\n\\n#[cfg(feature = \\\"gcpkms\\\")]\\n\\npub use crate::kms::gcpkms::inner::GcpKms;\\n\\n\\n\\npub use self::envelope::EnvelopeEncryption;\\n\\n\\n\\nmod envelope;\\n\\n\\n\\n/// Errors generated by KMS operations\\n\\n#[derive(Debug, PartialEq, Eq, PartialOrd, Hash, Clone)]\\n\\npub enum KmsError {\\n\\n OperationFailed(String),\\n\\n InvalidConfiguration(String),\\n\\n InvalidData(String),\\n\\n InvalidKey(String),\\n\\n}\\n\",\n \"file_path\": \"src/kms/mod.rs\",\n \"rank\": 73,\n \"score\": 18.4565171862957\n },\n {\n \"content\": \"\\n\\nuse data_encoding::{Encoding, HEXLOWER_PERMISSIVE};\\n\\nuse ring::rand;\\n\\nuse ring::rand::SecureRandom;\\n\\nuse ring::signature::{self, Ed25519KeyPair, KeyPair};\\n\\n\\n\\nconst HEX: Encoding = HEXLOWER_PERMISSIVE;\\n\\n\\n\\nconst INITIAL_BUF_SIZE: usize = 1024;\\n\\n\\n\\n/// A multi-step (init-update-finish) interface for verifying an Ed25519 signature\\n\\n#[derive(Debug)]\\n\\npub struct Verifier {\\n\\n pubkey: Vec<u8>,\\n\\n buf: Vec<u8>,\\n\\n}\\n\\n\\n\\nimpl Verifier {\\n\\n pub fn new(pubkey: &[u8]) -> Self {\\n\\n Verifier {\\n\",\n \"file_path\": \"src/sign.rs\",\n \"rank\": 74,\n \"score\": 18.34684140210263\n },\n {\n \"content\": \"\\n\\n let expected_sig = hex::decode(\\n\\n \\\"d9868d52c2bebce5f3fa5a79891970f309cb6591e3e1702a70276fa97c24b3a8e58606c38c9758529da50ee31b8219cba45271c689afa60b0ea26c99db19b00c\\\"\\n\\n ).unwrap();\\n\\n\\n\\n let mut s = Signer::from_seed(&seed);\\n\\n s.update(&message);\\n\\n let sig = s.sign();\\n\\n assert_eq!(sig, expected_sig);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn sign_verify_round_trip() {\\n\\n let seed = hex::decode(\\\"334a05b07352a5436e180356da0ae6efa0345ff7fb1572575772e8005ed978e9\\\")\\n\\n .unwrap();\\n\\n\\n\\n let message = \\\"Hello world\\\".as_bytes();\\n\\n\\n\\n let mut signer = Signer::from_seed(&seed);\\n\\n signer.update(&message);\\n\",\n \"file_path\": \"src/sign.rs\",\n \"rank\": 75,\n \"score\": 17.947153566770965\n },\n {\n \"content\": \" extern crate tokio;\\n\\n extern crate yup_oauth2 as oauth2;\\n\\n\\n\\n use std::default::Default;\\n\\n use std::env;\\n\\n use std::path::Path;\\n\\n use std::result::Result;\\n\\n\\n\\n use data_encoding::BASE64;\\n\\n use tokio::runtime::Runtime;\\n\\n\\n\\n use crate::kms::{AD, EncryptedDEK, KmsError, KmsProvider, PlaintextDEK};\\n\\n\\n\\n use self::cloudkms1::api::{DecryptRequest, EncryptRequest};\\n\\n use self::cloudkms1::CloudKMS;\\n\\n use self::hyper::{Body, StatusCode};\\n\\n use self::oauth2::ServiceAccountKey;\\n\\n\\n\\n const GOOGLE_APP_CREDS: &str = &\\\"GOOGLE_APPLICATION_CREDENTIALS\\\";\\n\\n\\n\",\n \"file_path\": \"src/kms/gcpkms.rs\",\n \"rank\": 76,\n \"score\": 17.870414253500776\n },\n {\n \"content\": \" pub fn public_key_bytes(&self) -> &[u8] {\\n\\n self.key_pair.public_key().as_ref()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl fmt::Display for Signer {\\n\\n fn fmt(&self, f: &mut Formatter) -> fmt::Result {\\n\\n write!(f, \\\"{}\\\", HEX.encode(self.public_key_bytes()))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl fmt::Debug for Signer {\\n\\n fn fmt(&self, f: &mut Formatter) -> fmt::Result {\\n\\n write!(\\n\\n f,\\n\\n \\\"Signer({}, {:?})\\\",\\n\\n HEX.encode(self.public_key_bytes()),\\n\\n self.buf\\n\\n )\\n\\n }\\n\",\n \"file_path\": \"src/sign.rs\",\n \"rank\": 77,\n \"score\": 17.680551417190358\n },\n {\n \"content\": \"use std::str::FromStr;\\n\\n\\n\\npub use self::longterm::LongTermKey;\\n\\npub use self::online::OnlineKey;\\n\\n\\n\\nmod longterm;\\n\\nmod online;\\n\\n\\n\\n/// Methods for protecting the server's long-term identity\\n\\n#[derive(Debug, PartialEq, Eq, PartialOrd, Hash, Clone)]\\n\\npub enum KmsProtection {\\n\\n /// No protection, seed is in plaintext\\n\\n Plaintext,\\n\\n\\n\\n /// Envelope encryption of the seed using AWS Key Management Service\\n\\n AwsKmsEnvelope(String),\\n\\n\\n\\n /// Envelope encryption of the seed using Google Cloud Key Management Service\\n\\n GoogleKmsEnvelope(String),\\n\\n}\\n\",\n \"file_path\": \"src/key/mod.rs\",\n \"rank\": 78,\n \"score\": 17.619224713266348\n },\n {\n \"content\": \"\\n\\n /// Returns a slice of the tags in the message\\n\\n pub fn tags(&self) -> &[Tag] {\\n\\n &self.tags\\n\\n }\\n\\n\\n\\n /// Returns a slice of the values in the message\\n\\n pub fn values(&self) -> &[Vec<u8>] {\\n\\n &self.values\\n\\n }\\n\\n\\n\\n /// Converts the message into a `HashMap` mapping each tag to its value\\n\\n pub fn into_hash_map(self) -> HashMap<Tag, Vec<u8>> {\\n\\n self.tags.into_iter().zip(self.values.into_iter()).collect()\\n\\n }\\n\\n\\n\\n /// Encode this message into an on-the-wire representation prefixed with RFC framing.\\n\\n pub fn encode_framed(&self) -> Result<Vec<u8>, Error> {\\n\\n let encoded = self.encode()?;\\n\\n let mut frame = Vec::with_capacity(RFC_REQUEST_FRAME_BYTES.len() + 4 + encoded.len());\\n\",\n \"file_path\": \"src/message.rs\",\n \"rank\": 79,\n \"score\": 17.614830271856157\n },\n {\n \"content\": \" use std::io::{Cursor, Read};\\n\\n\\n\\n use byteorder::{LittleEndian, ReadBytesExt};\\n\\n\\n\\n use crate::message::*;\\n\\n use crate::tag::Tag;\\n\\n\\n\\n #[test]\\n\\n fn empty_message_size() {\\n\\n let msg = RtMessage::with_capacity(0);\\n\\n\\n\\n assert_eq!(msg.num_fields(), 0);\\n\\n // Empty message is 4 bytes, a single num_tags value\\n\\n assert_eq!(msg.encoded_size(), 4);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn single_field_message_size() {\\n\\n let mut msg = RtMessage::with_capacity(1);\\n\\n msg.add_field(Tag::NONC, \\\"1234\\\".as_bytes()).unwrap();\\n\",\n \"file_path\": \"src/message.rs\",\n \"rank\": 80,\n \"score\": 17.566203998567065\n },\n {\n \"content\": \" use crate::kms::{KmsError, KmsProvider};\\n\\n use crate::kms::envelope::{DEK_LEN_FIELD, MIN_PAYLOAD_SIZE, NONCE_LEN_FIELD};\\n\\n use crate::kms::EnvelopeEncryption;\\n\\n\\n\\n struct MockKmsProvider {}\\n\\n\\n\\n // Mock provider that returns a copy of the input\\n\\n impl KmsProvider for MockKmsProvider {\\n\\n fn encrypt_dek(&self, plaintext_dek: &Vec<u8>) -> Result<Vec<u8>, KmsError> {\\n\\n Ok(plaintext_dek.to_vec())\\n\\n }\\n\\n\\n\\n fn decrypt_dek(&self, encrypted_dek: &Vec<u8>) -> Result<Vec<u8>, KmsError> {\\n\\n Ok(encrypted_dek.to_vec())\\n\\n }\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn decryption_reject_input_too_short() {\\n\\n let ciphertext_blob = \\\"1234567890\\\";\\n\",\n \"file_path\": \"src/kms/envelope.rs\",\n \"rank\": 81,\n \"score\": 17.523290792840143\n },\n {\n \"content\": \" Classic,\\n\\n\\n\\n /// IETF standardized version\\n\\n Rfc,\\n\\n}\\n\\n\\n\\n// RFC version 1\\n\\nconst VERSION_1: &'static [u8] = &[0x01, 0x00, 0x00, 0x00];\\n\\n\\n\\nimpl Version {\\n\\n /// On-the-wire representation of the version value\\n\\n pub fn wire_bytes(self) -> &'static [u8] {\\n\\n match self {\\n\\n Version::Classic => unreachable!(\\\"invalid, no version bytes for Classic\\\"),\\n\\n Version::Rfc => VERSION_1,\\n\\n }\\n\\n }\\n\\n\\n\\n /// A short (non-canonical) string representation of the `Version`\\n\\n pub fn to_string(&self) -> String {\\n\",\n \"file_path\": \"src/version.rs\",\n \"rank\": 82,\n \"score\": 17.345976126192177\n },\n {\n \"content\": \" #[test]\\n\\n fn sign_ed25519_empty_message() {\\n\\n let seed = hex::decode(\\\"9d61b19deffd5a60ba844af492ec2cc44449c5697b326919703bac031cae7f60\\\")\\n\\n .unwrap();\\n\\n\\n\\n let expected_sig = hex::decode(\\n\\n \\\"e5564300c360ac729086e2cc806e828a84877f1eb8e5d974d873e065224901555fb8821590a33bacc61e39701cf9b46bd25bf5f0595bbe24655141438e7a100b\\\"\\n\\n ).unwrap();\\n\\n\\n\\n let mut s = Signer::from_seed(&seed);\\n\\n let sig = s.sign();\\n\\n assert_eq!(sig, expected_sig);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn sign_ed25519_message() {\\n\\n let seed = hex::decode(\\\"0d4a05b07352a5436e180356da0ae6efa0345ff7fb1572575772e8005ed978e9\\\")\\n\\n .unwrap();\\n\\n\\n\\n let message = hex::decode(\\\"cbc77b\\\").unwrap();\\n\",\n \"file_path\": \"src/sign.rs\",\n \"rank\": 83,\n \"score\": 17.315637332203245\n },\n {\n \"content\": \" \\\"plaintext seed value must be 32 characters long, found {}\\\",\\n\\n cfg.seed().len()\\n\\n );\\n\\n is_valid = false;\\n\\n } else if *cfg.kms_protection() != KmsProtection::Plaintext\\n\\n && cfg.seed().len() <= SEED_LENGTH as usize\\n\\n {\\n\\n error!(\\\"KMS use enabled but seed value is too short to be an encrypted blob\\\");\\n\\n is_valid = false;\\n\\n }\\n\\n\\n\\n if cfg.batch_size() < 1 || cfg.batch_size() > 64 {\\n\\n error!(\\n\\n \\\"batch_size {} is invalid; valid range 1-64\\\",\\n\\n cfg.batch_size()\\n\\n );\\n\\n is_valid = false;\\n\\n }\\n\\n\\n\\n if cfg.fault_percentage() > 50 {\\n\",\n \"file_path\": \"src/config/mod.rs\",\n \"rank\": 84,\n \"score\": 17.30678753873255\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\npub enum Error {\\n\\n /// The associated tag was added to an `RtMessage` in non-increasing order.\\n\\n TagNotStrictlyIncreasing(Tag),\\n\\n\\n\\n /// The associated byte sequence does not correspond to a valid Roughtime tag.\\n\\n InvalidTag(Box<[u8]>),\\n\\n\\n\\n /// Invalid number of tags specified\\n\\n InvalidNumTags(u32),\\n\\n\\n\\n /// Tag value length exceeds length of source bytes\\n\\n InvalidValueLength(Tag, u32),\\n\\n\\n\\n /// Encoding failed. The associated `std::io::Error` should provide more information.\\n\\n EncodingFailure(std::io::Error),\\n\\n\\n\\n /// Request was less than 1024 bytes\\n\\n RequestTooShort,\\n\\n\\n\",\n \"file_path\": \"src/error.rs\",\n \"rank\": 85,\n \"score\": 16.525515841522164\n },\n {\n \"content\": \" let val =\\n\\n value.as_str().unwrap().parse().unwrap_or_else(|_| {\\n\\n panic!(\\\"invalid kms_protection value: {:?}\\\", value)\\n\\n });\\n\\n config.kms_protection = val\\n\\n }\\n\\n \\\"health_check_port\\\" => {\\n\\n let val = value.as_i64().unwrap() as u16;\\n\\n config.health_check_port = Some(val);\\n\\n }\\n\\n \\\"client_stats\\\" => {\\n\\n let val = value.as_str().unwrap().to_ascii_lowercase();\\n\\n config.client_stats = val == \\\"yes\\\" || val == \\\"on\\\";\\n\\n }\\n\\n \\\"fault_percentage\\\" => {\\n\\n let val = value.as_i64().unwrap() as u8;\\n\\n config.fault_percentage = val;\\n\\n }\\n\\n unknown => {\\n\\n return Err(Error::InvalidConfiguration(format!(\\n\",\n \"file_path\": \"src/config/file.rs\",\n \"rank\": 86,\n \"score\": 16.48155911299641\n },\n {\n \"content\": \"}\\n\\n\\n\\n#[rustfmt::skip] // rustfmt errors on the long signature strings\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\\n fn verify_ed25519_sig_on_empty_message() {\\n\\n let pubkey = hex::decode(\\n\\n \\\"d75a980182b10ab7d54bfed3c964073a0ee172f3daa62325af021a68f707511a\\\",\\n\\n ).unwrap();\\n\\n\\n\\n let signature = hex::decode(\\n\\n \\\"e5564300c360ac729086e2cc806e828a84877f1eb8e5d974d873e065224901555fb8821590a33bacc61e39701cf9b46bd25bf5f0595bbe24655141438e7a100b\\\"\\n\\n ).unwrap();\\n\\n\\n\\n let v = Verifier::new(&pubkey);\\n\\n let result = v.verify(&signature);\\n\\n assert_eq!(result, true);\\n\",\n \"file_path\": \"src/sign.rs\",\n \"rank\": 87,\n \"score\": 16.456218234569725\n },\n {\n \"content\": \"/// A multi-step (init-update-finish) interface for creating an Ed25519 signature\\n\\npub struct Signer {\\n\\n key_pair: Ed25519KeyPair,\\n\\n buf: Vec<u8>,\\n\\n}\\n\\n\\n\\nimpl Default for Signer {\\n\\n fn default() -> Self {\\n\\n Self::new()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Signer {\\n\\n pub fn new() -> Self {\\n\\n let rng = rand::SystemRandom::new();\\n\\n let mut seed = [0u8; 32];\\n\\n rng.fill(&mut seed).unwrap();\\n\\n\\n\\n Signer::from_seed(&seed)\\n\\n }\\n\",\n \"file_path\": \"src/sign.rs\",\n \"rank\": 88,\n \"score\": 16.390687017295658\n },\n {\n \"content\": \" result.push_str(&HEX.encode(value));\\n\\n result.push_str(\\\"\\\\n\\\");\\n\\n }\\n\\n }\\n\\n\\n\\n result.push_str(&indent1);\\n\\n result.push_str(\\\"}\\\\n\\\");\\n\\n\\n\\n result\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Display for RtMessage {\\n\\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\\n\\n write!(f, \\\"{}\\\", self.to_string(1))\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\",\n \"file_path\": \"src/message.rs\",\n \"rank\": 89,\n \"score\": 16.23589900337493\n },\n {\n \"content\": \"use crate::kms::{AD, DEK_LEN_BYTES, KmsError, KmsProvider, NONCE_LEN_BYTES, TAG_LEN_BYTES};\\n\\nuse crate::SEED_LENGTH;\\n\\n\\n\\nconst DEK_LEN_FIELD: usize = 2;\\n\\nconst NONCE_LEN_FIELD: usize = 2;\\n\\n\\n\\n// 2 bytes - encrypted DEK length\\n\\n// 2 bytes - nonce length\\n\\n// n bytes - encrypted DEK\\n\\n// n bytes - nonce\\n\\n// n bytes - opaque (AEAD encrypted seed + tag)\\n\\nconst MIN_PAYLOAD_SIZE: usize = DEK_LEN_FIELD\\n\\n + NONCE_LEN_FIELD\\n\\n + DEK_LEN_BYTES\\n\\n + NONCE_LEN_BYTES\\n\\n + SEED_LENGTH as usize\\n\\n + TAG_LEN_BYTES;\\n\\n\\n\\n// Convenience function to create zero-filled Vec of given size\\n\",\n \"file_path\": \"src/kms/envelope.rs\",\n \"rank\": 90,\n \"score\": 15.942970797289878\n },\n {\n \"content\": \"use crate::message::RtMessage;\\n\\nuse crate::sign::Signer;\\n\\nuse crate::SIGNED_RESPONSE_CONTEXT;\\n\\nuse crate::tag::Tag;\\n\\n\\n\\n///\\n\\n/// Represents the delegated Roughtime ephemeral online key.\\n\\n///\\n\\npub struct OnlineKey {\\n\\n signer: Signer,\\n\\n}\\n\\n\\n\\nimpl Default for OnlineKey {\\n\\n fn default() -> Self {\\n\\n Self::new()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl OnlineKey {\\n\\n pub fn new() -> Self {\\n\",\n \"file_path\": \"src/key/online.rs\",\n \"rank\": 91,\n \"score\": 15.405958318771885\n },\n {\n \"content\": \" let mut ciphertext_copy = ciphertext.clone();\\n\\n // flip some bits\\n\\n ciphertext_copy[i] = ciphertext[i].wrapping_add(1);\\n\\n\\n\\n let dec_result = EnvelopeEncryption::decrypt_seed(&kms, &ciphertext_copy);\\n\\n\\n\\n match dec_result.expect_err(\\\"Expected a KmsError error here\\\") {\\n\\n KmsError::OperationFailed(msg) => assert!(msg.contains(\\\"failed to decrypt\\\")),\\n\\n e => panic!(\\\"unexpected result {:?}\\\", e),\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/kms/envelope.rs\",\n \"rank\": 92,\n \"score\": 15.331490169242826\n },\n {\n \"content\": \"\\n\\n /// Returns the length in bytes of this message's on-the-wire representation.\\n\\n pub fn encoded_size(&self) -> usize {\\n\\n let num_tags = self.tags.len();\\n\\n let tags_size = 4 * num_tags;\\n\\n let offsets_size = if num_tags < 2 { 0 } else { 4 * (num_tags - 1) };\\n\\n let values_size: usize = self.values.iter().map(|v| v.len()).sum();\\n\\n\\n\\n 4 + tags_size + offsets_size + values_size\\n\\n }\\n\\n\\n\\n /// Calculate the length of PAD value such that the final encoded size of this message\\n\\n /// will be at least 1KB.\\n\\n pub fn calculate_padding_length(&mut self) -> usize {\\n\\n let size = self.encoded_size();\\n\\n if size >= 1024 {\\n\\n return 0;\\n\\n }\\n\\n\\n\\n let mut padding_needed = 1024 - size;\\n\",\n \"file_path\": \"src/message.rs\",\n \"rank\": 93,\n \"score\": 15.302632022470409\n },\n {\n \"content\": \"//! system (KMS). The resulting opaque encrypted \\\"blob\\\" (encrypted seed + encrypted DEK) is\\n\\n//! stored in the Roughenough configuration.\\n\\n//!\\n\\n//! At server start-up the KMS is used to decrypt the DEK, which is then used to (in memory)\\n\\n//! decrypt the seed. The seed is used to generate the\\n\\n//! [delegated on-line key](../key/struct.OnlineKey.html) after which the seed and DEK are erased\\n\\n//! from memory.\\n\\n//!\\n\\n//! See\\n\\n//! * [`EnvelopeEncryption`](struct.EnvelopeEncryption.html) for Roughenough's implementation.\\n\\n//! * [Google](https://cloud.google.com/kms/docs/envelope-encryption) or\\n\\n//! [Amazon](https://docs.aws.amazon.com/kms/latest/developerguide/concepts.html#enveloping)\\n\\n//! for more in-depth explanations of envelope encryption.\\n\\n//!\\n\\n\\n\\nuse std;\\n\\n\\n\\nuse data_encoding;\\n\\nuse ring;\\n\\n\\n\",\n \"file_path\": \"src/kms/mod.rs\",\n \"rank\": 94,\n \"score\": 15.132062391034816\n },\n {\n \"content\": \"//!\\n\\n\\n\\nuse rand::{FromEntropy, Rng};\\n\\nuse rand::distributions::Bernoulli;\\n\\nuse rand::rngs::SmallRng;\\n\\nuse rand::seq::index::sample as index_sample;\\n\\nuse rand::seq::SliceRandom;\\n\\n\\n\\nuse crate::grease::Pathologies::*;\\n\\nuse crate::RtMessage;\\n\\nuse crate::SIGNATURE_LENGTH;\\n\\nuse crate::tag::Tag;\\n\\n\\n\\n///\\n\\n/// Ways that a message can be made invalid.\\n\\n///\\n\\npub enum Pathologies {\\n\\n /// Randomly re-order the (tag, value) pairs in the message. This violates the protocol's\\n\\n /// requirement that tags must be in strictly increasing order.\\n\\n RandomlyOrderTags,\\n\",\n \"file_path\": \"src/grease.rs\",\n \"rank\": 95,\n \"score\": 15.095921039725532\n },\n {\n \"content\": \" assert_ne!(plaintext, ciphertext);\\n\\n\\n\\n let dec_result = EnvelopeEncryption::decrypt_seed(&kms, &ciphertext);\\n\\n assert_eq!(dec_result.is_ok(), true);\\n\\n\\n\\n let new_plaintext = dec_result.unwrap();\\n\\n assert_eq!(plaintext, new_plaintext);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn invalid_dek_length_detected() {\\n\\n let kms = MockKmsProvider {};\\n\\n let plaintext = Vec::from(\\\"This is the plaintext used for this test 2\\\");\\n\\n\\n\\n let enc_result = EnvelopeEncryption::encrypt_seed(&kms, &plaintext);\\n\\n assert_eq!(enc_result.is_ok(), true);\\n\\n\\n\\n let ciphertext = enc_result.unwrap();\\n\\n let mut ciphertext_copy = ciphertext.clone();\\n\\n\\n\",\n \"file_path\": \"src/kms/envelope.rs\",\n \"rank\": 96,\n \"score\": 15.03936637009204\n },\n {\n \"content\": \" pub fn encrypt_seed(kms: &dyn KmsProvider, plaintext_seed: &[u8]) -> Result<Vec<u8>, KmsError> {\\n\\n // Generate random DEK and nonce\\n\\n let rng = SystemRandom::new();\\n\\n let mut raw_dek = [0u8; DEK_LEN_BYTES];\\n\\n let mut raw_nonce = [0u8; NONCE_LEN_BYTES];\\n\\n rng.fill(&mut raw_dek)?;\\n\\n rng.fill(&mut raw_nonce)?;\\n\\n\\n\\n // Ring will overwrite plaintext with ciphertext+tag in this buffer\\n\\n let mut buf = plaintext_seed.to_vec();\\n\\n\\n\\n // Encrypt the plaintext seed (in buf) using the DEK\\n\\n let nonce = Nonce::assume_unique_for_key(raw_nonce);\\n\\n let unbound_dek = UnboundKey::new(&AES_256_GCM, &raw_dek)?;\\n\\n let dek_seal_key = LessSafeKey::new(unbound_dek);\\n\\n\\n\\n // Output overwrites context of 'buf' and appends auth tag to 'buf'\\n\\n if let Err(_) = dek_seal_key.seal_in_place_append_tag(nonce, Aad::from(AD), &mut buf) {\\n\\n return Err(KmsError::OperationFailed(\\n\\n \\\"failed to encrypt plaintext seed\\\".to_string(),\\n\",\n \"file_path\": \"src/kms/envelope.rs\",\n \"rank\": 97,\n \"score\": 15.017686984316757\n },\n {\n \"content\": \" fn handle_health_check(&mut self) {\\n\\n let listener = self.health_listener.as_ref().unwrap();\\n\\n match listener.accept() {\\n\\n Ok((ref mut stream, src_addr)) => {\\n\\n info!(\\\"health check from {}\\\", src_addr);\\n\\n self.stats.add_health_check(&src_addr.ip());\\n\\n\\n\\n match stream.write(HTTP_RESPONSE.as_bytes()) {\\n\\n Ok(_) => (),\\n\\n Err(e) => warn!(\\\"error writing health check {}\\\", e),\\n\\n };\\n\\n\\n\\n match stream.shutdown(Shutdown::Both) {\\n\\n Ok(_) => (),\\n\\n Err(e) => warn!(\\\"error in health check socket shutdown {}\\\", e),\\n\\n }\\n\\n }\\n\\n Err(ref e) if e.kind() == ErrorKind::WouldBlock => {\\n\\n debug!(\\\"blocking in TCP health check\\\");\\n\\n }\\n\",\n \"file_path\": \"src/server.rs\",\n \"rank\": 98,\n \"score\": 15.000561066992105\n },\n {\n \"content\": \"\\n\\n /// Request did not provide versions compatible with this implementation\\n\\n NoCompatibleVersion,\\n\\n}\\n\\n\\n\\nimpl From<std::io::Error> for Error {\\n\\n fn from(err: std::io::Error) -> Self {\\n\\n Error::EncodingFailure(err)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<KmsError> for Error {\\n\\n fn from(err: KmsError) -> Self {\\n\\n match err {\\n\\n KmsError::OperationFailed(m) => {\\n\\n Error::InvalidConfiguration(format!(\\\"KMS operation failed: {}\\\", m))\\n\\n }\\n\\n KmsError::InvalidConfiguration(m) => {\\n\\n Error::InvalidConfiguration(format!(\\\"invalid KMS config: {}\\\", m))\\n\\n }\\n\",\n \"file_path\": \"src/error.rs\",\n \"rank\": 99,\n \"score\": 14.998406067825659\n }\n]","isConversational":false}}},{"rowIdx":1384,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/read/elf/hash.rs"},"repo_name":{"kind":"string","value":"sunfishcode/object"},"commit":{"kind":"string","value":"aaf312e51fc6e4511e19a32c05d4b2ddf248b5b6"},"file_code":{"kind":"string","value":"use core::mem;\n\nuse crate::elf;\nuse crate::read::{ReadError, ReadRef, Result};\nuse crate::{U32, U64};\n\nuse super::{FileHeader, Sym, SymbolTable, Version, VersionTable};\n\n#[derive(Debug)]\npub struct HashTable<'data, Elf: FileHeader> {\n buckets: &'data [U32<Elf::Endian>],\n chains: &'data [U32<Elf::Endian>],\n}\n\nimpl<'data, Elf: FileHeader> HashTable<'data, Elf> {\n \n \n \n \n \n \n pub fn parse(endian: Elf::Endian, data: &'data [u8]) -> Result<Self> {\n let mut offset = 0;\n let header = data\n .read::<elf::HashHeader<Elf::Endian>>(&mut offset)\n .read_error(\"Invalid hash header\")?;\n let buckets = data\n .read_slice(&mut offset, header.bucket_count.get(endian) as usize)\n .read_error(\"Invalid hash buckets\")?;\n let chains = data\n .read_slice(&mut offset, header.chain_count.get(endian) as usize)\n .read_error(\"Invalid hash chains\")?;\n Ok(HashTable { buckets, chains })\n }\n\n \n pub fn symbol_table_length(&self) -> u32 {\n self.chains.len() as u32\n }\n\n \n pub fn find<R: ReadRef<'data>>(\n &self,\n endian: Elf::Endian,\n name: &[u8],\n hash: u32,\n version: Option<&Version>,\n symbols: &SymbolTable<'data, Elf, R>,\n versions: &VersionTable<'data, Elf>,\n ) -> Option<(usize, &'data Elf::Sym)> {\n \n let mut index = self.buckets[(hash as usize) % self.buckets.len()].get(endian) as usize;\n \n let mut i = 0;\n let strings = symbols.strings();\n while index != 0 && i < self.chains.len() {\n if let Ok(symbol) = symbols.symbol(index) {\n if symbol.name(endian, strings) == Ok(name)\n && versions.matches(endian, index, version)\n {\n return Some((index, symbol));\n }\n }\n index = self.chains.get(index)?.get(endian) as usize;\n i += 1;\n }\n None\n }\n}\n\n#[derive(Debug)]\npub struct GnuHashTable<'data, Elf: FileHeader> {\n symbol_base: u32,\n bloom_shift: u32,\n bloom_filters: &'data [u8],\n buckets: &'data [U32<Elf::Endian>],\n values: &'data [U32<Elf::Endian>],\n}\n\nimpl<'data, Elf: FileHeader> GnuHashTable<'data, Elf> {\n \n \n \n \n \n \n \n \n \n \n \n pub fn parse(endian: Elf::Endian, data: &'data [u8]) -> Result<Self> {\n let mut offset = 0;\n let header = data\n .read::<elf::GnuHashHeader<Elf::Endian>>(&mut offset)\n .read_error(\"Invalid GNU hash header\")?;\n let bloom_len =\n u64::from(header.bloom_count.get(endian)) * mem::size_of::<Elf::Word>() as u64;\n let bloom_filters = data\n .read_bytes(&mut offset, bloom_len)\n .read_error(\"Invalid GNU hash bloom filters\")?;\n let buckets = data\n .read_slice(&mut offset, header.bucket_count.get(endian) as usize)\n .read_error(\"Invalid GNU hash buckets\")?;\n let chain_count = (data.len() - offset as usize) / 4;\n let values = data\n .read_slice(&mut offset, chain_count)\n .read_error(\"Invalid GNU hash values\")?;\n Ok(GnuHashTable {\n symbol_base: header.symbol_base.get(endian),\n bloom_shift: header.bloom_shift.get(endian),\n bloom_filters,\n buckets,\n values,\n })\n }\n\n \n pub fn symbol_base(&self) -> u32 {\n self.symbol_base\n }\n\n \n \n \n pub fn symbol_table_length(&self, endian: Elf::Endian) -> Option<u32> {\n \n if self.symbol_base == 0 {\n return None;\n }\n\n \n let mut max_symbol = 0;\n for bucket in self.buckets {\n let bucket = bucket.get(endian);\n if max_symbol < bucket {\n max_symbol = bucket;\n }\n }\n\n \n for value in self\n .values\n .get(max_symbol.checked_sub(self.symbol_base)? as usize..)?\n {\n max_symbol += 1;\n if value.get(endian) & 1 != 0 {\n return Some(max_symbol);\n }\n }\n\n None\n }\n\n \n pub fn find<R: ReadRef<'data>>(\n &self,\n endian: Elf::Endian,\n name: &[u8],\n hash: u32,\n version: Option<&Version>,\n symbols: &SymbolTable<'data, Elf, R>,\n versions: &VersionTable<'data, Elf>,\n ) -> Option<(usize, &'data Elf::Sym)> {\n let word_bits = mem::size_of::<Elf::Word>() as u32 * 8;\n\n \n let bloom_count = self.bloom_filters.len() / mem::size_of::<Elf::Word>();\n let offset =\n ((hash / word_bits) & (bloom_count as u32 - 1)) * mem::size_of::<Elf::Word>() as u32;\n let filter = if word_bits == 64 {\n self.bloom_filters\n .read_at::<U64<Elf::Endian>>(offset.into())\n .ok()?\n .get(endian)\n } else {\n self.bloom_filters\n .read_at::<U32<Elf::Endian>>(offset.into())\n .ok()?\n .get(endian)\n .into()\n };\n if filter & (1 << (hash % word_bits)) == 0 {\n return None;\n }\n if filter & (1 << ((hash >> self.bloom_shift) % word_bits)) == 0 {\n return None;\n }\n\n \n let mut index = self.buckets[(hash as usize) % self.buckets.len()].get(endian) as usize;\n if index == 0 {\n return None;\n }\n\n \n let strings = symbols.strings();\n let symbols = symbols.symbols().get(index..)?;\n let values = self\n .values\n .get(index.checked_sub(self.symbol_base as usize)?..)?;\n for (symbol, value) in symbols.iter().zip(values.iter()) {\n let value = value.get(endian);\n if value | 1 == hash | 1 {\n if symbol.name(endian, strings) == Ok(name)\n && versions.matches(endian, index, version)\n {\n return Some((index, symbol));\n }\n }\n if value & 1 != 0 {\n break;\n }\n index += 1;\n }\n None\n }\n}\n"},"prefix":{"kind":"string","value":"use core::mem;\n\nuse crate::elf;\nuse crate::read::{ReadError, ReadRef, Result};\nuse crate::{U32, U64};\n\nuse super::{FileHeader, Sym, SymbolTable, Version, VersionTable};\n\n#[derive(Debug)]\npub struct HashTable<'data, Elf: FileHeader> {\n buckets: &'data [U32<Elf::Endian>],\n chains: &'data [U32<Elf::Endian>],\n}\n\nimpl<'data, Elf: FileHeader> HashTable<'data, Elf> {\n \n \n \n \n \n \n pub fn parse(endian: Elf::Endian, data: &'data [u8]) -> Result<Self> {\n let mut offset = 0;\n let header = data\n .read::<elf::HashHeader<Elf::Endian>>(&mut offset)\n .read_error(\"Invalid hash header\")?;\n let buckets = data\n .read_slice(&mut offset, header.bucket_count.get(endian) as usize)\n .read_error(\"Invalid hash buckets\")?;\n let chains = data\n .read_slice(&mut offset, header.chain_count.get(endian) as usize)\n .read_error(\"Invalid hash chains\")?;\n Ok(HashTable { buckets, chains })\n }\n\n \n pub fn symbol_table_length(&self) -> u32 {\n self.chains.len() as u32\n }\n\n \n pub fn find<R: ReadRef<'data>>(\n &self,\n endian: Elf::Endian,\n name: &[u8],\n hash: u32,\n version: Option<&Version>,\n symbols: &SymbolTable<'data, Elf, R>,\n versions: &VersionTable<'data, Elf>,\n ) -> Option<(usize, &'data Elf::Sym)> {\n \n let mut index = self.buckets[(hash as usize) % self.buckets.len()].get(endian) as usize;\n \n let mut i = 0;\n let strings = symbols.strings();\n while index != 0 && i < self.chains.len() {\n if let Ok(symbol) = symbols.symbol(index) {\n if symbol.name(endian, strings) == Ok(name)\n && versions.matches(endian, index, version)\n {\n return Some((index, symbol));\n }\n }\n index = self.chains.get(index)?.get(endian) as usize;\n i += 1;\n }\n None\n }\n}\n\n#[derive(Debug)]\npub struct GnuHashTable<'data, Elf: FileHeader> {\n symbol_base: u32,\n bloom_shift: u32,\n bloom_filters: &'data [u8],\n buckets: &'data [U32<Elf::Endian>],\n values: &'data [U32<Elf::Endian>],\n}\n\nimpl<'data, Elf: FileHeader> GnuHashTable<'data, Elf> {\n \n \n \n \n \n \n \n \n \n \n \n pub fn parse(endian: Elf::Endian, data: &'data [u8]) -> Result<Self> {\n let mut offset = 0;\n let header = data\n .read::<elf::GnuHashHeader<Elf::Endian>>(&mut offset)\n .read_error(\"Invalid GNU hash header\")?;\n let bloom_len =\n u64::from(header.bloom_count.get(endian)) * mem::size_of::<Elf::Word>() as u64;\n let bloom_filters = data\n .read_bytes(&mut offset, bloom_len)\n .read_error(\"Invalid GNU hash bloom filters\")?;\n let buckets = data\n .read_slice(&mut offset, header.bucket_count.get(endian) as usize)\n .read_error(\"Invalid GNU hash buckets\")?;\n let chain_count = (data.len() - offset as usize) / 4;\n let values = data\n .read_slice(&mut offset, chain_count)\n .read_error(\"Invalid GNU hash values\")?;\n Ok(GnuHashTable {\n symbol_base: header.symbol_base.get(endian),\n bloom_shift: header.bloom_shift.get(endian),\n bloom_filters,\n buckets,\n values,\n })\n }\n\n \n pub fn symbol_base(&self) -> u32 {\n self.symbol_base\n }\n\n \n \n \n pub fn symbol_table_length(&self, endian: Elf::Endian) -> Option<u32> {\n \n if self.symbol_base == 0 {\n return None;\n }\n\n \n let mut max_symbol = 0;\n for bucket in self.buckets {\n let bucket = bucket.get(endian);\n if max_symbol <"},"suffix":{"kind":"string","value":"l);\n }\n }\n\n None\n }\n\n \n pub fn find<R: ReadRef<'data>>(\n &self,\n endian: Elf::Endian,\n name: &[u8],\n hash: u32,\n version: Option<&Version>,\n symbols: &SymbolTable<'data, Elf, R>,\n versions: &VersionTable<'data, Elf>,\n ) -> Option<(usize, &'data Elf::Sym)> {\n let word_bits = mem::size_of::<Elf::Word>() as u32 * 8;\n\n \n let bloom_count = self.bloom_filters.len() / mem::size_of::<Elf::Word>();\n let offset =\n ((hash / word_bits) & (bloom_count as u32 - 1)) * mem::size_of::<Elf::Word>() as u32;\n let filter = if word_bits == 64 {\n self.bloom_filters\n .read_at::<U64<Elf::Endian>>(offset.into())\n .ok()?\n .get(endian)\n } else {\n self.bloom_filters\n .read_at::<U32<Elf::Endian>>(offset.into())\n .ok()?\n .get(endian)\n .into()\n };\n if filter & (1 << (hash % word_bits)) == 0 {\n return None;\n }\n if filter & (1 << ((hash >> self.bloom_shift) % word_bits)) == 0 {\n return None;\n }\n\n \n let mut index = self.buckets[(hash as usize) % self.buckets.len()].get(endian) as usize;\n if index == 0 {\n return None;\n }\n\n \n let strings = symbols.strings();\n let symbols = symbols.symbols().get(index..)?;\n let values = self\n .values\n .get(index.checked_sub(self.symbol_base as usize)?..)?;\n for (symbol, value) in symbols.iter().zip(values.iter()) {\n let value = value.get(endian);\n if value | 1 == hash | 1 {\n if symbol.name(endian, strings) == Ok(name)\n && versions.matches(endian, index, version)\n {\n return Some((index, symbol));\n }\n }\n if value & 1 != 0 {\n break;\n }\n index += 1;\n }\n None\n }\n}\n"},"middle":{"kind":"string","value":" bucket {\n max_symbol = bucket;\n }\n }\n\n \n for value in self\n .values\n .get(max_symbol.checked_sub(self.symbol_base)? as usize..)?\n {\n max_symbol += 1;\n if value.get(endian) & 1 != 0 {\n return Some(max_symbo"},"strategy":{"kind":"string","value":"function_block-random_span"},"context_items":{"kind":"list like","value":[{"content":"/// Calculate the GNU hash for a symbol name.\n\n///\n\n/// Used for `SHT_GNU_HASH`.\n\npub fn gnu_hash(name: &[u8]) -> u32 {\n\n let mut hash = 5381u32;\n\n for byte in name {\n\n hash = hash.wrapping_mul(33).wrapping_add(u32::from(*byte));\n\n }\n\n hash\n\n}\n\n\n\n// Motorola 68k specific definitions.\n\n\n\n// m68k values for `Rel*::r_type`.\n\n\n\n/// No reloc\n\npub const R_68K_NONE: u32 = 0;\n\n/// Direct 32 bit\n\npub const R_68K_32: u32 = 1;\n\n/// Direct 16 bit\n\npub const R_68K_16: u32 = 2;\n\n/// Direct 8 bit\n\npub const R_68K_8: u32 = 3;\n","file_path":"src/elf.rs","rank":0,"score":457849.2697326131},{"content":"/// Calculate the SysV hash for a symbol name.\n\n///\n\n/// Used for `SHT_HASH`.\n\npub fn hash(name: &[u8]) -> u32 {\n\n let mut hash = 0u32;\n\n for byte in name {\n\n hash = hash.wrapping_mul(16).wrapping_add(u32::from(*byte));\n\n hash ^= (hash >> 24) & 0xf0;\n\n }\n\n hash & 0xfff_ffff\n\n}\n\n\n\n/// Header of `SHT_GNU_HASH` section.\n\n#[derive(Debug, Clone, Copy)]\n\n#[repr(C)]\n\npub struct GnuHashHeader<E: Endian> {\n\n /// The number of hash buckets.\n\n pub bucket_count: U32<E>,\n\n /// The symbol table index of the first symbol in the hash.\n\n pub symbol_base: U32<E>,\n\n /// The number of words in the bloom filter.\n\n ///\n\n /// Must be a non-zero power of 2.\n","file_path":"src/elf.rs","rank":1,"score":447105.9927822598},{"content":"fn print_elf<Elf: FileHeader<Endian = Endianness>>(p: &mut Printer<'_>, elf: &Elf, data: &[u8]) {\n\n if let Some(endian) = elf.endian().print_err(p) {\n\n print_file_header(p, endian, elf);\n\n if let Some(segments) = elf.program_headers(endian, data).print_err(p) {\n\n print_program_headers(p, endian, data, elf, segments);\n\n }\n\n if let Some(sections) = elf.sections(endian, data).print_err(p) {\n\n print_section_headers(p, endian, data, elf, §ions);\n\n }\n\n }\n\n}\n\n\n","file_path":"crates/examples/src/readobj/elf.rs","rank":2,"score":377068.45356425154},{"content":"#[inline]\n\npub fn from_bytes_mut<T: Pod>(data: &mut [u8]) -> Result<(&mut T, &mut [u8])> {\n\n let size = mem::size_of::<T>();\n\n if size > data.len() {\n\n return Err(());\n\n }\n\n let (data, tail) = data.split_at_mut(size);\n\n let ptr = data.as_mut_ptr();\n\n if (ptr as usize) % mem::align_of::<T>() != 0 {\n\n return Err(());\n\n }\n\n // Safety:\n\n // The alignment and size are checked by this function.\n\n // The Pod trait ensures the type is valid to cast from bytes.\n\n let val = unsafe { &mut *ptr.cast() };\n\n Ok((val, tail))\n\n}\n\n\n\n/// Cast a byte slice to a slice of a `Pod` type.\n\n///\n\n/// Returns the type slice and the tail of the byte slice.\n","file_path":"src/pod.rs","rank":3,"score":369778.0266258335},{"content":"/// Find the optional header and read the `optional_header.magic`.\n\n///\n\n/// It can be useful to know this magic value before trying to\n\n/// fully parse the NT headers.\n\npub fn optional_header_magic<'data, R: ReadRef<'data>>(data: R) -> Result<u16> {\n\n let dos_header = pe::ImageDosHeader::parse(data)?;\n\n // NT headers are at an offset specified in the DOS header.\n\n let offset = dos_header.nt_headers_offset().into();\n\n // It doesn't matter which NT header type is used for the purpose\n\n // of reading the optional header magic.\n\n let nt_headers = data\n\n .read_at::<pe::ImageNtHeaders32>(offset)\n\n .read_error(\"Invalid NT headers offset, size, or alignment\")?;\n\n if nt_headers.signature() != pe::IMAGE_NT_SIGNATURE {\n\n return Err(Error(\"Invalid PE magic\"));\n\n }\n\n Ok(nt_headers.optional_header().magic())\n\n}\n\n\n\n/// A trait for generic access to `ImageNtHeaders32` and `ImageNtHeaders64`.\n","file_path":"src/read/pe/file.rs","rank":4,"score":366984.3382301446},{"content":"fn print_object_at(p: &mut Printer<'_>, data: &[u8], offset: u64) {\n\n let kind = match object::FileKind::parse_at(data, offset) {\n\n Ok(file) => file,\n\n Err(err) => {\n\n println!(\"Failed to parse file: {}\", err);\n\n return;\n\n }\n\n };\n\n match kind {\n\n object::FileKind::MachO32 => macho::print_macho32(p, data, offset),\n\n object::FileKind::MachO64 => macho::print_macho64(p, data, offset),\n\n // TODO\n\n _ => {}\n\n }\n\n}\n\n\n","file_path":"crates/examples/src/readobj/mod.rs","rank":5,"score":337345.104595638},{"content":"fn parse_sysv_extended_name<'data>(digits: &[u8], names: &'data [u8]) -> Result<&'data [u8], ()> {\n\n let offset = parse_u64_digits(digits, 10).ok_or(())?;\n\n let offset = offset.try_into().map_err(|_| ())?;\n\n let name_data = names.get(offset..).ok_or(())?;\n\n let name = match memchr::memchr2(b'/', b'\\0', name_data) {\n\n Some(len) => &name_data[..len],\n\n None => name_data,\n\n };\n\n Ok(name)\n\n}\n\n\n","file_path":"src/read/archive.rs","rank":6,"score":325886.3598654285},{"content":"// Multi-key quicksort.\n\n//\n\n// Ordering is such that if a string is a suffix of at least one other string,\n\n// then it is placed immediately after one of those strings. That is:\n\n// - comparison starts at the end of the string\n\n// - shorter strings come later\n\n//\n\n// Based on the implementation in LLVM.\n\nfn sort(mut ids: &mut [usize], mut pos: usize, strings: &IndexSet<&[u8]>) {\n\n loop {\n\n if ids.len() <= 1 {\n\n return;\n\n }\n\n\n\n let pivot = byte(ids[0], pos, strings);\n\n let mut lower = 0;\n\n let mut upper = ids.len();\n\n let mut i = 1;\n\n while i < upper {\n\n let b = byte(ids[i], pos, strings);\n\n if b > pivot {\n\n ids.swap(lower, i);\n\n lower += 1;\n\n i += 1;\n\n } else if b < pivot {\n\n upper -= 1;\n\n ids.swap(upper, i);\n\n } else {\n","file_path":"src/write/string.rs","rank":7,"score":325411.50905295176},{"content":"#[inline]\n\npub fn slice_from_bytes<T: Pod>(data: &[u8], count: usize) -> Result<(&[T], &[u8])> {\n\n let size = count.checked_mul(mem::size_of::<T>()).ok_or(())?;\n\n let tail = data.get(size..).ok_or(())?;\n\n let ptr = data.as_ptr();\n\n if (ptr as usize) % mem::align_of::<T>() != 0 {\n\n return Err(());\n\n }\n\n // Safety:\n\n // The alignment and size are checked by this function.\n\n // The Pod trait ensures the type is valid to cast from bytes.\n\n let slice = unsafe { slice::from_raw_parts(ptr.cast(), count) };\n\n Ok((slice, tail))\n\n}\n\n\n\n/// Cast a mutable byte slice to a slice of a `Pod` type.\n\n///\n\n/// Returns the type slice and the tail of the byte slice.\n","file_path":"src/pod.rs","rank":8,"score":325259.0808606861},{"content":"#[inline]\n\npub fn from_bytes<T: Pod>(data: &[u8]) -> Result<(&T, &[u8])> {\n\n let size = mem::size_of::<T>();\n\n let tail = data.get(size..).ok_or(())?;\n\n let ptr = data.as_ptr();\n\n if (ptr as usize) % mem::align_of::<T>() != 0 {\n\n return Err(());\n\n }\n\n // Safety:\n\n // The alignment and size are checked by this function.\n\n // The Pod trait ensures the type is valid to cast from bytes.\n\n let val = unsafe { &*ptr.cast() };\n\n Ok((val, tail))\n\n}\n\n\n\n/// Cast a mutable byte slice to a `Pod` type.\n\n///\n\n/// Returns the type and the tail of the slice.\n","file_path":"src/pod.rs","rank":9,"score":310754.0350728393},{"content":"fn print_file_header<Elf: FileHeader>(p: &mut Printer<'_>, endian: Elf::Endian, elf: &Elf) {\n\n p.group(\"FileHeader\", |p| {\n\n p.group(\"Ident\", |p| print_ident(p, elf.e_ident()));\n\n p.field_enum(\"Type\", elf.e_type(endian), &FLAGS_ET);\n\n p.field_enum(\"Machine\", elf.e_machine(endian), &FLAGS_EM);\n\n let version = elf.e_version(endian);\n\n if version < 256 {\n\n p.field_enum(\"Version\", version as u8, &FLAGS_EV);\n\n } else {\n\n p.field_hex(\"Version\", version);\n\n }\n\n p.field_enum(\"Type\", elf.e_type(endian), &FLAGS_ET);\n\n p.field_hex(\"Entry\", elf.e_entry(endian).into());\n\n p.field_hex(\"ProgramHeaderOffset\", elf.e_phoff(endian).into());\n\n p.field_hex(\"SectionHeaderOffset\", elf.e_shoff(endian).into());\n\n let flags = elf.e_flags(endian);\n\n p.field_hex(\"Flags\", flags);\n\n match elf.e_machine(endian) {\n\n EM_SPARC => p.flags(flags, 0, &FLAGS_EF_SPARC),\n\n EM_SPARCV9 => p.flags(flags, 0, &FLAGS_EF_SPARCV9),\n","file_path":"crates/examples/src/readobj/elf.rs","rank":10,"score":307416.4899311814},{"content":"fn find_member(member_names: &mut [(String, bool)], name: &[u8]) -> bool {\n\n if member_names.is_empty() {\n\n return true;\n\n }\n\n match member_names.iter().position(|x| x.0.as_bytes() == name) {\n\n Some(i) => {\n\n member_names[i].1 = true;\n\n true\n\n }\n\n None => false,\n\n }\n\n}\n\n\n","file_path":"crates/examples/src/objdump.rs","rank":11,"score":294925.17773745663},{"content":"fn rel_flag_type<Elf: FileHeader>(endian: Elf::Endian, elf: &Elf) -> &'static [Flag<u32>] {\n\n match elf.e_machine(endian) {\n\n EM_68K => FLAGS_R_68K,\n\n EM_386 => FLAGS_R_386,\n\n EM_SPARC => FLAGS_R_SPARC,\n\n EM_MIPS => FLAGS_R_MIPS,\n\n EM_PARISC => FLAGS_R_PARISC,\n\n EM_ALPHA => FLAGS_R_ALPHA,\n\n EM_PPC => FLAGS_R_PPC,\n\n EM_PPC64 => FLAGS_R_PPC64,\n\n EM_AARCH64 => FLAGS_R_AARCH64,\n\n EM_ARM => FLAGS_R_ARM,\n\n EM_CSKY => FLAGS_R_CKCORE,\n\n EM_IA_64 => FLAGS_R_IA64,\n\n EM_SH => FLAGS_R_SH,\n\n EM_S390 => FLAGS_R_390,\n\n EM_CRIS => FLAGS_R_CRIS,\n\n EM_X86_64 => FLAGS_R_X86_64,\n\n EM_MN10300 => FLAGS_R_MN10300,\n\n EM_M32R => FLAGS_R_M32R,\n","file_path":"crates/examples/src/readobj/elf.rs","rank":12,"score":294589.64894909906},{"content":"fn print_rel_symbol<'data, Elf: FileHeader>(\n\n p: &mut Printer<'_>,\n\n endian: Elf::Endian,\n\n symbols: Option<SymbolTable<'data, Elf>>,\n\n sym: u32,\n\n) {\n\n let name = symbols.and_then(|symbols| {\n\n symbols\n\n .symbol(sym as usize)\n\n .and_then(|symbol| symbol.name(endian, symbols.strings()))\n\n .print_err(p)\n\n });\n\n p.field_string_option(\"Symbol\", sym, name);\n\n}\n\n\n","file_path":"crates/examples/src/readobj/elf.rs","rank":13,"score":276827.9655994783},{"content":"// JamCRC\n\nfn checksum(data: &[u8]) -> u32 {\n\n let mut hasher = crc32fast::Hasher::new_with_initial(0xffff_ffff);\n\n hasher.update(data);\n\n !hasher.finalize()\n\n}\n","file_path":"src/write/coff.rs","rank":14,"score":276009.2438576237},{"content":"fn byte(id: usize, pos: usize, strings: &IndexSet<&[u8]>) -> u8 {\n\n let string = strings.get_index(id).unwrap();\n\n let len = string.len();\n\n if len >= pos {\n\n string[len - pos]\n\n } else {\n\n // We know the strings don't contain null bytes.\n\n 0\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n\n\n #[test]\n\n fn string_table() {\n\n let mut table = StringTable::default();\n\n let id0 = table.add(b\"\");\n\n let id1 = table.add(b\"foo\");\n","file_path":"src/write/string.rs","rank":15,"score":272267.34486359457},{"content":"/// Modifies `data` to start after the extended name.\n\nfn parse_bsd_extended_name<'data, R: ReadRef<'data>>(\n\n digits: &[u8],\n\n data: R,\n\n offset: &mut u64,\n\n size: &mut u64,\n\n) -> Result<&'data [u8], ()> {\n\n let len = parse_u64_digits(digits, 10).ok_or(())?;\n\n *size = size.checked_sub(len).ok_or(())?;\n\n let name_data = data.read_bytes(offset, len)?;\n\n let name = match memchr::memchr(b'\\0', name_data) {\n\n Some(len) => &name_data[..len],\n\n None => name_data,\n\n };\n\n Ok(name)\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n\n","file_path":"src/read/archive.rs","rank":16,"score":269351.76576054026},{"content":"fn dump_object<W: Write, E: Write>(w: &mut W, e: &mut E, data: &[u8]) -> Result<()> {\n\n match object::File::parse(data) {\n\n Ok(file) => {\n\n dump_parsed_object(w, e, &file)?;\n\n }\n\n Err(err) => {\n\n writeln!(e, \"Failed to parse file: {}\", err)?;\n\n }\n\n }\n\n Ok(())\n\n}\n\n\n","file_path":"crates/examples/src/objdump.rs","rank":17,"score":265849.2867492222},{"content":"fn print_gnu_hash<Elf: FileHeader>(\n\n p: &mut Printer<'_>,\n\n endian: Elf::Endian,\n\n data: &[u8],\n\n _elf: &Elf,\n\n _sections: &SectionTable<Elf>,\n\n section: &Elf::SectionHeader,\n\n) {\n\n if let Some(Some(hash)) = section.gnu_hash_header(endian, data).print_err(p) {\n\n p.group(\"GnuHash\", |p| {\n\n p.field(\"BucketCount\", hash.bucket_count.get(endian));\n\n p.field(\"SymbolBase\", hash.symbol_base.get(endian));\n\n p.field(\"BloomCount\", hash.bloom_count.get(endian));\n\n p.field(\"BloomShift\", hash.bloom_shift.get(endian));\n\n });\n\n }\n\n /* TODO: add this in a test somewhere\n\n if let Ok(Some((hash_table, link))) = section.gnu_hash(endian, data) {\n\n if let Ok(symbols) = _sections.symbol_table_by_index(endian, data, link) {\n\n if let Ok(versions) = _sections.versions(endian, data) {\n","file_path":"crates/examples/src/readobj/elf.rs","rank":18,"score":260633.967568488},{"content":"#[inline]\n\npub fn bytes_of_mut<T: Pod>(val: &mut T) -> &mut [u8] {\n\n let size = mem::size_of::<T>();\n\n // Safety:\n\n // Any alignment is allowed.\n\n // The size is determined in this function.\n\n // The Pod trait ensures the type is valid to cast to bytes.\n\n unsafe { slice::from_raw_parts_mut(slice::from_mut(val).as_mut_ptr().cast(), size) }\n\n}\n\n\n\n/// Cast a slice of a `Pod` type to a byte slice.\n","file_path":"src/pod.rs","rank":19,"score":255103.8613870678},{"content":"fn print_pe<Pe: ImageNtHeaders>(p: &mut Printer<'_>, data: &[u8]) {\n\n if let Some(dos_header) = ImageDosHeader::parse(data).print_err(p) {\n\n p.group(\"ImageDosHeader\", |p| {\n\n p.field_hex(\"Magic\", dos_header.e_magic.get(LE));\n\n p.field_hex(\"CountBytesLastPage\", dos_header.e_cblp.get(LE));\n\n p.field_hex(\"CountPages\", dos_header.e_cp.get(LE));\n\n p.field_hex(\"CountRelocations\", dos_header.e_crlc.get(LE));\n\n p.field_hex(\"CountHeaderParagraphs\", dos_header.e_cparhdr.get(LE));\n\n p.field_hex(\"MinAllocParagraphs\", dos_header.e_minalloc.get(LE));\n\n p.field_hex(\"MaxAllocParagraphs\", dos_header.e_maxalloc.get(LE));\n\n p.field_hex(\"StackSegment\", dos_header.e_ss.get(LE));\n\n p.field_hex(\"StackPointer\", dos_header.e_sp.get(LE));\n\n p.field_hex(\"Checksum\", dos_header.e_csum.get(LE));\n\n p.field_hex(\"InstructionPointer\", dos_header.e_ip.get(LE));\n\n p.field_hex(\"CodeSegment\", dos_header.e_cs.get(LE));\n\n p.field_hex(\"AddressOfRelocations\", dos_header.e_lfarlc.get(LE));\n\n p.field_hex(\"OverlayNumber\", dos_header.e_ovno.get(LE));\n\n p.field_hex(\"OemId\", dos_header.e_oemid.get(LE));\n\n p.field_hex(\"OemInfo\", dos_header.e_oeminfo.get(LE));\n\n p.field_hex(\"AddressOfNewHeader\", dos_header.e_lfanew.get(LE));\n","file_path":"crates/examples/src/readobj/pe.rs","rank":20,"score":252949.6590471919},{"content":"#[inline]\n\npub fn bytes_of_slice_mut<T: Pod>(val: &mut [T]) -> &mut [u8] {\n\n let size = val.len().wrapping_mul(mem::size_of::<T>());\n\n // Safety:\n\n // Any alignment is allowed.\n\n // The size is determined in this function.\n\n // The Pod trait ensures the type is valid to cast to bytes.\n\n unsafe { slice::from_raw_parts_mut(val.as_mut_ptr().cast(), size) }\n\n}\n\n\n\nmacro_rules! unsafe_impl_pod {\n\n ($($struct_name:ident),+ $(,)?) => {\n\n $(\n\n unsafe impl Pod for $struct_name { }\n\n )+\n\n }\n\n}\n\n\n\nunsafe_impl_pod!(u8, u16, u32, u64);\n\n\n\n#[cfg(test)]\n","file_path":"src/pod.rs","rank":21,"score":251646.38411224203},{"content":"// Ignores bytes starting from the first space.\n\nfn parse_u64_digits(digits: &[u8], radix: u32) -> Option<u64> {\n\n if let [b' ', ..] = digits {\n\n return None;\n\n }\n\n let mut result: u64 = 0;\n\n for &c in digits {\n\n if c == b' ' {\n\n return Some(result);\n\n } else {\n\n let x = (c as char).to_digit(radix)?;\n\n result = result\n\n .checked_mul(u64::from(radix))?\n\n .checked_add(u64::from(x))?;\n\n }\n\n }\n\n Some(result)\n\n}\n\n\n","file_path":"src/read/archive.rs","rank":22,"score":249910.74978341634},{"content":"fn print_mach_header<Mach: MachHeader>(p: &mut Printer<'_>, endian: Mach::Endian, header: &Mach) {\n\n p.group(\"MachHeader\", |p| {\n\n p.field_hex(\"Magic\", header.magic().to_be());\n\n print_cputype(p, header.cputype(endian), header.cpusubtype(endian));\n\n p.field_enum(\"FileType\", header.filetype(endian), FLAGS_MH_FILETYPE);\n\n p.field(\"NumberOfCmds\", header.ncmds(endian));\n\n p.field_hex(\"SizeOfCmds\", header.sizeofcmds(endian));\n\n p.field_enum(\"Flags\", header.flags(endian), FLAGS_MH);\n\n });\n\n}\n\n\n","file_path":"crates/examples/src/readobj/macho.rs","rank":23,"score":240041.98551592723},{"content":"fn print_archive(p: &mut Printer<'_>, data: &[u8]) {\n\n if let Some(archive) = ArchiveFile::parse(data).print_err(p) {\n\n p.field(\"Format\", format!(\"Archive ({:?})\", archive.kind()));\n\n for member in archive.members() {\n\n if let Some(member) = member.print_err(p) {\n\n p.blank();\n\n p.field(\"Member\", String::from_utf8_lossy(member.name()));\n\n if let Some(data) = member.data(data).print_err(p) {\n\n print_object(p, data);\n\n }\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"crates/examples/src/readobj/mod.rs","rank":24,"score":239966.57031160692},{"content":"fn print_object(p: &mut Printer<'_>, data: &[u8]) {\n\n let kind = match object::FileKind::parse(data) {\n\n Ok(file) => file,\n\n Err(err) => {\n\n println!(\"Failed to parse file: {}\", err);\n\n return;\n\n }\n\n };\n\n match kind {\n\n object::FileKind::Archive => print_archive(p, data),\n\n object::FileKind::Coff => pe::print_coff(p, data),\n\n object::FileKind::DyldCache => macho::print_dyld_cache(p, data),\n\n object::FileKind::Elf32 => elf::print_elf32(p, data),\n\n object::FileKind::Elf64 => elf::print_elf64(p, data),\n\n object::FileKind::MachO32 => macho::print_macho32(p, data, 0),\n\n object::FileKind::MachO64 => macho::print_macho64(p, data, 0),\n\n object::FileKind::MachOFat32 => macho::print_macho_fat32(p, data),\n\n object::FileKind::MachOFat64 => macho::print_macho_fat64(p, data),\n\n object::FileKind::Pe32 => pe::print_pe32(p, data),\n\n object::FileKind::Pe64 => pe::print_pe64(p, data),\n\n // TODO\n\n _ => {}\n\n }\n\n}\n\n\n","file_path":"crates/examples/src/readobj/mod.rs","rank":25,"score":239966.57031160692},{"content":"fn print_hash<Elf: FileHeader>(\n\n p: &mut Printer<'_>,\n\n endian: Elf::Endian,\n\n data: &[u8],\n\n _elf: &Elf,\n\n _sections: &SectionTable<Elf>,\n\n section: &Elf::SectionHeader,\n\n) {\n\n if let Some(Some(hash)) = section.hash_header(endian, data).print_err(p) {\n\n p.group(\"Hash\", |p| {\n\n p.field(\"BucketCount\", hash.bucket_count.get(endian));\n\n p.field(\"ChainCount\", hash.chain_count.get(endian));\n\n });\n\n }\n\n /* TODO: add this in a test somewhere\n\n if let Ok(Some((hash_table, link))) = section.hash(endian, data) {\n\n if let Ok(symbols) = _sections.symbol_table_by_index(endian, data, link) {\n\n if let Ok(versions) = _sections.versions(endian, data) {\n\n for (index, symbol) in symbols.symbols().iter().enumerate() {\n\n let name = symbols.symbol_name(endian, symbol).unwrap();\n","file_path":"crates/examples/src/readobj/elf.rs","rank":26,"score":224627.02315400602},{"content":"fn print_version<Elf: FileHeader>(\n\n p: &mut Printer<'_>,\n\n versions: Option<&VersionTable<Elf>>,\n\n version_index: VersionIndex,\n\n) {\n\n match versions.and_then(|versions| versions.version(version_index).print_err(p)) {\n\n Some(Some(version)) => {\n\n p.field_string_option(\"Version\", version_index.0, Some(version.name()))\n\n }\n\n _ => p.field_enum(\"Version\", version_index.0, FLAGS_VER_NDX),\n\n }\n\n p.flags(version_index.0, 0, FLAGS_VERSYM);\n\n}\n\n\n\nstatic FLAGS_EI_CLASS: &[Flag<u8>] = &flags!(ELFCLASSNONE, ELFCLASS32, ELFCLASS64);\n\nstatic FLAGS_EI_DATA: &[Flag<u8>] = &flags!(ELFDATANONE, ELFDATA2LSB, ELFDATA2MSB);\n\nstatic FLAGS_EV: &[Flag<u8>] = &flags!(EV_NONE, EV_CURRENT);\n\nstatic FLAGS_EI_OSABI: &[Flag<u8>] = &flags!(\n\n ELFOSABI_SYSV,\n\n ELFOSABI_HPUX,\n","file_path":"crates/examples/src/readobj/elf.rs","rank":27,"score":224609.54311881695},{"content":"pub fn print(w: &'_ mut dyn Write, e: &'_ mut dyn Write, file: &[u8]) {\n\n let mut printer = Printer::new(w, e);\n\n print_object(&mut printer, &*file);\n\n}\n\n\n","file_path":"crates/examples/src/readobj/mod.rs","rank":28,"score":222528.19473344937},{"content":"fn print_gnu_verneed<Elf: FileHeader>(\n\n p: &mut Printer<'_>,\n\n endian: Elf::Endian,\n\n data: &[u8],\n\n _elf: &Elf,\n\n sections: &SectionTable<Elf>,\n\n section: &Elf::SectionHeader,\n\n) {\n\n if let Some(Some((mut verneeds, link))) = section.gnu_verneed(endian, data).print_err(p) {\n\n let strings = sections.strings(endian, data, link).unwrap_or_default();\n\n while let Some(Some((verneed, mut vernauxs))) = verneeds.next().print_err(p) {\n\n p.group(\"VersionNeed\", |p| {\n\n p.field(\"Version\", verneed.vn_version.get(endian));\n\n p.field(\"AuxCount\", verneed.vn_cnt.get(endian));\n\n p.field_string(\n\n \"Filename\",\n\n verneed.vn_file.get(endian),\n\n verneed.file(endian, strings),\n\n );\n\n p.field(\"AuxOffset\", verneed.vn_aux.get(endian));\n","file_path":"crates/examples/src/readobj/elf.rs","rank":29,"score":220777.35480574917},{"content":"fn print_gnu_versym<Elf: FileHeader>(\n\n p: &mut Printer<'_>,\n\n endian: Elf::Endian,\n\n data: &[u8],\n\n _elf: &Elf,\n\n sections: &SectionTable<Elf>,\n\n section: &Elf::SectionHeader,\n\n) {\n\n if let Some(Some((syms, _link))) = section.gnu_versym(endian, data).print_err(p) {\n\n let versions = sections.versions(endian, data).print_err(p).flatten();\n\n for (index, sym) in syms.iter().enumerate() {\n\n let version_index = VersionIndex(sym.0.get(endian));\n\n p.group(\"VersionSymbol\", |p| {\n\n p.field(\"Index\", index);\n\n print_version(p, versions.as_ref(), version_index);\n\n });\n\n }\n\n }\n\n}\n\n\n","file_path":"crates/examples/src/readobj/elf.rs","rank":30,"score":220777.35480574917},{"content":"fn print_gnu_verdef<Elf: FileHeader>(\n\n p: &mut Printer<'_>,\n\n endian: Elf::Endian,\n\n data: &[u8],\n\n _elf: &Elf,\n\n sections: &SectionTable<Elf>,\n\n section: &Elf::SectionHeader,\n\n) {\n\n if let Some(Some((mut verdefs, link))) = section.gnu_verdef(endian, data).print_err(p) {\n\n let strings = sections.strings(endian, data, link).unwrap_or_default();\n\n while let Some(Some((verdef, mut verdauxs))) = verdefs.next().print_err(p) {\n\n p.group(\"VersionDefinition\", |p| {\n\n p.field(\"Version\", verdef.vd_version.get(endian));\n\n p.field_hex(\"Flags\", verdef.vd_flags.get(endian));\n\n p.flags(verdef.vd_flags.get(endian), 0, FLAGS_VER_FLG);\n\n p.field(\"Index\", verdef.vd_ndx.get(endian));\n\n p.field(\"AuxCount\", verdef.vd_cnt.get(endian));\n\n p.field_hex(\"Hash\", verdef.vd_hash.get(endian));\n\n p.field(\"AuxOffset\", verdef.vd_aux.get(endian));\n\n p.field(\"NextOffset\", verdef.vd_next.get(endian));\n","file_path":"crates/examples/src/readobj/elf.rs","rank":31,"score":220777.35480574917},{"content":"fn print_section_symbols<Elf: FileHeader>(\n\n p: &mut Printer<'_>,\n\n endian: Elf::Endian,\n\n data: &[u8],\n\n elf: &Elf,\n\n sections: &SectionTable<Elf>,\n\n section_index: SectionIndex,\n\n section: &Elf::SectionHeader,\n\n) {\n\n if let Some(Some(symbols)) = section\n\n .symbols(endian, data, sections, section_index)\n\n .print_err(p)\n\n {\n\n let versions = if section.sh_type(endian) == SHT_DYNSYM {\n\n sections.versions(endian, data).print_err(p).flatten()\n\n } else {\n\n None\n\n };\n\n let os_stt = match elf.e_ident().os_abi {\n\n ELFOSABI_GNU => FLAGS_STT_GNU,\n","file_path":"crates/examples/src/readobj/elf.rs","rank":32,"score":220562.50869487342},{"content":"#[allow(missing_docs)]\n\npub trait Sym: Debug + Pod {\n\n type Word: Into<u64>;\n\n type Endian: endian::Endian;\n\n\n\n fn st_name(&self, endian: Self::Endian) -> u32;\n\n fn st_info(&self) -> u8;\n\n fn st_bind(&self) -> u8;\n\n fn st_type(&self) -> u8;\n\n fn st_other(&self) -> u8;\n\n fn st_visibility(&self) -> u8;\n\n fn st_shndx(&self, endian: Self::Endian) -> u16;\n\n fn st_value(&self, endian: Self::Endian) -> Self::Word;\n\n fn st_size(&self, endian: Self::Endian) -> Self::Word;\n\n\n\n /// Parse the symbol name from the string table.\n\n fn name<'data, R: ReadRef<'data>>(\n\n &self,\n\n endian: Self::Endian,\n\n strings: StringTable<'data, R>,\n\n ) -> read::Result<&'data [u8]> {\n","file_path":"src/read/elf/symbol.rs","rank":33,"score":220003.02433040418},{"content":"// Only for Debug impl of `Bytes`.\n\nfn debug_list_bytes(bytes: &[u8], fmt: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n let mut list = fmt.debug_list();\n\n list.entries(bytes.iter().take(8).copied().map(DebugByte));\n\n if bytes.len() > 8 {\n\n list.entry(&DebugLen(bytes.len()));\n\n }\n\n list.finish()\n\n}\n\n\n","file_path":"src/read/util.rs","rank":34,"score":216935.76255675702},{"content":"#[derive(Default, Clone, Copy)]\n\nstruct SymbolOffsets {\n\n index: SymbolIndex,\n\n str_id: Option<StringId>,\n\n}\n\n\n\nimpl<'a> Object<'a> {\n\n pub(crate) fn elf_section_info(\n\n &self,\n\n section: StandardSection,\n\n ) -> (&'static [u8], &'static [u8], SectionKind) {\n\n match section {\n\n StandardSection::Text => (&[], &b\".text\"[..], SectionKind::Text),\n\n StandardSection::Data => (&[], &b\".data\"[..], SectionKind::Data),\n\n StandardSection::ReadOnlyData | StandardSection::ReadOnlyString => {\n\n (&[], &b\".rodata\"[..], SectionKind::ReadOnlyData)\n\n }\n\n StandardSection::ReadOnlyDataWithRel => (&[], b\".data.rel.ro\", SectionKind::Data),\n\n StandardSection::UninitializedData => {\n\n (&[], &b\".bss\"[..], SectionKind::UninitializedData)\n\n }\n","file_path":"src/write/elf/object.rs","rank":35,"score":211693.50703931542},{"content":"fn print_program_headers<Elf: FileHeader>(\n\n p: &mut Printer<'_>,\n\n endian: Elf::Endian,\n\n data: &[u8],\n\n elf: &Elf,\n\n segments: &[Elf::ProgramHeader],\n\n) {\n\n for segment in segments {\n\n p.group(\"ProgramHeader\", |p| {\n\n let proc = match elf.e_machine(endian) {\n\n EM_MIPS => FLAGS_PT_MIPS,\n\n EM_PARISC => FLAGS_PT_PARISC,\n\n EM_ARM => FLAGS_PT_ARM,\n\n EM_IA_64 => FLAGS_PT_IA_64,\n\n _ => &[],\n\n };\n\n let os = match elf.e_ident().os_abi {\n\n ELFOSABI_HPUX => FLAGS_PT_HP,\n\n _ => &[],\n\n };\n","file_path":"crates/examples/src/readobj/elf.rs","rank":36,"score":193475.13363837203},{"content":"fn print_section_headers<Elf: FileHeader>(\n\n p: &mut Printer<'_>,\n\n endian: Elf::Endian,\n\n data: &[u8],\n\n elf: &Elf,\n\n sections: &SectionTable<Elf>,\n\n) {\n\n for (index, section) in sections.iter().enumerate() {\n\n let index = SectionIndex(index);\n\n p.group(\"SectionHeader\", |p| {\n\n p.field(\"Index\", index.0);\n\n p.field_string(\n\n \"Name\",\n\n section.sh_name(endian),\n\n sections.section_name(endian, section),\n\n );\n\n\n\n let proc = match elf.e_machine(endian) {\n\n EM_MIPS => FLAGS_SHT_MIPS,\n\n EM_PARISC => FLAGS_SHT_PARISC,\n","file_path":"crates/examples/src/readobj/elf.rs","rank":37,"score":193475.13363837203},{"content":"#[derive(Clone, Debug)]\n\nstruct WasmSymbolInternal<'data> {\n\n name: &'data str,\n\n address: u64,\n\n size: u64,\n\n kind: SymbolKind,\n\n section: SymbolSection,\n\n scope: SymbolScope,\n\n}\n\n\n\nimpl<'data, 'file> read::private::Sealed for WasmSymbol<'data, 'file> {}\n\n\n\nimpl<'data, 'file> ObjectSymbol<'data> for WasmSymbol<'data, 'file> {\n\n #[inline]\n\n fn index(&self) -> SymbolIndex {\n\n self.index\n\n }\n\n\n\n #[inline]\n\n fn name_bytes(&self) -> read::Result<&'data [u8]> {\n\n Ok(self.symbol.name.as_bytes())\n","file_path":"src/read/wasm.rs","rank":38,"score":191813.211116139},{"content":"fn parse_ordinal(digits: &[u8]) -> Option<u32> {\n\n if digits.is_empty() {\n\n return None;\n\n }\n\n let mut result: u32 = 0;\n\n for &c in digits {\n\n let x = (c as char).to_digit(10)?;\n\n result = result.checked_mul(10)?.checked_add(x)?;\n\n }\n\n Some(result)\n\n}\n","file_path":"src/read/pe/export.rs","rank":39,"score":191467.0357393294},{"content":"fn print_cputype(p: &mut Printer<'_>, cputype: u32, cpusubtype: u32) {\n\n let proc = match cputype {\n\n CPU_TYPE_ANY => FLAGS_CPU_SUBTYPE_ANY,\n\n CPU_TYPE_VAX => FLAGS_CPU_SUBTYPE_VAX,\n\n CPU_TYPE_MC680X0 => FLAGS_CPU_SUBTYPE_MC680X0,\n\n CPU_TYPE_X86 => FLAGS_CPU_SUBTYPE_X86,\n\n CPU_TYPE_X86_64 => FLAGS_CPU_SUBTYPE_X86_64,\n\n CPU_TYPE_MIPS => FLAGS_CPU_SUBTYPE_MIPS,\n\n CPU_TYPE_MC98000 => FLAGS_CPU_SUBTYPE_MC98000,\n\n CPU_TYPE_HPPA => FLAGS_CPU_SUBTYPE_HPPA,\n\n CPU_TYPE_ARM => FLAGS_CPU_SUBTYPE_ARM,\n\n CPU_TYPE_ARM64 => FLAGS_CPU_SUBTYPE_ARM64,\n\n CPU_TYPE_ARM64_32 => FLAGS_CPU_SUBTYPE_ARM64_32,\n\n CPU_TYPE_MC88000 => FLAGS_CPU_SUBTYPE_MC88000,\n\n CPU_TYPE_SPARC => FLAGS_CPU_SUBTYPE_SPARC,\n\n CPU_TYPE_I860 => FLAGS_CPU_SUBTYPE_I860,\n\n CPU_TYPE_POWERPC | CPU_TYPE_POWERPC64 => FLAGS_CPU_SUBTYPE_POWERPC,\n\n _ => &[],\n\n };\n\n p.field_enum(\"CpuType\", cputype, FLAGS_CPU_TYPE);\n","file_path":"crates/examples/src/readobj/macho.rs","rank":40,"score":189716.71859798458},{"content":"fn print_file(p: &mut Printer<'_>, header: &ImageFileHeader) {\n\n p.group(\"ImageFileHeader\", |p| {\n\n p.field_enum(\"Machine\", header.machine.get(LE), FLAGS_IMAGE_FILE_MACHINE);\n\n p.field(\"NumberOfSections\", header.number_of_sections.get(LE));\n\n p.field(\"TimeDateStamp\", header.time_date_stamp.get(LE));\n\n p.field_hex(\n\n \"PointerToSymbolTable\",\n\n header.pointer_to_symbol_table.get(LE),\n\n );\n\n p.field(\"NumberOfSymbols\", header.number_of_symbols.get(LE));\n\n p.field_hex(\n\n \"SizeOfOptionalHeader\",\n\n header.size_of_optional_header.get(LE),\n\n );\n\n p.field_hex(\"Characteristics\", header.characteristics.get(LE));\n\n p.flags(header.characteristics.get(LE), 0, FLAGS_IMAGE_FILE);\n\n });\n\n}\n\n\n","file_path":"crates/examples/src/readobj/pe.rs","rank":41,"score":187289.36584175064},{"content":"fn parse_relocation<Elf: FileHeader>(\n\n header: &Elf,\n\n endian: Elf::Endian,\n\n reloc: Elf::Rela,\n\n implicit_addend: bool,\n\n) -> Relocation {\n\n let mut encoding = RelocationEncoding::Generic;\n\n let is_mips64el = header.is_mips64el(endian);\n\n let (kind, size) = match header.e_machine(endian) {\n\n elf::EM_AARCH64 => match reloc.r_type(endian, false) {\n\n elf::R_AARCH64_ABS64 => (RelocationKind::Absolute, 64),\n\n elf::R_AARCH64_ABS32 => (RelocationKind::Absolute, 32),\n\n elf::R_AARCH64_ABS16 => (RelocationKind::Absolute, 16),\n\n elf::R_AARCH64_PREL64 => (RelocationKind::Relative, 64),\n\n elf::R_AARCH64_PREL32 => (RelocationKind::Relative, 32),\n\n elf::R_AARCH64_PREL16 => (RelocationKind::Relative, 16),\n\n elf::R_AARCH64_CALL26 => {\n\n encoding = RelocationEncoding::AArch64Call;\n\n (RelocationKind::PltRelative, 26)\n\n }\n","file_path":"src/read/elf/relocation.rs","rank":42,"score":186736.64671381464},{"content":"#[inline]\n\npub fn bytes_of<T: Pod>(val: &T) -> &[u8] {\n\n let size = mem::size_of::<T>();\n\n // Safety:\n\n // Any alignment is allowed.\n\n // The size is determined in this function.\n\n // The Pod trait ensures the type is valid to cast to bytes.\n\n unsafe { slice::from_raw_parts(slice::from_ref(val).as_ptr().cast(), size) }\n\n}\n\n\n\n/// Cast a `Pod` type to a mutable byte slice.\n","file_path":"src/pod.rs","rank":43,"score":185488.74966241745},{"content":"fn print_notes<Elf: FileHeader>(\n\n p: &mut Printer<'_>,\n\n endian: Elf::Endian,\n\n mut notes: NoteIterator<Elf>,\n\n) {\n\n while let Some(Some(note)) = notes.next().print_err(p) {\n\n p.group(\"Note\", |p| {\n\n let name = note.name();\n\n p.field_string_option(\"Name\", note.n_namesz(endian), Some(name));\n\n let flags = if name == ELF_NOTE_CORE || name == ELF_NOTE_LINUX {\n\n FLAGS_NT_CORE\n\n } else if name == ELF_NOTE_SOLARIS {\n\n FLAGS_NT_SOLARIS\n\n } else if name == ELF_NOTE_GNU {\n\n FLAGS_NT_GNU\n\n } else {\n\n // TODO: NT_VERSION\n\n &[]\n\n };\n\n p.field_enum(\"Type\", note.n_type(endian), flags);\n\n // TODO: interpret desc\n\n p.field_bytes(\"Desc\", note.desc());\n\n });\n\n }\n\n}\n\n\n","file_path":"crates/examples/src/readobj/elf.rs","rank":44,"score":183750.44569393288},{"content":"fn print_dynamic<Elf: FileHeader>(\n\n p: &mut Printer<'_>,\n\n endian: Elf::Endian,\n\n elf: &Elf,\n\n dynamic: &[Elf::Dyn],\n\n dynstr: StringTable,\n\n) {\n\n let proc = match elf.e_machine(endian) {\n\n EM_SPARC => FLAGS_DT_SPARC,\n\n EM_MIPS => FLAGS_DT_MIPS,\n\n EM_ALPHA => FLAGS_DT_ALPHA,\n\n EM_PPC => FLAGS_DT_PPC,\n\n EM_PPC64 => FLAGS_DT_PPC64,\n\n EM_IA_64 => FLAGS_DT_IA_64,\n\n EM_ALTERA_NIOS2 => FLAGS_DT_NIOS2,\n\n _ => &[],\n\n };\n\n for d in dynamic {\n\n let tag = d.d_tag(endian).into();\n\n let val = d.d_val(endian).into();\n","file_path":"crates/examples/src/readobj/elf.rs","rank":45,"score":183750.44569393288},{"content":"enum SymbolInternal<'data, 'file, R>\n\nwhere\n\n 'data: 'file,\n\n R: ReadRef<'data>,\n\n{\n\n #[cfg(feature = \"coff\")]\n\n Coff((coff::CoffSymbol<'data, 'file, R>, PhantomData<R>)),\n\n #[cfg(feature = \"elf\")]\n\n Elf32(\n\n (\n\n elf::ElfSymbol32<'data, 'file, Endianness, R>,\n\n PhantomData<R>,\n\n ),\n\n ),\n\n #[cfg(feature = \"elf\")]\n\n Elf64(\n\n (\n\n elf::ElfSymbol64<'data, 'file, Endianness, R>,\n\n PhantomData<R>,\n\n ),\n","file_path":"src/read/any.rs","rank":46,"score":183088.27647468843},{"content":"#[inline]\n\npub fn bytes_of_slice<T: Pod>(val: &[T]) -> &[u8] {\n\n let size = val.len().wrapping_mul(mem::size_of::<T>());\n\n // Safety:\n\n // Any alignment is allowed.\n\n // The size is determined in this function.\n\n // The Pod trait ensures the type is valid to cast to bytes.\n\n unsafe { slice::from_raw_parts(val.as_ptr().cast(), size) }\n\n}\n\n\n\n/// Cast a slice of a `Pod` type to a mutable byte slice.\n","file_path":"src/pod.rs","rank":47,"score":182275.69241439167},{"content":"fn print_optional(p: &mut Printer<'_>, header: &impl ImageOptionalHeader) {\n\n p.group(\"ImageOptionalHeader\", |p| {\n\n p.field_hex(\"Magic\", header.magic());\n\n p.field(\"MajorLinkerVersion\", header.major_linker_version());\n\n p.field(\"MinorLinkerVersion\", header.minor_linker_version());\n\n p.field_hex(\"SizeOfCode\", header.size_of_code());\n\n p.field_hex(\"SizeOfInitializedData\", header.size_of_initialized_data());\n\n p.field_hex(\n\n \"SizeOfUninitializedData\",\n\n header.size_of_uninitialized_data(),\n\n );\n\n p.field_hex(\"AddressOfEntryPoint\", header.address_of_entry_point());\n\n p.field_hex(\"BaseOfCode\", header.base_of_code());\n\n p.field_hex(\"ImageBase\", header.image_base());\n\n p.field_hex(\"SectionAlignment\", header.section_alignment());\n\n p.field(\n\n \"MajorOperatingSystemVersion\",\n\n header.major_operating_system_version(),\n\n );\n\n p.field(\n","file_path":"crates/examples/src/readobj/pe.rs","rank":48,"score":181252.71894957032},{"content":"fn print_section_rel<Elf: FileHeader>(\n\n p: &mut Printer<'_>,\n\n endian: Elf::Endian,\n\n data: &[u8],\n\n elf: &Elf,\n\n sections: &SectionTable<Elf>,\n\n section: &Elf::SectionHeader,\n\n) {\n\n if let Some(Some((relocations, link))) = section.rel(endian, data).print_err(p) {\n\n let symbols = sections\n\n .symbol_table_by_index(endian, data, link)\n\n .print_err(p);\n\n let proc = rel_flag_type(endian, elf);\n\n for relocation in relocations {\n\n p.group(\"Relocation\", |p| {\n\n p.field_hex(\"Offset\", relocation.r_offset(endian).into());\n\n p.field_enum(\"Type\", relocation.r_type(endian), proc);\n\n let sym = relocation.r_sym(endian);\n\n print_rel_symbol(p, endian, symbols, sym);\n\n });\n\n }\n\n }\n\n}\n\n\n","file_path":"crates/examples/src/readobj/elf.rs","rank":49,"score":180898.83353741473},{"content":"fn print_section_rela<Elf: FileHeader>(\n\n p: &mut Printer<'_>,\n\n endian: Elf::Endian,\n\n data: &[u8],\n\n elf: &Elf,\n\n sections: &SectionTable<Elf>,\n\n section: &Elf::SectionHeader,\n\n) {\n\n if let Some(Some((relocations, link))) = section.rela(endian, data).print_err(p) {\n\n let symbols = sections\n\n .symbol_table_by_index(endian, data, link)\n\n .print_err(p);\n\n let proc = rel_flag_type(endian, elf);\n\n for relocation in relocations {\n\n p.group(\"Relocation\", |p| {\n\n p.field_hex(\"Offset\", relocation.r_offset(endian).into());\n\n p.field_enum(\n\n \"Type\",\n\n relocation.r_type(endian, elf.is_mips64el(endian)),\n\n proc,\n","file_path":"crates/examples/src/readobj/elf.rs","rank":50,"score":180898.83353741473},{"content":"fn print_section_group<Elf: FileHeader>(\n\n p: &mut Printer<'_>,\n\n endian: Elf::Endian,\n\n data: &[u8],\n\n _elf: &Elf,\n\n sections: &SectionTable<Elf>,\n\n section: &Elf::SectionHeader,\n\n) {\n\n if let Some(Some((flag, members))) = section.group(endian, data).print_err(p) {\n\n p.field_enum(\"GroupFlag\", flag, FLAGS_GRP);\n\n p.group(\"GroupSections\", |p| {\n\n for member in members {\n\n let index = member.get(endian);\n\n p.print_indent();\n\n if let Some(section) = sections.section(SectionIndex(index as usize)).print_err(p) {\n\n if let Some(name) = sections.section_name(endian, section).print_err(p) {\n\n p.print_string(name);\n\n writeln!(p.w, \" ({})\", index).unwrap();\n\n } else {\n\n writeln!(p.w, \"{}\", index).unwrap();\n\n }\n\n } else {\n\n writeln!(p.w, \"{}\", index).unwrap();\n\n }\n\n }\n\n });\n\n }\n\n}\n\n\n","file_path":"crates/examples/src/readobj/elf.rs","rank":51,"score":180898.83353741473},{"content":"fn print_segment_dynamic<Elf: FileHeader>(\n\n p: &mut Printer<'_>,\n\n endian: Elf::Endian,\n\n data: &[u8],\n\n elf: &Elf,\n\n segments: &[Elf::ProgramHeader],\n\n segment: &Elf::ProgramHeader,\n\n) {\n\n if let Some(Some(dynamic)) = segment.dynamic(endian, data).print_err(p) {\n\n // TODO: add a helper API for this and the other mandatory tags?\n\n let mut strtab = 0;\n\n let mut strsz = 0;\n\n for d in dynamic {\n\n let tag = d.d_tag(endian).into();\n\n if tag == DT_STRTAB.into() {\n\n strtab = d.d_val(endian).into();\n\n } else if tag == DT_STRSZ.into() {\n\n strsz = d.d_val(endian).into();\n\n }\n\n }\n","file_path":"crates/examples/src/readobj/elf.rs","rank":52,"score":180898.83353741473},{"content":"fn print_section_dynamic<Elf: FileHeader>(\n\n p: &mut Printer<'_>,\n\n endian: Elf::Endian,\n\n data: &[u8],\n\n elf: &Elf,\n\n sections: &SectionTable<Elf>,\n\n section: &Elf::SectionHeader,\n\n) {\n\n if let Some(Some((dynamic, index))) = section.dynamic(endian, data).print_err(p) {\n\n let strings = sections.strings(endian, data, index).unwrap_or_default();\n\n print_dynamic(p, endian, elf, dynamic, strings);\n\n }\n\n}\n\n\n","file_path":"crates/examples/src/readobj/elf.rs","rank":53,"score":180898.83353741473},{"content":"fn print_segment_notes<Elf: FileHeader>(\n\n p: &mut Printer<'_>,\n\n endian: Elf::Endian,\n\n data: &[u8],\n\n _elf: &Elf,\n\n segment: &Elf::ProgramHeader,\n\n) {\n\n if let Some(Some(notes)) = segment.notes(endian, data).print_err(p) {\n\n print_notes(p, endian, notes);\n\n }\n\n}\n\n\n","file_path":"crates/examples/src/readobj/elf.rs","rank":54,"score":180898.83353741473},{"content":"fn print_section_notes<Elf: FileHeader>(\n\n p: &mut Printer<'_>,\n\n endian: Elf::Endian,\n\n data: &[u8],\n\n _elf: &Elf,\n\n section: &Elf::SectionHeader,\n\n) {\n\n if let Some(Some(notes)) = section.notes(endian, data).print_err(p) {\n\n print_notes(p, endian, notes);\n\n }\n\n}\n\n\n","file_path":"crates/examples/src/readobj/elf.rs","rank":55,"score":180898.83353741473},{"content":"#[derive(Debug)]\n\nenum SymbolIteratorInternal<'data, 'file, R>\n\nwhere\n\n 'data: 'file,\n\n R: ReadRef<'data>,\n\n{\n\n #[cfg(feature = \"coff\")]\n\n Coff((coff::CoffSymbolIterator<'data, 'file, R>, PhantomData<R>)),\n\n #[cfg(feature = \"elf\")]\n\n Elf32(\n\n (\n\n elf::ElfSymbolIterator32<'data, 'file, Endianness, R>,\n\n PhantomData<R>,\n\n ),\n\n ),\n\n #[cfg(feature = \"elf\")]\n\n Elf64(\n\n (\n\n elf::ElfSymbolIterator64<'data, 'file, Endianness, R>,\n\n PhantomData<R>,\n\n ),\n","file_path":"src/read/any.rs","rank":56,"score":179513.5128312378},{"content":"#[derive(Debug)]\n\nenum SymbolTableInternal<'data, 'file, R>\n\nwhere\n\n 'data: 'file,\n\n R: ReadRef<'data>,\n\n{\n\n #[cfg(feature = \"coff\")]\n\n Coff((coff::CoffSymbolTable<'data, 'file, R>, PhantomData<R>)),\n\n #[cfg(feature = \"elf\")]\n\n Elf32(\n\n (\n\n elf::ElfSymbolTable32<'data, 'file, Endianness, R>,\n\n PhantomData<R>,\n\n ),\n\n ),\n\n #[cfg(feature = \"elf\")]\n\n Elf64(\n\n (\n\n elf::ElfSymbolTable64<'data, 'file, Endianness, R>,\n\n PhantomData<R>,\n\n ),\n","file_path":"src/read/any.rs","rank":57,"score":179513.5128312378},{"content":"#[inline]\n\npub fn slice_from_bytes_mut<T: Pod>(\n\n data: &mut [u8],\n\n count: usize,\n\n) -> Result<(&mut [T], &mut [u8])> {\n\n let size = count.checked_mul(mem::size_of::<T>()).ok_or(())?;\n\n if size > data.len() {\n\n return Err(());\n\n }\n\n let (data, tail) = data.split_at_mut(size);\n\n let ptr = data.as_mut_ptr();\n\n if (ptr as usize) % mem::align_of::<T>() != 0 {\n\n return Err(());\n\n }\n\n // Safety:\n\n // The alignment and size are checked by this function.\n\n // The Pod trait ensures the type is valid to cast from bytes.\n\n let slice = unsafe { slice::from_raw_parts_mut(ptr.cast(), count) };\n\n Ok((slice, tail))\n\n}\n\n\n\n/// Cast a `Pod` type to a byte slice.\n","file_path":"src/pod.rs","rank":58,"score":177003.75362288835},{"content":"#[derive(Debug)]\n\nenum FileInternal<'data, R: ReadRef<'data>> {\n\n #[cfg(feature = \"coff\")]\n\n Coff(coff::CoffFile<'data, R>),\n\n #[cfg(feature = \"elf\")]\n\n Elf32(elf::ElfFile32<'data, Endianness, R>),\n\n #[cfg(feature = \"elf\")]\n\n Elf64(elf::ElfFile64<'data, Endianness, R>),\n\n #[cfg(feature = \"macho\")]\n\n MachO32(macho::MachOFile32<'data, Endianness, R>),\n\n #[cfg(feature = \"macho\")]\n\n MachO64(macho::MachOFile64<'data, Endianness, R>),\n\n #[cfg(feature = \"pe\")]\n\n Pe32(pe::PeFile32<'data, R>),\n\n #[cfg(feature = \"pe\")]\n\n Pe64(pe::PeFile64<'data, R>),\n\n #[cfg(feature = \"wasm\")]\n\n Wasm(wasm::WasmFile<'data, R>),\n\n}\n\n\n\nimpl<'data, R: ReadRef<'data>> File<'data, R> {\n","file_path":"src/read/any.rs","rank":59,"score":175830.74456513458},{"content":"fn print_macho<Mach: MachHeader<Endian = Endianness>>(\n\n p: &mut Printer<'_>,\n\n header: &Mach,\n\n data: &[u8],\n\n offset: u64,\n\n) {\n\n if let Some(endian) = header.endian().print_err(p) {\n\n let mut state = MachState::default();\n\n print_mach_header(p, endian, header);\n\n if let Some(mut commands) = header.load_commands(endian, data, offset).print_err(p) {\n\n while let Some(Some(command)) = commands.next().print_err(p) {\n\n print_load_command(p, endian, data, header, command, &mut state);\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"crates/examples/src/readobj/macho.rs","rank":60,"score":174607.25846125698},{"content":"#[derive(Default, Clone, Copy)]\n\nstruct SymbolOffsets {\n\n index: usize,\n\n str_id: Option<StringId>,\n\n aux_count: u8,\n\n}\n\n\n\nimpl<'a> Object<'a> {\n\n pub(crate) fn coff_section_info(\n\n &self,\n\n section: StandardSection,\n\n ) -> (&'static [u8], &'static [u8], SectionKind) {\n\n match section {\n\n StandardSection::Text => (&[], &b\".text\"[..], SectionKind::Text),\n\n StandardSection::Data => (&[], &b\".data\"[..], SectionKind::Data),\n\n StandardSection::ReadOnlyData\n\n | StandardSection::ReadOnlyDataWithRel\n\n | StandardSection::ReadOnlyString => (&[], &b\".rdata\"[..], SectionKind::ReadOnlyData),\n\n StandardSection::UninitializedData => {\n\n (&[], &b\".bss\"[..], SectionKind::UninitializedData)\n\n }\n","file_path":"src/write/coff.rs","rank":61,"score":173148.34850770468},{"content":"#[derive(Default, Clone, Copy)]\n\nstruct SymbolOffsets {\n\n emit: bool,\n\n index: usize,\n\n str_id: Option<StringId>,\n\n}\n\n\n\nimpl<'a> Object<'a> {\n\n pub(crate) fn macho_set_subsections_via_symbols(&mut self) {\n\n let flags = match self.flags {\n\n FileFlags::MachO { flags } => flags,\n\n _ => 0,\n\n };\n\n self.flags = FileFlags::MachO {\n\n flags: flags | macho::MH_SUBSECTIONS_VIA_SYMBOLS,\n\n };\n\n }\n\n\n\n pub(crate) fn macho_segment_name(&self, segment: StandardSegment) -> &'static [u8] {\n\n match segment {\n\n StandardSegment::Text => &b\"__TEXT\"[..],\n","file_path":"src/write/macho.rs","rank":62,"score":173148.34850770468},{"content":"enum ComdatInternal<'data, 'file, R: ReadRef<'data>>\n\nwhere\n\n 'data: 'file,\n\n{\n\n #[cfg(feature = \"coff\")]\n\n Coff(coff::CoffComdat<'data, 'file, R>),\n\n #[cfg(feature = \"elf\")]\n\n Elf32(elf::ElfComdat32<'data, 'file, Endianness, R>),\n\n #[cfg(feature = \"elf\")]\n\n Elf64(elf::ElfComdat64<'data, 'file, Endianness, R>),\n\n #[cfg(feature = \"macho\")]\n\n MachO32(macho::MachOComdat32<'data, 'file, Endianness, R>),\n\n #[cfg(feature = \"macho\")]\n\n MachO64(macho::MachOComdat64<'data, 'file, Endianness, R>),\n\n #[cfg(feature = \"pe\")]\n\n Pe32(pe::PeComdat32<'data, 'file, R>),\n\n #[cfg(feature = \"pe\")]\n\n Pe64(pe::PeComdat64<'data, 'file, R>),\n\n #[cfg(feature = \"wasm\")]\n\n Wasm(wasm::WasmComdat<'data, 'file, R>),\n","file_path":"src/read/any.rs","rank":63,"score":169311.93965153053},{"content":"#[derive(Debug)]\n\nenum SegmentInternal<'data, 'file, R: ReadRef<'data>>\n\nwhere\n\n 'data: 'file,\n\n{\n\n #[cfg(feature = \"coff\")]\n\n Coff(coff::CoffSegment<'data, 'file, R>),\n\n #[cfg(feature = \"elf\")]\n\n Elf32(elf::ElfSegment32<'data, 'file, Endianness, R>),\n\n #[cfg(feature = \"elf\")]\n\n Elf64(elf::ElfSegment64<'data, 'file, Endianness, R>),\n\n #[cfg(feature = \"macho\")]\n\n MachO32(macho::MachOSegment32<'data, 'file, Endianness, R>),\n\n #[cfg(feature = \"macho\")]\n\n MachO64(macho::MachOSegment64<'data, 'file, Endianness, R>),\n\n #[cfg(feature = \"pe\")]\n\n Pe32(pe::PeSegment32<'data, 'file, R>),\n\n #[cfg(feature = \"pe\")]\n\n Pe64(pe::PeSegment64<'data, 'file, R>),\n\n #[cfg(feature = \"wasm\")]\n\n Wasm(wasm::WasmSegment<'data, 'file, R>),\n","file_path":"src/read/any.rs","rank":64,"score":169311.93965153053},{"content":"enum SectionInternal<'data, 'file, R: ReadRef<'data>>\n\nwhere\n\n 'data: 'file,\n\n{\n\n #[cfg(feature = \"coff\")]\n\n Coff(coff::CoffSection<'data, 'file, R>),\n\n #[cfg(feature = \"elf\")]\n\n Elf32(elf::ElfSection32<'data, 'file, Endianness, R>),\n\n #[cfg(feature = \"elf\")]\n\n Elf64(elf::ElfSection64<'data, 'file, Endianness, R>),\n\n #[cfg(feature = \"macho\")]\n\n MachO32(macho::MachOSection32<'data, 'file, Endianness, R>),\n\n #[cfg(feature = \"macho\")]\n\n MachO64(macho::MachOSection64<'data, 'file, Endianness, R>),\n\n #[cfg(feature = \"pe\")]\n\n Pe32(pe::PeSection32<'data, 'file, R>),\n\n #[cfg(feature = \"pe\")]\n\n Pe64(pe::PeSection64<'data, 'file, R>),\n\n #[cfg(feature = \"wasm\")]\n\n Wasm(wasm::WasmSection<'data, 'file, R>),\n","file_path":"src/read/any.rs","rank":65,"score":169311.93965153053},{"content":"#[derive(Debug)]\n\nenum ComdatIteratorInternal<'data, 'file, R: ReadRef<'data>>\n\nwhere\n\n 'data: 'file,\n\n{\n\n #[cfg(feature = \"coff\")]\n\n Coff(coff::CoffComdatIterator<'data, 'file, R>),\n\n #[cfg(feature = \"elf\")]\n\n Elf32(elf::ElfComdatIterator32<'data, 'file, Endianness, R>),\n\n #[cfg(feature = \"elf\")]\n\n Elf64(elf::ElfComdatIterator64<'data, 'file, Endianness, R>),\n\n #[cfg(feature = \"macho\")]\n\n MachO32(macho::MachOComdatIterator32<'data, 'file, Endianness, R>),\n\n #[cfg(feature = \"macho\")]\n\n MachO64(macho::MachOComdatIterator64<'data, 'file, Endianness, R>),\n\n #[cfg(feature = \"pe\")]\n\n Pe32(pe::PeComdatIterator32<'data, 'file, R>),\n\n #[cfg(feature = \"pe\")]\n\n Pe64(pe::PeComdatIterator64<'data, 'file, R>),\n\n #[cfg(feature = \"wasm\")]\n\n Wasm(wasm::WasmComdatIterator<'data, 'file, R>),\n","file_path":"src/read/any.rs","rank":66,"score":167417.82316432698},{"content":"#[derive(Debug)]\n\nenum SegmentIteratorInternal<'data, 'file, R: ReadRef<'data>>\n\nwhere\n\n 'data: 'file,\n\n{\n\n #[cfg(feature = \"coff\")]\n\n Coff(coff::CoffSegmentIterator<'data, 'file, R>),\n\n #[cfg(feature = \"elf\")]\n\n Elf32(elf::ElfSegmentIterator32<'data, 'file, Endianness, R>),\n\n #[cfg(feature = \"elf\")]\n\n Elf64(elf::ElfSegmentIterator64<'data, 'file, Endianness, R>),\n\n #[cfg(feature = \"macho\")]\n\n MachO32(macho::MachOSegmentIterator32<'data, 'file, Endianness, R>),\n\n #[cfg(feature = \"macho\")]\n\n MachO64(macho::MachOSegmentIterator64<'data, 'file, Endianness, R>),\n\n #[cfg(feature = \"pe\")]\n\n Pe32(pe::PeSegmentIterator32<'data, 'file, R>),\n\n #[cfg(feature = \"pe\")]\n\n Pe64(pe::PeSegmentIterator64<'data, 'file, R>),\n\n #[cfg(feature = \"wasm\")]\n\n Wasm(wasm::WasmSegmentIterator<'data, 'file, R>),\n","file_path":"src/read/any.rs","rank":67,"score":167417.82316432698},{"content":"#[derive(Debug)]\n\nenum SectionIteratorInternal<'data, 'file, R: ReadRef<'data>>\n\nwhere\n\n 'data: 'file,\n\n{\n\n #[cfg(feature = \"coff\")]\n\n Coff(coff::CoffSectionIterator<'data, 'file, R>),\n\n #[cfg(feature = \"elf\")]\n\n Elf32(elf::ElfSectionIterator32<'data, 'file, Endianness, R>),\n\n #[cfg(feature = \"elf\")]\n\n Elf64(elf::ElfSectionIterator64<'data, 'file, Endianness, R>),\n\n #[cfg(feature = \"macho\")]\n\n MachO32(macho::MachOSectionIterator32<'data, 'file, Endianness, R>),\n\n #[cfg(feature = \"macho\")]\n\n MachO64(macho::MachOSectionIterator64<'data, 'file, Endianness, R>),\n\n #[cfg(feature = \"pe\")]\n\n Pe32(pe::PeSectionIterator32<'data, 'file, R>),\n\n #[cfg(feature = \"pe\")]\n\n Pe64(pe::PeSectionIterator64<'data, 'file, R>),\n\n #[cfg(feature = \"wasm\")]\n\n Wasm(wasm::WasmSectionIterator<'data, 'file, R>),\n","file_path":"src/read/any.rs","rank":68,"score":167417.82316432698},{"content":"#[derive(Clone, Copy)]\n\nstruct ComdatOffsets {\n\n offset: usize,\n\n str_id: StringId,\n\n}\n\n\n","file_path":"src/write/elf/object.rs","rank":69,"score":166375.9443803213},{"content":"#[derive(Clone, Copy)]\n\nstruct SectionOffsets {\n\n index: SectionIndex,\n\n offset: usize,\n\n str_id: StringId,\n\n reloc_offset: usize,\n\n reloc_str_id: Option<StringId>,\n\n}\n\n\n","file_path":"src/write/elf/object.rs","rank":70,"score":166375.9443803213},{"content":"/// A symbol table entry.\n\npub trait ObjectSymbol<'data>: read::private::Sealed {\n\n /// The index of the symbol.\n\n fn index(&self) -> SymbolIndex;\n\n\n\n /// The name of the symbol.\n\n fn name_bytes(&self) -> Result<&'data [u8]>;\n\n\n\n /// The name of the symbol.\n\n ///\n\n /// Returns an error if the name is not UTF-8.\n\n fn name(&self) -> Result<&'data str>;\n\n\n\n /// The address of the symbol. May be zero if the address is unknown.\n\n fn address(&self) -> u64;\n\n\n\n /// The size of the symbol. May be zero if the size is unknown.\n\n fn size(&self) -> u64;\n\n\n\n /// Return the kind of this symbol.\n\n fn kind(&self) -> SymbolKind;\n","file_path":"src/read/traits.rs","rank":71,"score":165742.15553553659},{"content":"#[derive(Debug)]\n\nenum ComdatSectionIteratorInternal<'data, 'file, R: ReadRef<'data>>\n\nwhere\n\n 'data: 'file,\n\n{\n\n #[cfg(feature = \"coff\")]\n\n Coff(coff::CoffComdatSectionIterator<'data, 'file, R>),\n\n #[cfg(feature = \"elf\")]\n\n Elf32(elf::ElfComdatSectionIterator32<'data, 'file, Endianness, R>),\n\n #[cfg(feature = \"elf\")]\n\n Elf64(elf::ElfComdatSectionIterator64<'data, 'file, Endianness, R>),\n\n #[cfg(feature = \"macho\")]\n\n MachO32(macho::MachOComdatSectionIterator32<'data, 'file, Endianness, R>),\n\n #[cfg(feature = \"macho\")]\n\n MachO64(macho::MachOComdatSectionIterator64<'data, 'file, Endianness, R>),\n\n #[cfg(feature = \"pe\")]\n\n Pe32(pe::PeComdatSectionIterator32<'data, 'file, R>),\n\n #[cfg(feature = \"pe\")]\n\n Pe64(pe::PeComdatSectionIterator64<'data, 'file, R>),\n\n #[cfg(feature = \"wasm\")]\n\n Wasm(wasm::WasmComdatSectionIterator<'data, 'file, R>),\n","file_path":"src/read/any.rs","rank":72,"score":165601.609357303},{"content":"#[derive(Debug)]\n\nenum SectionRelocationIteratorInternal<'data, 'file, R: ReadRef<'data>>\n\nwhere\n\n 'data: 'file,\n\n{\n\n #[cfg(feature = \"coff\")]\n\n Coff(coff::CoffRelocationIterator<'data, 'file, R>),\n\n #[cfg(feature = \"elf\")]\n\n Elf32(elf::ElfSectionRelocationIterator32<'data, 'file, Endianness, R>),\n\n #[cfg(feature = \"elf\")]\n\n Elf64(elf::ElfSectionRelocationIterator64<'data, 'file, Endianness, R>),\n\n #[cfg(feature = \"macho\")]\n\n MachO32(macho::MachORelocationIterator32<'data, 'file, Endianness, R>),\n\n #[cfg(feature = \"macho\")]\n\n MachO64(macho::MachORelocationIterator64<'data, 'file, Endianness, R>),\n\n #[cfg(feature = \"pe\")]\n\n Pe32(pe::PeRelocationIterator<'data, 'file, R>),\n\n #[cfg(feature = \"pe\")]\n\n Pe64(pe::PeRelocationIterator<'data, 'file, R>),\n\n #[cfg(feature = \"wasm\")]\n\n Wasm(wasm::WasmRelocationIterator<'data, 'file, R>),\n\n}\n\n\n\nimpl<'data, 'file, R: ReadRef<'data>> Iterator for SectionRelocationIterator<'data, 'file, R> {\n\n type Item = (u64, Relocation);\n\n\n\n fn next(&mut self) -> Option<Self::Item> {\n\n with_inner_mut!(self.inner, SectionRelocationIteratorInternal, |x| x.next())\n\n }\n\n}\n","file_path":"src/read/any.rs","rank":73,"score":165601.609357303},{"content":"#[cfg(feature = \"compression\")]\n\n#[test]\n\nfn compression_gnu() {\n\n use object::read::ObjectSection;\n\n use std::io::Write;\n\n\n\n let data = b\"test data data data\";\n\n let len = data.len() as u32;\n\n\n\n let mut buf = Vec::new();\n\n buf.write_all(b\"ZLIB\\0\\0\\0\\0\").unwrap();\n\n buf.write_all(&len.to_be_bytes()).unwrap();\n\n let mut encoder = flate2::write::ZlibEncoder::new(buf, flate2::Compression::default());\n\n encoder.write_all(data).unwrap();\n\n let compressed = encoder.finish().unwrap();\n\n\n\n let mut object =\n\n write::Object::new(BinaryFormat::Elf, Architecture::X86_64, Endianness::Little);\n\n let section = object.add_section(\n\n Vec::new(),\n\n b\".zdebug_info\".to_vec(),\n\n object::SectionKind::Other,\n","file_path":"tests/round_trip/elf.rs","rank":74,"score":163272.50856206854},{"content":"/// A symbol table.\n\npub trait ObjectSymbolTable<'data>: read::private::Sealed {\n\n /// A symbol table entry.\n\n type Symbol: ObjectSymbol<'data>;\n\n\n\n /// An iterator over the symbols in a symbol table.\n\n type SymbolIterator: Iterator<Item = Self::Symbol>;\n\n\n\n /// Get an iterator over the symbols in the table.\n\n ///\n\n /// This may skip over symbols that are malformed or unsupported.\n\n fn symbols(&self) -> Self::SymbolIterator;\n\n\n\n /// Get the symbol at the given index.\n\n ///\n\n /// The meaning of the index depends on the object file.\n\n ///\n\n /// Returns an error if the index is invalid.\n\n fn symbol_by_index(&self, index: SymbolIndex) -> Result<Self::Symbol>;\n\n}\n\n\n","file_path":"src/read/traits.rs","rank":75,"score":162690.50031414803},{"content":"fn dump_parsed_object<W: Write, E: Write>(w: &mut W, e: &mut E, file: &object::File) -> Result<()> {\n\n writeln!(\n\n w,\n\n \"Format: {:?} {:?}-endian {}-bit\",\n\n file.format(),\n\n file.endianness(),\n\n if file.is_64() { \"64\" } else { \"32\" }\n\n )?;\n\n writeln!(w, \"Kind: {:?}\", file.kind())?;\n\n writeln!(w, \"Architecture: {:?}\", file.architecture())?;\n\n writeln!(w, \"Flags: {:x?}\", file.flags())?;\n\n writeln!(\n\n w,\n\n \"Relative Address Base: {:x?}\",\n\n file.relative_address_base()\n\n )?;\n\n writeln!(w, \"Entry Address: {:x?}\", file.entry())?;\n\n\n\n match file.mach_uuid() {\n\n Ok(Some(uuid)) => writeln!(w, \"Mach UUID: {:x?}\", uuid)?,\n","file_path":"crates/examples/src/objdump.rs","rank":76,"score":161608.28662837984},{"content":"fn testfile<F>(path: &str, data: &[u8], ext: &str, f: F) -> bool\n\nwhere\n\n F: FnOnce(&mut dyn Write, &mut dyn Write, &[u8]),\n\n{\n\n if glob::glob(&format!(\"crates/examples/{}.{}*\", path, ext))\n\n .unwrap()\n\n .find_map(Result::ok)\n\n .is_none()\n\n {\n\n return false;\n\n }\n\n\n\n // TODO: print diffs for mismatches\n\n let mut fail = false;\n\n let mut out = Vec::new();\n\n let mut err = Vec::new();\n\n f(&mut out, &mut err, data);\n\n\n\n // Check exact match of output.\n\n let out_path = &format!(\"crates/examples/{}.{}\", path, ext);\n","file_path":"crates/examples/tests/testfiles.rs","rank":77,"score":159308.45627380605},{"content":"fn print_symbols(p: &mut Printer<'_>, sections: Option<&SectionTable>, symbols: &SymbolTable) {\n\n for (index, symbol) in symbols.iter() {\n\n p.group(\"ImageSymbol\", |p| {\n\n p.field(\"Index\", index);\n\n if let Some(name) = symbol.name(symbols.strings()).print_err(p) {\n\n p.field_inline_string(\"Name\", name);\n\n } else {\n\n p.field(\"Name\", format!(\"{:X?}\", symbol.name));\n\n }\n\n p.field_hex(\"Value\", symbol.value.get(LE));\n\n let section = symbol.section_number.get(LE);\n\n if section == 0 || section >= IMAGE_SYM_SECTION_MAX {\n\n p.field_enum(\"Section\", section, FLAGS_IMAGE_SYM);\n\n } else {\n\n let section_name = sections.and_then(|sections| {\n\n sections\n\n .section(section.into())\n\n .and_then(|section| section.name(symbols.strings()))\n\n .print_err(p)\n\n });\n","file_path":"crates/examples/src/readobj/pe.rs","rank":78,"score":159276.70338518976},{"content":"fn print_ident(p: &mut Printer<'_>, ident: &Ident) {\n\n p.field(\"Magic\", format!(\"{:X?}\", ident.magic));\n\n p.field_enum(\"Class\", ident.class, &FLAGS_EI_CLASS);\n\n p.field_enum(\"Data\", ident.data, &FLAGS_EI_DATA);\n\n p.field_enum(\"Version\", ident.version, &FLAGS_EV);\n\n p.field_enum(\"OsAbi\", ident.os_abi, &FLAGS_EI_OSABI);\n\n p.field_hex(\"AbiVersion\", ident.abi_version);\n\n p.field(\"Unused\", format!(\"{:X?}\", ident.padding));\n\n}\n\n\n","file_path":"crates/examples/src/readobj/elf.rs","rank":79,"score":156477.95677182035},{"content":"struct DebugByte(u8);\n\n\n\nimpl fmt::Debug for DebugByte {\n\n fn fmt(&self, fmt: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n write!(fmt, \"0x{:02x}\", self.0)\n\n }\n\n}\n\n\n","file_path":"src/read/util.rs","rank":80,"score":150564.34601490063},{"content":"#[allow(missing_docs)]\n\npub trait FileHeader: Debug + Pod {\n\n // Ideally this would be a `u64: From<Word>`, but can't express that.\n\n type Word: Into<u64>;\n\n type Sword: Into<i64>;\n\n type Endian: endian::Endian;\n\n type ProgramHeader: ProgramHeader<Elf = Self, Endian = Self::Endian, Word = Self::Word>;\n\n type SectionHeader: SectionHeader<Elf = Self, Endian = Self::Endian, Word = Self::Word>;\n\n type CompressionHeader: CompressionHeader<Endian = Self::Endian, Word = Self::Word>;\n\n type NoteHeader: NoteHeader<Endian = Self::Endian>;\n\n type Dyn: Dyn<Endian = Self::Endian, Word = Self::Word>;\n\n type Sym: Sym<Endian = Self::Endian, Word = Self::Word>;\n\n type Rel: Rel<Endian = Self::Endian, Word = Self::Word>;\n\n type Rela: Rela<Endian = Self::Endian, Word = Self::Word> + From<Self::Rel>;\n\n\n\n /// Return true if this type is a 64-bit header.\n\n ///\n\n /// This is a property of the type, not a value in the header data.\n\n fn is_type_64(&self) -> bool;\n\n\n\n fn e_ident(&self) -> &elf::Ident;\n","file_path":"src/read/elf/file.rs","rank":81,"score":147823.0004362949},{"content":"#[allow(missing_docs)]\n\npub trait SectionHeader: Debug + Pod {\n\n type Elf: FileHeader<SectionHeader = Self, Endian = Self::Endian, Word = Self::Word>;\n\n type Word: Into<u64>;\n\n type Endian: endian::Endian;\n\n\n\n fn sh_name(&self, endian: Self::Endian) -> u32;\n\n fn sh_type(&self, endian: Self::Endian) -> u32;\n\n fn sh_flags(&self, endian: Self::Endian) -> Self::Word;\n\n fn sh_addr(&self, endian: Self::Endian) -> Self::Word;\n\n fn sh_offset(&self, endian: Self::Endian) -> Self::Word;\n\n fn sh_size(&self, endian: Self::Endian) -> Self::Word;\n\n fn sh_link(&self, endian: Self::Endian) -> u32;\n\n fn sh_info(&self, endian: Self::Endian) -> u32;\n\n fn sh_addralign(&self, endian: Self::Endian) -> Self::Word;\n\n fn sh_entsize(&self, endian: Self::Endian) -> Self::Word;\n\n\n\n /// Parse the section name from the string table.\n\n fn name<'data, R: ReadRef<'data>>(\n\n &self,\n\n endian: Self::Endian,\n","file_path":"src/read/elf/section.rs","rank":82,"score":147823.0004362949},{"content":"#[allow(missing_docs)]\n\npub trait CompressionHeader: Debug + Pod {\n\n type Word: Into<u64>;\n\n type Endian: endian::Endian;\n\n\n\n fn ch_type(&self, endian: Self::Endian) -> u32;\n\n fn ch_size(&self, endian: Self::Endian) -> Self::Word;\n\n fn ch_addralign(&self, endian: Self::Endian) -> Self::Word;\n\n}\n\n\n\nimpl<Endian: endian::Endian> CompressionHeader for elf::CompressionHeader32<Endian> {\n\n type Word = u32;\n\n type Endian = Endian;\n\n\n\n #[inline]\n\n fn ch_type(&self, endian: Self::Endian) -> u32 {\n\n self.ch_type.get(endian)\n\n }\n\n\n\n #[inline]\n\n fn ch_size(&self, endian: Self::Endian) -> Self::Word {\n","file_path":"src/read/elf/compression.rs","rank":83,"score":147823.0004362949},{"content":"#[allow(missing_docs)]\n\npub trait NoteHeader: Debug + Pod {\n\n type Endian: endian::Endian;\n\n\n\n fn n_namesz(&self, endian: Self::Endian) -> u32;\n\n fn n_descsz(&self, endian: Self::Endian) -> u32;\n\n fn n_type(&self, endian: Self::Endian) -> u32;\n\n}\n\n\n\nimpl<Endian: endian::Endian> NoteHeader for elf::NoteHeader32<Endian> {\n\n type Endian = Endian;\n\n\n\n #[inline]\n\n fn n_namesz(&self, endian: Self::Endian) -> u32 {\n\n self.n_namesz.get(endian)\n\n }\n\n\n\n #[inline]\n\n fn n_descsz(&self, endian: Self::Endian) -> u32 {\n\n self.n_descsz.get(endian)\n\n }\n","file_path":"src/read/elf/note.rs","rank":84,"score":147823.0004362949},{"content":"#[allow(missing_docs)]\n\npub trait ProgramHeader: Debug + Pod {\n\n type Elf: FileHeader<ProgramHeader = Self, Endian = Self::Endian, Word = Self::Word>;\n\n type Word: Into<u64>;\n\n type Endian: endian::Endian;\n\n\n\n fn p_type(&self, endian: Self::Endian) -> u32;\n\n fn p_flags(&self, endian: Self::Endian) -> u32;\n\n fn p_offset(&self, endian: Self::Endian) -> Self::Word;\n\n fn p_vaddr(&self, endian: Self::Endian) -> Self::Word;\n\n fn p_paddr(&self, endian: Self::Endian) -> Self::Word;\n\n fn p_filesz(&self, endian: Self::Endian) -> Self::Word;\n\n fn p_memsz(&self, endian: Self::Endian) -> Self::Word;\n\n fn p_align(&self, endian: Self::Endian) -> Self::Word;\n\n\n\n /// Return the offset and size of the segment in the file.\n\n fn file_range(&self, endian: Self::Endian) -> (u64, u64) {\n\n (self.p_offset(endian).into(), self.p_filesz(endian).into())\n\n }\n\n\n\n /// Return the segment data.\n","file_path":"src/read/elf/segment.rs","rank":85,"score":147823.0004362949},{"content":"fn find_subslice(haystack: &[u8], needle: &[u8]) -> bool {\n\n haystack\n\n .windows(needle.len())\n\n .any(|window| window == needle)\n\n}\n","file_path":"crates/examples/tests/testfiles.rs","rank":86,"score":143203.66192565026},{"content":"#[test]\n\nfn parse_self() {\n\n let exe = env::current_exe().unwrap();\n\n let data = fs::read(exe).unwrap();\n\n let object = File::parse(&*data).unwrap();\n\n assert!(object.entry() != 0);\n\n assert!(object.sections().count() != 0);\n\n}\n\n\n","file_path":"tests/parse_self.rs","rank":87,"score":134719.4327631728},{"content":"#[derive(Debug)]\n\nenum DynamicRelocationIteratorInternal<'data, 'file, R>\n\nwhere\n\n 'data: 'file,\n\n R: ReadRef<'data>,\n\n{\n\n #[cfg(feature = \"elf\")]\n\n Elf32(elf::ElfDynamicRelocationIterator32<'data, 'file, Endianness, R>),\n\n #[cfg(feature = \"elf\")]\n\n Elf64(elf::ElfDynamicRelocationIterator64<'data, 'file, Endianness, R>),\n\n // We need to always use the lifetime parameters.\n\n #[allow(unused)]\n\n None(PhantomData<(&'data (), &'file (), R)>),\n\n}\n\n\n\nimpl<'data, 'file, R: ReadRef<'data>> Iterator for DynamicRelocationIterator<'data, 'file, R> {\n\n type Item = (u64, Relocation);\n\n\n\n fn next(&mut self) -> Option<Self::Item> {\n\n match self.inner {\n\n #[cfg(feature = \"elf\")]\n","file_path":"src/read/any.rs","rank":88,"score":134379.4719357543},{"content":"#[derive(Debug)]\n\nstruct ReadCacheInternal<R: Read + Seek> {\n\n read: R,\n\n bufs: HashMap<(u64, u64), Box<[u8]>>,\n\n strings: HashMap<(u64, u8), Box<[u8]>>,\n\n}\n\n\n\nimpl<R: Read + Seek> ReadCache<R> {\n\n /// Create an empty `ReadCache` for the given stream.\n\n pub fn new(read: R) -> Self {\n\n ReadCache {\n\n cache: RefCell::new(ReadCacheInternal {\n\n read,\n\n bufs: HashMap::new(),\n\n strings: HashMap::new(),\n\n }),\n\n }\n\n }\n\n\n\n /// Return an implementation of `ReadRef` that restricts reads\n\n /// to the given range of the stream.\n","file_path":"src/read/read_cache.rs","rank":89,"score":132708.05120477287},{"content":"#[cfg(feature = \"std\")]\n\n#[test]\n\nfn parse_self_cache() {\n\n use object::read::{ReadCache, ReadRef};\n\n let exe = env::current_exe().unwrap();\n\n let file = fs::File::open(exe).unwrap();\n\n let cache = ReadCache::new(file);\n\n let data = cache.range(0, cache.len().unwrap());\n\n let object = File::parse(data).unwrap();\n\n assert!(object.entry() != 0);\n\n assert!(object.sections().count() != 0);\n\n}\n","file_path":"tests/parse_self.rs","rank":90,"score":132347.8254631897},{"content":"/// A trait for using an endianness specification.\n\n///\n\n/// Provides methods for converting between the specified endianness and\n\n/// the native endianness of the target machine.\n\n///\n\n/// This trait does not require that the endianness is known at compile time.\n\npub trait Endian: Debug + Default + Clone + Copy + PartialEq + Eq + 'static {\n\n /// Construct a specification for the endianness of some values.\n\n ///\n\n /// Returns `None` if the type does not support specifying the given endianness.\n\n fn from_big_endian(big_endian: bool) -> Option<Self>;\n\n\n\n /// Construct a specification for the endianness of some values.\n\n ///\n\n /// Returns `None` if the type does not support specifying the given endianness.\n\n fn from_little_endian(little_endian: bool) -> Option<Self> {\n\n Self::from_big_endian(!little_endian)\n\n }\n\n\n\n /// Return true for big endian byte order.\n\n fn is_big_endian(self) -> bool;\n\n\n\n /// Return true for little endian byte order.\n\n #[inline]\n\n fn is_little_endian(self) -> bool {\n\n !self.is_big_endian()\n","file_path":"src/endian.rs","rank":91,"score":127262.46427990052},{"content":"#[derive(Default, Clone, Copy)]\n\nstruct SectionOffsets {\n\n offset: usize,\n\n str_id: Option<StringId>,\n\n reloc_offset: usize,\n\n selection: u8,\n\n associative_section: u16,\n\n}\n\n\n","file_path":"src/write/coff.rs","rank":92,"score":126500.90713884834},{"content":"#[derive(Default, Clone, Copy)]\n\nstruct SectionOffsets {\n\n index: usize,\n\n offset: usize,\n\n address: u64,\n\n reloc_offset: usize,\n\n}\n\n\n","file_path":"src/write/macho.rs","rank":93,"score":126500.90713884834},{"content":"struct MachHeader {\n\n cputype: u32,\n\n cpusubtype: u32,\n\n filetype: u32,\n\n ncmds: u32,\n\n sizeofcmds: u32,\n\n flags: u32,\n\n}\n\n\n","file_path":"src/write/macho.rs","rank":94,"score":126406.14403011774},{"content":"/// A loadable segment defined in an object file.\n\n///\n\n/// For ELF, this is a program header with type `PT_LOAD`.\n\n/// For Mach-O, this is a load command with type `LC_SEGMENT` or `LC_SEGMENT_64`.\n\npub trait ObjectSegment<'data>: read::private::Sealed {\n\n /// Returns the virtual address of the segment.\n\n fn address(&self) -> u64;\n\n\n\n /// Returns the size of the segment in memory.\n\n fn size(&self) -> u64;\n\n\n\n /// Returns the alignment of the segment in memory.\n\n fn align(&self) -> u64;\n\n\n\n /// Returns the offset and size of the segment in the file.\n\n fn file_range(&self) -> (u64, u64);\n\n\n\n /// Returns a reference to the file contents of the segment.\n\n ///\n\n /// The length of this data may be different from the size of the\n\n /// segment in memory.\n\n fn data(&self) -> Result<&'data [u8]>;\n\n\n\n /// Return the segment data in the given range.\n","file_path":"src/read/traits.rs","rank":95,"score":125067.65718323209},{"content":"/// A section defined in an object file.\n\npub trait ObjectSection<'data>: read::private::Sealed {\n\n /// An iterator over the relocations for a section.\n\n ///\n\n /// The first field in the item tuple is the section offset\n\n /// that the relocation applies to.\n\n type RelocationIterator: Iterator<Item = (u64, Relocation)>;\n\n\n\n /// Returns the section index.\n\n fn index(&self) -> SectionIndex;\n\n\n\n /// Returns the address of the section.\n\n fn address(&self) -> u64;\n\n\n\n /// Returns the size of the section in memory.\n\n fn size(&self) -> u64;\n\n\n\n /// Returns the alignment of the section in memory.\n\n fn align(&self) -> u64;\n\n\n\n /// Returns offset and size of on-disk segment (if any).\n","file_path":"src/read/traits.rs","rank":96,"score":125057.9853639027},{"content":"/// A COMDAT section group defined in an object file.\n\npub trait ObjectComdat<'data>: read::private::Sealed {\n\n /// An iterator over the sections in the object file.\n\n type SectionIterator: Iterator<Item = SectionIndex>;\n\n\n\n /// Returns the COMDAT selection kind.\n\n fn kind(&self) -> ComdatKind;\n\n\n\n /// Returns the index of the symbol used for the name of COMDAT section group.\n\n fn symbol(&self) -> SymbolIndex;\n\n\n\n /// Returns the name of the COMDAT section group.\n\n fn name_bytes(&self) -> Result<&[u8]>;\n\n\n\n /// Returns the name of the COMDAT section group.\n\n ///\n\n /// Returns an error if the name is not UTF-8.\n\n fn name(&self) -> Result<&str>;\n\n\n\n /// Get the sections in this section group.\n\n fn sections(&self) -> Self::SectionIterator;\n\n}\n\n\n","file_path":"src/read/traits.rs","rank":97,"score":125057.9853639027},{"content":"pub fn print<W: Write, E: Write>(\n\n w: &mut W,\n\n e: &mut E,\n\n file: &[u8],\n\n member_names: Vec<String>,\n\n) -> Result<()> {\n\n let mut member_names: Vec<_> = member_names.into_iter().map(|name| (name, false)).collect();\n\n\n\n if let Ok(archive) = ArchiveFile::parse(&*file) {\n\n writeln!(w, \"Format: Archive (kind: {:?})\", archive.kind())?;\n\n for member in archive.members() {\n\n match member {\n\n Ok(member) => {\n\n if find_member(&mut member_names, member.name()) {\n\n writeln!(w)?;\n\n writeln!(w, \"{}:\", String::from_utf8_lossy(member.name()))?;\n\n if let Ok(data) = member.data(&*file) {\n\n dump_object(w, e, data)?;\n\n }\n\n }\n","file_path":"crates/examples/src/objdump.rs","rank":98,"score":123329.11931482567},{"content":"struct DebugLen(usize);\n\n\n\nimpl fmt::Debug for DebugLen {\n\n fn fmt(&self, fmt: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n write!(fmt, \"...; {}\", self.0)\n\n }\n\n}\n\n\n\n/// A newtype for byte strings.\n\n///\n\n/// For byte slices that are strings of an unknown encoding.\n\n///\n\n/// Provides a `Debug` implementation that interprets the bytes as UTF-8.\n\n#[derive(Default, Clone, Copy, PartialEq, Eq)]\n\npub(crate) struct ByteString<'data>(pub &'data [u8]);\n\n\n\nimpl<'data> fmt::Debug for ByteString<'data> {\n\n fn fmt(&self, fmt: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n write!(fmt, \"\\\"{}\\\"\", String::from_utf8_lossy(self.0))\n\n }\n","file_path":"src/read/util.rs","rank":99,"score":120979.4556807818}],"string":"[\n {\n \"content\": \"/// Calculate the GNU hash for a symbol name.\\n\\n///\\n\\n/// Used for `SHT_GNU_HASH`.\\n\\npub fn gnu_hash(name: &[u8]) -> u32 {\\n\\n let mut hash = 5381u32;\\n\\n for byte in name {\\n\\n hash = hash.wrapping_mul(33).wrapping_add(u32::from(*byte));\\n\\n }\\n\\n hash\\n\\n}\\n\\n\\n\\n// Motorola 68k specific definitions.\\n\\n\\n\\n// m68k values for `Rel*::r_type`.\\n\\n\\n\\n/// No reloc\\n\\npub const R_68K_NONE: u32 = 0;\\n\\n/// Direct 32 bit\\n\\npub const R_68K_32: u32 = 1;\\n\\n/// Direct 16 bit\\n\\npub const R_68K_16: u32 = 2;\\n\\n/// Direct 8 bit\\n\\npub const R_68K_8: u32 = 3;\\n\",\n \"file_path\": \"src/elf.rs\",\n \"rank\": 0,\n \"score\": 457849.2697326131\n },\n {\n \"content\": \"/// Calculate the SysV hash for a symbol name.\\n\\n///\\n\\n/// Used for `SHT_HASH`.\\n\\npub fn hash(name: &[u8]) -> u32 {\\n\\n let mut hash = 0u32;\\n\\n for byte in name {\\n\\n hash = hash.wrapping_mul(16).wrapping_add(u32::from(*byte));\\n\\n hash ^= (hash >> 24) & 0xf0;\\n\\n }\\n\\n hash & 0xfff_ffff\\n\\n}\\n\\n\\n\\n/// Header of `SHT_GNU_HASH` section.\\n\\n#[derive(Debug, Clone, Copy)]\\n\\n#[repr(C)]\\n\\npub struct GnuHashHeader<E: Endian> {\\n\\n /// The number of hash buckets.\\n\\n pub bucket_count: U32<E>,\\n\\n /// The symbol table index of the first symbol in the hash.\\n\\n pub symbol_base: U32<E>,\\n\\n /// The number of words in the bloom filter.\\n\\n ///\\n\\n /// Must be a non-zero power of 2.\\n\",\n \"file_path\": \"src/elf.rs\",\n \"rank\": 1,\n \"score\": 447105.9927822598\n },\n {\n \"content\": \"fn print_elf<Elf: FileHeader<Endian = Endianness>>(p: &mut Printer<'_>, elf: &Elf, data: &[u8]) {\\n\\n if let Some(endian) = elf.endian().print_err(p) {\\n\\n print_file_header(p, endian, elf);\\n\\n if let Some(segments) = elf.program_headers(endian, data).print_err(p) {\\n\\n print_program_headers(p, endian, data, elf, segments);\\n\\n }\\n\\n if let Some(sections) = elf.sections(endian, data).print_err(p) {\\n\\n print_section_headers(p, endian, data, elf, §ions);\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/examples/src/readobj/elf.rs\",\n \"rank\": 2,\n \"score\": 377068.45356425154\n },\n {\n \"content\": \"#[inline]\\n\\npub fn from_bytes_mut<T: Pod>(data: &mut [u8]) -> Result<(&mut T, &mut [u8])> {\\n\\n let size = mem::size_of::<T>();\\n\\n if size > data.len() {\\n\\n return Err(());\\n\\n }\\n\\n let (data, tail) = data.split_at_mut(size);\\n\\n let ptr = data.as_mut_ptr();\\n\\n if (ptr as usize) % mem::align_of::<T>() != 0 {\\n\\n return Err(());\\n\\n }\\n\\n // Safety:\\n\\n // The alignment and size are checked by this function.\\n\\n // The Pod trait ensures the type is valid to cast from bytes.\\n\\n let val = unsafe { &mut *ptr.cast() };\\n\\n Ok((val, tail))\\n\\n}\\n\\n\\n\\n/// Cast a byte slice to a slice of a `Pod` type.\\n\\n///\\n\\n/// Returns the type slice and the tail of the byte slice.\\n\",\n \"file_path\": \"src/pod.rs\",\n \"rank\": 3,\n \"score\": 369778.0266258335\n },\n {\n \"content\": \"/// Find the optional header and read the `optional_header.magic`.\\n\\n///\\n\\n/// It can be useful to know this magic value before trying to\\n\\n/// fully parse the NT headers.\\n\\npub fn optional_header_magic<'data, R: ReadRef<'data>>(data: R) -> Result<u16> {\\n\\n let dos_header = pe::ImageDosHeader::parse(data)?;\\n\\n // NT headers are at an offset specified in the DOS header.\\n\\n let offset = dos_header.nt_headers_offset().into();\\n\\n // It doesn't matter which NT header type is used for the purpose\\n\\n // of reading the optional header magic.\\n\\n let nt_headers = data\\n\\n .read_at::<pe::ImageNtHeaders32>(offset)\\n\\n .read_error(\\\"Invalid NT headers offset, size, or alignment\\\")?;\\n\\n if nt_headers.signature() != pe::IMAGE_NT_SIGNATURE {\\n\\n return Err(Error(\\\"Invalid PE magic\\\"));\\n\\n }\\n\\n Ok(nt_headers.optional_header().magic())\\n\\n}\\n\\n\\n\\n/// A trait for generic access to `ImageNtHeaders32` and `ImageNtHeaders64`.\\n\",\n \"file_path\": \"src/read/pe/file.rs\",\n \"rank\": 4,\n \"score\": 366984.3382301446\n },\n {\n \"content\": \"fn print_object_at(p: &mut Printer<'_>, data: &[u8], offset: u64) {\\n\\n let kind = match object::FileKind::parse_at(data, offset) {\\n\\n Ok(file) => file,\\n\\n Err(err) => {\\n\\n println!(\\\"Failed to parse file: {}\\\", err);\\n\\n return;\\n\\n }\\n\\n };\\n\\n match kind {\\n\\n object::FileKind::MachO32 => macho::print_macho32(p, data, offset),\\n\\n object::FileKind::MachO64 => macho::print_macho64(p, data, offset),\\n\\n // TODO\\n\\n _ => {}\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/examples/src/readobj/mod.rs\",\n \"rank\": 5,\n \"score\": 337345.104595638\n },\n {\n \"content\": \"fn parse_sysv_extended_name<'data>(digits: &[u8], names: &'data [u8]) -> Result<&'data [u8], ()> {\\n\\n let offset = parse_u64_digits(digits, 10).ok_or(())?;\\n\\n let offset = offset.try_into().map_err(|_| ())?;\\n\\n let name_data = names.get(offset..).ok_or(())?;\\n\\n let name = match memchr::memchr2(b'/', b'\\\\0', name_data) {\\n\\n Some(len) => &name_data[..len],\\n\\n None => name_data,\\n\\n };\\n\\n Ok(name)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/read/archive.rs\",\n \"rank\": 6,\n \"score\": 325886.3598654285\n },\n {\n \"content\": \"// Multi-key quicksort.\\n\\n//\\n\\n// Ordering is such that if a string is a suffix of at least one other string,\\n\\n// then it is placed immediately after one of those strings. That is:\\n\\n// - comparison starts at the end of the string\\n\\n// - shorter strings come later\\n\\n//\\n\\n// Based on the implementation in LLVM.\\n\\nfn sort(mut ids: &mut [usize], mut pos: usize, strings: &IndexSet<&[u8]>) {\\n\\n loop {\\n\\n if ids.len() <= 1 {\\n\\n return;\\n\\n }\\n\\n\\n\\n let pivot = byte(ids[0], pos, strings);\\n\\n let mut lower = 0;\\n\\n let mut upper = ids.len();\\n\\n let mut i = 1;\\n\\n while i < upper {\\n\\n let b = byte(ids[i], pos, strings);\\n\\n if b > pivot {\\n\\n ids.swap(lower, i);\\n\\n lower += 1;\\n\\n i += 1;\\n\\n } else if b < pivot {\\n\\n upper -= 1;\\n\\n ids.swap(upper, i);\\n\\n } else {\\n\",\n \"file_path\": \"src/write/string.rs\",\n \"rank\": 7,\n \"score\": 325411.50905295176\n },\n {\n \"content\": \"#[inline]\\n\\npub fn slice_from_bytes<T: Pod>(data: &[u8], count: usize) -> Result<(&[T], &[u8])> {\\n\\n let size = count.checked_mul(mem::size_of::<T>()).ok_or(())?;\\n\\n let tail = data.get(size..).ok_or(())?;\\n\\n let ptr = data.as_ptr();\\n\\n if (ptr as usize) % mem::align_of::<T>() != 0 {\\n\\n return Err(());\\n\\n }\\n\\n // Safety:\\n\\n // The alignment and size are checked by this function.\\n\\n // The Pod trait ensures the type is valid to cast from bytes.\\n\\n let slice = unsafe { slice::from_raw_parts(ptr.cast(), count) };\\n\\n Ok((slice, tail))\\n\\n}\\n\\n\\n\\n/// Cast a mutable byte slice to a slice of a `Pod` type.\\n\\n///\\n\\n/// Returns the type slice and the tail of the byte slice.\\n\",\n \"file_path\": \"src/pod.rs\",\n \"rank\": 8,\n \"score\": 325259.0808606861\n },\n {\n \"content\": \"#[inline]\\n\\npub fn from_bytes<T: Pod>(data: &[u8]) -> Result<(&T, &[u8])> {\\n\\n let size = mem::size_of::<T>();\\n\\n let tail = data.get(size..).ok_or(())?;\\n\\n let ptr = data.as_ptr();\\n\\n if (ptr as usize) % mem::align_of::<T>() != 0 {\\n\\n return Err(());\\n\\n }\\n\\n // Safety:\\n\\n // The alignment and size are checked by this function.\\n\\n // The Pod trait ensures the type is valid to cast from bytes.\\n\\n let val = unsafe { &*ptr.cast() };\\n\\n Ok((val, tail))\\n\\n}\\n\\n\\n\\n/// Cast a mutable byte slice to a `Pod` type.\\n\\n///\\n\\n/// Returns the type and the tail of the slice.\\n\",\n \"file_path\": \"src/pod.rs\",\n \"rank\": 9,\n \"score\": 310754.0350728393\n },\n {\n \"content\": \"fn print_file_header<Elf: FileHeader>(p: &mut Printer<'_>, endian: Elf::Endian, elf: &Elf) {\\n\\n p.group(\\\"FileHeader\\\", |p| {\\n\\n p.group(\\\"Ident\\\", |p| print_ident(p, elf.e_ident()));\\n\\n p.field_enum(\\\"Type\\\", elf.e_type(endian), &FLAGS_ET);\\n\\n p.field_enum(\\\"Machine\\\", elf.e_machine(endian), &FLAGS_EM);\\n\\n let version = elf.e_version(endian);\\n\\n if version < 256 {\\n\\n p.field_enum(\\\"Version\\\", version as u8, &FLAGS_EV);\\n\\n } else {\\n\\n p.field_hex(\\\"Version\\\", version);\\n\\n }\\n\\n p.field_enum(\\\"Type\\\", elf.e_type(endian), &FLAGS_ET);\\n\\n p.field_hex(\\\"Entry\\\", elf.e_entry(endian).into());\\n\\n p.field_hex(\\\"ProgramHeaderOffset\\\", elf.e_phoff(endian).into());\\n\\n p.field_hex(\\\"SectionHeaderOffset\\\", elf.e_shoff(endian).into());\\n\\n let flags = elf.e_flags(endian);\\n\\n p.field_hex(\\\"Flags\\\", flags);\\n\\n match elf.e_machine(endian) {\\n\\n EM_SPARC => p.flags(flags, 0, &FLAGS_EF_SPARC),\\n\\n EM_SPARCV9 => p.flags(flags, 0, &FLAGS_EF_SPARCV9),\\n\",\n \"file_path\": \"crates/examples/src/readobj/elf.rs\",\n \"rank\": 10,\n \"score\": 307416.4899311814\n },\n {\n \"content\": \"fn find_member(member_names: &mut [(String, bool)], name: &[u8]) -> bool {\\n\\n if member_names.is_empty() {\\n\\n return true;\\n\\n }\\n\\n match member_names.iter().position(|x| x.0.as_bytes() == name) {\\n\\n Some(i) => {\\n\\n member_names[i].1 = true;\\n\\n true\\n\\n }\\n\\n None => false,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/examples/src/objdump.rs\",\n \"rank\": 11,\n \"score\": 294925.17773745663\n },\n {\n \"content\": \"fn rel_flag_type<Elf: FileHeader>(endian: Elf::Endian, elf: &Elf) -> &'static [Flag<u32>] {\\n\\n match elf.e_machine(endian) {\\n\\n EM_68K => FLAGS_R_68K,\\n\\n EM_386 => FLAGS_R_386,\\n\\n EM_SPARC => FLAGS_R_SPARC,\\n\\n EM_MIPS => FLAGS_R_MIPS,\\n\\n EM_PARISC => FLAGS_R_PARISC,\\n\\n EM_ALPHA => FLAGS_R_ALPHA,\\n\\n EM_PPC => FLAGS_R_PPC,\\n\\n EM_PPC64 => FLAGS_R_PPC64,\\n\\n EM_AARCH64 => FLAGS_R_AARCH64,\\n\\n EM_ARM => FLAGS_R_ARM,\\n\\n EM_CSKY => FLAGS_R_CKCORE,\\n\\n EM_IA_64 => FLAGS_R_IA64,\\n\\n EM_SH => FLAGS_R_SH,\\n\\n EM_S390 => FLAGS_R_390,\\n\\n EM_CRIS => FLAGS_R_CRIS,\\n\\n EM_X86_64 => FLAGS_R_X86_64,\\n\\n EM_MN10300 => FLAGS_R_MN10300,\\n\\n EM_M32R => FLAGS_R_M32R,\\n\",\n \"file_path\": \"crates/examples/src/readobj/elf.rs\",\n \"rank\": 12,\n \"score\": 294589.64894909906\n },\n {\n \"content\": \"fn print_rel_symbol<'data, Elf: FileHeader>(\\n\\n p: &mut Printer<'_>,\\n\\n endian: Elf::Endian,\\n\\n symbols: Option<SymbolTable<'data, Elf>>,\\n\\n sym: u32,\\n\\n) {\\n\\n let name = symbols.and_then(|symbols| {\\n\\n symbols\\n\\n .symbol(sym as usize)\\n\\n .and_then(|symbol| symbol.name(endian, symbols.strings()))\\n\\n .print_err(p)\\n\\n });\\n\\n p.field_string_option(\\\"Symbol\\\", sym, name);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/examples/src/readobj/elf.rs\",\n \"rank\": 13,\n \"score\": 276827.9655994783\n },\n {\n \"content\": \"// JamCRC\\n\\nfn checksum(data: &[u8]) -> u32 {\\n\\n let mut hasher = crc32fast::Hasher::new_with_initial(0xffff_ffff);\\n\\n hasher.update(data);\\n\\n !hasher.finalize()\\n\\n}\\n\",\n \"file_path\": \"src/write/coff.rs\",\n \"rank\": 14,\n \"score\": 276009.2438576237\n },\n {\n \"content\": \"fn byte(id: usize, pos: usize, strings: &IndexSet<&[u8]>) -> u8 {\\n\\n let string = strings.get_index(id).unwrap();\\n\\n let len = string.len();\\n\\n if len >= pos {\\n\\n string[len - pos]\\n\\n } else {\\n\\n // We know the strings don't contain null bytes.\\n\\n 0\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\\n fn string_table() {\\n\\n let mut table = StringTable::default();\\n\\n let id0 = table.add(b\\\"\\\");\\n\\n let id1 = table.add(b\\\"foo\\\");\\n\",\n \"file_path\": \"src/write/string.rs\",\n \"rank\": 15,\n \"score\": 272267.34486359457\n },\n {\n \"content\": \"/// Modifies `data` to start after the extended name.\\n\\nfn parse_bsd_extended_name<'data, R: ReadRef<'data>>(\\n\\n digits: &[u8],\\n\\n data: R,\\n\\n offset: &mut u64,\\n\\n size: &mut u64,\\n\\n) -> Result<&'data [u8], ()> {\\n\\n let len = parse_u64_digits(digits, 10).ok_or(())?;\\n\\n *size = size.checked_sub(len).ok_or(())?;\\n\\n let name_data = data.read_bytes(offset, len)?;\\n\\n let name = match memchr::memchr(b'\\\\0', name_data) {\\n\\n Some(len) => &name_data[..len],\\n\\n None => name_data,\\n\\n };\\n\\n Ok(name)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n\\n\",\n \"file_path\": \"src/read/archive.rs\",\n \"rank\": 16,\n \"score\": 269351.76576054026\n },\n {\n \"content\": \"fn dump_object<W: Write, E: Write>(w: &mut W, e: &mut E, data: &[u8]) -> Result<()> {\\n\\n match object::File::parse(data) {\\n\\n Ok(file) => {\\n\\n dump_parsed_object(w, e, &file)?;\\n\\n }\\n\\n Err(err) => {\\n\\n writeln!(e, \\\"Failed to parse file: {}\\\", err)?;\\n\\n }\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/examples/src/objdump.rs\",\n \"rank\": 17,\n \"score\": 265849.2867492222\n },\n {\n \"content\": \"fn print_gnu_hash<Elf: FileHeader>(\\n\\n p: &mut Printer<'_>,\\n\\n endian: Elf::Endian,\\n\\n data: &[u8],\\n\\n _elf: &Elf,\\n\\n _sections: &SectionTable<Elf>,\\n\\n section: &Elf::SectionHeader,\\n\\n) {\\n\\n if let Some(Some(hash)) = section.gnu_hash_header(endian, data).print_err(p) {\\n\\n p.group(\\\"GnuHash\\\", |p| {\\n\\n p.field(\\\"BucketCount\\\", hash.bucket_count.get(endian));\\n\\n p.field(\\\"SymbolBase\\\", hash.symbol_base.get(endian));\\n\\n p.field(\\\"BloomCount\\\", hash.bloom_count.get(endian));\\n\\n p.field(\\\"BloomShift\\\", hash.bloom_shift.get(endian));\\n\\n });\\n\\n }\\n\\n /* TODO: add this in a test somewhere\\n\\n if let Ok(Some((hash_table, link))) = section.gnu_hash(endian, data) {\\n\\n if let Ok(symbols) = _sections.symbol_table_by_index(endian, data, link) {\\n\\n if let Ok(versions) = _sections.versions(endian, data) {\\n\",\n \"file_path\": \"crates/examples/src/readobj/elf.rs\",\n \"rank\": 18,\n \"score\": 260633.967568488\n },\n {\n \"content\": \"#[inline]\\n\\npub fn bytes_of_mut<T: Pod>(val: &mut T) -> &mut [u8] {\\n\\n let size = mem::size_of::<T>();\\n\\n // Safety:\\n\\n // Any alignment is allowed.\\n\\n // The size is determined in this function.\\n\\n // The Pod trait ensures the type is valid to cast to bytes.\\n\\n unsafe { slice::from_raw_parts_mut(slice::from_mut(val).as_mut_ptr().cast(), size) }\\n\\n}\\n\\n\\n\\n/// Cast a slice of a `Pod` type to a byte slice.\\n\",\n \"file_path\": \"src/pod.rs\",\n \"rank\": 19,\n \"score\": 255103.8613870678\n },\n {\n \"content\": \"fn print_pe<Pe: ImageNtHeaders>(p: &mut Printer<'_>, data: &[u8]) {\\n\\n if let Some(dos_header) = ImageDosHeader::parse(data).print_err(p) {\\n\\n p.group(\\\"ImageDosHeader\\\", |p| {\\n\\n p.field_hex(\\\"Magic\\\", dos_header.e_magic.get(LE));\\n\\n p.field_hex(\\\"CountBytesLastPage\\\", dos_header.e_cblp.get(LE));\\n\\n p.field_hex(\\\"CountPages\\\", dos_header.e_cp.get(LE));\\n\\n p.field_hex(\\\"CountRelocations\\\", dos_header.e_crlc.get(LE));\\n\\n p.field_hex(\\\"CountHeaderParagraphs\\\", dos_header.e_cparhdr.get(LE));\\n\\n p.field_hex(\\\"MinAllocParagraphs\\\", dos_header.e_minalloc.get(LE));\\n\\n p.field_hex(\\\"MaxAllocParagraphs\\\", dos_header.e_maxalloc.get(LE));\\n\\n p.field_hex(\\\"StackSegment\\\", dos_header.e_ss.get(LE));\\n\\n p.field_hex(\\\"StackPointer\\\", dos_header.e_sp.get(LE));\\n\\n p.field_hex(\\\"Checksum\\\", dos_header.e_csum.get(LE));\\n\\n p.field_hex(\\\"InstructionPointer\\\", dos_header.e_ip.get(LE));\\n\\n p.field_hex(\\\"CodeSegment\\\", dos_header.e_cs.get(LE));\\n\\n p.field_hex(\\\"AddressOfRelocations\\\", dos_header.e_lfarlc.get(LE));\\n\\n p.field_hex(\\\"OverlayNumber\\\", dos_header.e_ovno.get(LE));\\n\\n p.field_hex(\\\"OemId\\\", dos_header.e_oemid.get(LE));\\n\\n p.field_hex(\\\"OemInfo\\\", dos_header.e_oeminfo.get(LE));\\n\\n p.field_hex(\\\"AddressOfNewHeader\\\", dos_header.e_lfanew.get(LE));\\n\",\n \"file_path\": \"crates/examples/src/readobj/pe.rs\",\n \"rank\": 20,\n \"score\": 252949.6590471919\n },\n {\n \"content\": \"#[inline]\\n\\npub fn bytes_of_slice_mut<T: Pod>(val: &mut [T]) -> &mut [u8] {\\n\\n let size = val.len().wrapping_mul(mem::size_of::<T>());\\n\\n // Safety:\\n\\n // Any alignment is allowed.\\n\\n // The size is determined in this function.\\n\\n // The Pod trait ensures the type is valid to cast to bytes.\\n\\n unsafe { slice::from_raw_parts_mut(val.as_mut_ptr().cast(), size) }\\n\\n}\\n\\n\\n\\nmacro_rules! unsafe_impl_pod {\\n\\n ($($struct_name:ident),+ $(,)?) => {\\n\\n $(\\n\\n unsafe impl Pod for $struct_name { }\\n\\n )+\\n\\n }\\n\\n}\\n\\n\\n\\nunsafe_impl_pod!(u8, u16, u32, u64);\\n\\n\\n\\n#[cfg(test)]\\n\",\n \"file_path\": \"src/pod.rs\",\n \"rank\": 21,\n \"score\": 251646.38411224203\n },\n {\n \"content\": \"// Ignores bytes starting from the first space.\\n\\nfn parse_u64_digits(digits: &[u8], radix: u32) -> Option<u64> {\\n\\n if let [b' ', ..] = digits {\\n\\n return None;\\n\\n }\\n\\n let mut result: u64 = 0;\\n\\n for &c in digits {\\n\\n if c == b' ' {\\n\\n return Some(result);\\n\\n } else {\\n\\n let x = (c as char).to_digit(radix)?;\\n\\n result = result\\n\\n .checked_mul(u64::from(radix))?\\n\\n .checked_add(u64::from(x))?;\\n\\n }\\n\\n }\\n\\n Some(result)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/read/archive.rs\",\n \"rank\": 22,\n \"score\": 249910.74978341634\n },\n {\n \"content\": \"fn print_mach_header<Mach: MachHeader>(p: &mut Printer<'_>, endian: Mach::Endian, header: &Mach) {\\n\\n p.group(\\\"MachHeader\\\", |p| {\\n\\n p.field_hex(\\\"Magic\\\", header.magic().to_be());\\n\\n print_cputype(p, header.cputype(endian), header.cpusubtype(endian));\\n\\n p.field_enum(\\\"FileType\\\", header.filetype(endian), FLAGS_MH_FILETYPE);\\n\\n p.field(\\\"NumberOfCmds\\\", header.ncmds(endian));\\n\\n p.field_hex(\\\"SizeOfCmds\\\", header.sizeofcmds(endian));\\n\\n p.field_enum(\\\"Flags\\\", header.flags(endian), FLAGS_MH);\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/examples/src/readobj/macho.rs\",\n \"rank\": 23,\n \"score\": 240041.98551592723\n },\n {\n \"content\": \"fn print_archive(p: &mut Printer<'_>, data: &[u8]) {\\n\\n if let Some(archive) = ArchiveFile::parse(data).print_err(p) {\\n\\n p.field(\\\"Format\\\", format!(\\\"Archive ({:?})\\\", archive.kind()));\\n\\n for member in archive.members() {\\n\\n if let Some(member) = member.print_err(p) {\\n\\n p.blank();\\n\\n p.field(\\\"Member\\\", String::from_utf8_lossy(member.name()));\\n\\n if let Some(data) = member.data(data).print_err(p) {\\n\\n print_object(p, data);\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/examples/src/readobj/mod.rs\",\n \"rank\": 24,\n \"score\": 239966.57031160692\n },\n {\n \"content\": \"fn print_object(p: &mut Printer<'_>, data: &[u8]) {\\n\\n let kind = match object::FileKind::parse(data) {\\n\\n Ok(file) => file,\\n\\n Err(err) => {\\n\\n println!(\\\"Failed to parse file: {}\\\", err);\\n\\n return;\\n\\n }\\n\\n };\\n\\n match kind {\\n\\n object::FileKind::Archive => print_archive(p, data),\\n\\n object::FileKind::Coff => pe::print_coff(p, data),\\n\\n object::FileKind::DyldCache => macho::print_dyld_cache(p, data),\\n\\n object::FileKind::Elf32 => elf::print_elf32(p, data),\\n\\n object::FileKind::Elf64 => elf::print_elf64(p, data),\\n\\n object::FileKind::MachO32 => macho::print_macho32(p, data, 0),\\n\\n object::FileKind::MachO64 => macho::print_macho64(p, data, 0),\\n\\n object::FileKind::MachOFat32 => macho::print_macho_fat32(p, data),\\n\\n object::FileKind::MachOFat64 => macho::print_macho_fat64(p, data),\\n\\n object::FileKind::Pe32 => pe::print_pe32(p, data),\\n\\n object::FileKind::Pe64 => pe::print_pe64(p, data),\\n\\n // TODO\\n\\n _ => {}\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/examples/src/readobj/mod.rs\",\n \"rank\": 25,\n \"score\": 239966.57031160692\n },\n {\n \"content\": \"fn print_hash<Elf: FileHeader>(\\n\\n p: &mut Printer<'_>,\\n\\n endian: Elf::Endian,\\n\\n data: &[u8],\\n\\n _elf: &Elf,\\n\\n _sections: &SectionTable<Elf>,\\n\\n section: &Elf::SectionHeader,\\n\\n) {\\n\\n if let Some(Some(hash)) = section.hash_header(endian, data).print_err(p) {\\n\\n p.group(\\\"Hash\\\", |p| {\\n\\n p.field(\\\"BucketCount\\\", hash.bucket_count.get(endian));\\n\\n p.field(\\\"ChainCount\\\", hash.chain_count.get(endian));\\n\\n });\\n\\n }\\n\\n /* TODO: add this in a test somewhere\\n\\n if let Ok(Some((hash_table, link))) = section.hash(endian, data) {\\n\\n if let Ok(symbols) = _sections.symbol_table_by_index(endian, data, link) {\\n\\n if let Ok(versions) = _sections.versions(endian, data) {\\n\\n for (index, symbol) in symbols.symbols().iter().enumerate() {\\n\\n let name = symbols.symbol_name(endian, symbol).unwrap();\\n\",\n \"file_path\": \"crates/examples/src/readobj/elf.rs\",\n \"rank\": 26,\n \"score\": 224627.02315400602\n },\n {\n \"content\": \"fn print_version<Elf: FileHeader>(\\n\\n p: &mut Printer<'_>,\\n\\n versions: Option<&VersionTable<Elf>>,\\n\\n version_index: VersionIndex,\\n\\n) {\\n\\n match versions.and_then(|versions| versions.version(version_index).print_err(p)) {\\n\\n Some(Some(version)) => {\\n\\n p.field_string_option(\\\"Version\\\", version_index.0, Some(version.name()))\\n\\n }\\n\\n _ => p.field_enum(\\\"Version\\\", version_index.0, FLAGS_VER_NDX),\\n\\n }\\n\\n p.flags(version_index.0, 0, FLAGS_VERSYM);\\n\\n}\\n\\n\\n\\nstatic FLAGS_EI_CLASS: &[Flag<u8>] = &flags!(ELFCLASSNONE, ELFCLASS32, ELFCLASS64);\\n\\nstatic FLAGS_EI_DATA: &[Flag<u8>] = &flags!(ELFDATANONE, ELFDATA2LSB, ELFDATA2MSB);\\n\\nstatic FLAGS_EV: &[Flag<u8>] = &flags!(EV_NONE, EV_CURRENT);\\n\\nstatic FLAGS_EI_OSABI: &[Flag<u8>] = &flags!(\\n\\n ELFOSABI_SYSV,\\n\\n ELFOSABI_HPUX,\\n\",\n \"file_path\": \"crates/examples/src/readobj/elf.rs\",\n \"rank\": 27,\n \"score\": 224609.54311881695\n },\n {\n \"content\": \"pub fn print(w: &'_ mut dyn Write, e: &'_ mut dyn Write, file: &[u8]) {\\n\\n let mut printer = Printer::new(w, e);\\n\\n print_object(&mut printer, &*file);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/examples/src/readobj/mod.rs\",\n \"rank\": 28,\n \"score\": 222528.19473344937\n },\n {\n \"content\": \"fn print_gnu_verneed<Elf: FileHeader>(\\n\\n p: &mut Printer<'_>,\\n\\n endian: Elf::Endian,\\n\\n data: &[u8],\\n\\n _elf: &Elf,\\n\\n sections: &SectionTable<Elf>,\\n\\n section: &Elf::SectionHeader,\\n\\n) {\\n\\n if let Some(Some((mut verneeds, link))) = section.gnu_verneed(endian, data).print_err(p) {\\n\\n let strings = sections.strings(endian, data, link).unwrap_or_default();\\n\\n while let Some(Some((verneed, mut vernauxs))) = verneeds.next().print_err(p) {\\n\\n p.group(\\\"VersionNeed\\\", |p| {\\n\\n p.field(\\\"Version\\\", verneed.vn_version.get(endian));\\n\\n p.field(\\\"AuxCount\\\", verneed.vn_cnt.get(endian));\\n\\n p.field_string(\\n\\n \\\"Filename\\\",\\n\\n verneed.vn_file.get(endian),\\n\\n verneed.file(endian, strings),\\n\\n );\\n\\n p.field(\\\"AuxOffset\\\", verneed.vn_aux.get(endian));\\n\",\n \"file_path\": \"crates/examples/src/readobj/elf.rs\",\n \"rank\": 29,\n \"score\": 220777.35480574917\n },\n {\n \"content\": \"fn print_gnu_versym<Elf: FileHeader>(\\n\\n p: &mut Printer<'_>,\\n\\n endian: Elf::Endian,\\n\\n data: &[u8],\\n\\n _elf: &Elf,\\n\\n sections: &SectionTable<Elf>,\\n\\n section: &Elf::SectionHeader,\\n\\n) {\\n\\n if let Some(Some((syms, _link))) = section.gnu_versym(endian, data).print_err(p) {\\n\\n let versions = sections.versions(endian, data).print_err(p).flatten();\\n\\n for (index, sym) in syms.iter().enumerate() {\\n\\n let version_index = VersionIndex(sym.0.get(endian));\\n\\n p.group(\\\"VersionSymbol\\\", |p| {\\n\\n p.field(\\\"Index\\\", index);\\n\\n print_version(p, versions.as_ref(), version_index);\\n\\n });\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/examples/src/readobj/elf.rs\",\n \"rank\": 30,\n \"score\": 220777.35480574917\n },\n {\n \"content\": \"fn print_gnu_verdef<Elf: FileHeader>(\\n\\n p: &mut Printer<'_>,\\n\\n endian: Elf::Endian,\\n\\n data: &[u8],\\n\\n _elf: &Elf,\\n\\n sections: &SectionTable<Elf>,\\n\\n section: &Elf::SectionHeader,\\n\\n) {\\n\\n if let Some(Some((mut verdefs, link))) = section.gnu_verdef(endian, data).print_err(p) {\\n\\n let strings = sections.strings(endian, data, link).unwrap_or_default();\\n\\n while let Some(Some((verdef, mut verdauxs))) = verdefs.next().print_err(p) {\\n\\n p.group(\\\"VersionDefinition\\\", |p| {\\n\\n p.field(\\\"Version\\\", verdef.vd_version.get(endian));\\n\\n p.field_hex(\\\"Flags\\\", verdef.vd_flags.get(endian));\\n\\n p.flags(verdef.vd_flags.get(endian), 0, FLAGS_VER_FLG);\\n\\n p.field(\\\"Index\\\", verdef.vd_ndx.get(endian));\\n\\n p.field(\\\"AuxCount\\\", verdef.vd_cnt.get(endian));\\n\\n p.field_hex(\\\"Hash\\\", verdef.vd_hash.get(endian));\\n\\n p.field(\\\"AuxOffset\\\", verdef.vd_aux.get(endian));\\n\\n p.field(\\\"NextOffset\\\", verdef.vd_next.get(endian));\\n\",\n \"file_path\": \"crates/examples/src/readobj/elf.rs\",\n \"rank\": 31,\n \"score\": 220777.35480574917\n },\n {\n \"content\": \"fn print_section_symbols<Elf: FileHeader>(\\n\\n p: &mut Printer<'_>,\\n\\n endian: Elf::Endian,\\n\\n data: &[u8],\\n\\n elf: &Elf,\\n\\n sections: &SectionTable<Elf>,\\n\\n section_index: SectionIndex,\\n\\n section: &Elf::SectionHeader,\\n\\n) {\\n\\n if let Some(Some(symbols)) = section\\n\\n .symbols(endian, data, sections, section_index)\\n\\n .print_err(p)\\n\\n {\\n\\n let versions = if section.sh_type(endian) == SHT_DYNSYM {\\n\\n sections.versions(endian, data).print_err(p).flatten()\\n\\n } else {\\n\\n None\\n\\n };\\n\\n let os_stt = match elf.e_ident().os_abi {\\n\\n ELFOSABI_GNU => FLAGS_STT_GNU,\\n\",\n \"file_path\": \"crates/examples/src/readobj/elf.rs\",\n \"rank\": 32,\n \"score\": 220562.50869487342\n },\n {\n \"content\": \"#[allow(missing_docs)]\\n\\npub trait Sym: Debug + Pod {\\n\\n type Word: Into<u64>;\\n\\n type Endian: endian::Endian;\\n\\n\\n\\n fn st_name(&self, endian: Self::Endian) -> u32;\\n\\n fn st_info(&self) -> u8;\\n\\n fn st_bind(&self) -> u8;\\n\\n fn st_type(&self) -> u8;\\n\\n fn st_other(&self) -> u8;\\n\\n fn st_visibility(&self) -> u8;\\n\\n fn st_shndx(&self, endian: Self::Endian) -> u16;\\n\\n fn st_value(&self, endian: Self::Endian) -> Self::Word;\\n\\n fn st_size(&self, endian: Self::Endian) -> Self::Word;\\n\\n\\n\\n /// Parse the symbol name from the string table.\\n\\n fn name<'data, R: ReadRef<'data>>(\\n\\n &self,\\n\\n endian: Self::Endian,\\n\\n strings: StringTable<'data, R>,\\n\\n ) -> read::Result<&'data [u8]> {\\n\",\n \"file_path\": \"src/read/elf/symbol.rs\",\n \"rank\": 33,\n \"score\": 220003.02433040418\n },\n {\n \"content\": \"// Only for Debug impl of `Bytes`.\\n\\nfn debug_list_bytes(bytes: &[u8], fmt: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n let mut list = fmt.debug_list();\\n\\n list.entries(bytes.iter().take(8).copied().map(DebugByte));\\n\\n if bytes.len() > 8 {\\n\\n list.entry(&DebugLen(bytes.len()));\\n\\n }\\n\\n list.finish()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/read/util.rs\",\n \"rank\": 34,\n \"score\": 216935.76255675702\n },\n {\n \"content\": \"#[derive(Default, Clone, Copy)]\\n\\nstruct SymbolOffsets {\\n\\n index: SymbolIndex,\\n\\n str_id: Option<StringId>,\\n\\n}\\n\\n\\n\\nimpl<'a> Object<'a> {\\n\\n pub(crate) fn elf_section_info(\\n\\n &self,\\n\\n section: StandardSection,\\n\\n ) -> (&'static [u8], &'static [u8], SectionKind) {\\n\\n match section {\\n\\n StandardSection::Text => (&[], &b\\\".text\\\"[..], SectionKind::Text),\\n\\n StandardSection::Data => (&[], &b\\\".data\\\"[..], SectionKind::Data),\\n\\n StandardSection::ReadOnlyData | StandardSection::ReadOnlyString => {\\n\\n (&[], &b\\\".rodata\\\"[..], SectionKind::ReadOnlyData)\\n\\n }\\n\\n StandardSection::ReadOnlyDataWithRel => (&[], b\\\".data.rel.ro\\\", SectionKind::Data),\\n\\n StandardSection::UninitializedData => {\\n\\n (&[], &b\\\".bss\\\"[..], SectionKind::UninitializedData)\\n\\n }\\n\",\n \"file_path\": \"src/write/elf/object.rs\",\n \"rank\": 35,\n \"score\": 211693.50703931542\n },\n {\n \"content\": \"fn print_program_headers<Elf: FileHeader>(\\n\\n p: &mut Printer<'_>,\\n\\n endian: Elf::Endian,\\n\\n data: &[u8],\\n\\n elf: &Elf,\\n\\n segments: &[Elf::ProgramHeader],\\n\\n) {\\n\\n for segment in segments {\\n\\n p.group(\\\"ProgramHeader\\\", |p| {\\n\\n let proc = match elf.e_machine(endian) {\\n\\n EM_MIPS => FLAGS_PT_MIPS,\\n\\n EM_PARISC => FLAGS_PT_PARISC,\\n\\n EM_ARM => FLAGS_PT_ARM,\\n\\n EM_IA_64 => FLAGS_PT_IA_64,\\n\\n _ => &[],\\n\\n };\\n\\n let os = match elf.e_ident().os_abi {\\n\\n ELFOSABI_HPUX => FLAGS_PT_HP,\\n\\n _ => &[],\\n\\n };\\n\",\n \"file_path\": \"crates/examples/src/readobj/elf.rs\",\n \"rank\": 36,\n \"score\": 193475.13363837203\n },\n {\n \"content\": \"fn print_section_headers<Elf: FileHeader>(\\n\\n p: &mut Printer<'_>,\\n\\n endian: Elf::Endian,\\n\\n data: &[u8],\\n\\n elf: &Elf,\\n\\n sections: &SectionTable<Elf>,\\n\\n) {\\n\\n for (index, section) in sections.iter().enumerate() {\\n\\n let index = SectionIndex(index);\\n\\n p.group(\\\"SectionHeader\\\", |p| {\\n\\n p.field(\\\"Index\\\", index.0);\\n\\n p.field_string(\\n\\n \\\"Name\\\",\\n\\n section.sh_name(endian),\\n\\n sections.section_name(endian, section),\\n\\n );\\n\\n\\n\\n let proc = match elf.e_machine(endian) {\\n\\n EM_MIPS => FLAGS_SHT_MIPS,\\n\\n EM_PARISC => FLAGS_SHT_PARISC,\\n\",\n \"file_path\": \"crates/examples/src/readobj/elf.rs\",\n \"rank\": 37,\n \"score\": 193475.13363837203\n },\n {\n \"content\": \"#[derive(Clone, Debug)]\\n\\nstruct WasmSymbolInternal<'data> {\\n\\n name: &'data str,\\n\\n address: u64,\\n\\n size: u64,\\n\\n kind: SymbolKind,\\n\\n section: SymbolSection,\\n\\n scope: SymbolScope,\\n\\n}\\n\\n\\n\\nimpl<'data, 'file> read::private::Sealed for WasmSymbol<'data, 'file> {}\\n\\n\\n\\nimpl<'data, 'file> ObjectSymbol<'data> for WasmSymbol<'data, 'file> {\\n\\n #[inline]\\n\\n fn index(&self) -> SymbolIndex {\\n\\n self.index\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn name_bytes(&self) -> read::Result<&'data [u8]> {\\n\\n Ok(self.symbol.name.as_bytes())\\n\",\n \"file_path\": \"src/read/wasm.rs\",\n \"rank\": 38,\n \"score\": 191813.211116139\n },\n {\n \"content\": \"fn parse_ordinal(digits: &[u8]) -> Option<u32> {\\n\\n if digits.is_empty() {\\n\\n return None;\\n\\n }\\n\\n let mut result: u32 = 0;\\n\\n for &c in digits {\\n\\n let x = (c as char).to_digit(10)?;\\n\\n result = result.checked_mul(10)?.checked_add(x)?;\\n\\n }\\n\\n Some(result)\\n\\n}\\n\",\n \"file_path\": \"src/read/pe/export.rs\",\n \"rank\": 39,\n \"score\": 191467.0357393294\n },\n {\n \"content\": \"fn print_cputype(p: &mut Printer<'_>, cputype: u32, cpusubtype: u32) {\\n\\n let proc = match cputype {\\n\\n CPU_TYPE_ANY => FLAGS_CPU_SUBTYPE_ANY,\\n\\n CPU_TYPE_VAX => FLAGS_CPU_SUBTYPE_VAX,\\n\\n CPU_TYPE_MC680X0 => FLAGS_CPU_SUBTYPE_MC680X0,\\n\\n CPU_TYPE_X86 => FLAGS_CPU_SUBTYPE_X86,\\n\\n CPU_TYPE_X86_64 => FLAGS_CPU_SUBTYPE_X86_64,\\n\\n CPU_TYPE_MIPS => FLAGS_CPU_SUBTYPE_MIPS,\\n\\n CPU_TYPE_MC98000 => FLAGS_CPU_SUBTYPE_MC98000,\\n\\n CPU_TYPE_HPPA => FLAGS_CPU_SUBTYPE_HPPA,\\n\\n CPU_TYPE_ARM => FLAGS_CPU_SUBTYPE_ARM,\\n\\n CPU_TYPE_ARM64 => FLAGS_CPU_SUBTYPE_ARM64,\\n\\n CPU_TYPE_ARM64_32 => FLAGS_CPU_SUBTYPE_ARM64_32,\\n\\n CPU_TYPE_MC88000 => FLAGS_CPU_SUBTYPE_MC88000,\\n\\n CPU_TYPE_SPARC => FLAGS_CPU_SUBTYPE_SPARC,\\n\\n CPU_TYPE_I860 => FLAGS_CPU_SUBTYPE_I860,\\n\\n CPU_TYPE_POWERPC | CPU_TYPE_POWERPC64 => FLAGS_CPU_SUBTYPE_POWERPC,\\n\\n _ => &[],\\n\\n };\\n\\n p.field_enum(\\\"CpuType\\\", cputype, FLAGS_CPU_TYPE);\\n\",\n \"file_path\": \"crates/examples/src/readobj/macho.rs\",\n \"rank\": 40,\n \"score\": 189716.71859798458\n },\n {\n \"content\": \"fn print_file(p: &mut Printer<'_>, header: &ImageFileHeader) {\\n\\n p.group(\\\"ImageFileHeader\\\", |p| {\\n\\n p.field_enum(\\\"Machine\\\", header.machine.get(LE), FLAGS_IMAGE_FILE_MACHINE);\\n\\n p.field(\\\"NumberOfSections\\\", header.number_of_sections.get(LE));\\n\\n p.field(\\\"TimeDateStamp\\\", header.time_date_stamp.get(LE));\\n\\n p.field_hex(\\n\\n \\\"PointerToSymbolTable\\\",\\n\\n header.pointer_to_symbol_table.get(LE),\\n\\n );\\n\\n p.field(\\\"NumberOfSymbols\\\", header.number_of_symbols.get(LE));\\n\\n p.field_hex(\\n\\n \\\"SizeOfOptionalHeader\\\",\\n\\n header.size_of_optional_header.get(LE),\\n\\n );\\n\\n p.field_hex(\\\"Characteristics\\\", header.characteristics.get(LE));\\n\\n p.flags(header.characteristics.get(LE), 0, FLAGS_IMAGE_FILE);\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/examples/src/readobj/pe.rs\",\n \"rank\": 41,\n \"score\": 187289.36584175064\n },\n {\n \"content\": \"fn parse_relocation<Elf: FileHeader>(\\n\\n header: &Elf,\\n\\n endian: Elf::Endian,\\n\\n reloc: Elf::Rela,\\n\\n implicit_addend: bool,\\n\\n) -> Relocation {\\n\\n let mut encoding = RelocationEncoding::Generic;\\n\\n let is_mips64el = header.is_mips64el(endian);\\n\\n let (kind, size) = match header.e_machine(endian) {\\n\\n elf::EM_AARCH64 => match reloc.r_type(endian, false) {\\n\\n elf::R_AARCH64_ABS64 => (RelocationKind::Absolute, 64),\\n\\n elf::R_AARCH64_ABS32 => (RelocationKind::Absolute, 32),\\n\\n elf::R_AARCH64_ABS16 => (RelocationKind::Absolute, 16),\\n\\n elf::R_AARCH64_PREL64 => (RelocationKind::Relative, 64),\\n\\n elf::R_AARCH64_PREL32 => (RelocationKind::Relative, 32),\\n\\n elf::R_AARCH64_PREL16 => (RelocationKind::Relative, 16),\\n\\n elf::R_AARCH64_CALL26 => {\\n\\n encoding = RelocationEncoding::AArch64Call;\\n\\n (RelocationKind::PltRelative, 26)\\n\\n }\\n\",\n \"file_path\": \"src/read/elf/relocation.rs\",\n \"rank\": 42,\n \"score\": 186736.64671381464\n },\n {\n \"content\": \"#[inline]\\n\\npub fn bytes_of<T: Pod>(val: &T) -> &[u8] {\\n\\n let size = mem::size_of::<T>();\\n\\n // Safety:\\n\\n // Any alignment is allowed.\\n\\n // The size is determined in this function.\\n\\n // The Pod trait ensures the type is valid to cast to bytes.\\n\\n unsafe { slice::from_raw_parts(slice::from_ref(val).as_ptr().cast(), size) }\\n\\n}\\n\\n\\n\\n/// Cast a `Pod` type to a mutable byte slice.\\n\",\n \"file_path\": \"src/pod.rs\",\n \"rank\": 43,\n \"score\": 185488.74966241745\n },\n {\n \"content\": \"fn print_notes<Elf: FileHeader>(\\n\\n p: &mut Printer<'_>,\\n\\n endian: Elf::Endian,\\n\\n mut notes: NoteIterator<Elf>,\\n\\n) {\\n\\n while let Some(Some(note)) = notes.next().print_err(p) {\\n\\n p.group(\\\"Note\\\", |p| {\\n\\n let name = note.name();\\n\\n p.field_string_option(\\\"Name\\\", note.n_namesz(endian), Some(name));\\n\\n let flags = if name == ELF_NOTE_CORE || name == ELF_NOTE_LINUX {\\n\\n FLAGS_NT_CORE\\n\\n } else if name == ELF_NOTE_SOLARIS {\\n\\n FLAGS_NT_SOLARIS\\n\\n } else if name == ELF_NOTE_GNU {\\n\\n FLAGS_NT_GNU\\n\\n } else {\\n\\n // TODO: NT_VERSION\\n\\n &[]\\n\\n };\\n\\n p.field_enum(\\\"Type\\\", note.n_type(endian), flags);\\n\\n // TODO: interpret desc\\n\\n p.field_bytes(\\\"Desc\\\", note.desc());\\n\\n });\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/examples/src/readobj/elf.rs\",\n \"rank\": 44,\n \"score\": 183750.44569393288\n },\n {\n \"content\": \"fn print_dynamic<Elf: FileHeader>(\\n\\n p: &mut Printer<'_>,\\n\\n endian: Elf::Endian,\\n\\n elf: &Elf,\\n\\n dynamic: &[Elf::Dyn],\\n\\n dynstr: StringTable,\\n\\n) {\\n\\n let proc = match elf.e_machine(endian) {\\n\\n EM_SPARC => FLAGS_DT_SPARC,\\n\\n EM_MIPS => FLAGS_DT_MIPS,\\n\\n EM_ALPHA => FLAGS_DT_ALPHA,\\n\\n EM_PPC => FLAGS_DT_PPC,\\n\\n EM_PPC64 => FLAGS_DT_PPC64,\\n\\n EM_IA_64 => FLAGS_DT_IA_64,\\n\\n EM_ALTERA_NIOS2 => FLAGS_DT_NIOS2,\\n\\n _ => &[],\\n\\n };\\n\\n for d in dynamic {\\n\\n let tag = d.d_tag(endian).into();\\n\\n let val = d.d_val(endian).into();\\n\",\n \"file_path\": \"crates/examples/src/readobj/elf.rs\",\n \"rank\": 45,\n \"score\": 183750.44569393288\n },\n {\n \"content\": \"enum SymbolInternal<'data, 'file, R>\\n\\nwhere\\n\\n 'data: 'file,\\n\\n R: ReadRef<'data>,\\n\\n{\\n\\n #[cfg(feature = \\\"coff\\\")]\\n\\n Coff((coff::CoffSymbol<'data, 'file, R>, PhantomData<R>)),\\n\\n #[cfg(feature = \\\"elf\\\")]\\n\\n Elf32(\\n\\n (\\n\\n elf::ElfSymbol32<'data, 'file, Endianness, R>,\\n\\n PhantomData<R>,\\n\\n ),\\n\\n ),\\n\\n #[cfg(feature = \\\"elf\\\")]\\n\\n Elf64(\\n\\n (\\n\\n elf::ElfSymbol64<'data, 'file, Endianness, R>,\\n\\n PhantomData<R>,\\n\\n ),\\n\",\n \"file_path\": \"src/read/any.rs\",\n \"rank\": 46,\n \"score\": 183088.27647468843\n },\n {\n \"content\": \"#[inline]\\n\\npub fn bytes_of_slice<T: Pod>(val: &[T]) -> &[u8] {\\n\\n let size = val.len().wrapping_mul(mem::size_of::<T>());\\n\\n // Safety:\\n\\n // Any alignment is allowed.\\n\\n // The size is determined in this function.\\n\\n // The Pod trait ensures the type is valid to cast to bytes.\\n\\n unsafe { slice::from_raw_parts(val.as_ptr().cast(), size) }\\n\\n}\\n\\n\\n\\n/// Cast a slice of a `Pod` type to a mutable byte slice.\\n\",\n \"file_path\": \"src/pod.rs\",\n \"rank\": 47,\n \"score\": 182275.69241439167\n },\n {\n \"content\": \"fn print_optional(p: &mut Printer<'_>, header: &impl ImageOptionalHeader) {\\n\\n p.group(\\\"ImageOptionalHeader\\\", |p| {\\n\\n p.field_hex(\\\"Magic\\\", header.magic());\\n\\n p.field(\\\"MajorLinkerVersion\\\", header.major_linker_version());\\n\\n p.field(\\\"MinorLinkerVersion\\\", header.minor_linker_version());\\n\\n p.field_hex(\\\"SizeOfCode\\\", header.size_of_code());\\n\\n p.field_hex(\\\"SizeOfInitializedData\\\", header.size_of_initialized_data());\\n\\n p.field_hex(\\n\\n \\\"SizeOfUninitializedData\\\",\\n\\n header.size_of_uninitialized_data(),\\n\\n );\\n\\n p.field_hex(\\\"AddressOfEntryPoint\\\", header.address_of_entry_point());\\n\\n p.field_hex(\\\"BaseOfCode\\\", header.base_of_code());\\n\\n p.field_hex(\\\"ImageBase\\\", header.image_base());\\n\\n p.field_hex(\\\"SectionAlignment\\\", header.section_alignment());\\n\\n p.field(\\n\\n \\\"MajorOperatingSystemVersion\\\",\\n\\n header.major_operating_system_version(),\\n\\n );\\n\\n p.field(\\n\",\n \"file_path\": \"crates/examples/src/readobj/pe.rs\",\n \"rank\": 48,\n \"score\": 181252.71894957032\n },\n {\n \"content\": \"fn print_section_rel<Elf: FileHeader>(\\n\\n p: &mut Printer<'_>,\\n\\n endian: Elf::Endian,\\n\\n data: &[u8],\\n\\n elf: &Elf,\\n\\n sections: &SectionTable<Elf>,\\n\\n section: &Elf::SectionHeader,\\n\\n) {\\n\\n if let Some(Some((relocations, link))) = section.rel(endian, data).print_err(p) {\\n\\n let symbols = sections\\n\\n .symbol_table_by_index(endian, data, link)\\n\\n .print_err(p);\\n\\n let proc = rel_flag_type(endian, elf);\\n\\n for relocation in relocations {\\n\\n p.group(\\\"Relocation\\\", |p| {\\n\\n p.field_hex(\\\"Offset\\\", relocation.r_offset(endian).into());\\n\\n p.field_enum(\\\"Type\\\", relocation.r_type(endian), proc);\\n\\n let sym = relocation.r_sym(endian);\\n\\n print_rel_symbol(p, endian, symbols, sym);\\n\\n });\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/examples/src/readobj/elf.rs\",\n \"rank\": 49,\n \"score\": 180898.83353741473\n },\n {\n \"content\": \"fn print_section_rela<Elf: FileHeader>(\\n\\n p: &mut Printer<'_>,\\n\\n endian: Elf::Endian,\\n\\n data: &[u8],\\n\\n elf: &Elf,\\n\\n sections: &SectionTable<Elf>,\\n\\n section: &Elf::SectionHeader,\\n\\n) {\\n\\n if let Some(Some((relocations, link))) = section.rela(endian, data).print_err(p) {\\n\\n let symbols = sections\\n\\n .symbol_table_by_index(endian, data, link)\\n\\n .print_err(p);\\n\\n let proc = rel_flag_type(endian, elf);\\n\\n for relocation in relocations {\\n\\n p.group(\\\"Relocation\\\", |p| {\\n\\n p.field_hex(\\\"Offset\\\", relocation.r_offset(endian).into());\\n\\n p.field_enum(\\n\\n \\\"Type\\\",\\n\\n relocation.r_type(endian, elf.is_mips64el(endian)),\\n\\n proc,\\n\",\n \"file_path\": \"crates/examples/src/readobj/elf.rs\",\n \"rank\": 50,\n \"score\": 180898.83353741473\n },\n {\n \"content\": \"fn print_section_group<Elf: FileHeader>(\\n\\n p: &mut Printer<'_>,\\n\\n endian: Elf::Endian,\\n\\n data: &[u8],\\n\\n _elf: &Elf,\\n\\n sections: &SectionTable<Elf>,\\n\\n section: &Elf::SectionHeader,\\n\\n) {\\n\\n if let Some(Some((flag, members))) = section.group(endian, data).print_err(p) {\\n\\n p.field_enum(\\\"GroupFlag\\\", flag, FLAGS_GRP);\\n\\n p.group(\\\"GroupSections\\\", |p| {\\n\\n for member in members {\\n\\n let index = member.get(endian);\\n\\n p.print_indent();\\n\\n if let Some(section) = sections.section(SectionIndex(index as usize)).print_err(p) {\\n\\n if let Some(name) = sections.section_name(endian, section).print_err(p) {\\n\\n p.print_string(name);\\n\\n writeln!(p.w, \\\" ({})\\\", index).unwrap();\\n\\n } else {\\n\\n writeln!(p.w, \\\"{}\\\", index).unwrap();\\n\\n }\\n\\n } else {\\n\\n writeln!(p.w, \\\"{}\\\", index).unwrap();\\n\\n }\\n\\n }\\n\\n });\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/examples/src/readobj/elf.rs\",\n \"rank\": 51,\n \"score\": 180898.83353741473\n },\n {\n \"content\": \"fn print_segment_dynamic<Elf: FileHeader>(\\n\\n p: &mut Printer<'_>,\\n\\n endian: Elf::Endian,\\n\\n data: &[u8],\\n\\n elf: &Elf,\\n\\n segments: &[Elf::ProgramHeader],\\n\\n segment: &Elf::ProgramHeader,\\n\\n) {\\n\\n if let Some(Some(dynamic)) = segment.dynamic(endian, data).print_err(p) {\\n\\n // TODO: add a helper API for this and the other mandatory tags?\\n\\n let mut strtab = 0;\\n\\n let mut strsz = 0;\\n\\n for d in dynamic {\\n\\n let tag = d.d_tag(endian).into();\\n\\n if tag == DT_STRTAB.into() {\\n\\n strtab = d.d_val(endian).into();\\n\\n } else if tag == DT_STRSZ.into() {\\n\\n strsz = d.d_val(endian).into();\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"crates/examples/src/readobj/elf.rs\",\n \"rank\": 52,\n \"score\": 180898.83353741473\n },\n {\n \"content\": \"fn print_section_dynamic<Elf: FileHeader>(\\n\\n p: &mut Printer<'_>,\\n\\n endian: Elf::Endian,\\n\\n data: &[u8],\\n\\n elf: &Elf,\\n\\n sections: &SectionTable<Elf>,\\n\\n section: &Elf::SectionHeader,\\n\\n) {\\n\\n if let Some(Some((dynamic, index))) = section.dynamic(endian, data).print_err(p) {\\n\\n let strings = sections.strings(endian, data, index).unwrap_or_default();\\n\\n print_dynamic(p, endian, elf, dynamic, strings);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/examples/src/readobj/elf.rs\",\n \"rank\": 53,\n \"score\": 180898.83353741473\n },\n {\n \"content\": \"fn print_segment_notes<Elf: FileHeader>(\\n\\n p: &mut Printer<'_>,\\n\\n endian: Elf::Endian,\\n\\n data: &[u8],\\n\\n _elf: &Elf,\\n\\n segment: &Elf::ProgramHeader,\\n\\n) {\\n\\n if let Some(Some(notes)) = segment.notes(endian, data).print_err(p) {\\n\\n print_notes(p, endian, notes);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/examples/src/readobj/elf.rs\",\n \"rank\": 54,\n \"score\": 180898.83353741473\n },\n {\n \"content\": \"fn print_section_notes<Elf: FileHeader>(\\n\\n p: &mut Printer<'_>,\\n\\n endian: Elf::Endian,\\n\\n data: &[u8],\\n\\n _elf: &Elf,\\n\\n section: &Elf::SectionHeader,\\n\\n) {\\n\\n if let Some(Some(notes)) = section.notes(endian, data).print_err(p) {\\n\\n print_notes(p, endian, notes);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/examples/src/readobj/elf.rs\",\n \"rank\": 55,\n \"score\": 180898.83353741473\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nenum SymbolIteratorInternal<'data, 'file, R>\\n\\nwhere\\n\\n 'data: 'file,\\n\\n R: ReadRef<'data>,\\n\\n{\\n\\n #[cfg(feature = \\\"coff\\\")]\\n\\n Coff((coff::CoffSymbolIterator<'data, 'file, R>, PhantomData<R>)),\\n\\n #[cfg(feature = \\\"elf\\\")]\\n\\n Elf32(\\n\\n (\\n\\n elf::ElfSymbolIterator32<'data, 'file, Endianness, R>,\\n\\n PhantomData<R>,\\n\\n ),\\n\\n ),\\n\\n #[cfg(feature = \\\"elf\\\")]\\n\\n Elf64(\\n\\n (\\n\\n elf::ElfSymbolIterator64<'data, 'file, Endianness, R>,\\n\\n PhantomData<R>,\\n\\n ),\\n\",\n \"file_path\": \"src/read/any.rs\",\n \"rank\": 56,\n \"score\": 179513.5128312378\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nenum SymbolTableInternal<'data, 'file, R>\\n\\nwhere\\n\\n 'data: 'file,\\n\\n R: ReadRef<'data>,\\n\\n{\\n\\n #[cfg(feature = \\\"coff\\\")]\\n\\n Coff((coff::CoffSymbolTable<'data, 'file, R>, PhantomData<R>)),\\n\\n #[cfg(feature = \\\"elf\\\")]\\n\\n Elf32(\\n\\n (\\n\\n elf::ElfSymbolTable32<'data, 'file, Endianness, R>,\\n\\n PhantomData<R>,\\n\\n ),\\n\\n ),\\n\\n #[cfg(feature = \\\"elf\\\")]\\n\\n Elf64(\\n\\n (\\n\\n elf::ElfSymbolTable64<'data, 'file, Endianness, R>,\\n\\n PhantomData<R>,\\n\\n ),\\n\",\n \"file_path\": \"src/read/any.rs\",\n \"rank\": 57,\n \"score\": 179513.5128312378\n },\n {\n \"content\": \"#[inline]\\n\\npub fn slice_from_bytes_mut<T: Pod>(\\n\\n data: &mut [u8],\\n\\n count: usize,\\n\\n) -> Result<(&mut [T], &mut [u8])> {\\n\\n let size = count.checked_mul(mem::size_of::<T>()).ok_or(())?;\\n\\n if size > data.len() {\\n\\n return Err(());\\n\\n }\\n\\n let (data, tail) = data.split_at_mut(size);\\n\\n let ptr = data.as_mut_ptr();\\n\\n if (ptr as usize) % mem::align_of::<T>() != 0 {\\n\\n return Err(());\\n\\n }\\n\\n // Safety:\\n\\n // The alignment and size are checked by this function.\\n\\n // The Pod trait ensures the type is valid to cast from bytes.\\n\\n let slice = unsafe { slice::from_raw_parts_mut(ptr.cast(), count) };\\n\\n Ok((slice, tail))\\n\\n}\\n\\n\\n\\n/// Cast a `Pod` type to a byte slice.\\n\",\n \"file_path\": \"src/pod.rs\",\n \"rank\": 58,\n \"score\": 177003.75362288835\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nenum FileInternal<'data, R: ReadRef<'data>> {\\n\\n #[cfg(feature = \\\"coff\\\")]\\n\\n Coff(coff::CoffFile<'data, R>),\\n\\n #[cfg(feature = \\\"elf\\\")]\\n\\n Elf32(elf::ElfFile32<'data, Endianness, R>),\\n\\n #[cfg(feature = \\\"elf\\\")]\\n\\n Elf64(elf::ElfFile64<'data, Endianness, R>),\\n\\n #[cfg(feature = \\\"macho\\\")]\\n\\n MachO32(macho::MachOFile32<'data, Endianness, R>),\\n\\n #[cfg(feature = \\\"macho\\\")]\\n\\n MachO64(macho::MachOFile64<'data, Endianness, R>),\\n\\n #[cfg(feature = \\\"pe\\\")]\\n\\n Pe32(pe::PeFile32<'data, R>),\\n\\n #[cfg(feature = \\\"pe\\\")]\\n\\n Pe64(pe::PeFile64<'data, R>),\\n\\n #[cfg(feature = \\\"wasm\\\")]\\n\\n Wasm(wasm::WasmFile<'data, R>),\\n\\n}\\n\\n\\n\\nimpl<'data, R: ReadRef<'data>> File<'data, R> {\\n\",\n \"file_path\": \"src/read/any.rs\",\n \"rank\": 59,\n \"score\": 175830.74456513458\n },\n {\n \"content\": \"fn print_macho<Mach: MachHeader<Endian = Endianness>>(\\n\\n p: &mut Printer<'_>,\\n\\n header: &Mach,\\n\\n data: &[u8],\\n\\n offset: u64,\\n\\n) {\\n\\n if let Some(endian) = header.endian().print_err(p) {\\n\\n let mut state = MachState::default();\\n\\n print_mach_header(p, endian, header);\\n\\n if let Some(mut commands) = header.load_commands(endian, data, offset).print_err(p) {\\n\\n while let Some(Some(command)) = commands.next().print_err(p) {\\n\\n print_load_command(p, endian, data, header, command, &mut state);\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/examples/src/readobj/macho.rs\",\n \"rank\": 60,\n \"score\": 174607.25846125698\n },\n {\n \"content\": \"#[derive(Default, Clone, Copy)]\\n\\nstruct SymbolOffsets {\\n\\n index: usize,\\n\\n str_id: Option<StringId>,\\n\\n aux_count: u8,\\n\\n}\\n\\n\\n\\nimpl<'a> Object<'a> {\\n\\n pub(crate) fn coff_section_info(\\n\\n &self,\\n\\n section: StandardSection,\\n\\n ) -> (&'static [u8], &'static [u8], SectionKind) {\\n\\n match section {\\n\\n StandardSection::Text => (&[], &b\\\".text\\\"[..], SectionKind::Text),\\n\\n StandardSection::Data => (&[], &b\\\".data\\\"[..], SectionKind::Data),\\n\\n StandardSection::ReadOnlyData\\n\\n | StandardSection::ReadOnlyDataWithRel\\n\\n | StandardSection::ReadOnlyString => (&[], &b\\\".rdata\\\"[..], SectionKind::ReadOnlyData),\\n\\n StandardSection::UninitializedData => {\\n\\n (&[], &b\\\".bss\\\"[..], SectionKind::UninitializedData)\\n\\n }\\n\",\n \"file_path\": \"src/write/coff.rs\",\n \"rank\": 61,\n \"score\": 173148.34850770468\n },\n {\n \"content\": \"#[derive(Default, Clone, Copy)]\\n\\nstruct SymbolOffsets {\\n\\n emit: bool,\\n\\n index: usize,\\n\\n str_id: Option<StringId>,\\n\\n}\\n\\n\\n\\nimpl<'a> Object<'a> {\\n\\n pub(crate) fn macho_set_subsections_via_symbols(&mut self) {\\n\\n let flags = match self.flags {\\n\\n FileFlags::MachO { flags } => flags,\\n\\n _ => 0,\\n\\n };\\n\\n self.flags = FileFlags::MachO {\\n\\n flags: flags | macho::MH_SUBSECTIONS_VIA_SYMBOLS,\\n\\n };\\n\\n }\\n\\n\\n\\n pub(crate) fn macho_segment_name(&self, segment: StandardSegment) -> &'static [u8] {\\n\\n match segment {\\n\\n StandardSegment::Text => &b\\\"__TEXT\\\"[..],\\n\",\n \"file_path\": \"src/write/macho.rs\",\n \"rank\": 62,\n \"score\": 173148.34850770468\n },\n {\n \"content\": \"enum ComdatInternal<'data, 'file, R: ReadRef<'data>>\\n\\nwhere\\n\\n 'data: 'file,\\n\\n{\\n\\n #[cfg(feature = \\\"coff\\\")]\\n\\n Coff(coff::CoffComdat<'data, 'file, R>),\\n\\n #[cfg(feature = \\\"elf\\\")]\\n\\n Elf32(elf::ElfComdat32<'data, 'file, Endianness, R>),\\n\\n #[cfg(feature = \\\"elf\\\")]\\n\\n Elf64(elf::ElfComdat64<'data, 'file, Endianness, R>),\\n\\n #[cfg(feature = \\\"macho\\\")]\\n\\n MachO32(macho::MachOComdat32<'data, 'file, Endianness, R>),\\n\\n #[cfg(feature = \\\"macho\\\")]\\n\\n MachO64(macho::MachOComdat64<'data, 'file, Endianness, R>),\\n\\n #[cfg(feature = \\\"pe\\\")]\\n\\n Pe32(pe::PeComdat32<'data, 'file, R>),\\n\\n #[cfg(feature = \\\"pe\\\")]\\n\\n Pe64(pe::PeComdat64<'data, 'file, R>),\\n\\n #[cfg(feature = \\\"wasm\\\")]\\n\\n Wasm(wasm::WasmComdat<'data, 'file, R>),\\n\",\n \"file_path\": \"src/read/any.rs\",\n \"rank\": 63,\n \"score\": 169311.93965153053\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nenum SegmentInternal<'data, 'file, R: ReadRef<'data>>\\n\\nwhere\\n\\n 'data: 'file,\\n\\n{\\n\\n #[cfg(feature = \\\"coff\\\")]\\n\\n Coff(coff::CoffSegment<'data, 'file, R>),\\n\\n #[cfg(feature = \\\"elf\\\")]\\n\\n Elf32(elf::ElfSegment32<'data, 'file, Endianness, R>),\\n\\n #[cfg(feature = \\\"elf\\\")]\\n\\n Elf64(elf::ElfSegment64<'data, 'file, Endianness, R>),\\n\\n #[cfg(feature = \\\"macho\\\")]\\n\\n MachO32(macho::MachOSegment32<'data, 'file, Endianness, R>),\\n\\n #[cfg(feature = \\\"macho\\\")]\\n\\n MachO64(macho::MachOSegment64<'data, 'file, Endianness, R>),\\n\\n #[cfg(feature = \\\"pe\\\")]\\n\\n Pe32(pe::PeSegment32<'data, 'file, R>),\\n\\n #[cfg(feature = \\\"pe\\\")]\\n\\n Pe64(pe::PeSegment64<'data, 'file, R>),\\n\\n #[cfg(feature = \\\"wasm\\\")]\\n\\n Wasm(wasm::WasmSegment<'data, 'file, R>),\\n\",\n \"file_path\": \"src/read/any.rs\",\n \"rank\": 64,\n \"score\": 169311.93965153053\n },\n {\n \"content\": \"enum SectionInternal<'data, 'file, R: ReadRef<'data>>\\n\\nwhere\\n\\n 'data: 'file,\\n\\n{\\n\\n #[cfg(feature = \\\"coff\\\")]\\n\\n Coff(coff::CoffSection<'data, 'file, R>),\\n\\n #[cfg(feature = \\\"elf\\\")]\\n\\n Elf32(elf::ElfSection32<'data, 'file, Endianness, R>),\\n\\n #[cfg(feature = \\\"elf\\\")]\\n\\n Elf64(elf::ElfSection64<'data, 'file, Endianness, R>),\\n\\n #[cfg(feature = \\\"macho\\\")]\\n\\n MachO32(macho::MachOSection32<'data, 'file, Endianness, R>),\\n\\n #[cfg(feature = \\\"macho\\\")]\\n\\n MachO64(macho::MachOSection64<'data, 'file, Endianness, R>),\\n\\n #[cfg(feature = \\\"pe\\\")]\\n\\n Pe32(pe::PeSection32<'data, 'file, R>),\\n\\n #[cfg(feature = \\\"pe\\\")]\\n\\n Pe64(pe::PeSection64<'data, 'file, R>),\\n\\n #[cfg(feature = \\\"wasm\\\")]\\n\\n Wasm(wasm::WasmSection<'data, 'file, R>),\\n\",\n \"file_path\": \"src/read/any.rs\",\n \"rank\": 65,\n \"score\": 169311.93965153053\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nenum ComdatIteratorInternal<'data, 'file, R: ReadRef<'data>>\\n\\nwhere\\n\\n 'data: 'file,\\n\\n{\\n\\n #[cfg(feature = \\\"coff\\\")]\\n\\n Coff(coff::CoffComdatIterator<'data, 'file, R>),\\n\\n #[cfg(feature = \\\"elf\\\")]\\n\\n Elf32(elf::ElfComdatIterator32<'data, 'file, Endianness, R>),\\n\\n #[cfg(feature = \\\"elf\\\")]\\n\\n Elf64(elf::ElfComdatIterator64<'data, 'file, Endianness, R>),\\n\\n #[cfg(feature = \\\"macho\\\")]\\n\\n MachO32(macho::MachOComdatIterator32<'data, 'file, Endianness, R>),\\n\\n #[cfg(feature = \\\"macho\\\")]\\n\\n MachO64(macho::MachOComdatIterator64<'data, 'file, Endianness, R>),\\n\\n #[cfg(feature = \\\"pe\\\")]\\n\\n Pe32(pe::PeComdatIterator32<'data, 'file, R>),\\n\\n #[cfg(feature = \\\"pe\\\")]\\n\\n Pe64(pe::PeComdatIterator64<'data, 'file, R>),\\n\\n #[cfg(feature = \\\"wasm\\\")]\\n\\n Wasm(wasm::WasmComdatIterator<'data, 'file, R>),\\n\",\n \"file_path\": \"src/read/any.rs\",\n \"rank\": 66,\n \"score\": 167417.82316432698\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nenum SegmentIteratorInternal<'data, 'file, R: ReadRef<'data>>\\n\\nwhere\\n\\n 'data: 'file,\\n\\n{\\n\\n #[cfg(feature = \\\"coff\\\")]\\n\\n Coff(coff::CoffSegmentIterator<'data, 'file, R>),\\n\\n #[cfg(feature = \\\"elf\\\")]\\n\\n Elf32(elf::ElfSegmentIterator32<'data, 'file, Endianness, R>),\\n\\n #[cfg(feature = \\\"elf\\\")]\\n\\n Elf64(elf::ElfSegmentIterator64<'data, 'file, Endianness, R>),\\n\\n #[cfg(feature = \\\"macho\\\")]\\n\\n MachO32(macho::MachOSegmentIterator32<'data, 'file, Endianness, R>),\\n\\n #[cfg(feature = \\\"macho\\\")]\\n\\n MachO64(macho::MachOSegmentIterator64<'data, 'file, Endianness, R>),\\n\\n #[cfg(feature = \\\"pe\\\")]\\n\\n Pe32(pe::PeSegmentIterator32<'data, 'file, R>),\\n\\n #[cfg(feature = \\\"pe\\\")]\\n\\n Pe64(pe::PeSegmentIterator64<'data, 'file, R>),\\n\\n #[cfg(feature = \\\"wasm\\\")]\\n\\n Wasm(wasm::WasmSegmentIterator<'data, 'file, R>),\\n\",\n \"file_path\": \"src/read/any.rs\",\n \"rank\": 67,\n \"score\": 167417.82316432698\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nenum SectionIteratorInternal<'data, 'file, R: ReadRef<'data>>\\n\\nwhere\\n\\n 'data: 'file,\\n\\n{\\n\\n #[cfg(feature = \\\"coff\\\")]\\n\\n Coff(coff::CoffSectionIterator<'data, 'file, R>),\\n\\n #[cfg(feature = \\\"elf\\\")]\\n\\n Elf32(elf::ElfSectionIterator32<'data, 'file, Endianness, R>),\\n\\n #[cfg(feature = \\\"elf\\\")]\\n\\n Elf64(elf::ElfSectionIterator64<'data, 'file, Endianness, R>),\\n\\n #[cfg(feature = \\\"macho\\\")]\\n\\n MachO32(macho::MachOSectionIterator32<'data, 'file, Endianness, R>),\\n\\n #[cfg(feature = \\\"macho\\\")]\\n\\n MachO64(macho::MachOSectionIterator64<'data, 'file, Endianness, R>),\\n\\n #[cfg(feature = \\\"pe\\\")]\\n\\n Pe32(pe::PeSectionIterator32<'data, 'file, R>),\\n\\n #[cfg(feature = \\\"pe\\\")]\\n\\n Pe64(pe::PeSectionIterator64<'data, 'file, R>),\\n\\n #[cfg(feature = \\\"wasm\\\")]\\n\\n Wasm(wasm::WasmSectionIterator<'data, 'file, R>),\\n\",\n \"file_path\": \"src/read/any.rs\",\n \"rank\": 68,\n \"score\": 167417.82316432698\n },\n {\n \"content\": \"#[derive(Clone, Copy)]\\n\\nstruct ComdatOffsets {\\n\\n offset: usize,\\n\\n str_id: StringId,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/write/elf/object.rs\",\n \"rank\": 69,\n \"score\": 166375.9443803213\n },\n {\n \"content\": \"#[derive(Clone, Copy)]\\n\\nstruct SectionOffsets {\\n\\n index: SectionIndex,\\n\\n offset: usize,\\n\\n str_id: StringId,\\n\\n reloc_offset: usize,\\n\\n reloc_str_id: Option<StringId>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/write/elf/object.rs\",\n \"rank\": 70,\n \"score\": 166375.9443803213\n },\n {\n \"content\": \"/// A symbol table entry.\\n\\npub trait ObjectSymbol<'data>: read::private::Sealed {\\n\\n /// The index of the symbol.\\n\\n fn index(&self) -> SymbolIndex;\\n\\n\\n\\n /// The name of the symbol.\\n\\n fn name_bytes(&self) -> Result<&'data [u8]>;\\n\\n\\n\\n /// The name of the symbol.\\n\\n ///\\n\\n /// Returns an error if the name is not UTF-8.\\n\\n fn name(&self) -> Result<&'data str>;\\n\\n\\n\\n /// The address of the symbol. May be zero if the address is unknown.\\n\\n fn address(&self) -> u64;\\n\\n\\n\\n /// The size of the symbol. May be zero if the size is unknown.\\n\\n fn size(&self) -> u64;\\n\\n\\n\\n /// Return the kind of this symbol.\\n\\n fn kind(&self) -> SymbolKind;\\n\",\n \"file_path\": \"src/read/traits.rs\",\n \"rank\": 71,\n \"score\": 165742.15553553659\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nenum ComdatSectionIteratorInternal<'data, 'file, R: ReadRef<'data>>\\n\\nwhere\\n\\n 'data: 'file,\\n\\n{\\n\\n #[cfg(feature = \\\"coff\\\")]\\n\\n Coff(coff::CoffComdatSectionIterator<'data, 'file, R>),\\n\\n #[cfg(feature = \\\"elf\\\")]\\n\\n Elf32(elf::ElfComdatSectionIterator32<'data, 'file, Endianness, R>),\\n\\n #[cfg(feature = \\\"elf\\\")]\\n\\n Elf64(elf::ElfComdatSectionIterator64<'data, 'file, Endianness, R>),\\n\\n #[cfg(feature = \\\"macho\\\")]\\n\\n MachO32(macho::MachOComdatSectionIterator32<'data, 'file, Endianness, R>),\\n\\n #[cfg(feature = \\\"macho\\\")]\\n\\n MachO64(macho::MachOComdatSectionIterator64<'data, 'file, Endianness, R>),\\n\\n #[cfg(feature = \\\"pe\\\")]\\n\\n Pe32(pe::PeComdatSectionIterator32<'data, 'file, R>),\\n\\n #[cfg(feature = \\\"pe\\\")]\\n\\n Pe64(pe::PeComdatSectionIterator64<'data, 'file, R>),\\n\\n #[cfg(feature = \\\"wasm\\\")]\\n\\n Wasm(wasm::WasmComdatSectionIterator<'data, 'file, R>),\\n\",\n \"file_path\": \"src/read/any.rs\",\n \"rank\": 72,\n \"score\": 165601.609357303\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nenum SectionRelocationIteratorInternal<'data, 'file, R: ReadRef<'data>>\\n\\nwhere\\n\\n 'data: 'file,\\n\\n{\\n\\n #[cfg(feature = \\\"coff\\\")]\\n\\n Coff(coff::CoffRelocationIterator<'data, 'file, R>),\\n\\n #[cfg(feature = \\\"elf\\\")]\\n\\n Elf32(elf::ElfSectionRelocationIterator32<'data, 'file, Endianness, R>),\\n\\n #[cfg(feature = \\\"elf\\\")]\\n\\n Elf64(elf::ElfSectionRelocationIterator64<'data, 'file, Endianness, R>),\\n\\n #[cfg(feature = \\\"macho\\\")]\\n\\n MachO32(macho::MachORelocationIterator32<'data, 'file, Endianness, R>),\\n\\n #[cfg(feature = \\\"macho\\\")]\\n\\n MachO64(macho::MachORelocationIterator64<'data, 'file, Endianness, R>),\\n\\n #[cfg(feature = \\\"pe\\\")]\\n\\n Pe32(pe::PeRelocationIterator<'data, 'file, R>),\\n\\n #[cfg(feature = \\\"pe\\\")]\\n\\n Pe64(pe::PeRelocationIterator<'data, 'file, R>),\\n\\n #[cfg(feature = \\\"wasm\\\")]\\n\\n Wasm(wasm::WasmRelocationIterator<'data, 'file, R>),\\n\\n}\\n\\n\\n\\nimpl<'data, 'file, R: ReadRef<'data>> Iterator for SectionRelocationIterator<'data, 'file, R> {\\n\\n type Item = (u64, Relocation);\\n\\n\\n\\n fn next(&mut self) -> Option<Self::Item> {\\n\\n with_inner_mut!(self.inner, SectionRelocationIteratorInternal, |x| x.next())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/read/any.rs\",\n \"rank\": 73,\n \"score\": 165601.609357303\n },\n {\n \"content\": \"#[cfg(feature = \\\"compression\\\")]\\n\\n#[test]\\n\\nfn compression_gnu() {\\n\\n use object::read::ObjectSection;\\n\\n use std::io::Write;\\n\\n\\n\\n let data = b\\\"test data data data\\\";\\n\\n let len = data.len() as u32;\\n\\n\\n\\n let mut buf = Vec::new();\\n\\n buf.write_all(b\\\"ZLIB\\\\0\\\\0\\\\0\\\\0\\\").unwrap();\\n\\n buf.write_all(&len.to_be_bytes()).unwrap();\\n\\n let mut encoder = flate2::write::ZlibEncoder::new(buf, flate2::Compression::default());\\n\\n encoder.write_all(data).unwrap();\\n\\n let compressed = encoder.finish().unwrap();\\n\\n\\n\\n let mut object =\\n\\n write::Object::new(BinaryFormat::Elf, Architecture::X86_64, Endianness::Little);\\n\\n let section = object.add_section(\\n\\n Vec::new(),\\n\\n b\\\".zdebug_info\\\".to_vec(),\\n\\n object::SectionKind::Other,\\n\",\n \"file_path\": \"tests/round_trip/elf.rs\",\n \"rank\": 74,\n \"score\": 163272.50856206854\n },\n {\n \"content\": \"/// A symbol table.\\n\\npub trait ObjectSymbolTable<'data>: read::private::Sealed {\\n\\n /// A symbol table entry.\\n\\n type Symbol: ObjectSymbol<'data>;\\n\\n\\n\\n /// An iterator over the symbols in a symbol table.\\n\\n type SymbolIterator: Iterator<Item = Self::Symbol>;\\n\\n\\n\\n /// Get an iterator over the symbols in the table.\\n\\n ///\\n\\n /// This may skip over symbols that are malformed or unsupported.\\n\\n fn symbols(&self) -> Self::SymbolIterator;\\n\\n\\n\\n /// Get the symbol at the given index.\\n\\n ///\\n\\n /// The meaning of the index depends on the object file.\\n\\n ///\\n\\n /// Returns an error if the index is invalid.\\n\\n fn symbol_by_index(&self, index: SymbolIndex) -> Result<Self::Symbol>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/read/traits.rs\",\n \"rank\": 75,\n \"score\": 162690.50031414803\n },\n {\n \"content\": \"fn dump_parsed_object<W: Write, E: Write>(w: &mut W, e: &mut E, file: &object::File) -> Result<()> {\\n\\n writeln!(\\n\\n w,\\n\\n \\\"Format: {:?} {:?}-endian {}-bit\\\",\\n\\n file.format(),\\n\\n file.endianness(),\\n\\n if file.is_64() { \\\"64\\\" } else { \\\"32\\\" }\\n\\n )?;\\n\\n writeln!(w, \\\"Kind: {:?}\\\", file.kind())?;\\n\\n writeln!(w, \\\"Architecture: {:?}\\\", file.architecture())?;\\n\\n writeln!(w, \\\"Flags: {:x?}\\\", file.flags())?;\\n\\n writeln!(\\n\\n w,\\n\\n \\\"Relative Address Base: {:x?}\\\",\\n\\n file.relative_address_base()\\n\\n )?;\\n\\n writeln!(w, \\\"Entry Address: {:x?}\\\", file.entry())?;\\n\\n\\n\\n match file.mach_uuid() {\\n\\n Ok(Some(uuid)) => writeln!(w, \\\"Mach UUID: {:x?}\\\", uuid)?,\\n\",\n \"file_path\": \"crates/examples/src/objdump.rs\",\n \"rank\": 76,\n \"score\": 161608.28662837984\n },\n {\n \"content\": \"fn testfile<F>(path: &str, data: &[u8], ext: &str, f: F) -> bool\\n\\nwhere\\n\\n F: FnOnce(&mut dyn Write, &mut dyn Write, &[u8]),\\n\\n{\\n\\n if glob::glob(&format!(\\\"crates/examples/{}.{}*\\\", path, ext))\\n\\n .unwrap()\\n\\n .find_map(Result::ok)\\n\\n .is_none()\\n\\n {\\n\\n return false;\\n\\n }\\n\\n\\n\\n // TODO: print diffs for mismatches\\n\\n let mut fail = false;\\n\\n let mut out = Vec::new();\\n\\n let mut err = Vec::new();\\n\\n f(&mut out, &mut err, data);\\n\\n\\n\\n // Check exact match of output.\\n\\n let out_path = &format!(\\\"crates/examples/{}.{}\\\", path, ext);\\n\",\n \"file_path\": \"crates/examples/tests/testfiles.rs\",\n \"rank\": 77,\n \"score\": 159308.45627380605\n },\n {\n \"content\": \"fn print_symbols(p: &mut Printer<'_>, sections: Option<&SectionTable>, symbols: &SymbolTable) {\\n\\n for (index, symbol) in symbols.iter() {\\n\\n p.group(\\\"ImageSymbol\\\", |p| {\\n\\n p.field(\\\"Index\\\", index);\\n\\n if let Some(name) = symbol.name(symbols.strings()).print_err(p) {\\n\\n p.field_inline_string(\\\"Name\\\", name);\\n\\n } else {\\n\\n p.field(\\\"Name\\\", format!(\\\"{:X?}\\\", symbol.name));\\n\\n }\\n\\n p.field_hex(\\\"Value\\\", symbol.value.get(LE));\\n\\n let section = symbol.section_number.get(LE);\\n\\n if section == 0 || section >= IMAGE_SYM_SECTION_MAX {\\n\\n p.field_enum(\\\"Section\\\", section, FLAGS_IMAGE_SYM);\\n\\n } else {\\n\\n let section_name = sections.and_then(|sections| {\\n\\n sections\\n\\n .section(section.into())\\n\\n .and_then(|section| section.name(symbols.strings()))\\n\\n .print_err(p)\\n\\n });\\n\",\n \"file_path\": \"crates/examples/src/readobj/pe.rs\",\n \"rank\": 78,\n \"score\": 159276.70338518976\n },\n {\n \"content\": \"fn print_ident(p: &mut Printer<'_>, ident: &Ident) {\\n\\n p.field(\\\"Magic\\\", format!(\\\"{:X?}\\\", ident.magic));\\n\\n p.field_enum(\\\"Class\\\", ident.class, &FLAGS_EI_CLASS);\\n\\n p.field_enum(\\\"Data\\\", ident.data, &FLAGS_EI_DATA);\\n\\n p.field_enum(\\\"Version\\\", ident.version, &FLAGS_EV);\\n\\n p.field_enum(\\\"OsAbi\\\", ident.os_abi, &FLAGS_EI_OSABI);\\n\\n p.field_hex(\\\"AbiVersion\\\", ident.abi_version);\\n\\n p.field(\\\"Unused\\\", format!(\\\"{:X?}\\\", ident.padding));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/examples/src/readobj/elf.rs\",\n \"rank\": 79,\n \"score\": 156477.95677182035\n },\n {\n \"content\": \"struct DebugByte(u8);\\n\\n\\n\\nimpl fmt::Debug for DebugByte {\\n\\n fn fmt(&self, fmt: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n write!(fmt, \\\"0x{:02x}\\\", self.0)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/read/util.rs\",\n \"rank\": 80,\n \"score\": 150564.34601490063\n },\n {\n \"content\": \"#[allow(missing_docs)]\\n\\npub trait FileHeader: Debug + Pod {\\n\\n // Ideally this would be a `u64: From<Word>`, but can't express that.\\n\\n type Word: Into<u64>;\\n\\n type Sword: Into<i64>;\\n\\n type Endian: endian::Endian;\\n\\n type ProgramHeader: ProgramHeader<Elf = Self, Endian = Self::Endian, Word = Self::Word>;\\n\\n type SectionHeader: SectionHeader<Elf = Self, Endian = Self::Endian, Word = Self::Word>;\\n\\n type CompressionHeader: CompressionHeader<Endian = Self::Endian, Word = Self::Word>;\\n\\n type NoteHeader: NoteHeader<Endian = Self::Endian>;\\n\\n type Dyn: Dyn<Endian = Self::Endian, Word = Self::Word>;\\n\\n type Sym: Sym<Endian = Self::Endian, Word = Self::Word>;\\n\\n type Rel: Rel<Endian = Self::Endian, Word = Self::Word>;\\n\\n type Rela: Rela<Endian = Self::Endian, Word = Self::Word> + From<Self::Rel>;\\n\\n\\n\\n /// Return true if this type is a 64-bit header.\\n\\n ///\\n\\n /// This is a property of the type, not a value in the header data.\\n\\n fn is_type_64(&self) -> bool;\\n\\n\\n\\n fn e_ident(&self) -> &elf::Ident;\\n\",\n \"file_path\": \"src/read/elf/file.rs\",\n \"rank\": 81,\n \"score\": 147823.0004362949\n },\n {\n \"content\": \"#[allow(missing_docs)]\\n\\npub trait SectionHeader: Debug + Pod {\\n\\n type Elf: FileHeader<SectionHeader = Self, Endian = Self::Endian, Word = Self::Word>;\\n\\n type Word: Into<u64>;\\n\\n type Endian: endian::Endian;\\n\\n\\n\\n fn sh_name(&self, endian: Self::Endian) -> u32;\\n\\n fn sh_type(&self, endian: Self::Endian) -> u32;\\n\\n fn sh_flags(&self, endian: Self::Endian) -> Self::Word;\\n\\n fn sh_addr(&self, endian: Self::Endian) -> Self::Word;\\n\\n fn sh_offset(&self, endian: Self::Endian) -> Self::Word;\\n\\n fn sh_size(&self, endian: Self::Endian) -> Self::Word;\\n\\n fn sh_link(&self, endian: Self::Endian) -> u32;\\n\\n fn sh_info(&self, endian: Self::Endian) -> u32;\\n\\n fn sh_addralign(&self, endian: Self::Endian) -> Self::Word;\\n\\n fn sh_entsize(&self, endian: Self::Endian) -> Self::Word;\\n\\n\\n\\n /// Parse the section name from the string table.\\n\\n fn name<'data, R: ReadRef<'data>>(\\n\\n &self,\\n\\n endian: Self::Endian,\\n\",\n \"file_path\": \"src/read/elf/section.rs\",\n \"rank\": 82,\n \"score\": 147823.0004362949\n },\n {\n \"content\": \"#[allow(missing_docs)]\\n\\npub trait CompressionHeader: Debug + Pod {\\n\\n type Word: Into<u64>;\\n\\n type Endian: endian::Endian;\\n\\n\\n\\n fn ch_type(&self, endian: Self::Endian) -> u32;\\n\\n fn ch_size(&self, endian: Self::Endian) -> Self::Word;\\n\\n fn ch_addralign(&self, endian: Self::Endian) -> Self::Word;\\n\\n}\\n\\n\\n\\nimpl<Endian: endian::Endian> CompressionHeader for elf::CompressionHeader32<Endian> {\\n\\n type Word = u32;\\n\\n type Endian = Endian;\\n\\n\\n\\n #[inline]\\n\\n fn ch_type(&self, endian: Self::Endian) -> u32 {\\n\\n self.ch_type.get(endian)\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn ch_size(&self, endian: Self::Endian) -> Self::Word {\\n\",\n \"file_path\": \"src/read/elf/compression.rs\",\n \"rank\": 83,\n \"score\": 147823.0004362949\n },\n {\n \"content\": \"#[allow(missing_docs)]\\n\\npub trait NoteHeader: Debug + Pod {\\n\\n type Endian: endian::Endian;\\n\\n\\n\\n fn n_namesz(&self, endian: Self::Endian) -> u32;\\n\\n fn n_descsz(&self, endian: Self::Endian) -> u32;\\n\\n fn n_type(&self, endian: Self::Endian) -> u32;\\n\\n}\\n\\n\\n\\nimpl<Endian: endian::Endian> NoteHeader for elf::NoteHeader32<Endian> {\\n\\n type Endian = Endian;\\n\\n\\n\\n #[inline]\\n\\n fn n_namesz(&self, endian: Self::Endian) -> u32 {\\n\\n self.n_namesz.get(endian)\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn n_descsz(&self, endian: Self::Endian) -> u32 {\\n\\n self.n_descsz.get(endian)\\n\\n }\\n\",\n \"file_path\": \"src/read/elf/note.rs\",\n \"rank\": 84,\n \"score\": 147823.0004362949\n },\n {\n \"content\": \"#[allow(missing_docs)]\\n\\npub trait ProgramHeader: Debug + Pod {\\n\\n type Elf: FileHeader<ProgramHeader = Self, Endian = Self::Endian, Word = Self::Word>;\\n\\n type Word: Into<u64>;\\n\\n type Endian: endian::Endian;\\n\\n\\n\\n fn p_type(&self, endian: Self::Endian) -> u32;\\n\\n fn p_flags(&self, endian: Self::Endian) -> u32;\\n\\n fn p_offset(&self, endian: Self::Endian) -> Self::Word;\\n\\n fn p_vaddr(&self, endian: Self::Endian) -> Self::Word;\\n\\n fn p_paddr(&self, endian: Self::Endian) -> Self::Word;\\n\\n fn p_filesz(&self, endian: Self::Endian) -> Self::Word;\\n\\n fn p_memsz(&self, endian: Self::Endian) -> Self::Word;\\n\\n fn p_align(&self, endian: Self::Endian) -> Self::Word;\\n\\n\\n\\n /// Return the offset and size of the segment in the file.\\n\\n fn file_range(&self, endian: Self::Endian) -> (u64, u64) {\\n\\n (self.p_offset(endian).into(), self.p_filesz(endian).into())\\n\\n }\\n\\n\\n\\n /// Return the segment data.\\n\",\n \"file_path\": \"src/read/elf/segment.rs\",\n \"rank\": 85,\n \"score\": 147823.0004362949\n },\n {\n \"content\": \"fn find_subslice(haystack: &[u8], needle: &[u8]) -> bool {\\n\\n haystack\\n\\n .windows(needle.len())\\n\\n .any(|window| window == needle)\\n\\n}\\n\",\n \"file_path\": \"crates/examples/tests/testfiles.rs\",\n \"rank\": 86,\n \"score\": 143203.66192565026\n },\n {\n \"content\": \"#[test]\\n\\nfn parse_self() {\\n\\n let exe = env::current_exe().unwrap();\\n\\n let data = fs::read(exe).unwrap();\\n\\n let object = File::parse(&*data).unwrap();\\n\\n assert!(object.entry() != 0);\\n\\n assert!(object.sections().count() != 0);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/parse_self.rs\",\n \"rank\": 87,\n \"score\": 134719.4327631728\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nenum DynamicRelocationIteratorInternal<'data, 'file, R>\\n\\nwhere\\n\\n 'data: 'file,\\n\\n R: ReadRef<'data>,\\n\\n{\\n\\n #[cfg(feature = \\\"elf\\\")]\\n\\n Elf32(elf::ElfDynamicRelocationIterator32<'data, 'file, Endianness, R>),\\n\\n #[cfg(feature = \\\"elf\\\")]\\n\\n Elf64(elf::ElfDynamicRelocationIterator64<'data, 'file, Endianness, R>),\\n\\n // We need to always use the lifetime parameters.\\n\\n #[allow(unused)]\\n\\n None(PhantomData<(&'data (), &'file (), R)>),\\n\\n}\\n\\n\\n\\nimpl<'data, 'file, R: ReadRef<'data>> Iterator for DynamicRelocationIterator<'data, 'file, R> {\\n\\n type Item = (u64, Relocation);\\n\\n\\n\\n fn next(&mut self) -> Option<Self::Item> {\\n\\n match self.inner {\\n\\n #[cfg(feature = \\\"elf\\\")]\\n\",\n \"file_path\": \"src/read/any.rs\",\n \"rank\": 88,\n \"score\": 134379.4719357543\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct ReadCacheInternal<R: Read + Seek> {\\n\\n read: R,\\n\\n bufs: HashMap<(u64, u64), Box<[u8]>>,\\n\\n strings: HashMap<(u64, u8), Box<[u8]>>,\\n\\n}\\n\\n\\n\\nimpl<R: Read + Seek> ReadCache<R> {\\n\\n /// Create an empty `ReadCache` for the given stream.\\n\\n pub fn new(read: R) -> Self {\\n\\n ReadCache {\\n\\n cache: RefCell::new(ReadCacheInternal {\\n\\n read,\\n\\n bufs: HashMap::new(),\\n\\n strings: HashMap::new(),\\n\\n }),\\n\\n }\\n\\n }\\n\\n\\n\\n /// Return an implementation of `ReadRef` that restricts reads\\n\\n /// to the given range of the stream.\\n\",\n \"file_path\": \"src/read/read_cache.rs\",\n \"rank\": 89,\n \"score\": 132708.05120477287\n },\n {\n \"content\": \"#[cfg(feature = \\\"std\\\")]\\n\\n#[test]\\n\\nfn parse_self_cache() {\\n\\n use object::read::{ReadCache, ReadRef};\\n\\n let exe = env::current_exe().unwrap();\\n\\n let file = fs::File::open(exe).unwrap();\\n\\n let cache = ReadCache::new(file);\\n\\n let data = cache.range(0, cache.len().unwrap());\\n\\n let object = File::parse(data).unwrap();\\n\\n assert!(object.entry() != 0);\\n\\n assert!(object.sections().count() != 0);\\n\\n}\\n\",\n \"file_path\": \"tests/parse_self.rs\",\n \"rank\": 90,\n \"score\": 132347.8254631897\n },\n {\n \"content\": \"/// A trait for using an endianness specification.\\n\\n///\\n\\n/// Provides methods for converting between the specified endianness and\\n\\n/// the native endianness of the target machine.\\n\\n///\\n\\n/// This trait does not require that the endianness is known at compile time.\\n\\npub trait Endian: Debug + Default + Clone + Copy + PartialEq + Eq + 'static {\\n\\n /// Construct a specification for the endianness of some values.\\n\\n ///\\n\\n /// Returns `None` if the type does not support specifying the given endianness.\\n\\n fn from_big_endian(big_endian: bool) -> Option<Self>;\\n\\n\\n\\n /// Construct a specification for the endianness of some values.\\n\\n ///\\n\\n /// Returns `None` if the type does not support specifying the given endianness.\\n\\n fn from_little_endian(little_endian: bool) -> Option<Self> {\\n\\n Self::from_big_endian(!little_endian)\\n\\n }\\n\\n\\n\\n /// Return true for big endian byte order.\\n\\n fn is_big_endian(self) -> bool;\\n\\n\\n\\n /// Return true for little endian byte order.\\n\\n #[inline]\\n\\n fn is_little_endian(self) -> bool {\\n\\n !self.is_big_endian()\\n\",\n \"file_path\": \"src/endian.rs\",\n \"rank\": 91,\n \"score\": 127262.46427990052\n },\n {\n \"content\": \"#[derive(Default, Clone, Copy)]\\n\\nstruct SectionOffsets {\\n\\n offset: usize,\\n\\n str_id: Option<StringId>,\\n\\n reloc_offset: usize,\\n\\n selection: u8,\\n\\n associative_section: u16,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/write/coff.rs\",\n \"rank\": 92,\n \"score\": 126500.90713884834\n },\n {\n \"content\": \"#[derive(Default, Clone, Copy)]\\n\\nstruct SectionOffsets {\\n\\n index: usize,\\n\\n offset: usize,\\n\\n address: u64,\\n\\n reloc_offset: usize,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/write/macho.rs\",\n \"rank\": 93,\n \"score\": 126500.90713884834\n },\n {\n \"content\": \"struct MachHeader {\\n\\n cputype: u32,\\n\\n cpusubtype: u32,\\n\\n filetype: u32,\\n\\n ncmds: u32,\\n\\n sizeofcmds: u32,\\n\\n flags: u32,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/write/macho.rs\",\n \"rank\": 94,\n \"score\": 126406.14403011774\n },\n {\n \"content\": \"/// A loadable segment defined in an object file.\\n\\n///\\n\\n/// For ELF, this is a program header with type `PT_LOAD`.\\n\\n/// For Mach-O, this is a load command with type `LC_SEGMENT` or `LC_SEGMENT_64`.\\n\\npub trait ObjectSegment<'data>: read::private::Sealed {\\n\\n /// Returns the virtual address of the segment.\\n\\n fn address(&self) -> u64;\\n\\n\\n\\n /// Returns the size of the segment in memory.\\n\\n fn size(&self) -> u64;\\n\\n\\n\\n /// Returns the alignment of the segment in memory.\\n\\n fn align(&self) -> u64;\\n\\n\\n\\n /// Returns the offset and size of the segment in the file.\\n\\n fn file_range(&self) -> (u64, u64);\\n\\n\\n\\n /// Returns a reference to the file contents of the segment.\\n\\n ///\\n\\n /// The length of this data may be different from the size of the\\n\\n /// segment in memory.\\n\\n fn data(&self) -> Result<&'data [u8]>;\\n\\n\\n\\n /// Return the segment data in the given range.\\n\",\n \"file_path\": \"src/read/traits.rs\",\n \"rank\": 95,\n \"score\": 125067.65718323209\n },\n {\n \"content\": \"/// A section defined in an object file.\\n\\npub trait ObjectSection<'data>: read::private::Sealed {\\n\\n /// An iterator over the relocations for a section.\\n\\n ///\\n\\n /// The first field in the item tuple is the section offset\\n\\n /// that the relocation applies to.\\n\\n type RelocationIterator: Iterator<Item = (u64, Relocation)>;\\n\\n\\n\\n /// Returns the section index.\\n\\n fn index(&self) -> SectionIndex;\\n\\n\\n\\n /// Returns the address of the section.\\n\\n fn address(&self) -> u64;\\n\\n\\n\\n /// Returns the size of the section in memory.\\n\\n fn size(&self) -> u64;\\n\\n\\n\\n /// Returns the alignment of the section in memory.\\n\\n fn align(&self) -> u64;\\n\\n\\n\\n /// Returns offset and size of on-disk segment (if any).\\n\",\n \"file_path\": \"src/read/traits.rs\",\n \"rank\": 96,\n \"score\": 125057.9853639027\n },\n {\n \"content\": \"/// A COMDAT section group defined in an object file.\\n\\npub trait ObjectComdat<'data>: read::private::Sealed {\\n\\n /// An iterator over the sections in the object file.\\n\\n type SectionIterator: Iterator<Item = SectionIndex>;\\n\\n\\n\\n /// Returns the COMDAT selection kind.\\n\\n fn kind(&self) -> ComdatKind;\\n\\n\\n\\n /// Returns the index of the symbol used for the name of COMDAT section group.\\n\\n fn symbol(&self) -> SymbolIndex;\\n\\n\\n\\n /// Returns the name of the COMDAT section group.\\n\\n fn name_bytes(&self) -> Result<&[u8]>;\\n\\n\\n\\n /// Returns the name of the COMDAT section group.\\n\\n ///\\n\\n /// Returns an error if the name is not UTF-8.\\n\\n fn name(&self) -> Result<&str>;\\n\\n\\n\\n /// Get the sections in this section group.\\n\\n fn sections(&self) -> Self::SectionIterator;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/read/traits.rs\",\n \"rank\": 97,\n \"score\": 125057.9853639027\n },\n {\n \"content\": \"pub fn print<W: Write, E: Write>(\\n\\n w: &mut W,\\n\\n e: &mut E,\\n\\n file: &[u8],\\n\\n member_names: Vec<String>,\\n\\n) -> Result<()> {\\n\\n let mut member_names: Vec<_> = member_names.into_iter().map(|name| (name, false)).collect();\\n\\n\\n\\n if let Ok(archive) = ArchiveFile::parse(&*file) {\\n\\n writeln!(w, \\\"Format: Archive (kind: {:?})\\\", archive.kind())?;\\n\\n for member in archive.members() {\\n\\n match member {\\n\\n Ok(member) => {\\n\\n if find_member(&mut member_names, member.name()) {\\n\\n writeln!(w)?;\\n\\n writeln!(w, \\\"{}:\\\", String::from_utf8_lossy(member.name()))?;\\n\\n if let Ok(data) = member.data(&*file) {\\n\\n dump_object(w, e, data)?;\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"crates/examples/src/objdump.rs\",\n \"rank\": 98,\n \"score\": 123329.11931482567\n },\n {\n \"content\": \"struct DebugLen(usize);\\n\\n\\n\\nimpl fmt::Debug for DebugLen {\\n\\n fn fmt(&self, fmt: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n write!(fmt, \\\"...; {}\\\", self.0)\\n\\n }\\n\\n}\\n\\n\\n\\n/// A newtype for byte strings.\\n\\n///\\n\\n/// For byte slices that are strings of an unknown encoding.\\n\\n///\\n\\n/// Provides a `Debug` implementation that interprets the bytes as UTF-8.\\n\\n#[derive(Default, Clone, Copy, PartialEq, Eq)]\\n\\npub(crate) struct ByteString<'data>(pub &'data [u8]);\\n\\n\\n\\nimpl<'data> fmt::Debug for ByteString<'data> {\\n\\n fn fmt(&self, fmt: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n write!(fmt, \\\"\\\\\\\"{}\\\\\\\"\\\", String::from_utf8_lossy(self.0))\\n\\n }\\n\",\n \"file_path\": \"src/read/util.rs\",\n \"rank\": 99,\n \"score\": 120979.4556807818\n }\n]","isConversational":false}}},{"rowIdx":1385,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"gstreamer/src/buffer_pool.rs"},"repo_name":{"kind":"string","value":"heftig/gstreamer-rs"},"commit":{"kind":"string","value":"03c3580c224a10c86e89b34380215a551e1f7bff"},"file_code":{"kind":"string","value":"\n\nuse BufferPool;\nuse Structure;\n\nuse glib;\nuse glib::translate::{from_glib, from_glib_full, from_glib_none, ToGlib, ToGlibPtr, ToGlibPtrMut};\nuse glib::IsA;\n\nuse ffi;\n\nuse std::mem;\nuse std::ops;\nuse std::ptr;\n\n#[derive(Debug, PartialEq, Eq)]\npub struct BufferPoolConfig(Structure);\n\nimpl ops::Deref for BufferPoolConfig {\n type Target = ::StructureRef;\n\n fn deref(&self) -> &::StructureRef {\n self.0.deref()\n }\n}\n\nimpl ops::DerefMut for BufferPoolConfig {\n fn deref_mut(&mut self) -> &mut ::StructureRef {\n self.0.deref_mut()\n }\n}\n\nimpl AsRef<::StructureRef> for BufferPoolConfig {\n fn as_ref(&self) -> &::StructureRef {\n self.0.as_ref()\n }\n}\n\nimpl AsMut<::StructureRef> for BufferPoolConfig {\n fn as_mut(&mut self) -> &mut ::StructureRef {\n self.0.as_mut()\n }\n}\n\nimpl BufferPoolConfig {\n pub fn add_option(&mut self, option: &str) {\n unsafe {\n ffi::gst_buffer_pool_config_add_option(\n self.0.to_glib_none_mut().0,\n option.to_glib_none().0,\n );\n }\n }\n\n pub fn has_option(&self, option: &str) -> bool {\n unsafe {\n from_glib(ffi::gst_buffer_pool_config_has_option(\n self.0.to_glib_none().0,\n option.to_glib_none().0,\n ))\n }\n }\n\n pub fn get_options(&self) -> Vec<String> {\n unsafe {\n let n = ffi::gst_buffer_pool_config_n_options(self.0.to_glib_none().0) as usize;\n let mut options = Vec::with_capacity(n);\n\n for i in 0..n {\n options.push(from_glib_none(ffi::gst_buffer_pool_config_get_option(\n self.0.to_glib_none().0,\n i as u32,\n )));\n }\n\n options\n }\n }\n\n pub fn set_params<'a, T: Into<Option<&'a ::Caps>>>(\n &mut self,\n caps: T,\n size: u32,\n min_buffers: u32,\n max_buffers: u32,\n ) {\n let caps = caps.into();\n\n unsafe {\n ffi::gst_buffer_pool_config_set_params(\n self.0.to_glib_none_mut().0,\n caps.to_glib_none().0,\n size,\n min_buffers,\n max_buffers,\n );\n }\n }\n\n pub fn get_params(&self) -> Option<(Option<::Caps>, u32, u32, u32)> {\n unsafe {\n let mut caps = ptr::null_mut();\n let mut size = mem::uninitialized();\n let mut min_buffers = mem::uninitialized();\n let mut max_buffers = mem::uninitialized();\n\n let ret: bool = from_glib(ffi::gst_buffer_pool_config_get_params(\n self.0.to_glib_none().0,\n &mut caps,\n &mut size,\n &mut min_buffers,\n &mut max_buffers,\n ));\n if !ret {\n return None;\n }\n\n Some((from_glib_none(caps), size, min_buffers, max_buffers))\n }\n }\n\n pub fn validate_params<'a, T: Into<Option<&'a ::Caps>>>(\n &self,\n caps: T,\n size: u32,\n min_buffers: u32,\n max_buffers: u32,\n ) -> bool {\n let caps = caps.into();\n\n unsafe {\n from_glib(ffi::gst_buffer_pool_config_validate_params(\n self.0.to_glib_none().0,\n caps.to_glib_none().0,\n size,\n min_buffers,\n max_buffers,\n ))\n }\n }\n\n \n \n}\n\n#[derive(Debug)]\npub struct BufferPoolAcquireParams(ffi::GstBufferPoolAcquireParams);\n\nimpl BufferPoolAcquireParams {\n pub fn with_flags(flags: ::BufferPoolAcquireFlags) -> Self {\n BufferPoolAcquireParams(ffi::GstBufferPoolAcquireParams {\n format: ffi::GST_FORMAT_UNDEFINED,\n start: -1,\n stop: -1,\n flags: flags.to_glib(),\n _gst_reserved: [ptr::null_mut(); 4],\n })\n }\n\n pub fn with_start_stop<T: ::SpecificFormattedValue>(\n start: T,\n stop: T,\n flags: ::BufferPoolAcquireFlags,\n ) -> Self {\n unsafe {\n BufferPoolAcquireParams(ffi::GstBufferPoolAcquireParams {\n format: start.get_format().to_glib(),\n start: start.to_raw_value(),\n stop: stop.to_raw_value(),\n flags: flags.to_glib(),\n _gst_reserved: [ptr::null_mut(); 4],\n })\n }\n }\n\n pub fn flags(&self) -> ::BufferPoolAcquireFlags {\n from_glib(self.0.flags)\n }\n\n pub fn format(&self) -> ::Format {\n from_glib(self.0.format)\n }\n\n pub fn start(&self) -> ::GenericFormattedValue {\n ::GenericFormattedValue::new(from_glib(self.0.format), self.0.start)\n }\n\n pub fn stop(&self) -> ::GenericFormattedValue {\n ::GenericFormattedValue::new(from_glib(self.0.format), self.0.stop)\n }\n}\n\nimpl PartialEq for BufferPoolAcquireParams {\n fn eq(&self, other: &Self) -> bool {\n self.format() == other.format()\n && self.start() == other.start()\n && self.stop() == other.stop()\n }\n}\n\nimpl Eq for BufferPoolAcquireParams {}\n\nimpl BufferPool {\n pub fn new() -> BufferPool {\n assert_initialized_main_thread!();\n let (major, minor, _, _) = ::version();\n if (major, minor) > (1, 12) {\n unsafe { from_glib_full(ffi::gst_buffer_pool_new()) }\n } else {\n \n unsafe { from_glib_none(ffi::gst_buffer_pool_new()) }\n }\n }\n}\n\nimpl Default for BufferPool {\n fn default() -> Self {\n Self::new()\n }\n}\n\npub trait BufferPoolExtManual {\n fn get_config(&self) -> BufferPoolConfig;\n fn set_config(&self, config: BufferPoolConfig) -> Result<(), glib::error::BoolError>;\n\n fn is_flushing(&self) -> bool;\n\n fn acquire_buffer<'a, P: Into<Option<&'a BufferPoolAcquireParams>>>(\n &self,\n params: P,\n ) -> Result<::Buffer, ::FlowReturn>;\n fn release_buffer(&self, buffer: ::Buffer);\n}\n\nimpl<O: IsA<BufferPool>> BufferPoolExtManual for O {\n fn get_config(&self) -> BufferPoolConfig {\n unsafe {\n let ptr = ffi::gst_buffer_pool_get_config(self.to_glib_none().0);\n BufferPoolConfig(from_glib_full(ptr))\n }\n }\n\n fn set_config(&self, config: BufferPoolConfig) -> Result<(), glib::error::BoolError> {\n unsafe {\n glib::error::BoolError::from_glib(\n ffi::gst_buffer_pool_set_config(self.to_glib_none().0, config.0.into_ptr()),\n \"Failed to set config\",\n )\n }\n }\n\n fn is_flushing(&self) -> bool {\n unsafe {\n let stash = self.to_glib_none();\n let ptr: *mut ffi::GstBufferPool = stash.0;\n\n from_glib((*ptr).flushing)\n }\n }\n\n fn acquire_buffer<'a, P: Into<Option<&'a BufferPoolAcquireParams>>>(\n &self,\n params: P,\n ) -> Result<::Buffer, ::FlowReturn> {\n let params = params.into();\n let params_ptr = match params {\n Some(params) => ¶ms.0 as *const _ as *mut _,\n None => ptr::null_mut(),\n };\n\n unsafe {\n let mut buffer = ptr::null_mut();\n let ret = from_glib(ffi::gst_buffer_pool_acquire_buffer(\n self.to_glib_none().0,\n &mut buffer,\n params_ptr,\n ));\n\n if ret == ::FlowReturn::Ok {\n Ok(from_glib_full(buffer))\n } else {\n Err(ret)\n }\n }\n }\n\n fn release_buffer(&self, buffer: ::Buffer) {\n unsafe {\n ffi::gst_buffer_pool_release_buffer(self.to_glib_none().0, buffer.into_ptr());\n }\n }\n}\n\n#[cfg(test)]\nmod tests {\n use super::*;\n use prelude::*;\n\n #[test]\n fn test_pool() {\n ::init().unwrap();\n\n let pool = ::BufferPool::new();\n let mut config = pool.get_config();\n config.set_params(Some(&::Caps::new_simple(\"foo/bar\", &[])), 1024, 0, 2);\n pool.set_config(config).unwrap();\n\n pool.set_active(true).unwrap();\n\n let params = ::BufferPoolAcquireParams::with_flags(::BufferPoolAcquireFlags::DONTWAIT);\n\n let _buf1 = pool.acquire_buffer(¶ms).unwrap();\n let buf2 = pool.acquire_buffer(¶ms).unwrap();\n\n assert!(pool.acquire_buffer(¶ms).is_err());\n\n drop(buf2);\n let _buf2 = pool.acquire_buffer(¶ms).unwrap();\n\n pool.set_active(false).unwrap();\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nuse BufferPool;\nuse Structure;\n\nuse glib;\nuse glib::translate::{from_glib, from_glib_full, from_glib_none, ToGlib, ToGlibPtr, ToGlibPtrMut};\nuse glib::IsA;\n\nuse ffi;\n\nuse std::mem;\nuse std::ops;\nuse std::ptr;\n\n#[derive(Debug, PartialEq, Eq)]\npub struct BufferPoolConfig(Structure);\n\nimpl ops::Deref for BufferPoolConfig {\n type Target = ::StructureRef;\n\n fn deref(&self) -> &::StructureRef {\n self.0.deref()\n }\n}\n\nimpl ops::DerefMut for BufferPoolConfig {\n fn deref_mut(&mut self) -> &mut ::StructureRef {\n self.0.deref_mut()\n }\n}\n\nimpl AsRef<::StructureRef> for BufferPoolConfig {\n fn as_ref(&self) -> &::StructureRef {\n self.0.as_ref()\n }\n}\n\nimpl AsMut<::StructureRef> for BufferPoolConfig {\n fn as_mut(&mut self) -> &mut ::StructureRef {\n self.0.as_mut()\n }\n}\n\nimpl BufferPoolConfig {\n pub fn add_option(&mut self, option: &str) {\n unsafe {\n ffi::gst_buffer_pool_config_add_option(\n self.0.to_glib_none_mut().0,\n option.to_glib_none().0,\n );\n }\n }\n\n pub fn has_option(&self, option: &str) -> bool {\n unsafe {\n from_glib(ffi::gst_buffer_pool_config_has_option(\n self.0.to_glib_none().0,\n option.to_glib_none().0,\n ))\n }\n }\n\n pub fn get_options(&self) -> Vec<String> {\n unsafe {\n let n = ffi::gst_buffer_pool_config_n_options(self.0.to_glib_none().0) as usize;\n let mut options = Vec::with_capacity(n);\n\n for i in 0..n {\n options.push(from_glib_none(ffi::gst_buffer_pool_config_get_option(\n self.0.to_glib_none().0,\n i as u32,\n )));\n }\n\n options\n }\n }\n\n pub fn set_params<'a, T: Into<Option<&'a ::Caps>>>(\n &mut self,\n caps: T,\n size: u32,\n min_buffers: u32,\n max_buffers: u32,\n ) {\n let caps = caps.into();\n\n unsafe {\n ffi::gst_buffer_pool_config_set_params(\n self.0.to_glib_none_mut().0,\n caps.to_glib_none().0,\n size,\n min_buffers,\n max_buffers,\n );\n }\n }\n\n pub fn get_params(&self) -> Option<(Option<::Caps>, u32, u32, u32)> {\n unsafe {\n let mut caps = ptr::null_mut();\n let mut size = mem::uninitialized();\n let mut min_buffers = mem::uninitialized();\n let mut max_buffers = mem::uninitialized();\n\n let ret: bool = from_glib(ffi::gst_buffer_pool_config_get_params(\n self.0.to_glib_none().0,\n &mut caps,\n &mut size,\n &mut min_buffers,\n &mut max_buffers,\n ));\n if !ret {\n return None;\n }\n\n Some((from_glib_none(caps), size, min_buffers, max_buffers))\n }\n }\n\n pub fn validate_params<'a, T: Into<Option<&'a ::Caps>>>(\n &self,\n caps: T,\n size: u32,\n min_buffers: u32,\n max_buffers: u32,\n ) -> bool {\n let caps = caps.into();\n\n unsafe {\n from_glib(ffi::gst_buffer_pool_config_validate_params(\n self.0.to_glib_none().0,\n caps.to_glib_none().0,\n size,\n min_buffers,\n max_buffers,\n ))\n }\n }\n\n \n \n}\n\n#[derive(Debug)]\npub struct BufferPoolAcquireParams(ffi::GstBufferPoolAcquireParams);\n\nimpl BufferPoolAcquireParams {\n pub fn with_flags(flags: ::BufferPoolAcquireFlags) -> Self {\n BufferPoolAcquireParams(ffi::GstBufferPoolAcquireParams {\n format: ffi::GST_FORMAT_UNDEFINED,\n start: -1,\n stop: -1,\n flags: flags.to_glib(),\n _gst_reserved: [ptr::null_mut(); 4],\n })\n }\n\n pub fn with_start_stop<T: ::SpecificFormattedValue>(\n start: T,\n stop: T,\n flags: ::BufferPoolAcquireFlags,\n ) -> Self {\n unsafe {\n BufferPoolAcquireParams(ffi::GstBufferPoolAcquireParams {\n format: start.get_format().to_glib(),\n start: start.to_raw_value(),\n stop: stop.to_raw_value(),\n flags: flags.to_glib(),\n _gst_reserved: [ptr::null_mut(); 4],\n })\n }\n }\n\n pub fn flags(&self) -> ::BufferPoolAcquireFlags {\n from_glib(self.0.flags)\n }\n\n pub fn format(&self) -> ::Format {\n from_glib(self.0.format)\n }\n\n pub fn start(&self) -> ::GenericFormattedValue {\n ::GenericFormattedValue::new(from_glib(self.0.format), self.0.start)\n }\n\n pub fn stop(&self) -> ::GenericFormattedValue {\n ::GenericFormattedValue::new(from_glib(self.0.format), self.0.stop)\n }\n}\n\nimpl PartialEq for BufferPoolAcquireParams {\n fn eq(&self, other: &Self) -> bool {\n self.format() == other.format()\n && self.start() == other.start()\n && self.stop() == other.stop()\n }\n}\n\nimpl Eq for BufferPoolAcquireParams {}\n\nimpl BufferPool {\n pub fn new() -> BufferPool {\n assert_initialized_main_thread!();\n let (major, minor, _, _) = ::version();\n if (major, minor) > (1, 12) {\n unsafe { from_glib_full(ffi::gst_buffer_pool_new()) }\n } else {\n \n unsafe { from_glib_none(ffi::gst_buffer_pool_new()) }\n }\n }\n}\n\nimpl Default for BufferPool {\n fn default() -> Self {\n Self::new()\n }\n}\n\npub trait BufferPoolExtManual {\n fn get_config(&self) -> BufferPoolConfig;\n fn set_config(&self, config: BufferPoolConfig) -> Result<(), glib::error::BoolError>;\n\n fn is_flushing(&self) -> bool;\n\n fn acquire_buffer<'a, P: Into<Option<&'a BufferPoolAcquireParams>>>(\n &self,\n params: P,\n ) -> Result<::Buffer, ::FlowReturn>;\n fn release_buffer(&self, buffer: ::Buffer);\n}\n\nimpl<O: IsA<BufferPool>> BufferPoolExtManual for O {\n fn get_config(&self) -> BufferPoolConfig {\n unsafe {\n let ptr = ffi::gst_buffer_pool_get_config(self.to_glib_none().0);\n BufferPoolConfig(from_glib_full(ptr))\n }\n }\n\n fn set_config(&self, config: BufferPoolConfig) -> Result<(), glib::error::BoolError> {\n unsafe {\n glib::error::BoolError::from_glib(\n ffi::gst_buffer_pool_set_config(self.to_glib_none().0, config.0.into_ptr()),\n \"Failed to set config\",\n )\n }\n }\n\n fn is_flushing(&self) -> bool {\n unsafe {\n let stash = self.to_glib_none();\n let ptr: *mut ffi::GstBufferPool = stash.0;\n\n from_glib((*ptr).flushing)\n }\n }\n\n "},"suffix":{"kind":"string","value":"\n\n fn release_buffer(&self, buffer: ::Buffer) {\n unsafe {\n ffi::gst_buffer_pool_release_buffer(self.to_glib_none().0, buffer.into_ptr());\n }\n }\n}\n\n#[cfg(test)]\nmod tests {\n use super::*;\n use prelude::*;\n\n #[test]\n fn test_pool() {\n ::init().unwrap();\n\n let pool = ::BufferPool::new();\n let mut config = pool.get_config();\n config.set_params(Some(&::Caps::new_simple(\"foo/bar\", &[])), 1024, 0, 2);\n pool.set_config(config).unwrap();\n\n pool.set_active(true).unwrap();\n\n let params = ::BufferPoolAcquireParams::with_flags(::BufferPoolAcquireFlags::DONTWAIT);\n\n let _buf1 = pool.acquire_buffer(¶ms).unwrap();\n let buf2 = pool.acquire_buffer(¶ms).unwrap();\n\n assert!(pool.acquire_buffer(¶ms).is_err());\n\n drop(buf2);\n let _buf2 = pool.acquire_buffer(¶ms).unwrap();\n\n pool.set_active(false).unwrap();\n }\n}\n"},"middle":{"kind":"string","value":"fn acquire_buffer<'a, P: Into<Option<&'a BufferPoolAcquireParams>>>(\n &self,\n params: P,\n ) -> Result<::Buffer, ::FlowReturn> {\n let params = params.into();\n let params_ptr = match params {\n Some(params) => ¶ms.0 as *const _ as *mut _,\n None => ptr::null_mut(),\n };\n\n unsafe {\n let mut buffer = ptr::null_mut();\n let ret = from_glib(ffi::gst_buffer_pool_acquire_buffer(\n self.to_glib_none().0,\n &mut buffer,\n params_ptr,\n ));\n\n if ret == ::FlowReturn::Ok {\n Ok(from_glib_full(buffer))\n } else {\n Err(ret)\n }\n }\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"pub fn type_find_helper<P: IsA<gst::Pad>>(src: &P, size: u64) -> Option<gst::Caps> {\n\n assert_initialized_main_thread!();\n\n unsafe {\n\n from_glib_full(ffi::gst_type_find_helper(src.to_glib_none().0, size))\n\n }\n\n}\n\n\n","file_path":"gstreamer-base/src/auto/functions.rs","rank":0,"score":349503.0390563768},{"content":"pub fn type_find_helper_for_buffer<'a, P: IsA<gst::Object> + 'a, Q: Into<Option<&'a P>>>(obj: Q, buf: &gst::Buffer) -> (Option<gst::Caps>, gst::TypeFindProbability) {\n\n assert_initialized_main_thread!();\n\n let obj = obj.into();\n\n let obj = obj.to_glib_none();\n\n unsafe {\n\n let mut prob = mem::uninitialized();\n\n let ret = from_glib_full(ffi::gst_type_find_helper_for_buffer(obj.0, buf.to_glib_none().0, &mut prob));\n\n (ret, from_glib(prob))\n\n }\n\n}\n\n\n","file_path":"gstreamer-base/src/auto/functions.rs","rank":1,"score":335275.7058662332},{"content":"pub fn type_find_helper_for_extension<'a, P: IsA<gst::Object> + 'a, Q: Into<Option<&'a P>>>(obj: Q, extension: &str) -> Option<gst::Caps> {\n\n assert_initialized_main_thread!();\n\n let obj = obj.into();\n\n let obj = obj.to_glib_none();\n\n unsafe {\n\n from_glib_full(ffi::gst_type_find_helper_for_extension(obj.0, extension.to_glib_none().0))\n\n }\n\n}\n\n\n\n//pub fn type_find_helper_get_range<'a, P: IsA<gst::Object>, Q: IsA<gst::Object> + 'a, R: Into<Option<&'a Q>>>(obj: &P, parent: R, func: /*Unknown conversion*//*Unimplemented*/TypeFindHelperGetRangeFunction, size: u64, extension: &str) -> (Option<gst::Caps>, gst::TypeFindProbability) {\n\n// unsafe { TODO: call ffi::gst_type_find_helper_get_range() }\n\n//}\n","file_path":"gstreamer-base/src/auto/functions.rs","rank":2,"score":333393.08465173846},{"content":"pub fn version() -> (u32, u32, u32, u32) {\n\n assert_initialized_main_thread!();\n\n unsafe {\n\n let mut major = mem::uninitialized();\n\n let mut minor = mem::uninitialized();\n\n let mut micro = mem::uninitialized();\n\n let mut nano = mem::uninitialized();\n\n ffi::gst_version(&mut major, &mut minor, &mut micro, &mut nano);\n\n (major, minor, micro, nano)\n\n }\n\n}\n\n\n","file_path":"gstreamer/src/auto/functions.rs","rank":3,"score":303484.37578508875},{"content":"pub fn parse_launch_full<'a, P: Into<Option<&'a mut ParseContext>>>(\n\n pipeline_description: &str,\n\n context: P,\n\n flags: ParseFlags,\n\n) -> Result<Element, Error> {\n\n assert_initialized_main_thread!();\n\n let mut context = context.into();\n\n unsafe {\n\n let mut error = ptr::null_mut();\n\n let ret = ffi::gst_parse_launch_full(\n\n pipeline_description.to_glib_none().0,\n\n context.to_glib_none_mut().0,\n\n flags.to_glib(),\n\n &mut error,\n\n );\n\n if error.is_null() {\n\n Ok(from_glib_none(ret))\n\n } else {\n\n Err(from_glib_full(error))\n\n }\n\n }\n\n}\n\n\n","file_path":"gstreamer/src/functions.rs","rank":4,"score":299121.39432439633},{"content":"pub fn parse_launchv_full<'a, P: Into<Option<&'a mut ParseContext>>>(\n\n argv: &[&str],\n\n context: P,\n\n flags: ParseFlags,\n\n) -> Result<Element, Error> {\n\n assert_initialized_main_thread!();\n\n let mut context = context.into();\n\n unsafe {\n\n let mut error = ptr::null_mut();\n\n let ret = ffi::gst_parse_launchv_full(\n\n argv.to_glib_none().0,\n\n context.to_glib_none_mut().0,\n\n flags.to_glib(),\n\n &mut error,\n\n );\n\n if error.is_null() {\n\n Ok(from_glib_none(ret))\n\n } else {\n\n Err(from_glib_full(error))\n\n }\n\n }\n\n}\n\n\n","file_path":"gstreamer/src/functions.rs","rank":5,"score":299121.39432439633},{"content":"pub fn parse_bin_from_description_full<'a, P: Into<Option<&'a mut ParseContext>>>(\n\n bin_description: &str,\n\n ghost_unlinked_pads: bool,\n\n context: P,\n\n flags: ParseFlags,\n\n) -> Result<Element, Error> {\n\n assert_initialized_main_thread!();\n\n let mut context = context.into();\n\n unsafe {\n\n let mut error = ptr::null_mut();\n\n let ret = ffi::gst_parse_bin_from_description_full(\n\n bin_description.to_glib_none().0,\n\n ghost_unlinked_pads.to_glib(),\n\n context.to_glib_none_mut().0,\n\n flags.to_glib(),\n\n &mut error,\n\n );\n\n if error.is_null() {\n\n Ok(from_glib_none(ret))\n\n } else {\n\n Err(from_glib_full(error))\n\n }\n\n }\n\n}\n\n\n","file_path":"gstreamer/src/functions.rs","rank":6,"score":294333.1040753911},{"content":"pub fn debug_set_threshold_from_string(list: &str, reset: bool) {\n\n assert_initialized_main_thread!();\n\n unsafe {\n\n ffi::gst_debug_set_threshold_from_string(list.to_glib_none().0, reset.to_glib());\n\n }\n\n}\n\n\n","file_path":"gstreamer/src/auto/functions.rs","rank":7,"score":291262.54111425235},{"content":"pub fn init() -> Result<(), glib::Error> {\n\n unsafe {\n\n let mut error = ptr::null_mut();\n\n if from_glib(ffi::gst_init_check(\n\n ptr::null_mut(),\n\n ptr::null_mut(),\n\n &mut error,\n\n )) {\n\n Ok(())\n\n } else {\n\n Err(from_glib_full(error))\n\n }\n\n }\n\n}\n\n\n\npub unsafe fn deinit() {\n\n ffi::gst_deinit();\n\n}\n\n\n\npub const BUFFER_OFFSET_NONE: u64 = ffi::GST_BUFFER_OFFSET_NONE;\n","file_path":"gstreamer/src/lib.rs","rank":8,"score":277104.06231798703},{"content":"pub fn parse_bin_from_description(bin_description: &str, ghost_unlinked_pads: bool) -> Result<Bin, Error> {\n\n assert_initialized_main_thread!();\n\n unsafe {\n\n let mut error = ptr::null_mut();\n\n let ret = ffi::gst_parse_bin_from_description(bin_description.to_glib_none().0, ghost_unlinked_pads.to_glib(), &mut error);\n\n if error.is_null() { Ok(from_glib_none(ret)) } else { Err(from_glib_full(error)) }\n\n }\n\n}\n\n\n","file_path":"gstreamer/src/auto/functions.rs","rank":9,"score":273338.5429316997},{"content":"#[cfg(any(feature = \"v1_14\", feature = \"dox\"))]\n\npub fn debug_add_ring_buffer_logger(max_size_per_thread: u32, thread_timeout: u32) {\n\n assert_initialized_main_thread!();\n\n unsafe {\n\n ffi::gst_debug_add_ring_buffer_logger(max_size_per_thread, thread_timeout);\n\n }\n\n}\n\n\n","file_path":"gstreamer/src/auto/functions.rs","rank":10,"score":272411.92588178214},{"content":"pub fn debug_set_active(active: bool) {\n\n assert_initialized_main_thread!();\n\n unsafe {\n\n ffi::gst_debug_set_active(active.to_glib());\n\n }\n\n}\n\n\n","file_path":"gstreamer/src/auto/functions.rs","rank":11,"score":250191.95156209604},{"content":"pub fn debug_set_colored(colored: bool) {\n\n assert_initialized_main_thread!();\n\n unsafe {\n\n ffi::gst_debug_set_colored(colored.to_glib());\n\n }\n\n}\n\n\n","file_path":"gstreamer/src/auto/functions.rs","rank":12,"score":250191.95156209604},{"content":"pub trait TypeFindImpl {\n\n fn peek(&mut self, offset: i64, size: u32) -> Option<&[u8]>;\n\n fn suggest(&mut self, probability: TypeFindProbability, caps: &Caps);\n\n fn get_length(&self) -> Option<u64> {\n\n None\n\n }\n\n}\n\n\n\nimpl<'a> TypeFind<'a> {\n\n pub fn register<\n\n 'b,\n\n 'c,\n\n 'd,\n\n P: Into<Option<&'b Plugin>>,\n\n R: Into<Option<&'c str>>,\n\n S: Into<Option<&'d Caps>>,\n\n F,\n\n >(\n\n plugin: P,\n\n name: &str,\n","file_path":"gstreamer/src/typefind.rs","rank":13,"score":248754.9834687683},{"content":"pub fn parse_launchv(argv: &[&str]) -> Result<Element, Error> {\n\n assert_initialized_main_thread!();\n\n unsafe {\n\n let mut error = ptr::null_mut();\n\n let ret = ffi::gst_parse_launchv(argv.to_glib_none().0, &mut error);\n\n if error.is_null() { Ok(from_glib_none(ret)) } else { Err(from_glib_full(error)) }\n\n }\n\n}\n\n\n","file_path":"gstreamer/src/auto/functions.rs","rank":14,"score":247794.74572166626},{"content":"struct CapsItemSe<'a>(&'a StructureRef, Option<&'a CapsFeaturesRef>);\n\nimpl<'a> Serialize for CapsItemSe<'a> {\n\n fn serialize<S: Serializer>(&self, serializer: S) -> Result<S::Ok, S::Error> {\n\n let mut tup = serializer.serialize_tuple(2)?;\n\n tup.serialize_element(self.0)?;\n\n tup.serialize_element(&self.1)?;\n\n tup.end()\n\n }\n\n}\n\n\n","file_path":"gstreamer/src/caps_serde.rs","rank":15,"score":247212.8675208579},{"content":"struct CapsItemDe(Structure, Option<CapsFeatures>);\n\n\n","file_path":"gstreamer/src/caps_serde.rs","rank":16,"score":244393.35275001367},{"content":"pub fn parse_launch(pipeline_description: &str) -> Result<Element, Error> {\n\n assert_initialized_main_thread!();\n\n unsafe {\n\n let mut error = ptr::null_mut();\n\n let ret = ffi::gst_parse_launch(pipeline_description.to_glib_none().0, &mut error);\n\n if error.is_null() { Ok(from_glib_none(ret)) } else { Err(from_glib_full(error)) }\n\n }\n\n}\n\n\n","file_path":"gstreamer/src/auto/functions.rs","rank":17,"score":243965.27668545273},{"content":"struct FieldSe<'a>(&'a str, &'a glib::SendValue);\n\nimpl<'a> Serialize for FieldSe<'a> {\n\n fn serialize<S: Serializer>(&self, serializer: S) -> Result<S::Ok, S::Error> {\n\n ser_value!(self.1, |type_, value| {\n\n let mut tup = serializer.serialize_tuple(3)?;\n\n tup.serialize_element(self.0)?;\n\n tup.serialize_element(type_)?;\n\n tup.serialize_element(&value)?;\n\n tup.end()\n\n })\n\n }\n\n}\n\n\n","file_path":"gstreamer/src/structure_serde.rs","rank":18,"score":239237.4966621165},{"content":"#[cfg(any(feature = \"v1_12\", feature = \"dox\"))]\n\npub fn debug_get_stack_trace(flags: StackTraceFlags) -> Option<String> {\n\n assert_initialized_main_thread!();\n\n unsafe {\n\n from_glib_full(ffi::gst_debug_get_stack_trace(flags.to_glib()))\n\n }\n\n}\n\n\n","file_path":"gstreamer/src/auto/functions.rs","rank":19,"score":234326.86077113904},{"content":"pub trait FormattedValue: Copy + Clone + Sized + 'static {\n\n fn get_default_format() -> Format;\n\n fn try_from(v: GenericFormattedValue) -> Option<Self>;\n\n\n\n fn get_format(&self) -> Format;\n\n\n\n unsafe fn from_raw(format: Format, value: i64) -> Self;\n\n unsafe fn to_raw_value(&self) -> i64;\n\n}\n\n\n","file_path":"gstreamer/src/format.rs","rank":20,"score":231796.17391537537},{"content":"pub fn debug_set_threshold_for_name(name: &str, level: DebugLevel) {\n\n assert_initialized_main_thread!();\n\n unsafe {\n\n ffi::gst_debug_set_threshold_for_name(name.to_glib_none().0, level.to_glib());\n\n }\n\n}\n\n\n","file_path":"gstreamer/src/auto/functions.rs","rank":21,"score":224257.62850818367},{"content":"struct FieldsDe<'a>(&'a mut StructureRef);\n\n\n","file_path":"gstreamer/src/structure_serde.rs","rank":22,"score":219874.2819617808},{"content":"struct FieldsVisitor<'a>(&'a mut StructureRef);\n\nimpl<'de, 'a> Visitor<'de> for FieldsVisitor<'a> {\n\n type Value = ();\n\n\n\n fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {\n\n formatter.write_str(\"a sequence of `Structure` `Field`s\")\n\n }\n\n\n\n fn visit_seq<A: SeqAccess<'de>>(self, mut seq: A) -> Result<(), A::Error> {\n\n while let Some(field) = seq.next_element::<FieldDe>()? {\n\n let (name, value): (String, glib::SendValue) = field.into();\n\n self.0.set_value(name.as_str(), value);\n\n }\n\n\n\n Ok(())\n\n }\n\n}\n\n\n\nimpl<'de, 'a> DeserializeSeed<'de> for FieldsDe<'a> {\n\n type Value = ();\n\n\n\n fn deserialize<D: Deserializer<'de>>(self, deserializer: D) -> Result<(), D::Error> {\n\n deserializer.deserialize_seq(FieldsVisitor(self.0))\n\n }\n\n}\n\n\n","file_path":"gstreamer/src/structure_serde.rs","rank":23,"score":219874.2819617808},{"content":"pub fn update_registry() -> bool {\n\n assert_initialized_main_thread!();\n\n unsafe {\n\n from_glib(ffi::gst_update_registry())\n\n }\n\n}\n\n\n","file_path":"gstreamer/src/auto/functions.rs","rank":24,"score":218611.04595651358},{"content":"pub fn debug_is_active() -> bool {\n\n assert_initialized_main_thread!();\n\n unsafe {\n\n from_glib(ffi::gst_debug_is_active())\n\n }\n\n}\n\n\n","file_path":"gstreamer/src/auto/functions.rs","rank":25,"score":218611.04595651358},{"content":"pub fn debug_is_colored() -> bool {\n\n assert_initialized_main_thread!();\n\n unsafe {\n\n from_glib(ffi::gst_debug_is_colored())\n\n }\n\n}\n\n\n","file_path":"gstreamer/src/auto/functions.rs","rank":26,"score":218611.0459565136},{"content":"pub fn debug_set_default_threshold(level: DebugLevel) {\n\n assert_initialized_main_thread!();\n\n unsafe {\n\n ffi::gst_debug_set_default_threshold(level.to_glib());\n\n }\n\n}\n\n\n","file_path":"gstreamer/src/auto/functions.rs","rank":27,"score":216894.30367487803},{"content":"pub fn new_still_frame_event<'a>(in_still: bool) -> StillFrameEventBuilder<'a> {\n\n StillFrameEventBuilder::new(in_still)\n\n}\n\n\n\npub struct StillFrameEventBuilder<'a> {\n\n seqnum: Option<gst::Seqnum>,\n\n running_time_offset: Option<i64>,\n\n other_fields: Vec<(&'a str, &'a ToSendValue)>,\n\n in_still: bool,\n\n}\n\n\n\nimpl<'a> StillFrameEventBuilder<'a> {\n\n fn new(in_still: bool) -> Self {\n\n skip_assert_initialized!();\n\n Self {\n\n seqnum: None,\n\n running_time_offset: None,\n\n other_fields: Vec::new(),\n\n in_still,\n\n }\n","file_path":"gstreamer-video/src/video_event.rs","rank":28,"score":213314.74877810074},{"content":"pub trait SpecificFormattedValue: FormattedValue {}\n\n\n\nimpl FormattedValue for GenericFormattedValue {\n\n fn get_default_format() -> Format {\n\n Format::Undefined\n\n }\n\n\n\n fn try_from(v: GenericFormattedValue) -> Option<Self> {\n\n Some(v)\n\n }\n\n\n\n fn get_format(&self) -> Format {\n\n self.get_format()\n\n }\n\n\n\n unsafe fn from_raw(format: Format, value: i64) -> Self {\n\n GenericFormattedValue::new(format, value)\n\n }\n\n\n\n unsafe fn to_raw_value(&self) -> i64 {\n","file_path":"gstreamer/src/format.rs","rank":29,"score":207022.3990253205},{"content":"pub trait BufferPoolExt {\n\n fn get_options(&self) -> Vec<String>;\n\n\n\n fn has_option(&self, option: &str) -> bool;\n\n\n\n fn is_active(&self) -> bool;\n\n\n\n fn set_active(&self, active: bool) -> Result<(), glib::error::BoolError>;\n\n\n\n fn set_flushing(&self, flushing: bool);\n\n}\n\n\n\nimpl<O: IsA<BufferPool>> BufferPoolExt for O {\n\n fn get_options(&self) -> Vec<String> {\n\n unsafe {\n\n FromGlibPtrContainer::from_glib_none(ffi::gst_buffer_pool_get_options(self.to_glib_none().0))\n\n }\n\n }\n\n\n\n fn has_option(&self, option: &str) -> bool {\n","file_path":"gstreamer/src/auto/buffer_pool.rs","rank":30,"score":206057.27924743015},{"content":"pub trait EncodingTargetExt {\n\n fn get_category(&self) -> String;\n\n\n\n fn get_description(&self) -> String;\n\n\n\n fn get_name(&self) -> String;\n\n\n\n fn get_profile(&self, name: &str) -> Option<EncodingProfile>;\n\n\n\n fn get_profiles(&self) -> Vec<EncodingProfile>;\n\n\n\n fn save(&self) -> Result<(), Error>;\n\n\n\n fn save_to_file<P: AsRef<std::path::Path>>(&self, filepath: P) -> Result<(), Error>;\n\n}\n\n\n\nimpl<O: IsA<EncodingTarget>> EncodingTargetExt for O {\n\n fn get_category(&self) -> String {\n\n unsafe {\n\n from_glib_none(ffi::gst_encoding_target_get_category(self.to_glib_none().0))\n","file_path":"gstreamer-pbutils/src/auto/encoding_target.rs","rank":32,"score":203082.71907313348},{"content":"pub fn debug_unset_threshold_for_name(name: &str) {\n\n assert_initialized_main_thread!();\n\n unsafe {\n\n ffi::gst_debug_unset_threshold_for_name(name.to_glib_none().0);\n\n }\n\n}\n\n\n","file_path":"gstreamer/src/auto/functions.rs","rank":33,"score":202159.85337618654},{"content":"#[cfg(any(feature = \"v1_14\", feature = \"dox\"))]\n\npub fn get_main_executable_path() -> Option<String> {\n\n assert_initialized_main_thread!();\n\n unsafe {\n\n from_glib_none(ffi::gst_get_main_executable_path())\n\n }\n\n}\n\n\n","file_path":"gstreamer/src/auto/functions.rs","rank":34,"score":202142.38194685592},{"content":"pub trait MessageErrorDomain: glib::error::ErrorDomain {}\n\n\n\nimpl MessageErrorDomain for ::CoreError {}\n\nimpl MessageErrorDomain for ::ResourceError {}\n\nimpl MessageErrorDomain for ::StreamError {}\n\nimpl MessageErrorDomain for ::LibraryError {}\n\n\n\npub struct ErrorBuilder<'a, T> {\n\n builder: MessageBuilder<'a>,\n\n error: T,\n\n message: &'a str,\n\n debug: Option<&'a str>,\n\n #[allow(unused)]\n\n details: Option<Structure>,\n\n}\n\nimpl<'a, T: MessageErrorDomain> ErrorBuilder<'a, T> {\n\n fn new(error: T, message: &'a str) -> Self {\n\n skip_assert_initialized!();\n\n Self {\n\n builder: MessageBuilder::new(),\n","file_path":"gstreamer/src/message.rs","rank":35,"score":197126.6271927558},{"content":"pub fn audio_buffer_clip(\n\n buffer: gst::Buffer,\n\n segment: &gst::Segment,\n\n rate: u32,\n\n channels: u32,\n\n) -> Option<gst::Buffer> {\n\n skip_assert_initialized!();\n\n\n\n unsafe {\n\n from_glib_full(ffi::gst_audio_buffer_clip(\n\n buffer.into_ptr(),\n\n segment.to_glib_none().0,\n\n rate as i32,\n\n channels as i32,\n\n ))\n\n }\n\n}\n\n\n\n// Re-export all the traits in a prelude module, so that applications\n\n// can always \"use gst::prelude::*\" without getting conflicts\n\npub mod prelude {\n\n pub use glib::prelude::*;\n\n pub use gst::prelude::*;\n\n\n\n pub use auto::traits::*;\n\n}\n","file_path":"gstreamer-audio/src/lib.rs","rank":36,"score":196173.60670101087},{"content":"pub fn type_find_helper_for_data<\n\n 'a,\n\n P: IsA<gst::Object> + 'a,\n\n Q: Into<Option<&'a P>>,\n\n R: AsRef<[u8]>,\n\n>(\n\n obj: Q,\n\n data: R,\n\n) -> (Option<gst::Caps>, gst::TypeFindProbability) {\n\n assert_initialized_main_thread!();\n\n let obj = obj.into();\n\n let obj = obj.to_glib_none();\n\n unsafe {\n\n let mut prob = mem::uninitialized();\n\n let data = data.as_ref();\n\n let (ptr, len) = (data.as_ptr(), data.len());\n\n let ret = from_glib_full(ffi::gst_type_find_helper_for_data(\n\n obj.0,\n\n mut_override(ptr),\n\n len,\n\n &mut prob,\n\n ));\n\n (ret, from_glib(prob))\n\n }\n\n}\n","file_path":"gstreamer-base/src/functions.rs","rank":37,"score":192810.20546673867},{"content":"pub trait GstValueExt: Sized {\n\n fn can_compare(&self, other: &Self) -> bool;\n\n fn compare(&self, other: &Self) -> Option<cmp::Ordering>;\n\n fn eq(&self, other: &Self) -> bool;\n\n fn can_intersect(&self, other: &Self) -> bool;\n\n fn intersect(&self, other: &Self) -> Option<Self>;\n\n fn can_subtract(&self, other: &Self) -> bool;\n\n fn subtract(&self, other: &Self) -> Option<Self>;\n\n fn can_union(&self, other: &Self) -> bool;\n\n fn union(&self, other: &Self) -> Option<Self>;\n\n fn fixate(&self) -> Option<Self>;\n\n fn is_fixed(&self) -> bool;\n\n fn is_subset(&self, superset: &Self) -> bool;\n\n fn serialize(&self) -> Option<String>;\n\n fn deserialize<'a, T: Into<&'a str>>(s: T) -> Option<glib::Value>;\n\n}\n\n\n\nimpl GstValueExt for glib::Value {\n\n fn can_compare(&self, other: &Self) -> bool {\n\n unsafe {\n","file_path":"gstreamer/src/value.rs","rank":38,"score":191626.33472930698},{"content":"pub fn version_string() -> String {\n\n assert_initialized_main_thread!();\n\n unsafe {\n\n from_glib_full(ffi::gst_version_string())\n\n }\n\n}\n","file_path":"gstreamer/src/auto/functions.rs","rank":39,"score":191217.8980760513},{"content":"struct TagValues<'a>(&'a str, &'a mut TagListRef);\n\n\n","file_path":"gstreamer/src/tags_serde.rs","rank":40,"score":191179.09459122719},{"content":"pub fn buffer_reorder_channels(\n\n buffer: &mut gst::BufferRef,\n\n format: ::AudioFormat,\n\n channels: u32,\n\n from: &[AudioChannelPosition],\n\n to: &[AudioChannelPosition],\n\n) -> Result<(), glib::BoolError> {\n\n assert_initialized_main_thread!();\n\n\n\n if from.len() != to.len() || from.len() > 64 {\n\n return Err(glib::BoolError(\"Invalid number of channels\"));\n\n }\n\n\n\n let from_len = from.len();\n\n let to_len = to.len();\n\n\n\n let from_raw: [ffi::GstAudioChannelPosition; 64] = array_init::array_init_copy(|i| {\n\n if i >= from_len as usize {\n\n ffi::GST_AUDIO_CHANNEL_POSITION_INVALID\n\n } else {\n","file_path":"gstreamer-audio/src/audio_channel_position.rs","rank":41,"score":189403.86933760231},{"content":"#[cfg(any(feature = \"v1_14\", feature = \"dox\"))]\n\npub fn debug_remove_ring_buffer_logger() {\n\n assert_initialized_main_thread!();\n\n unsafe {\n\n ffi::gst_debug_remove_ring_buffer_logger();\n\n }\n\n}\n\n\n","file_path":"gstreamer/src/auto/functions.rs","rank":42,"score":189403.86933760231},{"content":"struct TagValuesVisitor<'a>(&'a str, &'a mut TagListRef);\n\nimpl<'de, 'a> Visitor<'de> for TagValuesVisitor<'a> {\n\n type Value = ();\n\n\n\n fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {\n\n formatter.write_str(\"a sequence of `Tag` values with the same type\")\n\n }\n\n\n\n fn visit_seq<A: SeqAccess<'de>>(self, mut seq: A) -> Result<(), A::Error> {\n\n let tag_type: glib::Type = unsafe {\n\n let tag_name = self.0.to_glib_none();\n\n from_glib(ffi::gst_tag_get_type(tag_name.0))\n\n };\n\n\n\n loop {\n\n let tag_value = match tag_type {\n\n glib::Type::F64 => de_tag_value!(self.0, seq, f64),\n\n glib::Type::String => de_tag_value!(self.0, seq, String),\n\n glib::Type::U32 => de_tag_value!(self.0, seq, u32),\n\n glib::Type::U64 => de_tag_value!(self.0, seq, u64),\n","file_path":"gstreamer/src/tags_serde.rs","rank":43,"score":188168.03953882906},{"content":"pub fn debug_bin_to_dot_data<P: IsA<Bin>>(bin: &P, details: DebugGraphDetails) -> String {\n\n skip_assert_initialized!();\n\n unsafe {\n\n from_glib_full(ffi::gst_debug_bin_to_dot_data(bin.to_glib_none().0, details.to_glib()))\n\n }\n\n}\n\n\n","file_path":"gstreamer/src/auto/functions.rs","rank":44,"score":182880.20676408077},{"content":"pub fn debug_get_default_threshold() -> DebugLevel {\n\n assert_initialized_main_thread!();\n\n unsafe {\n\n from_glib(ffi::gst_debug_get_default_threshold())\n\n }\n\n}\n\n\n","file_path":"gstreamer/src/auto/functions.rs","rank":45,"score":181293.04685743814},{"content":"pub fn is_force_key_unit_event(event: &gst::EventRef) -> bool {\n\n unsafe { from_glib(ffi::gst_video_event_is_force_key_unit(event.as_mut_ptr())) }\n\n}\n\n\n\n// FIXME: Copy from gstreamer/src/event.rs\n\nmacro_rules! event_builder_generic_impl {\n\n ($new_fn:expr) => {\n\n pub fn seqnum(self, seqnum: gst::Seqnum) -> Self {\n\n Self {\n\n seqnum: Some(seqnum),\n\n .. self\n\n }\n\n }\n\n\n\n pub fn running_time_offset(self, running_time_offset: i64) -> Self {\n\n Self {\n\n running_time_offset: Some(running_time_offset),\n\n .. self\n\n }\n\n }\n","file_path":"gstreamer-video/src/video_event.rs","rank":46,"score":180680.85922190303},{"content":"pub trait EncodingProfileBuilder<'a>: Sized {\n\n fn name(self, name: &'a str) -> Self;\n\n fn description(self, description: &'a str) -> Self;\n\n fn format(self, format: &'a gst::Caps) -> Self;\n\n fn preset(self, preset: &'a str) -> Self;\n\n fn preset_name(self, preset_name: &'a str) -> Self;\n\n fn restriction(self, format: &'a gst::Caps) -> Self;\n\n fn presence(self, presence: u32) -> Self;\n\n fn allow_dynamic_output(self, allow: bool) -> Self;\n\n fn enabled(self, enabled: bool) -> Self;\n\n}\n\n\n\nmacro_rules! declare_encoding_profile_builder_common(\n\n ($name:ident) => {\n\n impl<'a> EncodingProfileBuilder<'a> for $name<'a> {\n\n fn name(mut self, name: &'a str) -> $name<'a> {\n\n self.base.name = Some(name);\n\n self\n\n }\n\n\n","file_path":"gstreamer-pbutils/src/encoding_profile.rs","rank":47,"score":180597.23590996343},{"content":"pub fn is_video_overlay_prepare_window_handle_message(msg: &gst::MessageRef) -> bool {\n\n unsafe {\n\n from_glib(ffi::gst_is_video_overlay_prepare_window_handle_message(\n\n msg.as_mut_ptr(),\n\n ))\n\n }\n\n}\n","file_path":"gstreamer-video/src/video_overlay.rs","rank":48,"score":175751.29521036719},{"content":"pub trait IteratorImpl<T>: Clone + Send + 'static\n\nwhere\n\n for<'a> T: FromValueOptional<'a> + StaticType + ToValue + Send + 'static,\n\n{\n\n fn next(&mut self) -> Option<Result<T, IteratorError>>;\n\n fn resync(&mut self);\n\n}\n\n\n\nunsafe extern \"C\" fn rs_iterator_copy<T, I: IteratorImpl<T>>(\n\n it: *const ffi::GstIterator,\n\n copy: *mut ffi::GstIterator,\n\n) where\n\n for<'a> T: FromValueOptional<'a> + StaticType + ToValue + Send + 'static,\n\n{\n\n let it = it as *const RsIterator<T, I>;\n\n let copy = copy as *mut RsIterator<T, I>;\n\n\n\n ptr::write(&mut (*copy).imp, (*it).imp.clone());\n\n}\n\n\n","file_path":"gstreamer/src/iterator.rs","rank":49,"score":173931.9892592216},{"content":"#[cfg(any(feature = \"v1_14\", feature = \"dox\"))]\n\npub fn debug_ring_buffer_logger_get_logs() -> Vec<String> {\n\n assert_initialized_main_thread!();\n\n unsafe {\n\n FromGlibPtrContainer::from_glib_full(ffi::gst_debug_ring_buffer_logger_get_logs())\n\n }\n\n}\n\n\n","file_path":"gstreamer/src/auto/functions.rs","rank":50,"score":171092.00218529892},{"content":"pub fn parse_still_frame_event(event: &gst::EventRef) -> Option<StillFrameEvent> {\n\n unsafe {\n\n let mut in_still = mem::uninitialized();\n\n\n\n let res: bool = from_glib(ffi::gst_video_event_parse_still_frame(\n\n event.as_mut_ptr(),\n\n &mut in_still,\n\n ));\n\n if res {\n\n Some(StillFrameEvent {\n\n in_still: from_glib(in_still),\n\n })\n\n } else {\n\n None\n\n }\n\n }\n\n}\n","file_path":"gstreamer-video/src/video_event.rs","rank":51,"score":169336.64377486738},{"content":"fn get_other_type_id<T: StaticType>() -> usize {\n\n match T::static_type() {\n\n glib::Type::Other(type_id) => type_id,\n\n type_ => panic!(\"Expecting `Other` variant, found `{}`\", type_),\n\n }\n\n}\n\n\n\nlazy_static! {\n\n pub(crate) static ref ARRAY_OTHER_TYPE_ID: usize = get_other_type_id::<Array>();\n\n pub(crate) static ref BITMASK_OTHER_TYPE_ID: usize = get_other_type_id::<Bitmask>();\n\n pub(crate) static ref DATE_TIME_OTHER_TYPE_ID: usize = get_other_type_id::<DateTime>();\n\n pub(crate) static ref FRACTION_OTHER_TYPE_ID: usize = get_other_type_id::<Fraction>();\n\n pub(crate) static ref FRACTION_RANGE_OTHER_TYPE_ID: usize =\n\n get_other_type_id::<FractionRange>();\n\n pub(crate) static ref INT_RANGE_I32_OTHER_TYPE_ID: usize = get_other_type_id::<IntRange<i32>>();\n\n pub(crate) static ref INT_RANGE_I64_OTHER_TYPE_ID: usize = get_other_type_id::<IntRange<i64>>();\n\n pub(crate) static ref LIST_OTHER_TYPE_ID: usize = get_other_type_id::<List>();\n\n pub(crate) static ref SAMPLE_OTHER_TYPE_ID: usize = get_other_type_id::<Sample>();\n\n}\n\n\n","file_path":"gstreamer/src/value_serde.rs","rank":52,"score":168085.48805472834},{"content":"pub fn parse_force_key_unit_event(event: &gst::EventRef) -> Option<ForceKeyUnitEvent> {\n\n if event.is_upstream() {\n\n parse_upstream_force_key_unit_event(event).map(ForceKeyUnitEvent::Upstream)\n\n } else {\n\n parse_downstream_force_key_unit_event(event).map(ForceKeyUnitEvent::Downstream)\n\n }\n\n}\n\n\n","file_path":"gstreamer-video/src/video_event.rs","rank":53,"score":164974.03964328844},{"content":"struct StructureForIter<'a>(&'a StructureRef);\n\nimpl<'a> Serialize for StructureForIter<'a> {\n\n fn serialize<S: Serializer>(&self, serializer: S) -> Result<S::Ok, S::Error> {\n\n let iter = self.0.iter();\n\n let size = iter.size_hint().0;\n\n if size > 0 {\n\n let mut seq = serializer.serialize_seq(Some(size))?;\n\n for field in iter {\n\n seq.serialize_element(&FieldSe(field.0, field.1))?;\n\n }\n\n seq.end()\n\n } else {\n\n let seq = serializer.serialize_seq(None)?;\n\n seq.end()\n\n }\n\n }\n\n}\n\n\n\nimpl Serialize for StructureRef {\n\n fn serialize<S: Serializer>(&self, serializer: S) -> Result<S::Ok, S::Error> {\n","file_path":"gstreamer/src/structure_serde.rs","rank":54,"score":162588.1297767748},{"content":"pub fn debug_bin_to_dot_file<P: IsA<Bin>, Q: AsRef<std::path::Path>>(bin: &P, details: DebugGraphDetails, file_name: Q) {\n\n skip_assert_initialized!();\n\n unsafe {\n\n ffi::gst_debug_bin_to_dot_file(bin.to_glib_none().0, details.to_glib(), file_name.as_ref().to_glib_none().0);\n\n }\n\n}\n\n\n","file_path":"gstreamer/src/auto/functions.rs","rank":55,"score":156100.2295650466},{"content":"pub fn new_downstream_force_key_unit_event<'a>() -> DownstreamForceKeyUnitEventBuilder<'a> {\n\n DownstreamForceKeyUnitEventBuilder::new()\n\n}\n\n\n\npub struct DownstreamForceKeyUnitEventBuilder<'a> {\n\n seqnum: Option<gst::Seqnum>,\n\n running_time_offset: Option<i64>,\n\n other_fields: Vec<(&'a str, &'a ToSendValue)>,\n\n timestamp: gst::ClockTime,\n\n stream_time: gst::ClockTime,\n\n running_time: gst::ClockTime,\n\n all_headers: bool,\n\n count: u32,\n\n}\n\n\n\nimpl<'a> DownstreamForceKeyUnitEventBuilder<'a> {\n\n fn new() -> Self {\n\n skip_assert_initialized!();\n\n Self {\n\n seqnum: None,\n","file_path":"gstreamer-video/src/video_event.rs","rank":56,"score":155013.49113351168},{"content":"pub fn new_upstream_force_key_unit_event<'a>() -> UpstreamForceKeyUnitEventBuilder<'a> {\n\n UpstreamForceKeyUnitEventBuilder::new()\n\n}\n\n\n\npub struct UpstreamForceKeyUnitEventBuilder<'a> {\n\n seqnum: Option<gst::Seqnum>,\n\n running_time_offset: Option<i64>,\n\n other_fields: Vec<(&'a str, &'a ToSendValue)>,\n\n running_time: gst::ClockTime,\n\n all_headers: bool,\n\n count: u32,\n\n}\n\n\n\nimpl<'a> UpstreamForceKeyUnitEventBuilder<'a> {\n\n fn new() -> Self {\n\n skip_assert_initialized!();\n\n Self {\n\n seqnum: None,\n\n running_time_offset: None,\n\n other_fields: Vec::new(),\n","file_path":"gstreamer-video/src/video_event.rs","rank":57,"score":155013.49113351168},{"content":"pub fn debug_bin_to_dot_file_with_ts<P: IsA<Bin>, Q: AsRef<std::path::Path>>(bin: &P, details: DebugGraphDetails, file_name: Q) {\n\n skip_assert_initialized!();\n\n unsafe {\n\n ffi::gst_debug_bin_to_dot_file_with_ts(bin.to_glib_none().0, details.to_glib(), file_name.as_ref().to_glib_none().0);\n\n }\n\n}\n\n\n","file_path":"gstreamer/src/auto/functions.rs","rank":58,"score":154374.95599726957},{"content":"pub trait Tag<'a> {\n\n type TagType: FromValueOptional<'a> + SetValue + Send;\n\n fn tag_name<'b>() -> &'b str;\n\n}\n\n\n\nmacro_rules! impl_tag(\n\n ($name:ident, $t:ty, $rust_tag:ident, $gst_tag:ident) => {\n\n pub enum $name {}\n\n impl<'a> Tag<'a> for $name {\n\n type TagType = $t;\n\n fn tag_name<'b>() -> &'b str {\n\n *$rust_tag\n\n }\n\n }\n\n\n\n lazy_static! {\n\n pub(crate) static ref $rust_tag: &'static str =\n\n unsafe { CStr::from_ptr(ffi::$gst_tag).to_str().unwrap() };\n\n }\n\n };\n","file_path":"gstreamer/src/tags.rs","rank":59,"score":152169.4638977395},{"content":"pub trait PipelineExt {\n\n fn auto_clock(&self);\n\n\n\n fn get_auto_flush_bus(&self) -> bool;\n\n\n\n fn get_delay(&self) -> ClockTime;\n\n\n\n fn get_latency(&self) -> ClockTime;\n\n\n\n fn get_pipeline_clock(&self) -> Option<Clock>;\n\n\n\n fn set_auto_flush_bus(&self, auto_flush: bool);\n\n\n\n fn set_delay(&self, delay: ClockTime);\n\n\n\n fn set_latency(&self, latency: ClockTime);\n\n\n\n fn use_clock<'a, P: IsA<Clock> + 'a, Q: Into<Option<&'a P>>>(&self, clock: Q);\n\n\n\n fn connect_property_auto_flush_bus_notify<F: Fn(&Self) + Send + Sync + 'static>(&self, f: F) -> SignalHandlerId;\n","file_path":"gstreamer/src/auto/pipeline.rs","rank":60,"score":152022.51769296045},{"content":"pub trait ClockExtManual {\n\n fn new_periodic_id(&self, start_time: ClockTime, interval: ClockTime) -> Option<ClockId>;\n\n\n\n fn periodic_id_reinit(\n\n &self,\n\n id: &ClockId,\n\n start_time: ClockTime,\n\n interval: ClockTime,\n\n ) -> Result<(), glib::BoolError>;\n\n\n\n fn new_single_shot_id(&self, time: ClockTime) -> Option<ClockId>;\n\n\n\n fn single_shot_id_reinit(&self, id: &ClockId, time: ClockTime) -> Result<(), glib::BoolError>;\n\n}\n\n\n\nimpl<O: IsA<Clock> + IsA<glib::object::Object>> ClockExtManual for O {\n\n fn new_periodic_id(&self, start_time: ClockTime, interval: ClockTime) -> Option<ClockId> {\n\n unsafe {\n\n from_glib_full(ffi::gst_clock_new_periodic_id(\n\n self.to_glib_none().0,\n","file_path":"gstreamer/src/clock.rs","rank":61,"score":152022.51769296045},{"content":"pub trait PresetExt {\n\n fn delete_preset(&self, name: &str) -> Result<(), glib::error::BoolError>;\n\n\n\n fn get_meta(&self, name: &str, tag: &str) -> Option<String>;\n\n\n\n fn get_preset_names(&self) -> Vec<String>;\n\n\n\n fn get_property_names(&self) -> Vec<String>;\n\n\n\n fn is_editable(&self) -> bool;\n\n\n\n fn load_preset(&self, name: &str) -> Result<(), glib::error::BoolError>;\n\n\n\n fn rename_preset(&self, old_name: &str, new_name: &str) -> Result<(), glib::error::BoolError>;\n\n\n\n fn save_preset(&self, name: &str) -> Result<(), glib::error::BoolError>;\n\n\n\n fn set_meta<'a, P: Into<Option<&'a str>>>(&self, name: &str, tag: &str, value: P) -> Result<(), glib::error::BoolError>;\n\n}\n\n\n","file_path":"gstreamer/src/auto/preset.rs","rank":62,"score":152022.51769296045},{"content":"pub trait BinExtManual {\n\n fn add_many<E: IsA<Element>>(&self, elements: &[&E]) -> Result<(), glib::BoolError>;\n\n fn remove_many<E: IsA<Element>>(&self, elements: &[&E]) -> Result<(), glib::BoolError>;\n\n\n\n fn iterate_all_by_interface(&self, iface: glib::types::Type) -> ::Iterator<Element>;\n\n fn iterate_elements(&self) -> ::Iterator<Element>;\n\n fn iterate_recurse(&self) -> ::Iterator<Element>;\n\n fn iterate_sinks(&self) -> ::Iterator<Element>;\n\n fn iterate_sorted(&self) -> ::Iterator<Element>;\n\n fn iterate_sources(&self) -> ::Iterator<Element>;\n\n fn get_children(&self) -> Vec<Element>;\n\n}\n\n\n\nimpl<O: IsA<Bin>> BinExtManual for O {\n\n fn add_many<E: IsA<Element>>(&self, elements: &[&E]) -> Result<(), glib::BoolError> {\n\n for e in elements {\n\n unsafe {\n\n let ret: bool =\n\n from_glib(ffi::gst_bin_add(self.to_glib_none().0, e.to_glib_none().0));\n\n if !ret {\n","file_path":"gstreamer/src/bin.rs","rank":63,"score":152022.51769296045},{"content":"pub trait BinExt {\n\n fn add<P: IsA<Element>>(&self, element: &P) -> Result<(), glib::error::BoolError>;\n\n\n\n //fn add_many<P: IsA<Element>>(&self, element_1: &P, : /*Unknown conversion*//*Unimplemented*/Fundamental: VarArgs);\n\n\n\n fn find_unlinked_pad(&self, direction: PadDirection) -> Option<Pad>;\n\n\n\n fn get_by_interface(&self, iface: glib::types::Type) -> Option<Element>;\n\n\n\n fn get_by_name(&self, name: &str) -> Option<Element>;\n\n\n\n fn get_by_name_recurse_up(&self, name: &str) -> Option<Element>;\n\n\n\n #[cfg(any(feature = \"v1_10\", feature = \"dox\"))]\n\n fn get_suppressed_flags(&self) -> ElementFlags;\n\n\n\n //fn iterate_all_by_interface(&self, iface: glib::types::Type) -> /*Ignored*/Option<Iterator>;\n\n\n\n //fn iterate_elements(&self) -> /*Ignored*/Option<Iterator>;\n\n\n","file_path":"gstreamer/src/auto/bin.rs","rank":64,"score":152022.51769296045},{"content":"pub trait PadExtManual {\n\n fn add_probe<F>(&self, mask: PadProbeType, func: F) -> Option<PadProbeId>\n\n where\n\n F: Fn(&Pad, &mut PadProbeInfo) -> PadProbeReturn + Send + Sync + 'static;\n\n fn remove_probe(&self, id: PadProbeId);\n\n\n\n fn chain(&self, buffer: Buffer) -> FlowReturn;\n\n fn push(&self, buffer: Buffer) -> FlowReturn;\n\n\n\n fn chain_list(&self, list: BufferList) -> FlowReturn;\n\n fn push_list(&self, list: BufferList) -> FlowReturn;\n\n\n\n fn pull_range(&self, offset: u64, size: u32) -> Result<Buffer, FlowReturn>;\n\n fn get_range(&self, offset: u64, size: u32) -> Result<Buffer, FlowReturn>;\n\n\n\n fn peer_query(&self, query: &mut QueryRef) -> bool;\n\n fn query(&self, query: &mut QueryRef) -> bool;\n\n fn query_default<'a, P: IsA<Object> + 'a, Q: Into<Option<&'a P>>>(\n\n &self,\n\n parent: Q,\n","file_path":"gstreamer/src/pad.rs","rank":65,"score":152022.51769296045},{"content":"pub trait PadExt {\n\n fn activate_mode(&self, mode: PadMode, active: bool) -> Result<(), glib::error::BoolError>;\n\n\n\n //fn add_probe(&self, mask: PadProbeType, callback: /*Unknown conversion*//*Unimplemented*/PadProbeCallback, destroy_data: /*Unknown conversion*//*Unimplemented*/DestroyNotify) -> libc::c_ulong;\n\n\n\n fn can_link<P: IsA<Pad>>(&self, sinkpad: &P) -> bool;\n\n\n\n fn check_reconfigure(&self) -> bool;\n\n\n\n fn create_stream_id<'a, P: IsA<Element>, Q: Into<Option<&'a str>>>(&self, parent: &P, stream_id: Q) -> Option<String>;\n\n\n\n //fn create_stream_id_printf<'a, P: IsA<Element>, Q: Into<Option<&'a str>>>(&self, parent: &P, stream_id: Q, : /*Unknown conversion*//*Unimplemented*/Fundamental: VarArgs) -> Option<String>;\n\n\n\n //fn create_stream_id_printf_valist<'a, P: IsA<Element>, Q: Into<Option<&'a str>>>(&self, parent: &P, stream_id: Q, var_args: /*Unknown conversion*//*Unimplemented*/Unsupported) -> Option<String>;\n\n\n\n //fn forward<P: Into<Option</*Unimplemented*/Fundamental: Pointer>>>(&self, forward: /*Unknown conversion*//*Unimplemented*/PadForwardFunction, user_data: P) -> bool;\n\n\n\n fn get_allowed_caps(&self) -> Option<Caps>;\n\n\n\n fn get_current_caps(&self) -> Option<Caps>;\n","file_path":"gstreamer/src/auto/pad.rs","rank":66,"score":152022.51769296045},{"content":"pub trait DeviceExt {\n\n fn create_element<'a, P: Into<Option<&'a str>>>(&self, name: P) -> Option<Element>;\n\n\n\n fn get_caps(&self) -> Option<Caps>;\n\n\n\n fn get_device_class(&self) -> String;\n\n\n\n fn get_display_name(&self) -> String;\n\n\n\n fn get_properties(&self) -> Option<Structure>;\n\n\n\n fn has_classes(&self, classes: &str) -> bool;\n\n\n\n fn has_classesv(&self, classes: &[&str]) -> bool;\n\n\n\n fn reconfigure_element<P: IsA<Element>>(&self, element: &P) -> bool;\n\n\n\n fn connect_removed<F: Fn(&Self) + Send + Sync + 'static>(&self, f: F) -> SignalHandlerId;\n\n}\n\n\n","file_path":"gstreamer/src/auto/device.rs","rank":67,"score":152022.51769296045},{"content":"pub trait ClockExt {\n\n fn add_observation(&self, slave: ClockTime, master: ClockTime) -> Option<f64>;\n\n\n\n fn add_observation_unapplied(&self, slave: ClockTime, master: ClockTime) -> Option<(f64, ClockTime, ClockTime, ClockTime, ClockTime)>;\n\n\n\n fn adjust_unlocked(&self, internal: ClockTime) -> ClockTime;\n\n\n\n fn get_calibration(&self) -> (ClockTime, ClockTime, ClockTime, ClockTime);\n\n\n\n fn get_internal_time(&self) -> ClockTime;\n\n\n\n fn get_master(&self) -> Option<Clock>;\n\n\n\n fn get_resolution(&self) -> ClockTime;\n\n\n\n fn get_time(&self) -> ClockTime;\n\n\n\n fn get_timeout(&self) -> ClockTime;\n\n\n\n fn is_synced(&self) -> bool;\n","file_path":"gstreamer/src/auto/clock.rs","rank":68,"score":152022.51769296045},{"content":"pub trait ElementExt {\n\n fn abort_state(&self);\n\n\n\n fn add_pad<P: IsA<Pad>>(&self, pad: &P) -> Result<(), glib::error::BoolError>;\n\n\n\n //#[cfg(any(feature = \"v1_10\", feature = \"dox\"))]\n\n //fn call_async(&self, func: /*Unknown conversion*//*Unimplemented*/ElementCallAsyncFunc, destroy_notify: /*Unknown conversion*//*Unimplemented*/DestroyNotify);\n\n\n\n fn change_state(&self, transition: StateChange) -> StateChangeReturn;\n\n\n\n fn continue_state(&self, ret: StateChangeReturn) -> StateChangeReturn;\n\n\n\n fn create_all_pads(&self);\n\n\n\n //#[cfg(any(feature = \"v1_14\", feature = \"dox\"))]\n\n //fn foreach_pad<P: Into<Option</*Unimplemented*/Fundamental: Pointer>>>(&self, func: /*Unknown conversion*//*Unimplemented*/ElementForeachPadFunc, user_data: P) -> bool;\n\n\n\n //#[cfg(any(feature = \"v1_14\", feature = \"dox\"))]\n\n //fn foreach_sink_pad<P: Into<Option</*Unimplemented*/Fundamental: Pointer>>>(&self, func: /*Unknown conversion*//*Unimplemented*/ElementForeachPadFunc, user_data: P) -> bool;\n\n\n","file_path":"gstreamer/src/auto/element.rs","rank":69,"score":152022.51769296045},{"content":"pub trait ElementExtManual {\n\n fn query(&self, query: &mut QueryRef) -> bool;\n\n\n\n fn send_event(&self, event: Event) -> bool;\n\n\n\n fn get_metadata<'a>(&self, key: &str) -> Option<&'a str>;\n\n\n\n fn get_pad_template(&self, name: &str) -> Option<PadTemplate>;\n\n fn get_pad_template_list(&self) -> Vec<PadTemplate>;\n\n\n\n #[cfg_attr(feature = \"cargo-clippy\", allow(too_many_arguments))]\n\n fn message_full<T: ::MessageErrorDomain>(\n\n &self,\n\n type_: ElementMessageType,\n\n code: T,\n\n message: Option<&str>,\n\n debug: Option<&str>,\n\n file: &str,\n\n function: &str,\n\n line: u32,\n","file_path":"gstreamer/src/element.rs","rank":70,"score":152022.51769296045},{"content":"pub fn convert_sample(\n\n sample: &gst::Sample,\n\n caps: &gst::Caps,\n\n timeout: gst::ClockTime,\n\n) -> Result<gst::Sample, glib::Error> {\n\n unsafe {\n\n let mut error = ptr::null_mut();\n\n let ret = ffi::gst_video_convert_sample(\n\n sample.to_glib_none().0,\n\n caps.to_glib_none().0,\n\n timeout.to_glib(),\n\n &mut error,\n\n );\n\n\n\n if error.is_null() {\n\n Ok(from_glib_full(ret))\n\n } else {\n\n Err(from_glib_full(error))\n\n }\n\n }\n\n}\n\n\n","file_path":"gstreamer-video/src/functions.rs","rank":71,"score":151569.26775069794},{"content":"pub trait GstObjectExtManual {\n\n fn connect_deep_notify<\n\n 'a,\n\n P: Into<Option<&'a str>>,\n\n F: Fn(&Self, &::Object, &glib::ParamSpec) + Send + Sync + 'static,\n\n >(\n\n &self,\n\n name: P,\n\n f: F,\n\n ) -> SignalHandlerId;\n\n}\n\n\n\nimpl<O: IsA<::Object> + IsA<glib::Object> + glib::value::SetValue> GstObjectExtManual for O {\n\n fn connect_deep_notify<\n\n 'a,\n\n P: Into<Option<&'a str>>,\n\n F: Fn(&Self, &::Object, &glib::ParamSpec) + Send + Sync + 'static,\n\n >(\n\n &self,\n\n name: P,\n","file_path":"gstreamer/src/object.rs","rank":72,"score":149591.25183543772},{"content":"pub trait GstObjectExt {\n\n //fn add_control_binding(&self, binding: /*Ignored*/&ControlBinding) -> bool;\n\n\n\n fn default_error<'a, P: Into<Option<&'a str>>>(&self, error: &Error, debug: P);\n\n\n\n //fn get_control_binding(&self, property_name: &str) -> /*Ignored*/Option<ControlBinding>;\n\n\n\n fn get_control_rate(&self) -> ClockTime;\n\n\n\n //fn get_g_value_array(&self, property_name: &str, timestamp: ClockTime, interval: ClockTime, values: /*Ignored*/&[&glib::Value]) -> bool;\n\n\n\n fn get_name(&self) -> String;\n\n\n\n fn get_parent(&self) -> Option<Object>;\n\n\n\n fn get_path_string(&self) -> String;\n\n\n\n //fn get_value(&self, property_name: &str, timestamp: ClockTime) -> /*Ignored*/Option<glib::Value>;\n\n\n\n //fn get_value_array<P: Into<Option</*Unimplemented*/Fundamental: Pointer>>>(&self, property_name: &str, timestamp: ClockTime, interval: ClockTime, n_values: u32, values: P) -> bool;\n","file_path":"gstreamer/src/auto/object.rs","rank":73,"score":149591.25183543772},{"content":"pub trait AggregatorExt {\n\n //#[cfg(any(feature = \"v1_14\", feature = \"dox\"))]\n\n //fn get_allocator(&self, allocator: /*Ignored*/gst::Allocator, params: /*Ignored*/gst::AllocationParams);\n\n\n\n #[cfg(any(feature = \"v1_14\", feature = \"dox\"))]\n\n fn get_buffer_pool(&self) -> Option<gst::BufferPool>;\n\n\n\n #[cfg(any(feature = \"v1_14\", feature = \"dox\"))]\n\n fn get_latency(&self) -> gst::ClockTime;\n\n\n\n #[cfg(any(feature = \"v1_14\", feature = \"dox\"))]\n\n fn set_latency(&self, min_latency: gst::ClockTime, max_latency: gst::ClockTime);\n\n\n\n #[cfg(any(feature = \"v1_14\", feature = \"dox\"))]\n\n fn set_src_caps(&self, caps: &gst::Caps);\n\n\n\n fn get_property_start_time(&self) -> u64;\n\n\n\n fn set_property_start_time(&self, start_time: u64);\n\n\n","file_path":"gstreamer-base/src/auto/aggregator.rs","rank":74,"score":149591.25183543772},{"content":"pub trait AggregatorExtManual {\n\n fn finish_buffer(&self, buffer: gst::Buffer) -> gst::FlowReturn;\n\n}\n\n\n\nimpl<O: IsA<Aggregator>> AggregatorExtManual for O {\n\n fn finish_buffer(&self, buffer: gst::Buffer) -> gst::FlowReturn {\n\n unsafe {\n\n from_glib(ffi::gst_aggregator_finish_buffer(\n\n self.to_glib_none().0,\n\n buffer.into_ptr(),\n\n ))\n\n }\n\n }\n\n}\n","file_path":"gstreamer-base/src/aggregator.rs","rank":75,"score":149591.25183543772},{"content":"pub trait TagSetterExt {\n\n //fn add_tag_valist(&self, mode: TagMergeMode, tag: &str, var_args: /*Unknown conversion*//*Unimplemented*/Unsupported);\n\n\n\n //fn add_tag_valist_values(&self, mode: TagMergeMode, tag: &str, var_args: /*Unknown conversion*//*Unimplemented*/Unsupported);\n\n\n\n //fn add_tag_value(&self, mode: TagMergeMode, tag: &str, value: /*Ignored*/&glib::Value);\n\n\n\n //fn add_tag_values(&self, mode: TagMergeMode, tag: &str, : /*Unknown conversion*//*Unimplemented*/Fundamental: VarArgs);\n\n\n\n //fn add_tags(&self, mode: TagMergeMode, tag: &str, : /*Unknown conversion*//*Unimplemented*/Fundamental: VarArgs);\n\n\n\n fn get_tag_list(&self) -> Option<TagList>;\n\n\n\n fn get_tag_merge_mode(&self) -> TagMergeMode;\n\n\n\n fn merge_tags(&self, list: &TagList, mode: TagMergeMode);\n\n\n\n fn reset_tags(&self);\n\n\n\n fn set_tag_merge_mode(&self, mode: TagMergeMode);\n","file_path":"gstreamer/src/auto/tag_setter.rs","rank":76,"score":147279.61283910155},{"content":"pub trait ChildProxyExt {\n\n fn child_added<P: IsA<glib::Object>>(&self, child: &P, name: &str);\n\n\n\n fn child_removed<P: IsA<glib::Object>>(&self, child: &P, name: &str);\n\n\n\n //fn get(&self, first_property_name: &str, : /*Unknown conversion*//*Unimplemented*/Fundamental: VarArgs);\n\n\n\n fn get_child_by_index(&self, index: u32) -> Option<glib::Object>;\n\n\n\n fn get_child_by_name(&self, name: &str) -> Option<glib::Object>;\n\n\n\n fn get_children_count(&self) -> u32;\n\n\n\n //fn get_property(&self, name: &str, value: /*Ignored*/glib::Value);\n\n\n\n //fn get_valist(&self, first_property_name: &str, var_args: /*Unknown conversion*//*Unimplemented*/Unsupported);\n\n\n\n //fn lookup(&self, name: &str, pspec: /*Ignored*/glib::ParamSpec) -> Option<glib::Object>;\n\n\n\n //fn set(&self, first_property_name: &str, : /*Unknown conversion*//*Unimplemented*/Fundamental: VarArgs);\n","file_path":"gstreamer/src/auto/child_proxy.rs","rank":77,"score":147279.61283910155},{"content":"pub trait DeviceProviderExtManual {\n\n fn get_metadata<'a>(&self, key: &str) -> Option<&'a str>;\n\n}\n\n\n\nimpl<O: IsA<DeviceProvider>> DeviceProviderExtManual for O {\n\n fn get_metadata<'a>(&self, key: &str) -> Option<&'a str> {\n\n unsafe {\n\n let klass = (*(self.to_glib_none().0 as *mut gobject_ffi::GTypeInstance)).g_class\n\n as *mut ffi::GstDeviceProviderClass;\n\n\n\n let ptr = ffi::gst_device_provider_class_get_metadata(klass, key.to_glib_none().0);\n\n\n\n if ptr.is_null() {\n\n None\n\n } else {\n\n Some(CStr::from_ptr(ptr).to_str().unwrap())\n\n }\n\n }\n\n }\n\n}\n","file_path":"gstreamer/src/device_provider.rs","rank":78,"score":147279.61283910155},{"content":"pub trait DeviceMonitorExt {\n\n fn add_filter<'a, 'b, P: Into<Option<&'a str>>, Q: Into<Option<&'b Caps>>>(&self, classes: P, caps: Q) -> u32;\n\n\n\n fn get_bus(&self) -> Bus;\n\n\n\n fn get_devices(&self) -> Vec<Device>;\n\n\n\n fn get_providers(&self) -> Vec<String>;\n\n\n\n fn get_show_all_devices(&self) -> bool;\n\n\n\n fn remove_filter(&self, filter_id: u32) -> bool;\n\n\n\n fn set_show_all_devices(&self, show_all: bool);\n\n\n\n fn start(&self) -> Result<(), glib::error::BoolError>;\n\n\n\n fn stop(&self);\n\n\n\n fn get_property_show_all(&self) -> bool;\n","file_path":"gstreamer/src/auto/device_monitor.rs","rank":79,"score":147279.61283910155},{"content":"pub trait DeviceProviderExt {\n\n fn can_monitor(&self) -> bool;\n\n\n\n fn device_add(&self, device: &Device);\n\n\n\n fn device_remove(&self, device: &Device);\n\n\n\n fn get_bus(&self) -> Bus;\n\n\n\n fn get_devices(&self) -> Vec<Device>;\n\n\n\n fn get_factory(&self) -> Option<DeviceProviderFactory>;\n\n\n\n fn get_hidden_providers(&self) -> Vec<String>;\n\n\n\n fn hide_provider(&self, name: &str);\n\n\n\n fn start(&self) -> Result<(), glib::error::BoolError>;\n\n\n\n fn stop(&self);\n","file_path":"gstreamer/src/auto/device_provider.rs","rank":80,"score":147279.61283910155},{"content":"pub trait WindowsBusExtManual {\n\n fn get_pollfd(&self) -> windows::io::RawHandle;\n\n}\n\n\n\nimpl WindowsBusExtManual for Bus {\n\n /// This is supported on **Windows** only.\n\n fn get_pollfd(&self) -> windows::io::RawHandle {\n\n #[cfg(windows)]\n\n unsafe {\n\n let mut pollfd: glib_ffi::GPollFD = mem::zeroed();\n\n ffi::gst_bus_get_pollfd(self.to_glib_none().0, &mut pollfd);\n\n\n\n pollfd.fd as *mut _\n\n }\n\n\n\n #[cfg(all(not(windows), feature = \"dox\"))]\n\n windows::io::RawHandle {}\n\n }\n\n}\n","file_path":"gstreamer/src/bus_windows.rs","rank":81,"score":147279.61283910155},{"content":"pub trait GObjectExtManualGst {\n\n fn set_property_from_str(&self, name: &str, value: &str);\n\n}\n\n\n\nimpl<O: IsA<glib::Object>> GObjectExtManualGst for O {\n\n fn set_property_from_str(&self, name: &str, value: &str) {\n\n unsafe {\n\n ffi::gst_util_set_object_arg(\n\n self.to_glib_none().0,\n\n name.to_glib_none().0,\n\n value.to_glib_none().0,\n\n );\n\n }\n\n }\n\n}\n","file_path":"gstreamer/src/gobject.rs","rank":82,"score":147279.61283910155},{"content":"pub trait GhostPadExt {\n\n fn get_target(&self) -> Option<Pad>;\n\n\n\n fn set_target<'a, P: IsA<Pad> + 'a, Q: Into<Option<&'a P>>>(&self, newtarget: Q) -> Result<(), glib::error::BoolError>;\n\n}\n\n\n\nimpl<O: IsA<GhostPad>> GhostPadExt for O {\n\n fn get_target(&self) -> Option<Pad> {\n\n unsafe {\n\n from_glib_full(ffi::gst_ghost_pad_get_target(self.to_glib_none().0))\n\n }\n\n }\n\n\n\n fn set_target<'a, P: IsA<Pad> + 'a, Q: Into<Option<&'a P>>>(&self, newtarget: Q) -> Result<(), glib::error::BoolError> {\n\n let newtarget = newtarget.into();\n\n let newtarget = newtarget.to_glib_none();\n\n unsafe {\n\n glib::error::BoolError::from_glib(ffi::gst_ghost_pad_set_target(self.to_glib_none().0, newtarget.0), \"Failed to set target\")\n\n }\n\n }\n\n}\n","file_path":"gstreamer/src/auto/ghost_pad.rs","rank":83,"score":147279.61283910155},{"content":"pub trait UnixBusExtManual {\n\n fn get_pollfd(&self) -> unix::io::RawFd;\n\n}\n\n\n\nimpl UnixBusExtManual for Bus {\n\n /// This is supported on **Unix** only.\n\n fn get_pollfd(&self) -> unix::io::RawFd {\n\n #[cfg(unix)]\n\n unsafe {\n\n let mut pollfd: glib_ffi::GPollFD = mem::zeroed();\n\n ffi::gst_bus_get_pollfd(self.to_glib_none().0, &mut pollfd);\n\n\n\n pollfd.fd\n\n }\n\n\n\n #[cfg(all(not(unix), feature = \"dox\"))]\n\n unix::io::RawFd {}\n\n }\n\n}\n","file_path":"gstreamer/src/bus_unix.rs","rank":84,"score":147279.61283910155},{"content":"pub trait URIHandlerExt {\n\n fn get_protocols(&self) -> Vec<String>;\n\n\n\n fn get_uri(&self) -> Option<String>;\n\n\n\n fn get_uri_type(&self) -> URIType;\n\n\n\n fn set_uri(&self, uri: &str) -> Result<(), Error>;\n\n}\n\n\n\nimpl<O: IsA<URIHandler>> URIHandlerExt for O {\n\n fn get_protocols(&self) -> Vec<String> {\n\n unsafe {\n\n FromGlibPtrContainer::from_glib_none(ffi::gst_uri_handler_get_protocols(self.to_glib_none().0))\n\n }\n\n }\n\n\n\n fn get_uri(&self) -> Option<String> {\n\n unsafe {\n\n from_glib_full(ffi::gst_uri_handler_get_uri(self.to_glib_none().0))\n","file_path":"gstreamer/src/auto/uri_handler.rs","rank":85,"score":147279.61283910155},{"content":"pub trait TocSetterExt {\n\n fn get_toc(&self) -> Option<Toc>;\n\n\n\n fn reset(&self);\n\n\n\n fn set_toc<'a, P: Into<Option<&'a Toc>>>(&self, toc: P);\n\n}\n\n\n\nimpl<O: IsA<TocSetter>> TocSetterExt for O {\n\n fn get_toc(&self) -> Option<Toc> {\n\n unsafe {\n\n from_glib_full(ffi::gst_toc_setter_get_toc(self.to_glib_none().0))\n\n }\n\n }\n\n\n\n fn reset(&self) {\n\n unsafe {\n\n ffi::gst_toc_setter_reset(self.to_glib_none().0);\n\n }\n\n }\n\n\n\n fn set_toc<'a, P: Into<Option<&'a Toc>>>(&self, toc: P) {\n\n let toc = toc.into();\n\n let toc = toc.to_glib_none();\n\n unsafe {\n\n ffi::gst_toc_setter_set_toc(self.to_glib_none().0, toc.0);\n\n }\n\n }\n\n}\n","file_path":"gstreamer/src/auto/toc_setter.rs","rank":86,"score":147279.61283910155},{"content":"pub trait ChildProxyExtManual {\n\n fn get_child_property(&self, name: &str) -> Option<glib::Value>;\n\n fn set_child_property(&self, name: &str, value: &glib::ToValue) -> Result<(), glib::BoolError>;\n\n}\n\n\n\nimpl<O: IsA<ChildProxy>> ChildProxyExtManual for O {\n\n fn get_child_property(&self, name: &str) -> Option<glib::Value> {\n\n unsafe {\n\n let found: bool = from_glib(ffi::gst_child_proxy_lookup(\n\n self.to_glib_none().0,\n\n name.to_glib_none().0,\n\n ptr::null_mut(),\n\n ptr::null_mut(),\n\n ));\n\n if !found {\n\n return None;\n\n }\n\n\n\n let mut value = glib::Value::uninitialized();\n\n ffi::gst_child_proxy_get_property(\n","file_path":"gstreamer/src/child_proxy.rs","rank":87,"score":147279.61283910155},{"content":"pub trait PluginFeatureExt {\n\n fn check_version(&self, min_major: u32, min_minor: u32, min_micro: u32) -> bool;\n\n\n\n fn get_plugin(&self) -> Option<Plugin>;\n\n\n\n fn get_plugin_name(&self) -> Option<String>;\n\n\n\n fn get_rank(&self) -> u32;\n\n\n\n fn load(&self) -> Option<PluginFeature>;\n\n\n\n fn set_rank(&self, rank: u32);\n\n}\n\n\n\nimpl<O: IsA<PluginFeature>> PluginFeatureExt for O {\n\n fn check_version(&self, min_major: u32, min_minor: u32, min_micro: u32) -> bool {\n\n unsafe {\n\n from_glib(ffi::gst_plugin_feature_check_version(self.to_glib_none().0, min_major, min_minor, min_micro))\n\n }\n\n }\n","file_path":"gstreamer/src/auto/plugin_feature.rs","rank":88,"score":147279.61283910155},{"content":"pub trait SystemClockExt {\n\n fn get_property_clock_type(&self) -> ClockType;\n\n\n\n fn set_property_clock_type(&self, clock_type: ClockType);\n\n\n\n fn connect_property_clock_type_notify<F: Fn(&Self) + Send + Sync + 'static>(&self, f: F) -> SignalHandlerId;\n\n}\n\n\n\nimpl<O: IsA<SystemClock> + IsA<glib::object::Object>> SystemClockExt for O {\n\n fn get_property_clock_type(&self) -> ClockType {\n\n unsafe {\n\n let mut value = Value::from_type(<ClockType as StaticType>::static_type());\n\n gobject_ffi::g_object_get_property(self.to_glib_none().0, \"clock-type\".to_glib_none().0, value.to_glib_none_mut().0);\n\n value.get().unwrap()\n\n }\n\n }\n\n\n\n fn set_property_clock_type(&self, clock_type: ClockType) {\n\n unsafe {\n\n gobject_ffi::g_object_set_property(self.to_glib_none().0, \"clock-type\".to_glib_none().0, Value::from(&clock_type).to_glib_none().0);\n","file_path":"gstreamer/src/auto/system_clock.rs","rank":89,"score":147279.61283910155},{"content":"pub trait ProxyPadExt {\n\n fn get_internal(&self) -> Option<ProxyPad>;\n\n}\n\n\n\nimpl<O: IsA<ProxyPad>> ProxyPadExt for O {\n\n fn get_internal(&self) -> Option<ProxyPad> {\n\n unsafe {\n\n from_glib_full(ffi::gst_proxy_pad_get_internal(self.to_glib_none().0))\n\n }\n\n }\n\n}\n","file_path":"gstreamer/src/auto/proxy_pad.rs","rank":90,"score":147279.61283910155},{"content":"pub trait TagSetterExtManual {\n\n fn add<'a, T: Tag<'a>>(&self, value: T::TagType, mode: TagMergeMode)\n\n where\n\n T::TagType: ToSendValue;\n\n}\n\n\n\nimpl<O: IsA<TagSetter>> TagSetterExtManual for O {\n\n fn add<'a, T: Tag<'a>>(&self, value: T::TagType, mode: TagMergeMode)\n\n where\n\n T::TagType: ToSendValue,\n\n {\n\n unsafe {\n\n let v = value.to_send_value();\n\n\n\n ffi::gst_tag_setter_add_tag_value(\n\n self.to_glib_none().0,\n\n mode.to_glib(),\n\n T::tag_name().to_glib_none().0,\n\n v.to_glib_none().0,\n\n );\n\n }\n\n }\n\n}\n","file_path":"gstreamer/src/tag_setter.rs","rank":91,"score":147279.61283910155},{"content":"pub fn debug_print_stack_trace() {\n\n assert_initialized_main_thread!();\n\n unsafe {\n\n ffi::gst_debug_print_stack_trace();\n\n }\n\n}\n\n\n","file_path":"gstreamer/src/auto/functions.rs","rank":92,"score":146827.6738059734},{"content":"pub fn reorder_channels(\n\n data: &mut [u8],\n\n format: ::AudioFormat,\n\n channels: u32,\n\n from: &[AudioChannelPosition],\n\n to: &[AudioChannelPosition],\n\n) -> Result<(), glib::BoolError> {\n\n assert_initialized_main_thread!();\n\n\n\n if from.len() != to.len() || from.len() > 64 {\n\n return Err(glib::BoolError(\"Invalid number of channels\"));\n\n }\n\n\n\n let from_len = from.len();\n\n let to_len = to.len();\n\n\n\n let from_raw: [ffi::GstAudioChannelPosition; 64] = array_init::array_init_copy(|i| {\n\n if i >= from_len as usize {\n\n ffi::GST_AUDIO_CHANNEL_POSITION_INVALID\n\n } else {\n","file_path":"gstreamer-audio/src/audio_channel_position.rs","rank":93,"score":146827.6738059734},{"content":"pub fn center_video_rectangle(\n\n src: &VideoRectangle,\n\n dst: &VideoRectangle,\n\n scale: bool,\n\n) -> VideoRectangle {\n\n let mut result = ffi::GstVideoRectangle {\n\n x: 0,\n\n y: 0,\n\n w: 0,\n\n h: 0,\n\n };\n\n let src_rect = ffi::GstVideoRectangle {\n\n x: src.x,\n\n y: src.y,\n\n w: src.w,\n\n h: src.h,\n\n };\n\n let dst_rect = ffi::GstVideoRectangle {\n\n x: dst.x,\n\n y: dst.y,\n\n w: dst.w,\n\n h: dst.h,\n\n };\n\n unsafe {\n\n ffi::gst_video_sink_center_rect(src_rect, dst_rect, &mut result, scale.to_glib());\n\n }\n\n VideoRectangle::new(result.x, result.y, result.w, result.h)\n\n}\n","file_path":"gstreamer-video/src/video_rectangle.rs","rank":94,"score":146827.6738059734},{"content":"struct CapsSome(Caps);\n\n\n","file_path":"gstreamer/src/caps_serde.rs","rank":95,"score":146325.95043933118},{"content":"pub trait DiscovererInfoExt {\n\n fn copy(&self) -> DiscovererInfo;\n\n\n\n fn get_audio_streams(&self) -> Vec<DiscovererStreamInfo>;\n\n\n\n fn get_container_streams(&self) -> Vec<DiscovererStreamInfo>;\n\n\n\n fn get_duration(&self) -> gst::ClockTime;\n\n\n\n #[cfg(any(feature = \"v1_14\", feature = \"dox\"))]\n\n fn get_live(&self) -> bool;\n\n\n\n fn get_misc(&self) -> Option<gst::Structure>;\n\n\n\n fn get_missing_elements_installer_details(&self) -> Vec<String>;\n\n\n\n fn get_result(&self) -> DiscovererResult;\n\n\n\n fn get_seekable(&self) -> bool;\n\n\n","file_path":"gstreamer-pbutils/src/auto/discoverer_info.rs","rank":96,"score":145078.98360413563},{"content":"pub trait BaseTransformExt {\n\n //fn get_allocator(&self, allocator: /*Ignored*/gst::Allocator, params: /*Ignored*/gst::AllocationParams);\n\n\n\n fn get_buffer_pool(&self) -> Option<gst::BufferPool>;\n\n\n\n fn is_in_place(&self) -> bool;\n\n\n\n fn is_passthrough(&self) -> bool;\n\n\n\n fn is_qos_enabled(&self) -> bool;\n\n\n\n fn reconfigure_sink(&self);\n\n\n\n fn reconfigure_src(&self);\n\n\n\n fn set_gap_aware(&self, gap_aware: bool);\n\n\n\n fn set_in_place(&self, in_place: bool);\n\n\n\n fn set_passthrough(&self, passthrough: bool);\n","file_path":"gstreamer-base/src/auto/base_transform.rs","rank":97,"score":145078.98360413563},{"content":"pub trait BaseSinkExt {\n\n //fn do_preroll(&self, obj: /*Ignored*/&gst::MiniObject) -> gst::FlowReturn;\n\n\n\n fn get_blocksize(&self) -> u32;\n\n\n\n #[cfg(any(feature = \"v1_12\", feature = \"dox\"))]\n\n fn get_drop_out_of_segment(&self) -> bool;\n\n\n\n fn get_last_sample(&self) -> Option<gst::Sample>;\n\n\n\n fn get_latency(&self) -> gst::ClockTime;\n\n\n\n fn get_max_bitrate(&self) -> u64;\n\n\n\n fn get_max_lateness(&self) -> i64;\n\n\n\n fn get_render_delay(&self) -> gst::ClockTime;\n\n\n\n fn get_sync(&self) -> bool;\n\n\n","file_path":"gstreamer-base/src/auto/base_sink.rs","rank":98,"score":145078.98360413563},{"content":"pub trait BaseSrcExt {\n\n //fn get_allocator(&self, allocator: /*Ignored*/gst::Allocator, params: /*Ignored*/gst::AllocationParams);\n\n\n\n fn get_blocksize(&self) -> u32;\n\n\n\n fn get_buffer_pool(&self) -> Option<gst::BufferPool>;\n\n\n\n fn get_do_timestamp(&self) -> bool;\n\n\n\n fn is_async(&self) -> bool;\n\n\n\n fn is_live(&self) -> bool;\n\n\n\n fn new_seamless_segment(&self, start: i64, stop: i64, time: i64) -> bool;\n\n\n\n fn query_latency(&self) -> Option<(bool, gst::ClockTime, gst::ClockTime)>;\n\n\n\n fn set_async(&self, async: bool);\n\n\n\n fn set_automatic_eos(&self, automatic_eos: bool);\n","file_path":"gstreamer-base/src/auto/base_src.rs","rank":99,"score":145078.98360413563}],"string":"[\n {\n \"content\": \"pub fn type_find_helper<P: IsA<gst::Pad>>(src: &P, size: u64) -> Option<gst::Caps> {\\n\\n assert_initialized_main_thread!();\\n\\n unsafe {\\n\\n from_glib_full(ffi::gst_type_find_helper(src.to_glib_none().0, size))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer-base/src/auto/functions.rs\",\n \"rank\": 0,\n \"score\": 349503.0390563768\n },\n {\n \"content\": \"pub fn type_find_helper_for_buffer<'a, P: IsA<gst::Object> + 'a, Q: Into<Option<&'a P>>>(obj: Q, buf: &gst::Buffer) -> (Option<gst::Caps>, gst::TypeFindProbability) {\\n\\n assert_initialized_main_thread!();\\n\\n let obj = obj.into();\\n\\n let obj = obj.to_glib_none();\\n\\n unsafe {\\n\\n let mut prob = mem::uninitialized();\\n\\n let ret = from_glib_full(ffi::gst_type_find_helper_for_buffer(obj.0, buf.to_glib_none().0, &mut prob));\\n\\n (ret, from_glib(prob))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer-base/src/auto/functions.rs\",\n \"rank\": 1,\n \"score\": 335275.7058662332\n },\n {\n \"content\": \"pub fn type_find_helper_for_extension<'a, P: IsA<gst::Object> + 'a, Q: Into<Option<&'a P>>>(obj: Q, extension: &str) -> Option<gst::Caps> {\\n\\n assert_initialized_main_thread!();\\n\\n let obj = obj.into();\\n\\n let obj = obj.to_glib_none();\\n\\n unsafe {\\n\\n from_glib_full(ffi::gst_type_find_helper_for_extension(obj.0, extension.to_glib_none().0))\\n\\n }\\n\\n}\\n\\n\\n\\n//pub fn type_find_helper_get_range<'a, P: IsA<gst::Object>, Q: IsA<gst::Object> + 'a, R: Into<Option<&'a Q>>>(obj: &P, parent: R, func: /*Unknown conversion*//*Unimplemented*/TypeFindHelperGetRangeFunction, size: u64, extension: &str) -> (Option<gst::Caps>, gst::TypeFindProbability) {\\n\\n// unsafe { TODO: call ffi::gst_type_find_helper_get_range() }\\n\\n//}\\n\",\n \"file_path\": \"gstreamer-base/src/auto/functions.rs\",\n \"rank\": 2,\n \"score\": 333393.08465173846\n },\n {\n \"content\": \"pub fn version() -> (u32, u32, u32, u32) {\\n\\n assert_initialized_main_thread!();\\n\\n unsafe {\\n\\n let mut major = mem::uninitialized();\\n\\n let mut minor = mem::uninitialized();\\n\\n let mut micro = mem::uninitialized();\\n\\n let mut nano = mem::uninitialized();\\n\\n ffi::gst_version(&mut major, &mut minor, &mut micro, &mut nano);\\n\\n (major, minor, micro, nano)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/auto/functions.rs\",\n \"rank\": 3,\n \"score\": 303484.37578508875\n },\n {\n \"content\": \"pub fn parse_launch_full<'a, P: Into<Option<&'a mut ParseContext>>>(\\n\\n pipeline_description: &str,\\n\\n context: P,\\n\\n flags: ParseFlags,\\n\\n) -> Result<Element, Error> {\\n\\n assert_initialized_main_thread!();\\n\\n let mut context = context.into();\\n\\n unsafe {\\n\\n let mut error = ptr::null_mut();\\n\\n let ret = ffi::gst_parse_launch_full(\\n\\n pipeline_description.to_glib_none().0,\\n\\n context.to_glib_none_mut().0,\\n\\n flags.to_glib(),\\n\\n &mut error,\\n\\n );\\n\\n if error.is_null() {\\n\\n Ok(from_glib_none(ret))\\n\\n } else {\\n\\n Err(from_glib_full(error))\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/functions.rs\",\n \"rank\": 4,\n \"score\": 299121.39432439633\n },\n {\n \"content\": \"pub fn parse_launchv_full<'a, P: Into<Option<&'a mut ParseContext>>>(\\n\\n argv: &[&str],\\n\\n context: P,\\n\\n flags: ParseFlags,\\n\\n) -> Result<Element, Error> {\\n\\n assert_initialized_main_thread!();\\n\\n let mut context = context.into();\\n\\n unsafe {\\n\\n let mut error = ptr::null_mut();\\n\\n let ret = ffi::gst_parse_launchv_full(\\n\\n argv.to_glib_none().0,\\n\\n context.to_glib_none_mut().0,\\n\\n flags.to_glib(),\\n\\n &mut error,\\n\\n );\\n\\n if error.is_null() {\\n\\n Ok(from_glib_none(ret))\\n\\n } else {\\n\\n Err(from_glib_full(error))\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/functions.rs\",\n \"rank\": 5,\n \"score\": 299121.39432439633\n },\n {\n \"content\": \"pub fn parse_bin_from_description_full<'a, P: Into<Option<&'a mut ParseContext>>>(\\n\\n bin_description: &str,\\n\\n ghost_unlinked_pads: bool,\\n\\n context: P,\\n\\n flags: ParseFlags,\\n\\n) -> Result<Element, Error> {\\n\\n assert_initialized_main_thread!();\\n\\n let mut context = context.into();\\n\\n unsafe {\\n\\n let mut error = ptr::null_mut();\\n\\n let ret = ffi::gst_parse_bin_from_description_full(\\n\\n bin_description.to_glib_none().0,\\n\\n ghost_unlinked_pads.to_glib(),\\n\\n context.to_glib_none_mut().0,\\n\\n flags.to_glib(),\\n\\n &mut error,\\n\\n );\\n\\n if error.is_null() {\\n\\n Ok(from_glib_none(ret))\\n\\n } else {\\n\\n Err(from_glib_full(error))\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/functions.rs\",\n \"rank\": 6,\n \"score\": 294333.1040753911\n },\n {\n \"content\": \"pub fn debug_set_threshold_from_string(list: &str, reset: bool) {\\n\\n assert_initialized_main_thread!();\\n\\n unsafe {\\n\\n ffi::gst_debug_set_threshold_from_string(list.to_glib_none().0, reset.to_glib());\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/auto/functions.rs\",\n \"rank\": 7,\n \"score\": 291262.54111425235\n },\n {\n \"content\": \"pub fn init() -> Result<(), glib::Error> {\\n\\n unsafe {\\n\\n let mut error = ptr::null_mut();\\n\\n if from_glib(ffi::gst_init_check(\\n\\n ptr::null_mut(),\\n\\n ptr::null_mut(),\\n\\n &mut error,\\n\\n )) {\\n\\n Ok(())\\n\\n } else {\\n\\n Err(from_glib_full(error))\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\npub unsafe fn deinit() {\\n\\n ffi::gst_deinit();\\n\\n}\\n\\n\\n\\npub const BUFFER_OFFSET_NONE: u64 = ffi::GST_BUFFER_OFFSET_NONE;\\n\",\n \"file_path\": \"gstreamer/src/lib.rs\",\n \"rank\": 8,\n \"score\": 277104.06231798703\n },\n {\n \"content\": \"pub fn parse_bin_from_description(bin_description: &str, ghost_unlinked_pads: bool) -> Result<Bin, Error> {\\n\\n assert_initialized_main_thread!();\\n\\n unsafe {\\n\\n let mut error = ptr::null_mut();\\n\\n let ret = ffi::gst_parse_bin_from_description(bin_description.to_glib_none().0, ghost_unlinked_pads.to_glib(), &mut error);\\n\\n if error.is_null() { Ok(from_glib_none(ret)) } else { Err(from_glib_full(error)) }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/auto/functions.rs\",\n \"rank\": 9,\n \"score\": 273338.5429316997\n },\n {\n \"content\": \"#[cfg(any(feature = \\\"v1_14\\\", feature = \\\"dox\\\"))]\\n\\npub fn debug_add_ring_buffer_logger(max_size_per_thread: u32, thread_timeout: u32) {\\n\\n assert_initialized_main_thread!();\\n\\n unsafe {\\n\\n ffi::gst_debug_add_ring_buffer_logger(max_size_per_thread, thread_timeout);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/auto/functions.rs\",\n \"rank\": 10,\n \"score\": 272411.92588178214\n },\n {\n \"content\": \"pub fn debug_set_active(active: bool) {\\n\\n assert_initialized_main_thread!();\\n\\n unsafe {\\n\\n ffi::gst_debug_set_active(active.to_glib());\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/auto/functions.rs\",\n \"rank\": 11,\n \"score\": 250191.95156209604\n },\n {\n \"content\": \"pub fn debug_set_colored(colored: bool) {\\n\\n assert_initialized_main_thread!();\\n\\n unsafe {\\n\\n ffi::gst_debug_set_colored(colored.to_glib());\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/auto/functions.rs\",\n \"rank\": 12,\n \"score\": 250191.95156209604\n },\n {\n \"content\": \"pub trait TypeFindImpl {\\n\\n fn peek(&mut self, offset: i64, size: u32) -> Option<&[u8]>;\\n\\n fn suggest(&mut self, probability: TypeFindProbability, caps: &Caps);\\n\\n fn get_length(&self) -> Option<u64> {\\n\\n None\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> TypeFind<'a> {\\n\\n pub fn register<\\n\\n 'b,\\n\\n 'c,\\n\\n 'd,\\n\\n P: Into<Option<&'b Plugin>>,\\n\\n R: Into<Option<&'c str>>,\\n\\n S: Into<Option<&'d Caps>>,\\n\\n F,\\n\\n >(\\n\\n plugin: P,\\n\\n name: &str,\\n\",\n \"file_path\": \"gstreamer/src/typefind.rs\",\n \"rank\": 13,\n \"score\": 248754.9834687683\n },\n {\n \"content\": \"pub fn parse_launchv(argv: &[&str]) -> Result<Element, Error> {\\n\\n assert_initialized_main_thread!();\\n\\n unsafe {\\n\\n let mut error = ptr::null_mut();\\n\\n let ret = ffi::gst_parse_launchv(argv.to_glib_none().0, &mut error);\\n\\n if error.is_null() { Ok(from_glib_none(ret)) } else { Err(from_glib_full(error)) }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/auto/functions.rs\",\n \"rank\": 14,\n \"score\": 247794.74572166626\n },\n {\n \"content\": \"struct CapsItemSe<'a>(&'a StructureRef, Option<&'a CapsFeaturesRef>);\\n\\nimpl<'a> Serialize for CapsItemSe<'a> {\\n\\n fn serialize<S: Serializer>(&self, serializer: S) -> Result<S::Ok, S::Error> {\\n\\n let mut tup = serializer.serialize_tuple(2)?;\\n\\n tup.serialize_element(self.0)?;\\n\\n tup.serialize_element(&self.1)?;\\n\\n tup.end()\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/caps_serde.rs\",\n \"rank\": 15,\n \"score\": 247212.8675208579\n },\n {\n \"content\": \"struct CapsItemDe(Structure, Option<CapsFeatures>);\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/caps_serde.rs\",\n \"rank\": 16,\n \"score\": 244393.35275001367\n },\n {\n \"content\": \"pub fn parse_launch(pipeline_description: &str) -> Result<Element, Error> {\\n\\n assert_initialized_main_thread!();\\n\\n unsafe {\\n\\n let mut error = ptr::null_mut();\\n\\n let ret = ffi::gst_parse_launch(pipeline_description.to_glib_none().0, &mut error);\\n\\n if error.is_null() { Ok(from_glib_none(ret)) } else { Err(from_glib_full(error)) }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/auto/functions.rs\",\n \"rank\": 17,\n \"score\": 243965.27668545273\n },\n {\n \"content\": \"struct FieldSe<'a>(&'a str, &'a glib::SendValue);\\n\\nimpl<'a> Serialize for FieldSe<'a> {\\n\\n fn serialize<S: Serializer>(&self, serializer: S) -> Result<S::Ok, S::Error> {\\n\\n ser_value!(self.1, |type_, value| {\\n\\n let mut tup = serializer.serialize_tuple(3)?;\\n\\n tup.serialize_element(self.0)?;\\n\\n tup.serialize_element(type_)?;\\n\\n tup.serialize_element(&value)?;\\n\\n tup.end()\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/structure_serde.rs\",\n \"rank\": 18,\n \"score\": 239237.4966621165\n },\n {\n \"content\": \"#[cfg(any(feature = \\\"v1_12\\\", feature = \\\"dox\\\"))]\\n\\npub fn debug_get_stack_trace(flags: StackTraceFlags) -> Option<String> {\\n\\n assert_initialized_main_thread!();\\n\\n unsafe {\\n\\n from_glib_full(ffi::gst_debug_get_stack_trace(flags.to_glib()))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/auto/functions.rs\",\n \"rank\": 19,\n \"score\": 234326.86077113904\n },\n {\n \"content\": \"pub trait FormattedValue: Copy + Clone + Sized + 'static {\\n\\n fn get_default_format() -> Format;\\n\\n fn try_from(v: GenericFormattedValue) -> Option<Self>;\\n\\n\\n\\n fn get_format(&self) -> Format;\\n\\n\\n\\n unsafe fn from_raw(format: Format, value: i64) -> Self;\\n\\n unsafe fn to_raw_value(&self) -> i64;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/format.rs\",\n \"rank\": 20,\n \"score\": 231796.17391537537\n },\n {\n \"content\": \"pub fn debug_set_threshold_for_name(name: &str, level: DebugLevel) {\\n\\n assert_initialized_main_thread!();\\n\\n unsafe {\\n\\n ffi::gst_debug_set_threshold_for_name(name.to_glib_none().0, level.to_glib());\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/auto/functions.rs\",\n \"rank\": 21,\n \"score\": 224257.62850818367\n },\n {\n \"content\": \"struct FieldsDe<'a>(&'a mut StructureRef);\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/structure_serde.rs\",\n \"rank\": 22,\n \"score\": 219874.2819617808\n },\n {\n \"content\": \"struct FieldsVisitor<'a>(&'a mut StructureRef);\\n\\nimpl<'de, 'a> Visitor<'de> for FieldsVisitor<'a> {\\n\\n type Value = ();\\n\\n\\n\\n fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {\\n\\n formatter.write_str(\\\"a sequence of `Structure` `Field`s\\\")\\n\\n }\\n\\n\\n\\n fn visit_seq<A: SeqAccess<'de>>(self, mut seq: A) -> Result<(), A::Error> {\\n\\n while let Some(field) = seq.next_element::<FieldDe>()? {\\n\\n let (name, value): (String, glib::SendValue) = field.into();\\n\\n self.0.set_value(name.as_str(), value);\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'de, 'a> DeserializeSeed<'de> for FieldsDe<'a> {\\n\\n type Value = ();\\n\\n\\n\\n fn deserialize<D: Deserializer<'de>>(self, deserializer: D) -> Result<(), D::Error> {\\n\\n deserializer.deserialize_seq(FieldsVisitor(self.0))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/structure_serde.rs\",\n \"rank\": 23,\n \"score\": 219874.2819617808\n },\n {\n \"content\": \"pub fn update_registry() -> bool {\\n\\n assert_initialized_main_thread!();\\n\\n unsafe {\\n\\n from_glib(ffi::gst_update_registry())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/auto/functions.rs\",\n \"rank\": 24,\n \"score\": 218611.04595651358\n },\n {\n \"content\": \"pub fn debug_is_active() -> bool {\\n\\n assert_initialized_main_thread!();\\n\\n unsafe {\\n\\n from_glib(ffi::gst_debug_is_active())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/auto/functions.rs\",\n \"rank\": 25,\n \"score\": 218611.04595651358\n },\n {\n \"content\": \"pub fn debug_is_colored() -> bool {\\n\\n assert_initialized_main_thread!();\\n\\n unsafe {\\n\\n from_glib(ffi::gst_debug_is_colored())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/auto/functions.rs\",\n \"rank\": 26,\n \"score\": 218611.0459565136\n },\n {\n \"content\": \"pub fn debug_set_default_threshold(level: DebugLevel) {\\n\\n assert_initialized_main_thread!();\\n\\n unsafe {\\n\\n ffi::gst_debug_set_default_threshold(level.to_glib());\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/auto/functions.rs\",\n \"rank\": 27,\n \"score\": 216894.30367487803\n },\n {\n \"content\": \"pub fn new_still_frame_event<'a>(in_still: bool) -> StillFrameEventBuilder<'a> {\\n\\n StillFrameEventBuilder::new(in_still)\\n\\n}\\n\\n\\n\\npub struct StillFrameEventBuilder<'a> {\\n\\n seqnum: Option<gst::Seqnum>,\\n\\n running_time_offset: Option<i64>,\\n\\n other_fields: Vec<(&'a str, &'a ToSendValue)>,\\n\\n in_still: bool,\\n\\n}\\n\\n\\n\\nimpl<'a> StillFrameEventBuilder<'a> {\\n\\n fn new(in_still: bool) -> Self {\\n\\n skip_assert_initialized!();\\n\\n Self {\\n\\n seqnum: None,\\n\\n running_time_offset: None,\\n\\n other_fields: Vec::new(),\\n\\n in_still,\\n\\n }\\n\",\n \"file_path\": \"gstreamer-video/src/video_event.rs\",\n \"rank\": 28,\n \"score\": 213314.74877810074\n },\n {\n \"content\": \"pub trait SpecificFormattedValue: FormattedValue {}\\n\\n\\n\\nimpl FormattedValue for GenericFormattedValue {\\n\\n fn get_default_format() -> Format {\\n\\n Format::Undefined\\n\\n }\\n\\n\\n\\n fn try_from(v: GenericFormattedValue) -> Option<Self> {\\n\\n Some(v)\\n\\n }\\n\\n\\n\\n fn get_format(&self) -> Format {\\n\\n self.get_format()\\n\\n }\\n\\n\\n\\n unsafe fn from_raw(format: Format, value: i64) -> Self {\\n\\n GenericFormattedValue::new(format, value)\\n\\n }\\n\\n\\n\\n unsafe fn to_raw_value(&self) -> i64 {\\n\",\n \"file_path\": \"gstreamer/src/format.rs\",\n \"rank\": 29,\n \"score\": 207022.3990253205\n },\n {\n \"content\": \"pub trait BufferPoolExt {\\n\\n fn get_options(&self) -> Vec<String>;\\n\\n\\n\\n fn has_option(&self, option: &str) -> bool;\\n\\n\\n\\n fn is_active(&self) -> bool;\\n\\n\\n\\n fn set_active(&self, active: bool) -> Result<(), glib::error::BoolError>;\\n\\n\\n\\n fn set_flushing(&self, flushing: bool);\\n\\n}\\n\\n\\n\\nimpl<O: IsA<BufferPool>> BufferPoolExt for O {\\n\\n fn get_options(&self) -> Vec<String> {\\n\\n unsafe {\\n\\n FromGlibPtrContainer::from_glib_none(ffi::gst_buffer_pool_get_options(self.to_glib_none().0))\\n\\n }\\n\\n }\\n\\n\\n\\n fn has_option(&self, option: &str) -> bool {\\n\",\n \"file_path\": \"gstreamer/src/auto/buffer_pool.rs\",\n \"rank\": 30,\n \"score\": 206057.27924743015\n },\n {\n \"content\": \"pub trait EncodingTargetExt {\\n\\n fn get_category(&self) -> String;\\n\\n\\n\\n fn get_description(&self) -> String;\\n\\n\\n\\n fn get_name(&self) -> String;\\n\\n\\n\\n fn get_profile(&self, name: &str) -> Option<EncodingProfile>;\\n\\n\\n\\n fn get_profiles(&self) -> Vec<EncodingProfile>;\\n\\n\\n\\n fn save(&self) -> Result<(), Error>;\\n\\n\\n\\n fn save_to_file<P: AsRef<std::path::Path>>(&self, filepath: P) -> Result<(), Error>;\\n\\n}\\n\\n\\n\\nimpl<O: IsA<EncodingTarget>> EncodingTargetExt for O {\\n\\n fn get_category(&self) -> String {\\n\\n unsafe {\\n\\n from_glib_none(ffi::gst_encoding_target_get_category(self.to_glib_none().0))\\n\",\n \"file_path\": \"gstreamer-pbutils/src/auto/encoding_target.rs\",\n \"rank\": 32,\n \"score\": 203082.71907313348\n },\n {\n \"content\": \"pub fn debug_unset_threshold_for_name(name: &str) {\\n\\n assert_initialized_main_thread!();\\n\\n unsafe {\\n\\n ffi::gst_debug_unset_threshold_for_name(name.to_glib_none().0);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/auto/functions.rs\",\n \"rank\": 33,\n \"score\": 202159.85337618654\n },\n {\n \"content\": \"#[cfg(any(feature = \\\"v1_14\\\", feature = \\\"dox\\\"))]\\n\\npub fn get_main_executable_path() -> Option<String> {\\n\\n assert_initialized_main_thread!();\\n\\n unsafe {\\n\\n from_glib_none(ffi::gst_get_main_executable_path())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/auto/functions.rs\",\n \"rank\": 34,\n \"score\": 202142.38194685592\n },\n {\n \"content\": \"pub trait MessageErrorDomain: glib::error::ErrorDomain {}\\n\\n\\n\\nimpl MessageErrorDomain for ::CoreError {}\\n\\nimpl MessageErrorDomain for ::ResourceError {}\\n\\nimpl MessageErrorDomain for ::StreamError {}\\n\\nimpl MessageErrorDomain for ::LibraryError {}\\n\\n\\n\\npub struct ErrorBuilder<'a, T> {\\n\\n builder: MessageBuilder<'a>,\\n\\n error: T,\\n\\n message: &'a str,\\n\\n debug: Option<&'a str>,\\n\\n #[allow(unused)]\\n\\n details: Option<Structure>,\\n\\n}\\n\\nimpl<'a, T: MessageErrorDomain> ErrorBuilder<'a, T> {\\n\\n fn new(error: T, message: &'a str) -> Self {\\n\\n skip_assert_initialized!();\\n\\n Self {\\n\\n builder: MessageBuilder::new(),\\n\",\n \"file_path\": \"gstreamer/src/message.rs\",\n \"rank\": 35,\n \"score\": 197126.6271927558\n },\n {\n \"content\": \"pub fn audio_buffer_clip(\\n\\n buffer: gst::Buffer,\\n\\n segment: &gst::Segment,\\n\\n rate: u32,\\n\\n channels: u32,\\n\\n) -> Option<gst::Buffer> {\\n\\n skip_assert_initialized!();\\n\\n\\n\\n unsafe {\\n\\n from_glib_full(ffi::gst_audio_buffer_clip(\\n\\n buffer.into_ptr(),\\n\\n segment.to_glib_none().0,\\n\\n rate as i32,\\n\\n channels as i32,\\n\\n ))\\n\\n }\\n\\n}\\n\\n\\n\\n// Re-export all the traits in a prelude module, so that applications\\n\\n// can always \\\"use gst::prelude::*\\\" without getting conflicts\\n\\npub mod prelude {\\n\\n pub use glib::prelude::*;\\n\\n pub use gst::prelude::*;\\n\\n\\n\\n pub use auto::traits::*;\\n\\n}\\n\",\n \"file_path\": \"gstreamer-audio/src/lib.rs\",\n \"rank\": 36,\n \"score\": 196173.60670101087\n },\n {\n \"content\": \"pub fn type_find_helper_for_data<\\n\\n 'a,\\n\\n P: IsA<gst::Object> + 'a,\\n\\n Q: Into<Option<&'a P>>,\\n\\n R: AsRef<[u8]>,\\n\\n>(\\n\\n obj: Q,\\n\\n data: R,\\n\\n) -> (Option<gst::Caps>, gst::TypeFindProbability) {\\n\\n assert_initialized_main_thread!();\\n\\n let obj = obj.into();\\n\\n let obj = obj.to_glib_none();\\n\\n unsafe {\\n\\n let mut prob = mem::uninitialized();\\n\\n let data = data.as_ref();\\n\\n let (ptr, len) = (data.as_ptr(), data.len());\\n\\n let ret = from_glib_full(ffi::gst_type_find_helper_for_data(\\n\\n obj.0,\\n\\n mut_override(ptr),\\n\\n len,\\n\\n &mut prob,\\n\\n ));\\n\\n (ret, from_glib(prob))\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"gstreamer-base/src/functions.rs\",\n \"rank\": 37,\n \"score\": 192810.20546673867\n },\n {\n \"content\": \"pub trait GstValueExt: Sized {\\n\\n fn can_compare(&self, other: &Self) -> bool;\\n\\n fn compare(&self, other: &Self) -> Option<cmp::Ordering>;\\n\\n fn eq(&self, other: &Self) -> bool;\\n\\n fn can_intersect(&self, other: &Self) -> bool;\\n\\n fn intersect(&self, other: &Self) -> Option<Self>;\\n\\n fn can_subtract(&self, other: &Self) -> bool;\\n\\n fn subtract(&self, other: &Self) -> Option<Self>;\\n\\n fn can_union(&self, other: &Self) -> bool;\\n\\n fn union(&self, other: &Self) -> Option<Self>;\\n\\n fn fixate(&self) -> Option<Self>;\\n\\n fn is_fixed(&self) -> bool;\\n\\n fn is_subset(&self, superset: &Self) -> bool;\\n\\n fn serialize(&self) -> Option<String>;\\n\\n fn deserialize<'a, T: Into<&'a str>>(s: T) -> Option<glib::Value>;\\n\\n}\\n\\n\\n\\nimpl GstValueExt for glib::Value {\\n\\n fn can_compare(&self, other: &Self) -> bool {\\n\\n unsafe {\\n\",\n \"file_path\": \"gstreamer/src/value.rs\",\n \"rank\": 38,\n \"score\": 191626.33472930698\n },\n {\n \"content\": \"pub fn version_string() -> String {\\n\\n assert_initialized_main_thread!();\\n\\n unsafe {\\n\\n from_glib_full(ffi::gst_version_string())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"gstreamer/src/auto/functions.rs\",\n \"rank\": 39,\n \"score\": 191217.8980760513\n },\n {\n \"content\": \"struct TagValues<'a>(&'a str, &'a mut TagListRef);\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/tags_serde.rs\",\n \"rank\": 40,\n \"score\": 191179.09459122719\n },\n {\n \"content\": \"pub fn buffer_reorder_channels(\\n\\n buffer: &mut gst::BufferRef,\\n\\n format: ::AudioFormat,\\n\\n channels: u32,\\n\\n from: &[AudioChannelPosition],\\n\\n to: &[AudioChannelPosition],\\n\\n) -> Result<(), glib::BoolError> {\\n\\n assert_initialized_main_thread!();\\n\\n\\n\\n if from.len() != to.len() || from.len() > 64 {\\n\\n return Err(glib::BoolError(\\\"Invalid number of channels\\\"));\\n\\n }\\n\\n\\n\\n let from_len = from.len();\\n\\n let to_len = to.len();\\n\\n\\n\\n let from_raw: [ffi::GstAudioChannelPosition; 64] = array_init::array_init_copy(|i| {\\n\\n if i >= from_len as usize {\\n\\n ffi::GST_AUDIO_CHANNEL_POSITION_INVALID\\n\\n } else {\\n\",\n \"file_path\": \"gstreamer-audio/src/audio_channel_position.rs\",\n \"rank\": 41,\n \"score\": 189403.86933760231\n },\n {\n \"content\": \"#[cfg(any(feature = \\\"v1_14\\\", feature = \\\"dox\\\"))]\\n\\npub fn debug_remove_ring_buffer_logger() {\\n\\n assert_initialized_main_thread!();\\n\\n unsafe {\\n\\n ffi::gst_debug_remove_ring_buffer_logger();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/auto/functions.rs\",\n \"rank\": 42,\n \"score\": 189403.86933760231\n },\n {\n \"content\": \"struct TagValuesVisitor<'a>(&'a str, &'a mut TagListRef);\\n\\nimpl<'de, 'a> Visitor<'de> for TagValuesVisitor<'a> {\\n\\n type Value = ();\\n\\n\\n\\n fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {\\n\\n formatter.write_str(\\\"a sequence of `Tag` values with the same type\\\")\\n\\n }\\n\\n\\n\\n fn visit_seq<A: SeqAccess<'de>>(self, mut seq: A) -> Result<(), A::Error> {\\n\\n let tag_type: glib::Type = unsafe {\\n\\n let tag_name = self.0.to_glib_none();\\n\\n from_glib(ffi::gst_tag_get_type(tag_name.0))\\n\\n };\\n\\n\\n\\n loop {\\n\\n let tag_value = match tag_type {\\n\\n glib::Type::F64 => de_tag_value!(self.0, seq, f64),\\n\\n glib::Type::String => de_tag_value!(self.0, seq, String),\\n\\n glib::Type::U32 => de_tag_value!(self.0, seq, u32),\\n\\n glib::Type::U64 => de_tag_value!(self.0, seq, u64),\\n\",\n \"file_path\": \"gstreamer/src/tags_serde.rs\",\n \"rank\": 43,\n \"score\": 188168.03953882906\n },\n {\n \"content\": \"pub fn debug_bin_to_dot_data<P: IsA<Bin>>(bin: &P, details: DebugGraphDetails) -> String {\\n\\n skip_assert_initialized!();\\n\\n unsafe {\\n\\n from_glib_full(ffi::gst_debug_bin_to_dot_data(bin.to_glib_none().0, details.to_glib()))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/auto/functions.rs\",\n \"rank\": 44,\n \"score\": 182880.20676408077\n },\n {\n \"content\": \"pub fn debug_get_default_threshold() -> DebugLevel {\\n\\n assert_initialized_main_thread!();\\n\\n unsafe {\\n\\n from_glib(ffi::gst_debug_get_default_threshold())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/auto/functions.rs\",\n \"rank\": 45,\n \"score\": 181293.04685743814\n },\n {\n \"content\": \"pub fn is_force_key_unit_event(event: &gst::EventRef) -> bool {\\n\\n unsafe { from_glib(ffi::gst_video_event_is_force_key_unit(event.as_mut_ptr())) }\\n\\n}\\n\\n\\n\\n// FIXME: Copy from gstreamer/src/event.rs\\n\\nmacro_rules! event_builder_generic_impl {\\n\\n ($new_fn:expr) => {\\n\\n pub fn seqnum(self, seqnum: gst::Seqnum) -> Self {\\n\\n Self {\\n\\n seqnum: Some(seqnum),\\n\\n .. self\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn running_time_offset(self, running_time_offset: i64) -> Self {\\n\\n Self {\\n\\n running_time_offset: Some(running_time_offset),\\n\\n .. self\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"gstreamer-video/src/video_event.rs\",\n \"rank\": 46,\n \"score\": 180680.85922190303\n },\n {\n \"content\": \"pub trait EncodingProfileBuilder<'a>: Sized {\\n\\n fn name(self, name: &'a str) -> Self;\\n\\n fn description(self, description: &'a str) -> Self;\\n\\n fn format(self, format: &'a gst::Caps) -> Self;\\n\\n fn preset(self, preset: &'a str) -> Self;\\n\\n fn preset_name(self, preset_name: &'a str) -> Self;\\n\\n fn restriction(self, format: &'a gst::Caps) -> Self;\\n\\n fn presence(self, presence: u32) -> Self;\\n\\n fn allow_dynamic_output(self, allow: bool) -> Self;\\n\\n fn enabled(self, enabled: bool) -> Self;\\n\\n}\\n\\n\\n\\nmacro_rules! declare_encoding_profile_builder_common(\\n\\n ($name:ident) => {\\n\\n impl<'a> EncodingProfileBuilder<'a> for $name<'a> {\\n\\n fn name(mut self, name: &'a str) -> $name<'a> {\\n\\n self.base.name = Some(name);\\n\\n self\\n\\n }\\n\\n\\n\",\n \"file_path\": \"gstreamer-pbutils/src/encoding_profile.rs\",\n \"rank\": 47,\n \"score\": 180597.23590996343\n },\n {\n \"content\": \"pub fn is_video_overlay_prepare_window_handle_message(msg: &gst::MessageRef) -> bool {\\n\\n unsafe {\\n\\n from_glib(ffi::gst_is_video_overlay_prepare_window_handle_message(\\n\\n msg.as_mut_ptr(),\\n\\n ))\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"gstreamer-video/src/video_overlay.rs\",\n \"rank\": 48,\n \"score\": 175751.29521036719\n },\n {\n \"content\": \"pub trait IteratorImpl<T>: Clone + Send + 'static\\n\\nwhere\\n\\n for<'a> T: FromValueOptional<'a> + StaticType + ToValue + Send + 'static,\\n\\n{\\n\\n fn next(&mut self) -> Option<Result<T, IteratorError>>;\\n\\n fn resync(&mut self);\\n\\n}\\n\\n\\n\\nunsafe extern \\\"C\\\" fn rs_iterator_copy<T, I: IteratorImpl<T>>(\\n\\n it: *const ffi::GstIterator,\\n\\n copy: *mut ffi::GstIterator,\\n\\n) where\\n\\n for<'a> T: FromValueOptional<'a> + StaticType + ToValue + Send + 'static,\\n\\n{\\n\\n let it = it as *const RsIterator<T, I>;\\n\\n let copy = copy as *mut RsIterator<T, I>;\\n\\n\\n\\n ptr::write(&mut (*copy).imp, (*it).imp.clone());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/iterator.rs\",\n \"rank\": 49,\n \"score\": 173931.9892592216\n },\n {\n \"content\": \"#[cfg(any(feature = \\\"v1_14\\\", feature = \\\"dox\\\"))]\\n\\npub fn debug_ring_buffer_logger_get_logs() -> Vec<String> {\\n\\n assert_initialized_main_thread!();\\n\\n unsafe {\\n\\n FromGlibPtrContainer::from_glib_full(ffi::gst_debug_ring_buffer_logger_get_logs())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/auto/functions.rs\",\n \"rank\": 50,\n \"score\": 171092.00218529892\n },\n {\n \"content\": \"pub fn parse_still_frame_event(event: &gst::EventRef) -> Option<StillFrameEvent> {\\n\\n unsafe {\\n\\n let mut in_still = mem::uninitialized();\\n\\n\\n\\n let res: bool = from_glib(ffi::gst_video_event_parse_still_frame(\\n\\n event.as_mut_ptr(),\\n\\n &mut in_still,\\n\\n ));\\n\\n if res {\\n\\n Some(StillFrameEvent {\\n\\n in_still: from_glib(in_still),\\n\\n })\\n\\n } else {\\n\\n None\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"gstreamer-video/src/video_event.rs\",\n \"rank\": 51,\n \"score\": 169336.64377486738\n },\n {\n \"content\": \"fn get_other_type_id<T: StaticType>() -> usize {\\n\\n match T::static_type() {\\n\\n glib::Type::Other(type_id) => type_id,\\n\\n type_ => panic!(\\\"Expecting `Other` variant, found `{}`\\\", type_),\\n\\n }\\n\\n}\\n\\n\\n\\nlazy_static! {\\n\\n pub(crate) static ref ARRAY_OTHER_TYPE_ID: usize = get_other_type_id::<Array>();\\n\\n pub(crate) static ref BITMASK_OTHER_TYPE_ID: usize = get_other_type_id::<Bitmask>();\\n\\n pub(crate) static ref DATE_TIME_OTHER_TYPE_ID: usize = get_other_type_id::<DateTime>();\\n\\n pub(crate) static ref FRACTION_OTHER_TYPE_ID: usize = get_other_type_id::<Fraction>();\\n\\n pub(crate) static ref FRACTION_RANGE_OTHER_TYPE_ID: usize =\\n\\n get_other_type_id::<FractionRange>();\\n\\n pub(crate) static ref INT_RANGE_I32_OTHER_TYPE_ID: usize = get_other_type_id::<IntRange<i32>>();\\n\\n pub(crate) static ref INT_RANGE_I64_OTHER_TYPE_ID: usize = get_other_type_id::<IntRange<i64>>();\\n\\n pub(crate) static ref LIST_OTHER_TYPE_ID: usize = get_other_type_id::<List>();\\n\\n pub(crate) static ref SAMPLE_OTHER_TYPE_ID: usize = get_other_type_id::<Sample>();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/value_serde.rs\",\n \"rank\": 52,\n \"score\": 168085.48805472834\n },\n {\n \"content\": \"pub fn parse_force_key_unit_event(event: &gst::EventRef) -> Option<ForceKeyUnitEvent> {\\n\\n if event.is_upstream() {\\n\\n parse_upstream_force_key_unit_event(event).map(ForceKeyUnitEvent::Upstream)\\n\\n } else {\\n\\n parse_downstream_force_key_unit_event(event).map(ForceKeyUnitEvent::Downstream)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer-video/src/video_event.rs\",\n \"rank\": 53,\n \"score\": 164974.03964328844\n },\n {\n \"content\": \"struct StructureForIter<'a>(&'a StructureRef);\\n\\nimpl<'a> Serialize for StructureForIter<'a> {\\n\\n fn serialize<S: Serializer>(&self, serializer: S) -> Result<S::Ok, S::Error> {\\n\\n let iter = self.0.iter();\\n\\n let size = iter.size_hint().0;\\n\\n if size > 0 {\\n\\n let mut seq = serializer.serialize_seq(Some(size))?;\\n\\n for field in iter {\\n\\n seq.serialize_element(&FieldSe(field.0, field.1))?;\\n\\n }\\n\\n seq.end()\\n\\n } else {\\n\\n let seq = serializer.serialize_seq(None)?;\\n\\n seq.end()\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Serialize for StructureRef {\\n\\n fn serialize<S: Serializer>(&self, serializer: S) -> Result<S::Ok, S::Error> {\\n\",\n \"file_path\": \"gstreamer/src/structure_serde.rs\",\n \"rank\": 54,\n \"score\": 162588.1297767748\n },\n {\n \"content\": \"pub fn debug_bin_to_dot_file<P: IsA<Bin>, Q: AsRef<std::path::Path>>(bin: &P, details: DebugGraphDetails, file_name: Q) {\\n\\n skip_assert_initialized!();\\n\\n unsafe {\\n\\n ffi::gst_debug_bin_to_dot_file(bin.to_glib_none().0, details.to_glib(), file_name.as_ref().to_glib_none().0);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/auto/functions.rs\",\n \"rank\": 55,\n \"score\": 156100.2295650466\n },\n {\n \"content\": \"pub fn new_downstream_force_key_unit_event<'a>() -> DownstreamForceKeyUnitEventBuilder<'a> {\\n\\n DownstreamForceKeyUnitEventBuilder::new()\\n\\n}\\n\\n\\n\\npub struct DownstreamForceKeyUnitEventBuilder<'a> {\\n\\n seqnum: Option<gst::Seqnum>,\\n\\n running_time_offset: Option<i64>,\\n\\n other_fields: Vec<(&'a str, &'a ToSendValue)>,\\n\\n timestamp: gst::ClockTime,\\n\\n stream_time: gst::ClockTime,\\n\\n running_time: gst::ClockTime,\\n\\n all_headers: bool,\\n\\n count: u32,\\n\\n}\\n\\n\\n\\nimpl<'a> DownstreamForceKeyUnitEventBuilder<'a> {\\n\\n fn new() -> Self {\\n\\n skip_assert_initialized!();\\n\\n Self {\\n\\n seqnum: None,\\n\",\n \"file_path\": \"gstreamer-video/src/video_event.rs\",\n \"rank\": 56,\n \"score\": 155013.49113351168\n },\n {\n \"content\": \"pub fn new_upstream_force_key_unit_event<'a>() -> UpstreamForceKeyUnitEventBuilder<'a> {\\n\\n UpstreamForceKeyUnitEventBuilder::new()\\n\\n}\\n\\n\\n\\npub struct UpstreamForceKeyUnitEventBuilder<'a> {\\n\\n seqnum: Option<gst::Seqnum>,\\n\\n running_time_offset: Option<i64>,\\n\\n other_fields: Vec<(&'a str, &'a ToSendValue)>,\\n\\n running_time: gst::ClockTime,\\n\\n all_headers: bool,\\n\\n count: u32,\\n\\n}\\n\\n\\n\\nimpl<'a> UpstreamForceKeyUnitEventBuilder<'a> {\\n\\n fn new() -> Self {\\n\\n skip_assert_initialized!();\\n\\n Self {\\n\\n seqnum: None,\\n\\n running_time_offset: None,\\n\\n other_fields: Vec::new(),\\n\",\n \"file_path\": \"gstreamer-video/src/video_event.rs\",\n \"rank\": 57,\n \"score\": 155013.49113351168\n },\n {\n \"content\": \"pub fn debug_bin_to_dot_file_with_ts<P: IsA<Bin>, Q: AsRef<std::path::Path>>(bin: &P, details: DebugGraphDetails, file_name: Q) {\\n\\n skip_assert_initialized!();\\n\\n unsafe {\\n\\n ffi::gst_debug_bin_to_dot_file_with_ts(bin.to_glib_none().0, details.to_glib(), file_name.as_ref().to_glib_none().0);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/auto/functions.rs\",\n \"rank\": 58,\n \"score\": 154374.95599726957\n },\n {\n \"content\": \"pub trait Tag<'a> {\\n\\n type TagType: FromValueOptional<'a> + SetValue + Send;\\n\\n fn tag_name<'b>() -> &'b str;\\n\\n}\\n\\n\\n\\nmacro_rules! impl_tag(\\n\\n ($name:ident, $t:ty, $rust_tag:ident, $gst_tag:ident) => {\\n\\n pub enum $name {}\\n\\n impl<'a> Tag<'a> for $name {\\n\\n type TagType = $t;\\n\\n fn tag_name<'b>() -> &'b str {\\n\\n *$rust_tag\\n\\n }\\n\\n }\\n\\n\\n\\n lazy_static! {\\n\\n pub(crate) static ref $rust_tag: &'static str =\\n\\n unsafe { CStr::from_ptr(ffi::$gst_tag).to_str().unwrap() };\\n\\n }\\n\\n };\\n\",\n \"file_path\": \"gstreamer/src/tags.rs\",\n \"rank\": 59,\n \"score\": 152169.4638977395\n },\n {\n \"content\": \"pub trait PipelineExt {\\n\\n fn auto_clock(&self);\\n\\n\\n\\n fn get_auto_flush_bus(&self) -> bool;\\n\\n\\n\\n fn get_delay(&self) -> ClockTime;\\n\\n\\n\\n fn get_latency(&self) -> ClockTime;\\n\\n\\n\\n fn get_pipeline_clock(&self) -> Option<Clock>;\\n\\n\\n\\n fn set_auto_flush_bus(&self, auto_flush: bool);\\n\\n\\n\\n fn set_delay(&self, delay: ClockTime);\\n\\n\\n\\n fn set_latency(&self, latency: ClockTime);\\n\\n\\n\\n fn use_clock<'a, P: IsA<Clock> + 'a, Q: Into<Option<&'a P>>>(&self, clock: Q);\\n\\n\\n\\n fn connect_property_auto_flush_bus_notify<F: Fn(&Self) + Send + Sync + 'static>(&self, f: F) -> SignalHandlerId;\\n\",\n \"file_path\": \"gstreamer/src/auto/pipeline.rs\",\n \"rank\": 60,\n \"score\": 152022.51769296045\n },\n {\n \"content\": \"pub trait ClockExtManual {\\n\\n fn new_periodic_id(&self, start_time: ClockTime, interval: ClockTime) -> Option<ClockId>;\\n\\n\\n\\n fn periodic_id_reinit(\\n\\n &self,\\n\\n id: &ClockId,\\n\\n start_time: ClockTime,\\n\\n interval: ClockTime,\\n\\n ) -> Result<(), glib::BoolError>;\\n\\n\\n\\n fn new_single_shot_id(&self, time: ClockTime) -> Option<ClockId>;\\n\\n\\n\\n fn single_shot_id_reinit(&self, id: &ClockId, time: ClockTime) -> Result<(), glib::BoolError>;\\n\\n}\\n\\n\\n\\nimpl<O: IsA<Clock> + IsA<glib::object::Object>> ClockExtManual for O {\\n\\n fn new_periodic_id(&self, start_time: ClockTime, interval: ClockTime) -> Option<ClockId> {\\n\\n unsafe {\\n\\n from_glib_full(ffi::gst_clock_new_periodic_id(\\n\\n self.to_glib_none().0,\\n\",\n \"file_path\": \"gstreamer/src/clock.rs\",\n \"rank\": 61,\n \"score\": 152022.51769296045\n },\n {\n \"content\": \"pub trait PresetExt {\\n\\n fn delete_preset(&self, name: &str) -> Result<(), glib::error::BoolError>;\\n\\n\\n\\n fn get_meta(&self, name: &str, tag: &str) -> Option<String>;\\n\\n\\n\\n fn get_preset_names(&self) -> Vec<String>;\\n\\n\\n\\n fn get_property_names(&self) -> Vec<String>;\\n\\n\\n\\n fn is_editable(&self) -> bool;\\n\\n\\n\\n fn load_preset(&self, name: &str) -> Result<(), glib::error::BoolError>;\\n\\n\\n\\n fn rename_preset(&self, old_name: &str, new_name: &str) -> Result<(), glib::error::BoolError>;\\n\\n\\n\\n fn save_preset(&self, name: &str) -> Result<(), glib::error::BoolError>;\\n\\n\\n\\n fn set_meta<'a, P: Into<Option<&'a str>>>(&self, name: &str, tag: &str, value: P) -> Result<(), glib::error::BoolError>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/auto/preset.rs\",\n \"rank\": 62,\n \"score\": 152022.51769296045\n },\n {\n \"content\": \"pub trait BinExtManual {\\n\\n fn add_many<E: IsA<Element>>(&self, elements: &[&E]) -> Result<(), glib::BoolError>;\\n\\n fn remove_many<E: IsA<Element>>(&self, elements: &[&E]) -> Result<(), glib::BoolError>;\\n\\n\\n\\n fn iterate_all_by_interface(&self, iface: glib::types::Type) -> ::Iterator<Element>;\\n\\n fn iterate_elements(&self) -> ::Iterator<Element>;\\n\\n fn iterate_recurse(&self) -> ::Iterator<Element>;\\n\\n fn iterate_sinks(&self) -> ::Iterator<Element>;\\n\\n fn iterate_sorted(&self) -> ::Iterator<Element>;\\n\\n fn iterate_sources(&self) -> ::Iterator<Element>;\\n\\n fn get_children(&self) -> Vec<Element>;\\n\\n}\\n\\n\\n\\nimpl<O: IsA<Bin>> BinExtManual for O {\\n\\n fn add_many<E: IsA<Element>>(&self, elements: &[&E]) -> Result<(), glib::BoolError> {\\n\\n for e in elements {\\n\\n unsafe {\\n\\n let ret: bool =\\n\\n from_glib(ffi::gst_bin_add(self.to_glib_none().0, e.to_glib_none().0));\\n\\n if !ret {\\n\",\n \"file_path\": \"gstreamer/src/bin.rs\",\n \"rank\": 63,\n \"score\": 152022.51769296045\n },\n {\n \"content\": \"pub trait BinExt {\\n\\n fn add<P: IsA<Element>>(&self, element: &P) -> Result<(), glib::error::BoolError>;\\n\\n\\n\\n //fn add_many<P: IsA<Element>>(&self, element_1: &P, : /*Unknown conversion*//*Unimplemented*/Fundamental: VarArgs);\\n\\n\\n\\n fn find_unlinked_pad(&self, direction: PadDirection) -> Option<Pad>;\\n\\n\\n\\n fn get_by_interface(&self, iface: glib::types::Type) -> Option<Element>;\\n\\n\\n\\n fn get_by_name(&self, name: &str) -> Option<Element>;\\n\\n\\n\\n fn get_by_name_recurse_up(&self, name: &str) -> Option<Element>;\\n\\n\\n\\n #[cfg(any(feature = \\\"v1_10\\\", feature = \\\"dox\\\"))]\\n\\n fn get_suppressed_flags(&self) -> ElementFlags;\\n\\n\\n\\n //fn iterate_all_by_interface(&self, iface: glib::types::Type) -> /*Ignored*/Option<Iterator>;\\n\\n\\n\\n //fn iterate_elements(&self) -> /*Ignored*/Option<Iterator>;\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/auto/bin.rs\",\n \"rank\": 64,\n \"score\": 152022.51769296045\n },\n {\n \"content\": \"pub trait PadExtManual {\\n\\n fn add_probe<F>(&self, mask: PadProbeType, func: F) -> Option<PadProbeId>\\n\\n where\\n\\n F: Fn(&Pad, &mut PadProbeInfo) -> PadProbeReturn + Send + Sync + 'static;\\n\\n fn remove_probe(&self, id: PadProbeId);\\n\\n\\n\\n fn chain(&self, buffer: Buffer) -> FlowReturn;\\n\\n fn push(&self, buffer: Buffer) -> FlowReturn;\\n\\n\\n\\n fn chain_list(&self, list: BufferList) -> FlowReturn;\\n\\n fn push_list(&self, list: BufferList) -> FlowReturn;\\n\\n\\n\\n fn pull_range(&self, offset: u64, size: u32) -> Result<Buffer, FlowReturn>;\\n\\n fn get_range(&self, offset: u64, size: u32) -> Result<Buffer, FlowReturn>;\\n\\n\\n\\n fn peer_query(&self, query: &mut QueryRef) -> bool;\\n\\n fn query(&self, query: &mut QueryRef) -> bool;\\n\\n fn query_default<'a, P: IsA<Object> + 'a, Q: Into<Option<&'a P>>>(\\n\\n &self,\\n\\n parent: Q,\\n\",\n \"file_path\": \"gstreamer/src/pad.rs\",\n \"rank\": 65,\n \"score\": 152022.51769296045\n },\n {\n \"content\": \"pub trait PadExt {\\n\\n fn activate_mode(&self, mode: PadMode, active: bool) -> Result<(), glib::error::BoolError>;\\n\\n\\n\\n //fn add_probe(&self, mask: PadProbeType, callback: /*Unknown conversion*//*Unimplemented*/PadProbeCallback, destroy_data: /*Unknown conversion*//*Unimplemented*/DestroyNotify) -> libc::c_ulong;\\n\\n\\n\\n fn can_link<P: IsA<Pad>>(&self, sinkpad: &P) -> bool;\\n\\n\\n\\n fn check_reconfigure(&self) -> bool;\\n\\n\\n\\n fn create_stream_id<'a, P: IsA<Element>, Q: Into<Option<&'a str>>>(&self, parent: &P, stream_id: Q) -> Option<String>;\\n\\n\\n\\n //fn create_stream_id_printf<'a, P: IsA<Element>, Q: Into<Option<&'a str>>>(&self, parent: &P, stream_id: Q, : /*Unknown conversion*//*Unimplemented*/Fundamental: VarArgs) -> Option<String>;\\n\\n\\n\\n //fn create_stream_id_printf_valist<'a, P: IsA<Element>, Q: Into<Option<&'a str>>>(&self, parent: &P, stream_id: Q, var_args: /*Unknown conversion*//*Unimplemented*/Unsupported) -> Option<String>;\\n\\n\\n\\n //fn forward<P: Into<Option</*Unimplemented*/Fundamental: Pointer>>>(&self, forward: /*Unknown conversion*//*Unimplemented*/PadForwardFunction, user_data: P) -> bool;\\n\\n\\n\\n fn get_allowed_caps(&self) -> Option<Caps>;\\n\\n\\n\\n fn get_current_caps(&self) -> Option<Caps>;\\n\",\n \"file_path\": \"gstreamer/src/auto/pad.rs\",\n \"rank\": 66,\n \"score\": 152022.51769296045\n },\n {\n \"content\": \"pub trait DeviceExt {\\n\\n fn create_element<'a, P: Into<Option<&'a str>>>(&self, name: P) -> Option<Element>;\\n\\n\\n\\n fn get_caps(&self) -> Option<Caps>;\\n\\n\\n\\n fn get_device_class(&self) -> String;\\n\\n\\n\\n fn get_display_name(&self) -> String;\\n\\n\\n\\n fn get_properties(&self) -> Option<Structure>;\\n\\n\\n\\n fn has_classes(&self, classes: &str) -> bool;\\n\\n\\n\\n fn has_classesv(&self, classes: &[&str]) -> bool;\\n\\n\\n\\n fn reconfigure_element<P: IsA<Element>>(&self, element: &P) -> bool;\\n\\n\\n\\n fn connect_removed<F: Fn(&Self) + Send + Sync + 'static>(&self, f: F) -> SignalHandlerId;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/auto/device.rs\",\n \"rank\": 67,\n \"score\": 152022.51769296045\n },\n {\n \"content\": \"pub trait ClockExt {\\n\\n fn add_observation(&self, slave: ClockTime, master: ClockTime) -> Option<f64>;\\n\\n\\n\\n fn add_observation_unapplied(&self, slave: ClockTime, master: ClockTime) -> Option<(f64, ClockTime, ClockTime, ClockTime, ClockTime)>;\\n\\n\\n\\n fn adjust_unlocked(&self, internal: ClockTime) -> ClockTime;\\n\\n\\n\\n fn get_calibration(&self) -> (ClockTime, ClockTime, ClockTime, ClockTime);\\n\\n\\n\\n fn get_internal_time(&self) -> ClockTime;\\n\\n\\n\\n fn get_master(&self) -> Option<Clock>;\\n\\n\\n\\n fn get_resolution(&self) -> ClockTime;\\n\\n\\n\\n fn get_time(&self) -> ClockTime;\\n\\n\\n\\n fn get_timeout(&self) -> ClockTime;\\n\\n\\n\\n fn is_synced(&self) -> bool;\\n\",\n \"file_path\": \"gstreamer/src/auto/clock.rs\",\n \"rank\": 68,\n \"score\": 152022.51769296045\n },\n {\n \"content\": \"pub trait ElementExt {\\n\\n fn abort_state(&self);\\n\\n\\n\\n fn add_pad<P: IsA<Pad>>(&self, pad: &P) -> Result<(), glib::error::BoolError>;\\n\\n\\n\\n //#[cfg(any(feature = \\\"v1_10\\\", feature = \\\"dox\\\"))]\\n\\n //fn call_async(&self, func: /*Unknown conversion*//*Unimplemented*/ElementCallAsyncFunc, destroy_notify: /*Unknown conversion*//*Unimplemented*/DestroyNotify);\\n\\n\\n\\n fn change_state(&self, transition: StateChange) -> StateChangeReturn;\\n\\n\\n\\n fn continue_state(&self, ret: StateChangeReturn) -> StateChangeReturn;\\n\\n\\n\\n fn create_all_pads(&self);\\n\\n\\n\\n //#[cfg(any(feature = \\\"v1_14\\\", feature = \\\"dox\\\"))]\\n\\n //fn foreach_pad<P: Into<Option</*Unimplemented*/Fundamental: Pointer>>>(&self, func: /*Unknown conversion*//*Unimplemented*/ElementForeachPadFunc, user_data: P) -> bool;\\n\\n\\n\\n //#[cfg(any(feature = \\\"v1_14\\\", feature = \\\"dox\\\"))]\\n\\n //fn foreach_sink_pad<P: Into<Option</*Unimplemented*/Fundamental: Pointer>>>(&self, func: /*Unknown conversion*//*Unimplemented*/ElementForeachPadFunc, user_data: P) -> bool;\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/auto/element.rs\",\n \"rank\": 69,\n \"score\": 152022.51769296045\n },\n {\n \"content\": \"pub trait ElementExtManual {\\n\\n fn query(&self, query: &mut QueryRef) -> bool;\\n\\n\\n\\n fn send_event(&self, event: Event) -> bool;\\n\\n\\n\\n fn get_metadata<'a>(&self, key: &str) -> Option<&'a str>;\\n\\n\\n\\n fn get_pad_template(&self, name: &str) -> Option<PadTemplate>;\\n\\n fn get_pad_template_list(&self) -> Vec<PadTemplate>;\\n\\n\\n\\n #[cfg_attr(feature = \\\"cargo-clippy\\\", allow(too_many_arguments))]\\n\\n fn message_full<T: ::MessageErrorDomain>(\\n\\n &self,\\n\\n type_: ElementMessageType,\\n\\n code: T,\\n\\n message: Option<&str>,\\n\\n debug: Option<&str>,\\n\\n file: &str,\\n\\n function: &str,\\n\\n line: u32,\\n\",\n \"file_path\": \"gstreamer/src/element.rs\",\n \"rank\": 70,\n \"score\": 152022.51769296045\n },\n {\n \"content\": \"pub fn convert_sample(\\n\\n sample: &gst::Sample,\\n\\n caps: &gst::Caps,\\n\\n timeout: gst::ClockTime,\\n\\n) -> Result<gst::Sample, glib::Error> {\\n\\n unsafe {\\n\\n let mut error = ptr::null_mut();\\n\\n let ret = ffi::gst_video_convert_sample(\\n\\n sample.to_glib_none().0,\\n\\n caps.to_glib_none().0,\\n\\n timeout.to_glib(),\\n\\n &mut error,\\n\\n );\\n\\n\\n\\n if error.is_null() {\\n\\n Ok(from_glib_full(ret))\\n\\n } else {\\n\\n Err(from_glib_full(error))\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer-video/src/functions.rs\",\n \"rank\": 71,\n \"score\": 151569.26775069794\n },\n {\n \"content\": \"pub trait GstObjectExtManual {\\n\\n fn connect_deep_notify<\\n\\n 'a,\\n\\n P: Into<Option<&'a str>>,\\n\\n F: Fn(&Self, &::Object, &glib::ParamSpec) + Send + Sync + 'static,\\n\\n >(\\n\\n &self,\\n\\n name: P,\\n\\n f: F,\\n\\n ) -> SignalHandlerId;\\n\\n}\\n\\n\\n\\nimpl<O: IsA<::Object> + IsA<glib::Object> + glib::value::SetValue> GstObjectExtManual for O {\\n\\n fn connect_deep_notify<\\n\\n 'a,\\n\\n P: Into<Option<&'a str>>,\\n\\n F: Fn(&Self, &::Object, &glib::ParamSpec) + Send + Sync + 'static,\\n\\n >(\\n\\n &self,\\n\\n name: P,\\n\",\n \"file_path\": \"gstreamer/src/object.rs\",\n \"rank\": 72,\n \"score\": 149591.25183543772\n },\n {\n \"content\": \"pub trait GstObjectExt {\\n\\n //fn add_control_binding(&self, binding: /*Ignored*/&ControlBinding) -> bool;\\n\\n\\n\\n fn default_error<'a, P: Into<Option<&'a str>>>(&self, error: &Error, debug: P);\\n\\n\\n\\n //fn get_control_binding(&self, property_name: &str) -> /*Ignored*/Option<ControlBinding>;\\n\\n\\n\\n fn get_control_rate(&self) -> ClockTime;\\n\\n\\n\\n //fn get_g_value_array(&self, property_name: &str, timestamp: ClockTime, interval: ClockTime, values: /*Ignored*/&[&glib::Value]) -> bool;\\n\\n\\n\\n fn get_name(&self) -> String;\\n\\n\\n\\n fn get_parent(&self) -> Option<Object>;\\n\\n\\n\\n fn get_path_string(&self) -> String;\\n\\n\\n\\n //fn get_value(&self, property_name: &str, timestamp: ClockTime) -> /*Ignored*/Option<glib::Value>;\\n\\n\\n\\n //fn get_value_array<P: Into<Option</*Unimplemented*/Fundamental: Pointer>>>(&self, property_name: &str, timestamp: ClockTime, interval: ClockTime, n_values: u32, values: P) -> bool;\\n\",\n \"file_path\": \"gstreamer/src/auto/object.rs\",\n \"rank\": 73,\n \"score\": 149591.25183543772\n },\n {\n \"content\": \"pub trait AggregatorExt {\\n\\n //#[cfg(any(feature = \\\"v1_14\\\", feature = \\\"dox\\\"))]\\n\\n //fn get_allocator(&self, allocator: /*Ignored*/gst::Allocator, params: /*Ignored*/gst::AllocationParams);\\n\\n\\n\\n #[cfg(any(feature = \\\"v1_14\\\", feature = \\\"dox\\\"))]\\n\\n fn get_buffer_pool(&self) -> Option<gst::BufferPool>;\\n\\n\\n\\n #[cfg(any(feature = \\\"v1_14\\\", feature = \\\"dox\\\"))]\\n\\n fn get_latency(&self) -> gst::ClockTime;\\n\\n\\n\\n #[cfg(any(feature = \\\"v1_14\\\", feature = \\\"dox\\\"))]\\n\\n fn set_latency(&self, min_latency: gst::ClockTime, max_latency: gst::ClockTime);\\n\\n\\n\\n #[cfg(any(feature = \\\"v1_14\\\", feature = \\\"dox\\\"))]\\n\\n fn set_src_caps(&self, caps: &gst::Caps);\\n\\n\\n\\n fn get_property_start_time(&self) -> u64;\\n\\n\\n\\n fn set_property_start_time(&self, start_time: u64);\\n\\n\\n\",\n \"file_path\": \"gstreamer-base/src/auto/aggregator.rs\",\n \"rank\": 74,\n \"score\": 149591.25183543772\n },\n {\n \"content\": \"pub trait AggregatorExtManual {\\n\\n fn finish_buffer(&self, buffer: gst::Buffer) -> gst::FlowReturn;\\n\\n}\\n\\n\\n\\nimpl<O: IsA<Aggregator>> AggregatorExtManual for O {\\n\\n fn finish_buffer(&self, buffer: gst::Buffer) -> gst::FlowReturn {\\n\\n unsafe {\\n\\n from_glib(ffi::gst_aggregator_finish_buffer(\\n\\n self.to_glib_none().0,\\n\\n buffer.into_ptr(),\\n\\n ))\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"gstreamer-base/src/aggregator.rs\",\n \"rank\": 75,\n \"score\": 149591.25183543772\n },\n {\n \"content\": \"pub trait TagSetterExt {\\n\\n //fn add_tag_valist(&self, mode: TagMergeMode, tag: &str, var_args: /*Unknown conversion*//*Unimplemented*/Unsupported);\\n\\n\\n\\n //fn add_tag_valist_values(&self, mode: TagMergeMode, tag: &str, var_args: /*Unknown conversion*//*Unimplemented*/Unsupported);\\n\\n\\n\\n //fn add_tag_value(&self, mode: TagMergeMode, tag: &str, value: /*Ignored*/&glib::Value);\\n\\n\\n\\n //fn add_tag_values(&self, mode: TagMergeMode, tag: &str, : /*Unknown conversion*//*Unimplemented*/Fundamental: VarArgs);\\n\\n\\n\\n //fn add_tags(&self, mode: TagMergeMode, tag: &str, : /*Unknown conversion*//*Unimplemented*/Fundamental: VarArgs);\\n\\n\\n\\n fn get_tag_list(&self) -> Option<TagList>;\\n\\n\\n\\n fn get_tag_merge_mode(&self) -> TagMergeMode;\\n\\n\\n\\n fn merge_tags(&self, list: &TagList, mode: TagMergeMode);\\n\\n\\n\\n fn reset_tags(&self);\\n\\n\\n\\n fn set_tag_merge_mode(&self, mode: TagMergeMode);\\n\",\n \"file_path\": \"gstreamer/src/auto/tag_setter.rs\",\n \"rank\": 76,\n \"score\": 147279.61283910155\n },\n {\n \"content\": \"pub trait ChildProxyExt {\\n\\n fn child_added<P: IsA<glib::Object>>(&self, child: &P, name: &str);\\n\\n\\n\\n fn child_removed<P: IsA<glib::Object>>(&self, child: &P, name: &str);\\n\\n\\n\\n //fn get(&self, first_property_name: &str, : /*Unknown conversion*//*Unimplemented*/Fundamental: VarArgs);\\n\\n\\n\\n fn get_child_by_index(&self, index: u32) -> Option<glib::Object>;\\n\\n\\n\\n fn get_child_by_name(&self, name: &str) -> Option<glib::Object>;\\n\\n\\n\\n fn get_children_count(&self) -> u32;\\n\\n\\n\\n //fn get_property(&self, name: &str, value: /*Ignored*/glib::Value);\\n\\n\\n\\n //fn get_valist(&self, first_property_name: &str, var_args: /*Unknown conversion*//*Unimplemented*/Unsupported);\\n\\n\\n\\n //fn lookup(&self, name: &str, pspec: /*Ignored*/glib::ParamSpec) -> Option<glib::Object>;\\n\\n\\n\\n //fn set(&self, first_property_name: &str, : /*Unknown conversion*//*Unimplemented*/Fundamental: VarArgs);\\n\",\n \"file_path\": \"gstreamer/src/auto/child_proxy.rs\",\n \"rank\": 77,\n \"score\": 147279.61283910155\n },\n {\n \"content\": \"pub trait DeviceProviderExtManual {\\n\\n fn get_metadata<'a>(&self, key: &str) -> Option<&'a str>;\\n\\n}\\n\\n\\n\\nimpl<O: IsA<DeviceProvider>> DeviceProviderExtManual for O {\\n\\n fn get_metadata<'a>(&self, key: &str) -> Option<&'a str> {\\n\\n unsafe {\\n\\n let klass = (*(self.to_glib_none().0 as *mut gobject_ffi::GTypeInstance)).g_class\\n\\n as *mut ffi::GstDeviceProviderClass;\\n\\n\\n\\n let ptr = ffi::gst_device_provider_class_get_metadata(klass, key.to_glib_none().0);\\n\\n\\n\\n if ptr.is_null() {\\n\\n None\\n\\n } else {\\n\\n Some(CStr::from_ptr(ptr).to_str().unwrap())\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"gstreamer/src/device_provider.rs\",\n \"rank\": 78,\n \"score\": 147279.61283910155\n },\n {\n \"content\": \"pub trait DeviceMonitorExt {\\n\\n fn add_filter<'a, 'b, P: Into<Option<&'a str>>, Q: Into<Option<&'b Caps>>>(&self, classes: P, caps: Q) -> u32;\\n\\n\\n\\n fn get_bus(&self) -> Bus;\\n\\n\\n\\n fn get_devices(&self) -> Vec<Device>;\\n\\n\\n\\n fn get_providers(&self) -> Vec<String>;\\n\\n\\n\\n fn get_show_all_devices(&self) -> bool;\\n\\n\\n\\n fn remove_filter(&self, filter_id: u32) -> bool;\\n\\n\\n\\n fn set_show_all_devices(&self, show_all: bool);\\n\\n\\n\\n fn start(&self) -> Result<(), glib::error::BoolError>;\\n\\n\\n\\n fn stop(&self);\\n\\n\\n\\n fn get_property_show_all(&self) -> bool;\\n\",\n \"file_path\": \"gstreamer/src/auto/device_monitor.rs\",\n \"rank\": 79,\n \"score\": 147279.61283910155\n },\n {\n \"content\": \"pub trait DeviceProviderExt {\\n\\n fn can_monitor(&self) -> bool;\\n\\n\\n\\n fn device_add(&self, device: &Device);\\n\\n\\n\\n fn device_remove(&self, device: &Device);\\n\\n\\n\\n fn get_bus(&self) -> Bus;\\n\\n\\n\\n fn get_devices(&self) -> Vec<Device>;\\n\\n\\n\\n fn get_factory(&self) -> Option<DeviceProviderFactory>;\\n\\n\\n\\n fn get_hidden_providers(&self) -> Vec<String>;\\n\\n\\n\\n fn hide_provider(&self, name: &str);\\n\\n\\n\\n fn start(&self) -> Result<(), glib::error::BoolError>;\\n\\n\\n\\n fn stop(&self);\\n\",\n \"file_path\": \"gstreamer/src/auto/device_provider.rs\",\n \"rank\": 80,\n \"score\": 147279.61283910155\n },\n {\n \"content\": \"pub trait WindowsBusExtManual {\\n\\n fn get_pollfd(&self) -> windows::io::RawHandle;\\n\\n}\\n\\n\\n\\nimpl WindowsBusExtManual for Bus {\\n\\n /// This is supported on **Windows** only.\\n\\n fn get_pollfd(&self) -> windows::io::RawHandle {\\n\\n #[cfg(windows)]\\n\\n unsafe {\\n\\n let mut pollfd: glib_ffi::GPollFD = mem::zeroed();\\n\\n ffi::gst_bus_get_pollfd(self.to_glib_none().0, &mut pollfd);\\n\\n\\n\\n pollfd.fd as *mut _\\n\\n }\\n\\n\\n\\n #[cfg(all(not(windows), feature = \\\"dox\\\"))]\\n\\n windows::io::RawHandle {}\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"gstreamer/src/bus_windows.rs\",\n \"rank\": 81,\n \"score\": 147279.61283910155\n },\n {\n \"content\": \"pub trait GObjectExtManualGst {\\n\\n fn set_property_from_str(&self, name: &str, value: &str);\\n\\n}\\n\\n\\n\\nimpl<O: IsA<glib::Object>> GObjectExtManualGst for O {\\n\\n fn set_property_from_str(&self, name: &str, value: &str) {\\n\\n unsafe {\\n\\n ffi::gst_util_set_object_arg(\\n\\n self.to_glib_none().0,\\n\\n name.to_glib_none().0,\\n\\n value.to_glib_none().0,\\n\\n );\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"gstreamer/src/gobject.rs\",\n \"rank\": 82,\n \"score\": 147279.61283910155\n },\n {\n \"content\": \"pub trait GhostPadExt {\\n\\n fn get_target(&self) -> Option<Pad>;\\n\\n\\n\\n fn set_target<'a, P: IsA<Pad> + 'a, Q: Into<Option<&'a P>>>(&self, newtarget: Q) -> Result<(), glib::error::BoolError>;\\n\\n}\\n\\n\\n\\nimpl<O: IsA<GhostPad>> GhostPadExt for O {\\n\\n fn get_target(&self) -> Option<Pad> {\\n\\n unsafe {\\n\\n from_glib_full(ffi::gst_ghost_pad_get_target(self.to_glib_none().0))\\n\\n }\\n\\n }\\n\\n\\n\\n fn set_target<'a, P: IsA<Pad> + 'a, Q: Into<Option<&'a P>>>(&self, newtarget: Q) -> Result<(), glib::error::BoolError> {\\n\\n let newtarget = newtarget.into();\\n\\n let newtarget = newtarget.to_glib_none();\\n\\n unsafe {\\n\\n glib::error::BoolError::from_glib(ffi::gst_ghost_pad_set_target(self.to_glib_none().0, newtarget.0), \\\"Failed to set target\\\")\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"gstreamer/src/auto/ghost_pad.rs\",\n \"rank\": 83,\n \"score\": 147279.61283910155\n },\n {\n \"content\": \"pub trait UnixBusExtManual {\\n\\n fn get_pollfd(&self) -> unix::io::RawFd;\\n\\n}\\n\\n\\n\\nimpl UnixBusExtManual for Bus {\\n\\n /// This is supported on **Unix** only.\\n\\n fn get_pollfd(&self) -> unix::io::RawFd {\\n\\n #[cfg(unix)]\\n\\n unsafe {\\n\\n let mut pollfd: glib_ffi::GPollFD = mem::zeroed();\\n\\n ffi::gst_bus_get_pollfd(self.to_glib_none().0, &mut pollfd);\\n\\n\\n\\n pollfd.fd\\n\\n }\\n\\n\\n\\n #[cfg(all(not(unix), feature = \\\"dox\\\"))]\\n\\n unix::io::RawFd {}\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"gstreamer/src/bus_unix.rs\",\n \"rank\": 84,\n \"score\": 147279.61283910155\n },\n {\n \"content\": \"pub trait URIHandlerExt {\\n\\n fn get_protocols(&self) -> Vec<String>;\\n\\n\\n\\n fn get_uri(&self) -> Option<String>;\\n\\n\\n\\n fn get_uri_type(&self) -> URIType;\\n\\n\\n\\n fn set_uri(&self, uri: &str) -> Result<(), Error>;\\n\\n}\\n\\n\\n\\nimpl<O: IsA<URIHandler>> URIHandlerExt for O {\\n\\n fn get_protocols(&self) -> Vec<String> {\\n\\n unsafe {\\n\\n FromGlibPtrContainer::from_glib_none(ffi::gst_uri_handler_get_protocols(self.to_glib_none().0))\\n\\n }\\n\\n }\\n\\n\\n\\n fn get_uri(&self) -> Option<String> {\\n\\n unsafe {\\n\\n from_glib_full(ffi::gst_uri_handler_get_uri(self.to_glib_none().0))\\n\",\n \"file_path\": \"gstreamer/src/auto/uri_handler.rs\",\n \"rank\": 85,\n \"score\": 147279.61283910155\n },\n {\n \"content\": \"pub trait TocSetterExt {\\n\\n fn get_toc(&self) -> Option<Toc>;\\n\\n\\n\\n fn reset(&self);\\n\\n\\n\\n fn set_toc<'a, P: Into<Option<&'a Toc>>>(&self, toc: P);\\n\\n}\\n\\n\\n\\nimpl<O: IsA<TocSetter>> TocSetterExt for O {\\n\\n fn get_toc(&self) -> Option<Toc> {\\n\\n unsafe {\\n\\n from_glib_full(ffi::gst_toc_setter_get_toc(self.to_glib_none().0))\\n\\n }\\n\\n }\\n\\n\\n\\n fn reset(&self) {\\n\\n unsafe {\\n\\n ffi::gst_toc_setter_reset(self.to_glib_none().0);\\n\\n }\\n\\n }\\n\\n\\n\\n fn set_toc<'a, P: Into<Option<&'a Toc>>>(&self, toc: P) {\\n\\n let toc = toc.into();\\n\\n let toc = toc.to_glib_none();\\n\\n unsafe {\\n\\n ffi::gst_toc_setter_set_toc(self.to_glib_none().0, toc.0);\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"gstreamer/src/auto/toc_setter.rs\",\n \"rank\": 86,\n \"score\": 147279.61283910155\n },\n {\n \"content\": \"pub trait ChildProxyExtManual {\\n\\n fn get_child_property(&self, name: &str) -> Option<glib::Value>;\\n\\n fn set_child_property(&self, name: &str, value: &glib::ToValue) -> Result<(), glib::BoolError>;\\n\\n}\\n\\n\\n\\nimpl<O: IsA<ChildProxy>> ChildProxyExtManual for O {\\n\\n fn get_child_property(&self, name: &str) -> Option<glib::Value> {\\n\\n unsafe {\\n\\n let found: bool = from_glib(ffi::gst_child_proxy_lookup(\\n\\n self.to_glib_none().0,\\n\\n name.to_glib_none().0,\\n\\n ptr::null_mut(),\\n\\n ptr::null_mut(),\\n\\n ));\\n\\n if !found {\\n\\n return None;\\n\\n }\\n\\n\\n\\n let mut value = glib::Value::uninitialized();\\n\\n ffi::gst_child_proxy_get_property(\\n\",\n \"file_path\": \"gstreamer/src/child_proxy.rs\",\n \"rank\": 87,\n \"score\": 147279.61283910155\n },\n {\n \"content\": \"pub trait PluginFeatureExt {\\n\\n fn check_version(&self, min_major: u32, min_minor: u32, min_micro: u32) -> bool;\\n\\n\\n\\n fn get_plugin(&self) -> Option<Plugin>;\\n\\n\\n\\n fn get_plugin_name(&self) -> Option<String>;\\n\\n\\n\\n fn get_rank(&self) -> u32;\\n\\n\\n\\n fn load(&self) -> Option<PluginFeature>;\\n\\n\\n\\n fn set_rank(&self, rank: u32);\\n\\n}\\n\\n\\n\\nimpl<O: IsA<PluginFeature>> PluginFeatureExt for O {\\n\\n fn check_version(&self, min_major: u32, min_minor: u32, min_micro: u32) -> bool {\\n\\n unsafe {\\n\\n from_glib(ffi::gst_plugin_feature_check_version(self.to_glib_none().0, min_major, min_minor, min_micro))\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"gstreamer/src/auto/plugin_feature.rs\",\n \"rank\": 88,\n \"score\": 147279.61283910155\n },\n {\n \"content\": \"pub trait SystemClockExt {\\n\\n fn get_property_clock_type(&self) -> ClockType;\\n\\n\\n\\n fn set_property_clock_type(&self, clock_type: ClockType);\\n\\n\\n\\n fn connect_property_clock_type_notify<F: Fn(&Self) + Send + Sync + 'static>(&self, f: F) -> SignalHandlerId;\\n\\n}\\n\\n\\n\\nimpl<O: IsA<SystemClock> + IsA<glib::object::Object>> SystemClockExt for O {\\n\\n fn get_property_clock_type(&self) -> ClockType {\\n\\n unsafe {\\n\\n let mut value = Value::from_type(<ClockType as StaticType>::static_type());\\n\\n gobject_ffi::g_object_get_property(self.to_glib_none().0, \\\"clock-type\\\".to_glib_none().0, value.to_glib_none_mut().0);\\n\\n value.get().unwrap()\\n\\n }\\n\\n }\\n\\n\\n\\n fn set_property_clock_type(&self, clock_type: ClockType) {\\n\\n unsafe {\\n\\n gobject_ffi::g_object_set_property(self.to_glib_none().0, \\\"clock-type\\\".to_glib_none().0, Value::from(&clock_type).to_glib_none().0);\\n\",\n \"file_path\": \"gstreamer/src/auto/system_clock.rs\",\n \"rank\": 89,\n \"score\": 147279.61283910155\n },\n {\n \"content\": \"pub trait ProxyPadExt {\\n\\n fn get_internal(&self) -> Option<ProxyPad>;\\n\\n}\\n\\n\\n\\nimpl<O: IsA<ProxyPad>> ProxyPadExt for O {\\n\\n fn get_internal(&self) -> Option<ProxyPad> {\\n\\n unsafe {\\n\\n from_glib_full(ffi::gst_proxy_pad_get_internal(self.to_glib_none().0))\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"gstreamer/src/auto/proxy_pad.rs\",\n \"rank\": 90,\n \"score\": 147279.61283910155\n },\n {\n \"content\": \"pub trait TagSetterExtManual {\\n\\n fn add<'a, T: Tag<'a>>(&self, value: T::TagType, mode: TagMergeMode)\\n\\n where\\n\\n T::TagType: ToSendValue;\\n\\n}\\n\\n\\n\\nimpl<O: IsA<TagSetter>> TagSetterExtManual for O {\\n\\n fn add<'a, T: Tag<'a>>(&self, value: T::TagType, mode: TagMergeMode)\\n\\n where\\n\\n T::TagType: ToSendValue,\\n\\n {\\n\\n unsafe {\\n\\n let v = value.to_send_value();\\n\\n\\n\\n ffi::gst_tag_setter_add_tag_value(\\n\\n self.to_glib_none().0,\\n\\n mode.to_glib(),\\n\\n T::tag_name().to_glib_none().0,\\n\\n v.to_glib_none().0,\\n\\n );\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"gstreamer/src/tag_setter.rs\",\n \"rank\": 91,\n \"score\": 147279.61283910155\n },\n {\n \"content\": \"pub fn debug_print_stack_trace() {\\n\\n assert_initialized_main_thread!();\\n\\n unsafe {\\n\\n ffi::gst_debug_print_stack_trace();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/auto/functions.rs\",\n \"rank\": 92,\n \"score\": 146827.6738059734\n },\n {\n \"content\": \"pub fn reorder_channels(\\n\\n data: &mut [u8],\\n\\n format: ::AudioFormat,\\n\\n channels: u32,\\n\\n from: &[AudioChannelPosition],\\n\\n to: &[AudioChannelPosition],\\n\\n) -> Result<(), glib::BoolError> {\\n\\n assert_initialized_main_thread!();\\n\\n\\n\\n if from.len() != to.len() || from.len() > 64 {\\n\\n return Err(glib::BoolError(\\\"Invalid number of channels\\\"));\\n\\n }\\n\\n\\n\\n let from_len = from.len();\\n\\n let to_len = to.len();\\n\\n\\n\\n let from_raw: [ffi::GstAudioChannelPosition; 64] = array_init::array_init_copy(|i| {\\n\\n if i >= from_len as usize {\\n\\n ffi::GST_AUDIO_CHANNEL_POSITION_INVALID\\n\\n } else {\\n\",\n \"file_path\": \"gstreamer-audio/src/audio_channel_position.rs\",\n \"rank\": 93,\n \"score\": 146827.6738059734\n },\n {\n \"content\": \"pub fn center_video_rectangle(\\n\\n src: &VideoRectangle,\\n\\n dst: &VideoRectangle,\\n\\n scale: bool,\\n\\n) -> VideoRectangle {\\n\\n let mut result = ffi::GstVideoRectangle {\\n\\n x: 0,\\n\\n y: 0,\\n\\n w: 0,\\n\\n h: 0,\\n\\n };\\n\\n let src_rect = ffi::GstVideoRectangle {\\n\\n x: src.x,\\n\\n y: src.y,\\n\\n w: src.w,\\n\\n h: src.h,\\n\\n };\\n\\n let dst_rect = ffi::GstVideoRectangle {\\n\\n x: dst.x,\\n\\n y: dst.y,\\n\\n w: dst.w,\\n\\n h: dst.h,\\n\\n };\\n\\n unsafe {\\n\\n ffi::gst_video_sink_center_rect(src_rect, dst_rect, &mut result, scale.to_glib());\\n\\n }\\n\\n VideoRectangle::new(result.x, result.y, result.w, result.h)\\n\\n}\\n\",\n \"file_path\": \"gstreamer-video/src/video_rectangle.rs\",\n \"rank\": 94,\n \"score\": 146827.6738059734\n },\n {\n \"content\": \"struct CapsSome(Caps);\\n\\n\\n\",\n \"file_path\": \"gstreamer/src/caps_serde.rs\",\n \"rank\": 95,\n \"score\": 146325.95043933118\n },\n {\n \"content\": \"pub trait DiscovererInfoExt {\\n\\n fn copy(&self) -> DiscovererInfo;\\n\\n\\n\\n fn get_audio_streams(&self) -> Vec<DiscovererStreamInfo>;\\n\\n\\n\\n fn get_container_streams(&self) -> Vec<DiscovererStreamInfo>;\\n\\n\\n\\n fn get_duration(&self) -> gst::ClockTime;\\n\\n\\n\\n #[cfg(any(feature = \\\"v1_14\\\", feature = \\\"dox\\\"))]\\n\\n fn get_live(&self) -> bool;\\n\\n\\n\\n fn get_misc(&self) -> Option<gst::Structure>;\\n\\n\\n\\n fn get_missing_elements_installer_details(&self) -> Vec<String>;\\n\\n\\n\\n fn get_result(&self) -> DiscovererResult;\\n\\n\\n\\n fn get_seekable(&self) -> bool;\\n\\n\\n\",\n \"file_path\": \"gstreamer-pbutils/src/auto/discoverer_info.rs\",\n \"rank\": 96,\n \"score\": 145078.98360413563\n },\n {\n \"content\": \"pub trait BaseTransformExt {\\n\\n //fn get_allocator(&self, allocator: /*Ignored*/gst::Allocator, params: /*Ignored*/gst::AllocationParams);\\n\\n\\n\\n fn get_buffer_pool(&self) -> Option<gst::BufferPool>;\\n\\n\\n\\n fn is_in_place(&self) -> bool;\\n\\n\\n\\n fn is_passthrough(&self) -> bool;\\n\\n\\n\\n fn is_qos_enabled(&self) -> bool;\\n\\n\\n\\n fn reconfigure_sink(&self);\\n\\n\\n\\n fn reconfigure_src(&self);\\n\\n\\n\\n fn set_gap_aware(&self, gap_aware: bool);\\n\\n\\n\\n fn set_in_place(&self, in_place: bool);\\n\\n\\n\\n fn set_passthrough(&self, passthrough: bool);\\n\",\n \"file_path\": \"gstreamer-base/src/auto/base_transform.rs\",\n \"rank\": 97,\n \"score\": 145078.98360413563\n },\n {\n \"content\": \"pub trait BaseSinkExt {\\n\\n //fn do_preroll(&self, obj: /*Ignored*/&gst::MiniObject) -> gst::FlowReturn;\\n\\n\\n\\n fn get_blocksize(&self) -> u32;\\n\\n\\n\\n #[cfg(any(feature = \\\"v1_12\\\", feature = \\\"dox\\\"))]\\n\\n fn get_drop_out_of_segment(&self) -> bool;\\n\\n\\n\\n fn get_last_sample(&self) -> Option<gst::Sample>;\\n\\n\\n\\n fn get_latency(&self) -> gst::ClockTime;\\n\\n\\n\\n fn get_max_bitrate(&self) -> u64;\\n\\n\\n\\n fn get_max_lateness(&self) -> i64;\\n\\n\\n\\n fn get_render_delay(&self) -> gst::ClockTime;\\n\\n\\n\\n fn get_sync(&self) -> bool;\\n\\n\\n\",\n \"file_path\": \"gstreamer-base/src/auto/base_sink.rs\",\n \"rank\": 98,\n \"score\": 145078.98360413563\n },\n {\n \"content\": \"pub trait BaseSrcExt {\\n\\n //fn get_allocator(&self, allocator: /*Ignored*/gst::Allocator, params: /*Ignored*/gst::AllocationParams);\\n\\n\\n\\n fn get_blocksize(&self) -> u32;\\n\\n\\n\\n fn get_buffer_pool(&self) -> Option<gst::BufferPool>;\\n\\n\\n\\n fn get_do_timestamp(&self) -> bool;\\n\\n\\n\\n fn is_async(&self) -> bool;\\n\\n\\n\\n fn is_live(&self) -> bool;\\n\\n\\n\\n fn new_seamless_segment(&self, start: i64, stop: i64, time: i64) -> bool;\\n\\n\\n\\n fn query_latency(&self) -> Option<(bool, gst::ClockTime, gst::ClockTime)>;\\n\\n\\n\\n fn set_async(&self, async: bool);\\n\\n\\n\\n fn set_automatic_eos(&self, automatic_eos: bool);\\n\",\n \"file_path\": \"gstreamer-base/src/auto/base_src.rs\",\n \"rank\": 99,\n \"score\": 145078.98360413563\n }\n]","isConversational":false}}},{"rowIdx":1386,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/io/obj.rs"},"repo_name":{"kind":"string","value":"cpheinrich/web-geo-viewer"},"commit":{"kind":"string","value":"e835b0667e57697e0b8005c08c9dcd36222811ee"},"file_code":{"kind":"string","value":"/*\nCopyright 2020 Martin Buck\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"),\nto deal in the Software without restriction, including without limitation the\nrights to use, copy, modify, merge, publish, distribute, sublicense,\nand/or sell copies of the Software, and to permit persons to whom the Software\nis furnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall\nbe included all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\nDAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE\nOR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n*/\n\nuse log::*;\nuse rust_3d::*;\n\nuse std::{\n fmt,\n io::{BufRead, Error as ioError},\n};\n\nuse super::utils::*;\nuse super::{MaterialInfo, MaterialSurface};\n\npub fn load_obj_mesh<EM, P, R>(\n read: &mut R,\n mesh: &mut EM,\n material_info: &mut MaterialInfo,\n) -> ObjResult<()>\nwhere\n EM: IsFaceEditableMesh<P, Face3> + IsVertexEditableMesh<P, Face3>,\n P: IsBuildable3D + Clone,\n R: BufRead,\n{\n let mut line_buffer = Vec::new();\n let mut i_line = 0;\n let mut mtl_name = \"NotSpecified\".to_string();\n material_info\n .surfaces\n .insert(mtl_name.clone(), MaterialSurface::new());\n\n while let Ok(line) = fetch_line(read, &mut line_buffer) {\n i_line += 1;\n if line.starts_with(b\"usemtl \") {\n let mut words = to_words_skip_empty(line);\n\n \n words.next().ok_or(ObjError::LineParse(i_line))?;\n\n mtl_name = words\n .next()\n .and_then(|w| from_ascii(w))\n .ok_or(ObjError::LineParse(i_line))?;\n material_info\n .surfaces\n .insert(mtl_name.clone(), MaterialSurface::new());\n }\n\n if line.starts_with(b\"mtllib \") {\n let mut words = to_words_skip_empty(line);\n\n \n words.next().ok_or(ObjError::LineParse(i_line))?;\n\n let lib_name: String = words\n .next()\n .and_then(|w| from_ascii(w))\n .ok_or(ObjError::LineParse(i_line))?;\n material_info.material_libs.insert(lib_name.clone());\n }\n\n if line.starts_with(b\"v \") {\n let mut words = to_words_skip_empty(line);\n\n \n words.next().ok_or(ObjError::LineParse(i_line))?;\n\n let x = words\n .next()\n .and_then(|w| from_ascii(w))\n .ok_or(ObjError::LineParse(i_line))?;\n\n let y = words\n .next()\n .and_then(|w| from_ascii(w))\n .ok_or(ObjError::LineParse(i_line))?;\n\n let z = words\n .next()\n .and_then(|w| from_ascii(w))\n .ok_or(ObjError::LineParse(i_line))?;\n\n mesh.add_vertex(P::new(x, y, z));\n } else if line.starts_with(b\"vt \") {\n let mut words = to_words_skip_empty(line);\n\n \n words.next().ok_or(ObjError::LineParse(i_line))?;\n\n let x = words\n .next()\n .and_then(|w| from_ascii(w))\n .ok_or(ObjError::LineParse(i_line))?;\n\n let y = words\n .next()\n .and_then(|w| from_ascii(w))\n .or(Some(0f64))\n .unwrap();\n let z = words\n .next()\n .and_then(|w| from_ascii(w))\n .or(Some(0f64))\n .unwrap();\n\n material_info.uv.push_d(Point3D::new(x, y, z));\n } else if line.starts_with(b\"f \") {\n let mut words = to_words_skip_empty(line);\n\n \n words.next().ok_or(ObjError::LineParse(i_line))?;\n\n let mut tmp = words.next().ok_or(ObjError::LineParse(i_line))?;\n let tmp_str = until_bytes(tmp, b'/');\n let a: usize = from_ascii(tmp_str).ok_or(ObjError::LineParse(i_line))?;\n let mut maybe_at: Option<usize> = None;\n if tmp_str.len() + 1 < tmp.len() {\n maybe_at = from_ascii(until_bytes(&tmp[(tmp_str.len() + 1)..], b'/')).or(None);\n }\n\n tmp = words.next().ok_or(ObjError::LineParse(i_line))?;\n let tmp_str = until_bytes(tmp, b'/');\n let b: usize = from_ascii(tmp_str).ok_or(ObjError::LineParse(i_line))?;\n let mut maybe_bt: Option<usize> = None;\n if tmp_str.len() + 1 < tmp.len() {\n maybe_bt = from_ascii(until_bytes(&tmp[(tmp_str.len() + 1)..], b'/')).or(None);\n }\n\n tmp = words.next().ok_or(ObjError::LineParse(i_line))?;\n let tmp_str = until_bytes(tmp, b'/');\n let c: usize = from_ascii(tmp_str).ok_or(ObjError::LineParse(i_line))?;\n let mut maybe_ct: Option<usize> = None;\n if tmp_str.len() + 1 < tmp.len() {\n maybe_ct = from_ascii(until_bytes(&tmp[(tmp_str.len() + 1)..], b'/')).or(None);\n }\n\n let mut maybe_d: Option<usize> = None;\n let mut maybe_dt: Option<usize> = None;\n match words.next() {\n Some(tmp) => {\n let tmp_str = until_bytes(tmp, b'/');\n if tmp_str.len() > 0 {\n maybe_d = from_ascii(until_bytes(&tmp_str, b'/')).or(None);\n }\n if tmp_str.len() + 1 < tmp.len() {\n maybe_dt =\n from_ascii(until_bytes(&tmp[(tmp_str.len() + 1)..], b'/')).or(None);\n }\n \n if let Some(d) = maybe_d {\n let face = Face3 {\n a: VId { val: a - 1 },\n b: VId { val: c - 1 },\n c: VId { val: d - 1 },\n };\n material_info\n .surfaces\n .get_mut(&mtl_name)\n .unwrap()\n .faces\n .insert(face);\n }\n if let (Some(at), Some(ct), Some(d), Some(dt)) =\n (maybe_at, maybe_ct, maybe_d, maybe_dt)\n {\n material_info\n .surfaces\n .get_mut(&mtl_name)\n .unwrap()\n .uvs\n .insert(\n Face3 {\n a: VId { val: a - 1 },\n b: VId { val: c - 1 },\n c: VId { val: d - 1 },\n },\n Face3 {\n a: VId { val: at - 1 },\n b: VId { val: ct - 1 },\n c: VId { val: dt - 1 },\n },\n );\n }\n }\n None => {}\n };\n\n \n material_info\n .surfaces\n .get_mut(&mtl_name)\n .unwrap()\n .faces\n .insert(Face3 {\n a: VId { val: a - 1 },\n b: VId { val: b - 1 },\n c: VId { val: c - 1 },\n });\n if let (Some(at), Some(bt), Some(ct)) = (maybe_at, maybe_bt, maybe_ct) {\n material_info\n .surfaces\n .get_mut(&mtl_name)\n .unwrap()\n .uvs\n .insert(\n Face3 {\n a: VId { val: a - 1 },\n b: VId { val: b - 1 },\n c: VId { val: c - 1 },\n },\n Face3 {\n a: VId { val: at - 1 },\n b: VId { val: bt - 1 },\n c: VId { val: ct - 1 },\n },\n );\n }\n \n if let Some(_next) = words.next() {\n return Err(ObjError::NotTriangularMesh(i_line));\n }\n }\n }\n \n \n \n \n for surface in &material_info.surfaces {\n for face in &surface.1.faces {\n match mesh.try_add_connection(face.a, face.b, face.c).or(Err(\n ObjError::InvalidMeshIndices(face.a.val, face.b.val, face.c.val),\n )) {\n Ok(_) => {}\n Err(_) => {\n info!(\n \"Warning, face {},{},{} could not be added.\",\n face.a.val, face.b.val, face.c.val\n );\n }\n }\n }\n }\n Ok(())\n}\n\npub fn load_obj_points<IP, P, R>(read: &mut R, ip: &mut IP) -> ObjResult<()>\nwhere\n IP: IsPushable<P>,\n P: IsBuildable3D,\n R: BufRead,\n{\n let mut line_buffer = Vec::new();\n let mut i_line = 0;\n\n while let Ok(line) = fetch_line(read, &mut line_buffer) {\n i_line += 1;\n\n if line.starts_with(b\"v \") {\n let mut words = to_words_skip_empty(line);\n\n \n words.next().ok_or(ObjError::LineParse(i_line))?;\n\n let x = words\n .next()\n .and_then(|w| from_ascii(w))\n .ok_or(ObjError::LineParse(i_line))?;\n\n let y = words\n .next()\n .and_then(|w| from_ascii(w))\n .ok_or(ObjError::LineParse(i_line))?;\n\n let z = words\n .next()\n .and_then(|w| from_ascii(w))\n .ok_or(ObjError::LineParse(i_line))?;\n\n ip.push(P::new(x, y, z));\n }\n }\n\n Ok(())\n}\n\npub enum ObjError {\n AccessFile,\n InvalidMeshIndices(usize, usize, usize),\n LineParse(usize),\n NotTriangularMesh(usize),\n}\n\npub type ObjResult<T> = std::result::Result<T, ObjError>;\n\nimpl fmt::Debug for ObjError {\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n match self {\n Self::AccessFile => write!(f, \"Unable to access file\"),\n Self::LineParse(x) => write!(f, \"Unable to parse line {}\", x),\n Self::InvalidMeshIndices(x, y, z) => {\n write!(f, \"File contains invalid mesh indices: {}, {}, {}\", x, y, z)\n }\n Self::NotTriangularMesh(x) => write!(\n f,\n \"File contains face with more than 3 sets of indices on line {}\",\n x\n ),\n }\n }\n}\n\nimpl From<ioError> for ObjError {\n fn from(_error: ioError) -> Self {\n ObjError::AccessFile\n }\n}\n"},"prefix":{"kind":"string","value":"/*\nCopyright 2020 Martin Buck\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"),\nto deal in the Software without restriction, including without limitation the\nrights to use, copy, modify, merge, publish, distribute, sublicense,\nand/or sell copies of the Software, and to permit persons to whom the Software\nis furnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall\nbe included all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\nDAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE\nOR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n*/\n\nuse log::*;\nuse rust_3d::*;\n\nuse std::{\n fmt,\n io::{BufRead, Error as ioError},\n};\n\nuse super::utils::*;\nuse super::{MaterialInfo, MaterialSurface};\n\npub fn load_obj_mesh<EM, P, R>(\n read: &mut R,\n mesh: &mut EM,\n material_info: &mut MaterialInfo,\n) -> ObjResult<()>\nwhere\n EM: IsFaceEditableMesh<P, Face3> + IsVertexEditableMesh<P, Face3>,\n P: IsBuildable3D + Clone,\n R: BufRead,\n{\n let mut line_buffer = Vec::new();\n let mut i_line = 0;\n let mut mtl_name = \"NotSpecified\".to_string();\n material_info\n .surfaces\n .insert(mtl_name.clone(), MaterialSurface::new());\n\n while let Ok(line) = fetch_line(read, &mut line_buffer) {\n i_line += 1;\n if line.starts_with(b\"usemtl \") {\n let mut words = to_words_skip_empty(line);\n\n \n words.next().ok_or(ObjError::LineParse(i_line))?;\n\n mtl_name = words\n .next()\n .and_then(|w| from_ascii(w))\n .ok_or(ObjError::LineParse(i_line))?;\n material_info\n .surfaces\n .insert(mtl_name.clone(), MaterialSurface::new());\n }\n\n if line.starts_with(b\"mtllib \") {\n let mut words = to_words_skip_empty(line);\n\n \n words.next().ok_or(ObjError::LineParse(i_line))?;\n\n let lib_name: String = words\n .next()\n .and_then(|w| from_ascii(w))\n .ok_or(ObjError::LineParse(i_line))?;\n material_info.material_libs.insert(lib_name.clone());\n }\n\n if line.starts_with(b\"v \") {\n let mut words = to_words_skip_empty(line);\n\n \n words.next().ok_or(ObjError::LineParse(i_line))?;\n\n let x = words\n .next()\n .and_then(|w| from_ascii(w))\n .ok_or(ObjError::LineParse(i_line))?;\n\n let y = words\n .next()\n .and_then(|w| from_ascii(w))\n .ok_or(ObjError::LineParse(i_line))?;\n\n let z = words\n .next()\n .and_then(|w| from_ascii(w))\n .ok_or(ObjError::LineParse(i_line))?;\n\n mesh.add_vertex(P::new(x, y, z));\n } else if line.starts_with(b\"vt \") {\n let mut words = to_words_skip_empty(line);\n\n \n words.next().ok_or(ObjError::LineParse(i_line))?;\n\n let x = words\n .next()\n .and_then(|w| from_ascii(w))\n .ok_or(ObjError::LineParse(i_line))?;\n\n let y = words\n .next()\n .and_then(|w| from_ascii(w))\n .or(Some(0f64))\n .unwrap();\n let z = words\n .next()\n .and_then(|w| from_ascii(w))\n .or(Some(0f64))\n .unwrap();\n\n material_info.uv.push_d(Point3D::new(x, y, z));\n } else if line.starts_with(b\"f \") {\n let mut words = to_words_skip_empty(line);\n\n \n words.next().ok_or(ObjError::LineParse(i_line))?;\n\n let mut tmp = words.next().ok_or(ObjError::LineParse(i_line))?;\n let tmp_str = until_bytes(tmp, b'/');\n let a: usize = from_ascii(tmp_str).ok_or(ObjError::LineParse(i_line))?;\n let mut maybe_at: Option<usize> = None;\n if tmp_str.len() + 1 < tmp.len() {\n maybe_at = from_ascii(until_bytes(&tmp[(tmp_str.len() + 1)..], b'/')).or(None);\n }\n\n tmp = words.next().ok_or(ObjError::LineParse(i_line))?;\n let tmp_str = until_bytes(tmp, b'/');\n let b: usize = from_ascii(tmp_str).ok_or(ObjError::LineParse(i_line))?;\n let mut maybe_bt: Option<usize> = None;\n if tmp_str.len() + 1 < tmp.len() {\n maybe_bt = from_ascii(until_bytes(&tmp[(tmp_str.len() + 1)..], b'/')).or(None);\n }\n\n tmp = words.next().ok_or(ObjError::LineParse(i_line))?;\n let tmp_str = until_bytes(tmp, b'/');\n let c: usize = from_ascii(tmp_str).ok_or(ObjError::LineParse(i_line))?;\n let mut maybe_ct: Option<usize> = None;\n if tmp_str.len() + 1 < tmp.len() {\n maybe_ct = from_ascii(until_bytes(&tmp[(tmp_str.len() + 1)..], b'/')).or(None);\n }\n\n let mut maybe_d: Option<usize> = None;\n let mut maybe_dt: Option<usize> = None;\n match words.next() {\n Some(tmp) => {\n let tmp_str = until_bytes(tmp, b'/');\n if tmp_str.len() > 0 {\n maybe_d = from_ascii(until_bytes(&tmp_str, b'/')).or(None);\n }\n if tmp_str.len() + 1 < tmp.len() {\n maybe_dt =\n from_ascii(until_bytes(&tmp[(tmp_str.len() + 1)..], b'/')).or(None);\n }\n "},"suffix":{"kind":"string","value":" }\n }\n }\n }\n Ok(())\n}\n\npub fn load_obj_points<IP, P, R>(read: &mut R, ip: &mut IP) -> ObjResult<()>\nwhere\n IP: IsPushable<P>,\n P: IsBuildable3D,\n R: BufRead,\n{\n let mut line_buffer = Vec::new();\n let mut i_line = 0;\n\n while let Ok(line) = fetch_line(read, &mut line_buffer) {\n i_line += 1;\n\n if line.starts_with(b\"v \") {\n let mut words = to_words_skip_empty(line);\n\n \n words.next().ok_or(ObjError::LineParse(i_line))?;\n\n let x = words\n .next()\n .and_then(|w| from_ascii(w))\n .ok_or(ObjError::LineParse(i_line))?;\n\n let y = words\n .next()\n .and_then(|w| from_ascii(w))\n .ok_or(ObjError::LineParse(i_line))?;\n\n let z = words\n .next()\n .and_then(|w| from_ascii(w))\n .ok_or(ObjError::LineParse(i_line))?;\n\n ip.push(P::new(x, y, z));\n }\n }\n\n Ok(())\n}\n\npub enum ObjError {\n AccessFile,\n InvalidMeshIndices(usize, usize, usize),\n LineParse(usize),\n NotTriangularMesh(usize),\n}\n\npub type ObjResult<T> = std::result::Result<T, ObjError>;\n\nimpl fmt::Debug for ObjError {\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n match self {\n Self::AccessFile => write!(f, \"Unable to access file\"),\n Self::LineParse(x) => write!(f, \"Unable to parse line {}\", x),\n Self::InvalidMeshIndices(x, y, z) => {\n write!(f, \"File contains invalid mesh indices: {}, {}, {}\", x, y, z)\n }\n Self::NotTriangularMesh(x) => write!(\n f,\n \"File contains face with more than 3 sets of indices on line {}\",\n x\n ),\n }\n }\n}\n\nimpl From<ioError> for ObjError {\n fn from(_error: ioError) -> Self {\n ObjError::AccessFile\n }\n}\n"},"middle":{"kind":"string","value":" \n if let Some(d) = maybe_d {\n let face = Face3 {\n a: VId { val: a - 1 },\n b: VId { val: c - 1 },\n c: VId { val: d - 1 },\n };\n material_info\n .surfaces\n .get_mut(&mtl_name)\n .unwrap()\n .faces\n .insert(face);\n }\n if let (Some(at), Some(ct), Some(d), Some(dt)) =\n (maybe_at, maybe_ct, maybe_d, maybe_dt)\n {\n material_info\n .surfaces\n .get_mut(&mtl_name)\n .unwrap()\n .uvs\n .insert(\n Face3 {\n a: VId { val: a - 1 },\n b: VId { val: c - 1 },\n c: VId { val: d - 1 },\n },\n Face3 {\n a: VId { val: at - 1 },\n b: VId { val: ct - 1 },\n c: VId { val: dt - 1 },\n },\n );\n }\n }\n None => {}\n };\n\n \n material_info\n .surfaces\n .get_mut(&mtl_name)\n .unwrap()\n .faces\n .insert(Face3 {\n a: VId { val: a - 1 },\n b: VId { val: b - 1 },\n c: VId { val: c - 1 },\n });\n if let (Some(at), Some(bt), Some(ct)) = (maybe_at, maybe_bt, maybe_ct) {\n material_info\n .surfaces\n .get_mut(&mtl_name)\n .unwrap()\n .uvs\n .insert(\n Face3 {\n a: VId { val: a - 1 },\n b: VId { val: b - 1 },\n c: VId { val: c - 1 },\n },\n Face3 {\n a: VId { val: at - 1 },\n b: VId { val: bt - 1 },\n c: VId { val: ct - 1 },\n },\n );\n }\n \n if let Some(_next) = words.next() {\n return Err(ObjError::NotTriangularMesh(i_line));\n }\n }\n }\n \n \n \n \n for surface in &material_info.surfaces {\n for face in &surface.1.faces {\n match mesh.try_add_connection(face.a, face.b, face.c).or(Err(\n ObjError::InvalidMeshIndices(face.a.val, face.b.val, face.c.val),\n )) {\n Ok(_) => {}\n Err(_) => {\n info!(\n \"Warning, face {},{},{} could not be added.\",\n face.a.val, face.b.val, face.c.val\n );\n "},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"/// Loads an IsMesh3D from the off file format\n\npub fn load_off_mesh<EM, P, R>(read: &mut R, mesh: &mut EM) -> OffResult<()>\n\nwhere\n\n EM: IsFaceEditableMesh<P, Face3> + IsVertexEditableMesh<P, Face3>,\n\n P: IsBuildable3D + Clone,\n\n R: BufRead,\n\n{\n\n let mut line_buffer = Vec::new();\n\n let mut i_line = 0;\n\n\n\n let mut off_seen = false;\n\n let mut counts = None;\n\n\n\n while let Ok(line) = fetch_line(read, &mut line_buffer) {\n\n i_line += 1;\n\n\n\n if !off_seen && line.starts_with(b\"OFF\") {\n\n off_seen = true;\n\n continue;\n\n }\n\n\n","file_path":"src/io/off.rs","rank":0,"score":323430.3918512946},{"content":"#[inline(always)]\n\npub fn skip_bytes<R>(read: &mut R, n_bytes: usize) -> std::io::Result<()>\n\nwhere\n\n R: Read,\n\n{\n\n let mut buffer = [0u8; 1];\n\n for _ in 0..n_bytes {\n\n let _ = read.read_exact(&mut buffer)?;\n\n }\n\n\n\n Ok(())\n\n}\n\n\n\n/// Skip number of elements\n","file_path":"src/io/utils.rs","rank":1,"score":238809.35433665093},{"content":"/// Loads IsPushable<Is3D> from the .off file format\n\npub fn load_off_points<IP, P, R>(read: &mut R, ip: &mut IP) -> OffResult<()>\n\nwhere\n\n IP: IsPushable<P>,\n\n P: IsBuildable3D,\n\n R: BufRead,\n\n{\n\n let mut line_buffer = Vec::new();\n\n let mut i_line = 0;\n\n\n\n let mut off_seen = false;\n\n let mut n_vertices = None;\n\n let mut n_added = 0;\n\n\n\n while let Ok(line) = fetch_line(read, &mut line_buffer) {\n\n i_line += 1;\n\n\n\n if !off_seen && line.starts_with(b\"OFF\") {\n\n off_seen = true;\n\n continue;\n\n }\n","file_path":"src/io/off.rs","rank":3,"score":227814.92701315827},{"content":"/// Loads materials from a .mtl file\n\npub fn load_mtl<R>(read: &mut R) -> MtlResult<HashMap<String, Material>>\n\nwhere\n\n R: BufRead,\n\n{\n\n let mut line_buffer = Vec::new();\n\n let mut i_line = 0;\n\n let mut mtl_name: Option<String> = None;\n\n let mut result: HashMap<String, Material> = HashMap::new();\n\n while let Ok(line) = fetch_line(read, &mut line_buffer) {\n\n i_line += 1;\n\n if line.starts_with(b\"newmtl \") {\n\n // skip \"newmtl\"\n\n let mut words = to_words_skip_empty(line);\n\n words.next().ok_or(MtlError::LineParse(i_line))?;\n\n if let Some(next_word) = words.next().and_then(|w| from_ascii(w)) {\n\n mtl_name = Some(next_word);\n\n result.insert(mtl_name.clone().unwrap(), Material::new());\n\n }\n\n } else if line.starts_with(b\"map_Kd \") {\n\n let mut words = to_words_skip_empty(line);\n","file_path":"src/io/mtl.rs","rank":5,"score":217195.13771809978},{"content":"/// Loads an IsMesh3D from the .ply file format\n\npub fn load_ply<EM, P, R>(\n\n read: &mut R,\n\n mesh: &mut EM,\n\n material: &mut Material,\n\n material_info: &mut MaterialInfo,\n\n name: &String,\n\n) -> PlyResult<()>\n\nwhere\n\n EM: IsFaceEditableMesh<P, Face3> + IsVertexEditableMesh<P, Face3>,\n\n P: IsBuildable3D + Clone,\n\n R: BufRead,\n\n{\n\n let mut line_buffer = Vec::new();\n\n let mut i_line = 0;\n\n let surface = MaterialSurface::new();\n\n material_info.surfaces.insert(name.clone(), surface);\n\n\n\n let header = load_header(read, &mut line_buffer, &mut i_line)?;\n\n material.texture_name = header.texture_name.clone();\n\n\n","file_path":"src/io/ply/load.rs","rank":6,"score":203082.31387108704},{"content":"#[inline(always)]\n\npub fn read_face_type<BR, R>(read: &mut R, t: FaceType) -> PlyResult<usize>\n\nwhere\n\n BR: IsByteReader,\n\n R: Read,\n\n{\n\n match t {\n\n FaceType::Char => Ok(BR::read_i8(read)? as usize),\n\n FaceType::UChar => Ok(BR::read_u8(read)? as usize),\n\n FaceType::Short => Ok(BR::read_i16(read)? as usize),\n\n FaceType::UShort => Ok(BR::read_u16(read)? as usize),\n\n FaceType::Int => Ok(BR::read_i32(read)? as usize),\n\n FaceType::UInt => Ok(BR::read_u32(read)? as usize),\n\n _ => Err(PlyError::InvalidFaceType),\n\n }\n\n}\n\n\n\n//------------------------------------------------------------------------------\n\n\n","file_path":"src/io/ply/utils.rs","rank":7,"score":200767.85424448625},{"content":"#[inline(always)]\n\npub fn read_vertex_type<BR, R>(read: &mut R, t: VertexType) -> PlyResult<f64>\n\nwhere\n\n BR: IsByteReader,\n\n R: Read,\n\n{\n\n Ok(match t {\n\n VertexType::Float => BR::read_f32(read)? as f64,\n\n VertexType::Double => BR::read_f64(read)?,\n\n })\n\n}\n\n\n\n//------------------------------------------------------------------------------\n\n\n","file_path":"src/io/ply/utils.rs","rank":8,"score":181349.06933940266},{"content":"#[inline(always)]\n\npub fn fetch_line<'a, R>(read: &mut R, line_buffer: &'a mut Vec<u8>) -> FetchLineResult<&'a [u8]>\n\nwhere\n\n R: BufRead,\n\n{\n\n line_buffer.clear();\n\n let n_read = read.read_until(b'\\n', line_buffer)?;\n\n if n_read == 0 {\n\n return Err(FetchLineError);\n\n }\n\n\n\n // We must drop the '\\n' we read_until for sure\n\n // And might also have to drop additional whitespace\n\n let mut ignore_end = 1;\n\n for i in 1..line_buffer.len() {\n\n if (line_buffer[line_buffer.len() - i - 1] as char).is_whitespace() {\n\n ignore_end += 1;\n\n } else {\n\n break;\n\n }\n\n }\n","file_path":"src/io/utils.rs","rank":9,"score":176033.91338870264},{"content":"fn load_header<R>(read: &mut R, line_buffer: &mut Vec<u8>, i_line: &mut usize) -> PlyResult<Header>\n\nwhere\n\n R: BufRead,\n\n{\n\n let mut vertex_order = [Xyz::X, Xyz::X, Xyz::X];\n\n let mut i_vertex_order = 0;\n\n\n\n let mut ply_found = false;\n\n let mut read_state = HeaderReadState::Meta;\n\n let mut opt_format = None;\n\n let mut opt_n_vertices: Option<usize> = None;\n\n let mut opt_n_faces: Option<usize> = None;\n\n\n\n let mut opt_fst_type = None;\n\n let mut opt_snd_type = None;\n\n let mut opt_third_type = None;\n\n let mut n_types_found = 0;\n\n let mut vertex_before = BytesWords::default();\n\n let mut vertex_between_first_snd = BytesWords::default();\n\n let mut vertex_between_snd_third = BytesWords::default();\n","file_path":"src/io/ply/load.rs","rank":10,"score":171214.44435496168},{"content":"fn load_ascii<EM, P, R>(\n\n read: &mut R,\n\n mesh: &mut EM,\n\n header: &Header,\n\n line_buffer: &mut Vec<u8>,\n\n i_line: &mut usize,\n\n material_info: &mut MaterialInfo,\n\n name: &String,\n\n) -> PlyResult<()>\n\nwhere\n\n EM: IsFaceEditableMesh<P, Face3> + IsVertexEditableMesh<P, Face3>,\n\n P: IsBuildable3D + Clone,\n\n R: BufRead,\n\n{\n\n while let Ok(line) = fetch_line(read, line_buffer) {\n\n *i_line += 1;\n\n\n\n if header.n_vertices > mesh.num_vertices() {\n\n let mut words = to_words_skip_empty(line);\n\n\n","file_path":"src/io/ply/load.rs","rank":11,"score":170370.97573858604},{"content":"fn load_binary<BR, EM, P, R>(\n\n read: &mut R,\n\n mesh: &mut EM,\n\n header: &Header,\n\n material_info: &mut MaterialInfo,\n\n name: &String,\n\n) -> PlyResult<()>\n\nwhere\n\n EM: IsFaceEditableMesh<P, Face3> + IsVertexEditableMesh<P, Face3>,\n\n P: IsBuildable3D + Clone,\n\n R: Read,\n\n BR: IsByteReader,\n\n{\n\n for _ in 0..header.n_vertices {\n\n skip_bytes(read, header.vertex_format.before.bytes)?;\n\n\n\n let first = read_vertex_type::<BR, _>(read, header.vertex_format.first)?;\n\n\n\n skip_bytes(read, header.vertex_format.between_first_snd.bytes)?;\n\n\n","file_path":"src/io/ply/load.rs","rank":12,"score":163650.02640364625},{"content":"/// Saves an IsMesh3D in the ASCII .ply file format\n\npub fn save_ply_ascii<M, P, W>(write: &mut W, mesh: &M) -> PlyResult<()>\n\nwhere\n\n M: IsMesh<P, Face3>,\n\n P: IsBuildable3D,\n\n W: Write,\n\n{\n\n let header = \"ply\\n\".to_string()\n\n + \"format ascii 1.0\\n\"\n\n + \"comment Created by rust-3d\\n\"\n\n + \"element vertex \"\n\n + &mesh.num_vertices().to_string()\n\n + \"\\n\"\n\n + \"property float x\\n\"\n\n + \"property float y\\n\"\n\n + \"property float z\\n\"\n\n + \"element face \"\n\n + &mesh.num_faces().to_string()\n\n + \"\\n\"\n\n + \"property list uchar uint vertex_indices\\n\"\n\n + \"end_header\\n\";\n","file_path":"src/io/ply/save.rs","rank":13,"score":157463.75637735537},{"content":"/// Saves an IsMesh3D in the binary .ply file format\n\npub fn save_ply_binary<M, P, W>(write: &mut W, mesh: &M, precision: &Precision) -> PlyResult<()>\n\nwhere\n\n M: IsMesh<P, Face3>,\n\n P: IsBuildable3D,\n\n W: Write,\n\n{\n\n let header = match precision {\n\n Precision::P32 => {\n\n \"ply\\n\".to_string()\n\n + \"format binary_big_endian 1.0\\n\"\n\n + \"comment Created by rust-3d\\n\"\n\n + \"element vertex \"\n\n + &mesh.num_vertices().to_string()\n\n + \"\\n\"\n\n + \"property float x\\n\"\n\n + \"property float y\\n\"\n\n + \"property float z\\n\"\n\n + \"element face \"\n\n + &mesh.num_faces().to_string()\n\n + \"\\n\"\n","file_path":"src/io/ply/save.rs","rank":14,"score":148369.8508730583},{"content":"#[inline(always)]\n\npub fn skip_n<I>(i: &mut I, n: usize)\n\nwhere\n\n I: Iterator,\n\n{\n\n for _ in 0..n {\n\n i.next();\n\n }\n\n}\n\n\n\n//------------------------------------------------------------------------------\n\n\n\n/// Reads a FromStr from ASCII bytes\n","file_path":"src/io/utils.rs","rank":15,"score":143428.76253843826},{"content":"/// Saves an IsMesh3D in the ASCII .ply file format with additional colors\n\npub fn save_ply_ascii_colored<M, P, W>(write: &mut W, mesh: &M, colors: &Vec<Rgb>) -> PlyResult<()>\n\nwhere\n\n M: IsMesh<P, Face3>,\n\n P: IsBuildable3D,\n\n W: Write,\n\n{\n\n let n_vertices = mesh.num_vertices();\n\n let n_faces = mesh.num_faces();\n\n\n\n if n_vertices != colors.len() {\n\n return Err(PlyError::ColorArrayIncorrectLength);\n\n }\n\n\n\n let header = \"ply\\n\".to_string()\n\n + \"format ascii 1.0\\n\"\n\n + \"comment Created by rust-3d\\n\"\n\n + \"element vertex \"\n\n + &n_vertices.to_string()\n\n + \"\\n\"\n\n + \"property float x\\n\"\n","file_path":"src/io/ply/save.rs","rank":16,"score":142136.39063591236},{"content":"pub fn update(model: &mut Model, msg: &Msg) -> ShouldRender {\n\n match msg {\n\n Msg::Files(files) => {\n\n for file in files.into_iter() {\n\n let task = {\n\n let callback = model.link.callback(Msg::Loaded);\n\n model.reader.read_file(file.clone(), callback).unwrap()\n\n };\n\n model.tasks.push(task);\n\n }\n\n }\n\n Msg::Loaded(file) => {\n\n let path = Path::new(&file.name);\n\n info!(\"Loading file {}\", file.name);\n\n if let Some(ext) = path.extension() {\n\n let maybe_image_format =\n\n string_to_format(&ext.to_os_string().into_string().unwrap().to_lowercase());\n\n if let Some(image_format) = maybe_image_format {\n\n info!(\"Loading image {}\", file.name);\n\n match image::load_from_memory_with_format(&file.content[..], image_format) {\n","file_path":"src/mesh_loader.rs","rank":17,"score":128900.32721045848},{"content":"pub fn update(model: &mut Model, msg: &Msg) -> ShouldRender {\n\n match msg {\n\n Msg::RemoveMesh(event) => {\n\n model.mesh.remove(event);\n\n return true;\n\n }\n\n Msg::MeshVisibilityToggle(event) => {\n\n let visible = &mut model.mesh.get_mut(event).unwrap().visible;\n\n *visible = !(*visible);\n\n }\n\n _ => {}\n\n };\n\n false\n\n}\n","file_path":"src/mesh_list.rs","rank":18,"score":128900.32721045848},{"content":"/// Saves an IsMesh3D in the binary .ply file format with additional colors\n\npub fn save_ply_binary_colored<M, P, W>(\n\n write: &mut W,\n\n mesh: &M,\n\n precision: &Precision,\n\n colors: &Vec<Rgb>,\n\n) -> PlyResult<()>\n\nwhere\n\n M: IsMesh<P, Face3>,\n\n P: IsBuildable3D,\n\n W: Write,\n\n{\n\n let n_vertices = mesh.num_vertices();\n\n let n_faces = mesh.num_faces();\n\n\n\n if n_vertices != colors.len() {\n\n return Err(PlyError::ColorArrayIncorrectLength);\n\n }\n\n\n\n let header = match precision {\n\n Precision::P32 => {\n","file_path":"src/io/ply/save.rs","rank":19,"score":110693.12439252582},{"content":"fn extend_by_vertex(p: &Point3D, array: &mut Vec<f32>) {\n\n array.push(p.x() as f32);\n\n array.push(p.y() as f32);\n\n array.push(p.z() as f32);\n\n}\n\n\n","file_path":"src/mesh_loader.rs","rank":20,"score":110427.73148720444},{"content":"fn string_to_format(format_string: &String) -> Option<image::ImageFormat> {\n\n let test_string = format_string.to_lowercase();\n\n if test_string == \"png\" {\n\n Some(image::ImageFormat::Png)\n\n } else if test_string == \"jpg\" || test_string == \".jpeg\" {\n\n Some(image::ImageFormat::Jpeg)\n\n } else if test_string == \"gif\" {\n\n Some(image::ImageFormat::Gif)\n\n } else if test_string == \"webp\" {\n\n Some(image::ImageFormat::WebP)\n\n } else if test_string == \"pnm\" {\n\n Some(image::ImageFormat::Pnm)\n\n } else if test_string == \"tiff\" || test_string == \"tiff\" {\n\n Some(image::ImageFormat::Tiff)\n\n } else if test_string == \"tga\" {\n\n Some(image::ImageFormat::Tga)\n\n } else if test_string == \"dds\" {\n\n Some(image::ImageFormat::Dds)\n\n } else if test_string == \"bmp\" {\n\n Some(image::ImageFormat::Bmp)\n\n } else if test_string == \"ico\" {\n\n Some(image::ImageFormat::Ico)\n\n } else if test_string == \"hdr\" {\n\n Some(image::ImageFormat::Hdr)\n\n } else {\n\n None\n\n }\n\n}\n\n\n","file_path":"src/mesh_loader.rs","rank":21,"score":109377.13953942576},{"content":"pub fn rendered(model: &mut Model, first_render: bool) {\n\n let canvas = model.node_ref.cast::<HtmlCanvasElement>().unwrap();\n\n\n\n let gl: GL = canvas\n\n .get_context(\"webgl2\")\n\n .unwrap()\n\n .unwrap()\n\n .dyn_into()\n\n .unwrap();\n\n\n\n model.canvas = Some(canvas);\n\n model.gl = new_gl(&gl);\n\n let gl_ref = model.gl.as_ref().expect(\"GL Context not initialized!\");\n\n\n\n model.renderer = Some(DeferredPipeline::new(&gl_ref).unwrap());\n\n model.untextured_mesh_renderer = Some(UntexturedMeshRenderer::new(&gl_ref));\n\n model.textured_mesh_renderer = Some(TexturedMeshRenderer::new(&gl_ref));\n\n\n\n // Camera\n\n let camera = Camera::new_perspective(\n","file_path":"src/render_canvas.rs","rank":22,"score":107607.81174580553},{"content":"pub fn update(model: &mut Model, msg: &Msg) -> ShouldRender {\n\n match msg {\n\n Msg::PointerDown(event) => {\n\n model.mouse_down = event.button();\n\n }\n\n Msg::PointerUp(_event) => {\n\n model.mouse_down = -1;\n\n }\n\n Msg::MouseUp(_event) => {\n\n model.mouse_down = -1;\n\n }\n\n Msg::TouchEnd(_event) => {\n\n model.mouse_down = -1;\n\n }\n\n Msg::PointerMove(event) => {\n\n if model.mouse_down != -1 {\n\n model.mouse_events.push(event.clone());\n\n }\n\n }\n\n Msg::PointerWheel(event) => {\n\n model.wheel_events.push(event.clone());\n\n }\n\n _ => {}\n\n }\n\n false\n\n}\n","file_path":"src/input_controller.rs","rank":23,"score":105991.94145957299},{"content":"pub fn update(model: &mut Model, msg: &Msg) -> ShouldRender {\n\n match msg {\n\n Msg::Render(timestamp) => {\n\n render_gl(model, *timestamp);\n\n }\n\n _ => {}\n\n };\n\n false\n\n}\n\n\n","file_path":"src/render_canvas.rs","rank":24,"score":105991.94145957299},{"content":"pub fn view_mesh_list(model: &Model) -> Html {\n\n html! {\n\n <table style=\"width:100%\">\n\n { for model.mesh.iter().map(|f| view_element(model, f.0)) }\n\n </table>\n\n }\n\n}\n\n\n","file_path":"src/mesh_list.rs","rank":25,"score":104186.93395579242},{"content":"#[inline(always)]\n\npub fn point_with_order<P>(fst: f64, snd: f64, third: f64, order: VertexOrder) -> P\n\nwhere\n\n P: IsBuildable3D,\n\n{\n\n match order {\n\n VertexOrder::Xyz => P::new(fst, snd, third),\n\n VertexOrder::Xzy => P::new(fst, third, snd),\n\n VertexOrder::Yxz => P::new(snd, fst, third),\n\n VertexOrder::Yzx => P::new(snd, third, fst),\n\n VertexOrder::Zxy => P::new(third, fst, snd),\n\n VertexOrder::Zyx => P::new(third, snd, fst),\n\n }\n\n}\n","file_path":"src/io/ply/utils.rs","rank":26,"score":104022.75045521706},{"content":"fn create_mesh_surface(\n\n model: &mut Model,\n\n mesh: &Rust3DMesh,\n\n uvs: &rust_3d::PointCloud3D<Point3D>,\n\n material_name: Option<String>,\n\n surface: &MaterialSurface,\n\n) -> MeshSurface {\n\n let gl_ref = model.gl.as_ref().expect(\"GL Context not initialized!\");\n\n // Only add faces that belong to this surface.\n\n let mut indices: Vec<u32> = vec![];\n\n for fid in 0..mesh.num_faces() {\n\n let vids = mesh.face_vertex_ids(FId { val: fid }).unwrap();\n\n if !surface.faces.contains(&vids.clone()) {\n\n continue;\n\n }\n\n indices.push(vids.a.val as u32);\n\n indices.push(vids.b.val as u32);\n\n indices.push(vids.c.val as u32);\n\n }\n\n let mut maybe_uvs: Option<&[f32]> = None;\n","file_path":"src/mesh_loader.rs","rank":27,"score":102101.93073526093},{"content":"pub fn view(model: &Model) -> Html {\n\n html! {\n\n <form>\n\n <input id=\"load_mesh\" type=\"file\" multiple=true accept=\".ply, .obj, .off, .stl, .mtl, .png, .jpeg, .jpg, .gif, .webp, .pnm, .tif, .tiff, .tga, .dds, .bmp, .ico, .hdr\" onchange=model.link.callback(move |value| {\n\n let mut result = Vec::new();\n\n if let ChangeData::Files(files) = value {\n\n let files = js_sys::try_iter(&files)\n\n .unwrap()\n\n .unwrap()\n\n .into_iter()\n\n .map(|v| File::from(v.unwrap()));\n\n result.extend(files);\n\n }\n\n Msg::Files(result)\n\n })/>\n\n <label for=\"load_mesh\">{\"Select files to view.\"}</label>\n\n </form>\n\n }\n\n}\n","file_path":"src/mesh_loader.rs","rank":28,"score":100576.2789334034},{"content":"#[inline(always)]\n\npub fn collect_index_line(line: &[u8]) -> Option<[usize; 3]> {\n\n let mut words = to_words_skip_empty(line);\n\n if words.next()? != b\"3\" {\n\n return None;\n\n }\n\n\n\n let a = from_ascii(words.next()?)?;\n\n let b = from_ascii(words.next()?)?;\n\n let c = from_ascii(words.next()?)?;\n\n\n\n Some([a, b, c])\n\n}\n\n\n\n//------------------------------------------------------------------------------\n\n\n","file_path":"src/io/ply/utils.rs","rank":29,"score":89797.95361827328},{"content":"/// Divide a mesh by materials, in instances where the only\n\n/// buffer we're passing to the shader is the vertex buffer. In\n\n/// this case we can use the values and existing order\n\n/// directly.\n\nfn divide_mesh_by_materials(\n\n model: &mut Model,\n\n mesh: &Rust3DMesh,\n\n material_info: &MaterialInfo,\n\n maybe_normals: Option<Vec<f32>>,\n\n) -> MeshContainer {\n\n let vertices = create_vertex_data(model, mesh, maybe_normals);\n\n info!(\"Adding model with {} vertices\", mesh.num_vertices());\n\n let mut surfaces: Vec<MeshSurface> = vec![];\n\n if material_info.surfaces.len() > 0 {\n\n for surface in material_info.surfaces.iter() {\n\n info!(\n\n \"Adding surface {} with {} faces\",\n\n surface.0,\n\n surface.1.faces.len()\n\n );\n\n let mesh_surface = create_mesh_surface(\n\n model,\n\n mesh,\n\n &material_info.uv,\n","file_path":"src/mesh_loader.rs","rank":30,"score":73687.30636712552},{"content":"fn render_gl(model: &mut Model, _timestamp: f64) {\n\n let gl = model.gl.as_ref().expect(\"GL Context not initialized!\");\n\n let screen_width = model.canvas.as_ref().unwrap().width();\n\n let screen_height = model.canvas.as_ref().unwrap().height();\n\n model\n\n .camera\n\n .as_mut()\n\n .unwrap()\n\n .set_size(screen_width as f32, screen_height as f32);\n\n\n\n for mouse_event in model.mouse_events.iter() {\n\n if mouse_event.shift_key() || model.mouse_down == 2 {\n\n let target = model.camera.as_ref().unwrap().target();\n\n let position = model.camera.as_ref().unwrap().position();\n\n let up = model.camera.as_ref().unwrap().up();\n\n let forward = target - position;\n\n let right = forward.cross(*up);\n\n let translation_y = MOVE_SPEED * (mouse_event.movement_y() as f32) * up;\n\n let translation_x = -1f32 * MOVE_SPEED * (mouse_event.movement_x() as f32) * right;\n\n let translation = translation_x + translation_y;\n","file_path":"src/render_canvas.rs","rank":31,"score":72957.34934998934},{"content":"#[cfg(target_arch = \"wasm32\")]\n\npub fn new_gl(gl: &GL) -> Option<Gl> {\n\n gl::Glstruct::new(gl.clone()).into()\n\n}\n\n\n","file_path":"src/render_canvas.rs","rank":32,"score":70747.14583320629},{"content":"#[cfg(not(target_arch = \"wasm32\"))]\n\npub fn new_gl(_gl: &GL) -> Option<Gl> {\n\n None\n\n}\n\n\n","file_path":"src/render_canvas.rs","rank":33,"score":70747.14583320629},{"content":"/// Per-wedge UVs require that we duplicate any\n\n/// vertices that are referenced multiple times\n\n/// in the index vector so that the vertex and\n\n/// UV buffer that we send to the GPU are the\n\n/// same length. The resulting vectors are the\n\n/// same length and arrangement of the index\n\n/// vector, and the index vector is therefore\n\n/// sequential.\n\nfn divide_mesh_by_materials_per_wedge(\n\n model: &mut Model,\n\n mesh: &Rust3DMesh,\n\n material_info: &MaterialInfo,\n\n) -> MeshContainer {\n\n info!(\"Rebuilding vertex/UV vectors so they agree.\");\n\n let gl_ref = model.gl.as_ref().expect(\"GL Context not initialized!\");\n\n let mut vertices = vec![];\n\n let mut uvs = vec![];\n\n let uv_in = &material_info.uv;\n\n if 3 * mesh.num_faces() != uv_in.len() {\n\n // This function is only meant to be used with a mesh that has\n\n // per-face UVs.\n\n panic!(\n\n \"Expected 1 UV per wedge ({} != {})!\",\n\n mesh.num_faces() * 3,\n\n uv_in.len()\n\n );\n\n }\n\n let mut surface_indices: HashMap<String, Vec<u32>> = HashMap::new();\n","file_path":"src/mesh_loader.rs","rank":34,"score":70078.31353593236},{"content":"#[inline(always)]\n\npub fn from_ascii<T>(bytes: &[u8]) -> Option<T>\n\nwhere\n\n T: FromStr,\n\n{\n\n if bytes.is_ascii() {\n\n unsafe { T::from_str(std::str::from_utf8_unchecked(bytes)).ok() }\n\n } else {\n\n None\n\n }\n\n}\n\n\n\n//------------------------------------------------------------------------------\n\n\n\n/// Fetch a single line\n","file_path":"src/io/utils.rs","rank":35,"score":69722.96314782268},{"content":"fn create_vertex_data(\n\n model: &mut Model,\n\n mesh: &Rust3DMesh,\n\n maybe_normals: Option<Vec<f32>>,\n\n) -> VertexData {\n\n let gl_ref = model.gl.as_ref().expect(\"GL Context not initialized!\");\n\n let mut vertices: Vec<f32> = vec![];\n\n let mut indices: Vec<u32> = vec![];\n\n for fid in 0..mesh.num_faces() {\n\n let vids = mesh.face_vertex_ids(FId { val: fid }).unwrap();\n\n indices.push(vids.a.val as u32);\n\n indices.push(vids.b.val as u32);\n\n indices.push(vids.c.val as u32);\n\n }\n\n for vid in 0..mesh.num_vertices() {\n\n let vertex = mesh.vertex(VId { val: vid }).unwrap();\n\n vertices.push(vertex.x as f32);\n\n vertices.push(vertex.y as f32);\n\n vertices.push(vertex.z as f32);\n\n }\n","file_path":"src/mesh_loader.rs","rank":36,"score":65427.84252326164},{"content":"type Rust3DMesh = rust_3d::Mesh3D<Point3D, PointCloud3D<Point3D>, Vec<usize>>;\n\n\n","file_path":"src/mesh_loader.rs","rank":37,"score":64815.71637102769},{"content":"fn view_element(model: &Model, data: &str) -> Html {\n\n let mesh_name = data.to_string();\n\n let remove_mesh_cb = model\n\n .link\n\n .callback(move |_| Msg::RemoveMesh(mesh_name.clone()));\n\n let mesh_name = data.to_string();\n\n let handle_check_cb = model\n\n .link\n\n .callback(move |_| Msg::MeshVisibilityToggle(mesh_name.clone()));\n\n html! {\n\n <table>\n\n <tr>\n\n <td>\n\n { data }\n\n </td>\n\n <td>\n\n <input type=\"checkbox\" checked={model.mesh.get(data).unwrap().visible } onclick=handle_check_cb />\n\n </td>\n\n <td>\n\n <button onclick=remove_mesh_cb.clone()>\n\n { \"Remove\" }\n\n </button>\n\n </td>\n\n </tr>\n\n </table>\n\n }\n\n}\n","file_path":"src/mesh_list.rs","rank":38,"score":55699.27934481435},{"content":"fn compute_normals(indices: &[u32], positions: &[f32]) -> Vec<f32> {\n\n let mut normals = vec![0.0f32; positions.len() * 3];\n\n for face in 0..indices.len() / 3 {\n\n let index0 = indices[face * 3] as usize;\n\n let p0 = vec3(\n\n positions[index0 * 3],\n\n positions[index0 * 3 + 1],\n\n positions[index0 * 3 + 2],\n\n );\n\n let index1 = indices[face * 3 + 1] as usize;\n\n let p1 = vec3(\n\n positions[index1 * 3],\n\n positions[index1 * 3 + 1],\n\n positions[index1 * 3 + 2],\n\n );\n\n let index2 = indices[face * 3 + 2] as usize;\n\n let p2 = vec3(\n\n positions[index2 * 3],\n\n positions[index2 * 3 + 1],\n\n positions[index2 * 3 + 2],\n","file_path":"src/mesh_loader.rs","rank":39,"score":53815.802242038444},{"content":"/// Trait for binary data readers\n\npub trait IsByteReader {\n\n fn read_i8<R>(read: &mut R) -> iRes<i8>\n\n where\n\n R: Read;\n\n\n\n fn read_u8<R>(read: &mut R) -> iRes<u8>\n\n where\n\n R: Read;\n\n\n\n fn read_i16<R>(read: &mut R) -> iRes<i16>\n\n where\n\n R: Read;\n\n\n\n fn read_u16<R>(read: &mut R) -> iRes<u16>\n\n where\n\n R: Read;\n\n\n\n fn read_i32<R>(read: &mut R) -> iRes<i32>\n\n where\n\n R: Read;\n","file_path":"src/io/byte_reader.rs","rank":40,"score":44705.05673240629},{"content":"fn main() {\n\n console_log::init_with_level(Level::Debug).unwrap();\n\n yew::start_app::<web_geo_viewer::Model>();\n\n}\n","file_path":"src/main.rs","rank":41,"score":41674.59254026748},{"content":" Some(surface.0.clone()),\n\n surface.1,\n\n );\n\n surfaces.push(mesh_surface);\n\n }\n\n } else {\n\n let gl_ref = model.gl.as_ref().expect(\"GL Context not initialized!\");\n\n let mut indices: Vec<u32> = vec![];\n\n for fid in 0..mesh.num_faces() {\n\n let vids = mesh.face_vertex_ids(FId { val: fid }).unwrap();\n\n indices.push(vids.a.val as u32);\n\n indices.push(vids.b.val as u32);\n\n indices.push(vids.c.val as u32);\n\n }\n\n let surface = MeshSurface::new(gl_ref, &indices[..], None, None).unwrap();\n\n surfaces.push(surface);\n\n }\n\n MeshContainer {\n\n vertices: vertices,\n\n surfaces: surfaces,\n\n visible: true,\n\n }\n\n}\n\n\n","file_path":"src/mesh_loader.rs","rank":42,"score":30790.586057504854},{"content":"use super::{MeshContainer, Model, Msg, ShouldRender};\n\nuse crate::io::*;\n\nuse crate::render_buffers::{MeshSurface, VertexData};\n\nuse image::GenericImageView;\n\nuse log::*;\n\nuse rust_3d::{io::load_stl_mesh_unique, *};\n\nuse std::collections::HashMap;\n\nuse std::path::Path;\n\nuse three_d::core::types::InnerSpace;\n\nuse three_d::vec3;\n\nuse yew::services::reader::File;\n\nuse yew::{html, ChangeData, Html};\n\n\n","file_path":"src/mesh_loader.rs","rank":43,"score":30790.235060464987},{"content":"\n\n // Initialize index vector for each surface.\n\n for surface in &material_info.surfaces {\n\n surface_indices.insert(surface.0.clone(), vec![]);\n\n }\n\n let mut all_indices = vec![];\n\n for fid in 0..mesh.num_faces() {\n\n let vids = mesh.face_vertex_ids(FId { val: fid }).unwrap();\n\n all_indices.push((fid * 3 + 0) as u32);\n\n all_indices.push((fid * 3 + 1) as u32);\n\n all_indices.push((fid * 3 + 2) as u32);\n\n // Insert this index into surfaces to which this face belongs.\n\n for surface in &material_info.surfaces {\n\n if surface.1.faces.contains(&vids) {\n\n let index_vector = surface_indices.get_mut(surface.0).unwrap();\n\n index_vector.push((fid * 3 + 0) as u32);\n\n index_vector.push((fid * 3 + 1) as u32);\n\n index_vector.push((fid * 3 + 2) as u32);\n\n }\n\n }\n","file_path":"src/mesh_loader.rs","rank":44,"score":30787.704243889053},{"content":" match maybe_normals {\n\n Some(normals) => {\n\n info!(\"Using {} provided normals.\", normals.len());\n\n VertexData::new(gl_ref, &vertices[..], &normals[..]).unwrap()\n\n }\n\n None => {\n\n info!(\n\n \"computing normals with {} indices and {} indices.\",\n\n vertices.len(),\n\n indices.len()\n\n );\n\n VertexData::new(\n\n gl_ref,\n\n &vertices[..],\n\n &compute_normals(&indices[..], &vertices[..]),\n\n )\n\n .unwrap()\n\n }\n\n }\n\n}\n\n\n","file_path":"src/mesh_loader.rs","rank":45,"score":30786.63082096072},{"content":" let vertex_data = VertexData::new(\n\n gl_ref,\n\n &vertices[..],\n\n &compute_normals(&all_indices[..], &vertices[..]),\n\n )\n\n .unwrap();\n\n let mut surfaces: Vec<MeshSurface> = vec![];\n\n for name_and_indices in surface_indices {\n\n info!(\"Material name {}\", name_and_indices.0);\n\n let surface = MeshSurface::new(\n\n gl_ref,\n\n &name_and_indices.1[..],\n\n Some(&uvs[..]),\n\n Some(name_and_indices.0),\n\n )\n\n .unwrap();\n\n surfaces.push(surface);\n\n }\n\n MeshContainer {\n\n vertices: vertex_data,\n\n surfaces: surfaces,\n\n visible: true,\n\n }\n\n}\n\n\n","file_path":"src/mesh_loader.rs","rank":46,"score":30786.57971138597},{"content":" info!(\n\n \"Could not load {} as a texture due to error {:?}\",\n\n file.name, e\n\n );\n\n }\n\n }\n\n }\n\n Err(e) => {\n\n info!(\n\n \"Could not load {} as an image due to error {}\",\n\n file.name, e\n\n );\n\n }\n\n }\n\n } else if ext == \"ply\" || ext == \"obj\" {\n\n let mut m = Rust3DMesh::default();\n\n let mut material_info = MaterialInfo::new();\n\n let mut maybe_normals = None;\n\n if ext == \"ply\" {\n\n let mut material = Material::new();\n","file_path":"src/mesh_loader.rs","rank":47,"score":30785.46294671563},{"content":" match load_ply(\n\n &mut &file.content[..],\n\n &mut m,\n\n &mut material,\n\n &mut material_info,\n\n &file.name,\n\n ) {\n\n Ok(_) => {\n\n model.materials.insert(file.name.clone(), material);\n\n }\n\n Err(e) => {\n\n warn!(\"Could not load {} as a PLY due to {:?}\", file.name, e);\n\n }\n\n }\n\n } else if ext == \"obj\" {\n\n match load_obj_mesh(&mut &file.content[..], &mut m, &mut material_info) {\n\n Ok(_) => {}\n\n Err(e) => {\n\n warn!(\"Could not load {} as an OBJ due to {:?}\", file.name, e);\n\n }\n","file_path":"src/mesh_loader.rs","rank":48,"score":30785.244698275957},{"content":" let v0 = mesh.vertex(vids.a).unwrap();\n\n extend_by_vertex(&v0, &mut vertices);\n\n let v1 = mesh.vertex(vids.b).unwrap();\n\n extend_by_vertex(&v1, &mut vertices);\n\n let v2 = mesh.vertex(vids.c).unwrap();\n\n extend_by_vertex(&v2, &mut vertices);\n\n // 1 UV per face, each a point3D, is stored for each face,\n\n // for a total of 3 points per face.\n\n // UVs.\n\n let uv_base_idx = fid * 3;\n\n let uv0 = uv_in.get_d(uv_base_idx + 0);\n\n extend_by_vertex(&uv0, &mut uvs);\n\n let uv1 = uv_in.get_d(uv_base_idx + 1);\n\n extend_by_vertex(&uv1, &mut uvs);\n\n let uv2 = uv_in.get_d(uv_base_idx + 2);\n\n extend_by_vertex(&uv2, &mut uvs);\n\n }\n\n // we always have to compute normals here since the pre-computed\n\n // normals will not match, and it's better to have per-face\n\n // normals anyway.\n","file_path":"src/mesh_loader.rs","rank":49,"score":30784.560938592855},{"content":" }\n\n } else if ext == \"off\" {\n\n match load_off_mesh(&mut &file.content[..], &mut m) {\n\n Ok(_) => {}\n\n Err(e) => {\n\n warn!(\"Could not load {} as an off due to {:?}\", file.name, e);\n\n }\n\n }\n\n } else if ext == \"stl\" {\n\n let mut r3d_normals = vec![];\n\n match load_stl_mesh_unique(\n\n &mut &file.content[..],\n\n rust_3d::io::StlFormat::Auto,\n\n &mut m,\n\n &mut r3d_normals,\n\n ) {\n\n Ok(_) => {\n\n let mut normals = vec![];\n\n for normal in r3d_normals {\n\n normals.push(normal.x as f32);\n","file_path":"src/mesh_loader.rs","rank":50,"score":30784.050585210854},{"content":" let mut uv_vec: Vec<f32> = vec![];\n\n if uvs.len() > 0 {\n\n for point in uvs.data.iter() {\n\n uv_vec.push(point.x as f32);\n\n uv_vec.push(point.y as f32);\n\n uv_vec.push(point.z as f32);\n\n }\n\n info!(\"Loaded {} uvs\", uv_vec.len() / 3);\n\n maybe_uvs = Some(&uv_vec[..]);\n\n }\n\n MeshSurface::new(gl_ref, &indices[..], maybe_uvs, material_name).unwrap()\n\n}\n\n\n","file_path":"src/mesh_loader.rs","rank":51,"score":30782.45356211749},{"content":" info!(\"Loading an MTL file.\");\n\n match load_mtl(&mut &file.content[..]) {\n\n Ok(materials) => {\n\n for material in materials {\n\n info!(\"Loading material {}: {:?}.\", material.0, material.1);\n\n model.materials.insert(material.0, material.1);\n\n }\n\n }\n\n Err(e) => {\n\n warn!(\n\n \"Could not load {} as an mtl file due to error: {:?}\",\n\n file.name, e\n\n );\n\n }\n\n }\n\n }\n\n }\n\n }\n\n _ => {}\n\n };\n\n false\n\n}\n","file_path":"src/mesh_loader.rs","rank":52,"score":30781.385931436696},{"content":" }\n\n info!(\n\n \"{} has {} vertices and {} indices\",\n\n file.name,\n\n m.num_vertices(),\n\n m.num_faces()\n\n );\n\n if material_info.uv.len() == 3 * m.num_faces() {\n\n // Per-wedge UVs. If a model has both per-wedge and per-vertex\n\n // UVs we should prefer per-wedge.\n\n let meshes = divide_mesh_by_materials_per_wedge(model, &m, &material_info);\n\n model.mesh.insert(file.name.clone(), meshes);\n\n } else {\n\n // Per-vetex UVs\n\n let meshes =\n\n divide_mesh_by_materials(model, &m, &material_info, maybe_normals);\n\n model.mesh.insert(file.name.clone(), meshes);\n\n }\n\n return true;\n\n } else if ext == \"mtl\" {\n","file_path":"src/mesh_loader.rs","rank":53,"score":30780.875104083978},{"content":" normals.push(normal.x as f32);\n\n normals.push(normal.z as f32);\n\n }\n\n maybe_normals = Some(normals);\n\n let meshes = divide_mesh_by_materials(\n\n model,\n\n &m,\n\n &material_info,\n\n maybe_normals,\n\n );\n\n model.mesh.insert(file.name.clone(), meshes);\n\n }\n\n Err(e) => {\n\n warn!(\"Could not load {} as an off due to {:?}\", file.name, e);\n\n }\n\n }\n\n return true;\n\n }\n\n if m.num_vertices() == 0 {\n\n return false;\n","file_path":"src/mesh_loader.rs","rank":54,"score":30780.443064962474},{"content":"use super::{Model, Msg, ShouldRender};\n\nuse yew::{html, Html};\n\n\n","file_path":"src/mesh_list.rs","rank":55,"score":30778.35382992476},{"content":" Ok(image) => {\n\n let gl_ref = model.gl.as_ref().expect(\"GL Context not initialized!\");\n\n let (width, height) = image.dimensions();\n\n info!(\"Loaded {}x{} image {}\", file.name, width, height);\n\n match three_d::texture::Texture2D::new_with_u8(\n\n gl_ref,\n\n three_d::Interpolation::Linear,\n\n three_d::Interpolation::Linear,\n\n Some(three_d::Interpolation::Linear),\n\n three_d::Wrapping::ClampToEdge,\n\n three_d::Wrapping::ClampToEdge,\n\n width,\n\n height,\n\n &image.to_bytes()[..],\n\n ) {\n\n Ok(texture) => {\n\n info!(\"Created texture {}\", file.name);\n\n model.images.insert(file.name.clone(), texture);\n\n }\n\n Err(e) => {\n","file_path":"src/mesh_loader.rs","rank":56,"score":30777.90934618938},{"content":" );\n\n\n\n let normal = (p1 - p0).cross(p2 - p0);\n\n normals[index0 * 3] += normal.x;\n\n normals[index0 * 3 + 1] += normal.y;\n\n normals[index0 * 3 + 2] += normal.z;\n\n normals[index1 * 3] += normal.x;\n\n normals[index1 * 3 + 1] += normal.y;\n\n normals[index1 * 3 + 2] += normal.z;\n\n normals[index2 * 3] += normal.x;\n\n normals[index2 * 3 + 1] += normal.y;\n\n normals[index2 * 3 + 2] += normal.z;\n\n }\n\n\n\n for i in 0..normals.len() / 3 {\n\n let normal = vec3(normals[3 * i], normals[3 * i + 1], normals[3 * i + 2]).normalize();\n\n normals[3 * i] = normal.x;\n\n normals[3 * i + 1] = normal.y;\n\n normals[3 * i + 2] = normal.z;\n\n }\n\n normals\n\n}\n\n\n","file_path":"src/mesh_loader.rs","rank":57,"score":30774.37159409625},{"content":"use crate::io::Material;\n\nuse crate::render_buffers::{MeshSurface, VertexData};\n\nuse three_d::*;\n\n\n\npub struct UntexturedMeshRenderer {\n\n shader: program::Program,\n\n}\n\n\n\nimpl UntexturedMeshRenderer {\n\n pub fn new(gl: &Gl) -> UntexturedMeshRenderer {\n\n UntexturedMeshRenderer {\n\n shader: program::Program::from_source(\n\n &gl,\n\n include_str!(\"shaders/mesh_shaded.vert\"),\n\n include_str!(\"shaders/shaded.frag\"),\n\n )\n\n .unwrap(),\n\n }\n\n }\n\n\n","file_path":"src/untextured_mesh_renderer.rs","rank":58,"score":29524.79098066109},{"content":"use crate::io::Material;\n\nuse crate::render_buffers::{MeshSurface, VertexData};\n\nuse three_d::*;\n\n\n\npub struct TexturedMeshRenderer {\n\n shader: program::Program,\n\n}\n\n\n\nimpl TexturedMeshRenderer {\n\n pub fn new(gl: &Gl) -> TexturedMeshRenderer {\n\n TexturedMeshRenderer {\n\n shader: program::Program::from_source(\n\n &gl,\n\n include_str!(\"shaders/textured.vert\"),\n\n include_str!(\"shaders/textured.frag\"),\n\n )\n\n .unwrap(),\n\n }\n\n }\n\n\n","file_path":"src/textured_mesh_renderer.rs","rank":59,"score":29524.749150035856},{"content":"\n\n program\n\n .add_uniform_mat4(\"modelMatrix\", &transformation)\n\n .unwrap();\n\n\n\n program.use_texture(image, \"texture0\").unwrap();\n\n\n\n program.use_uniform_block(camera.matrix_buffer(), \"Camera\");\n\n program\n\n .add_uniform_mat4(\n\n \"normalMatrix\",\n\n &transformation.invert().unwrap().transpose(),\n\n )\n\n .unwrap();\n\n program\n\n .use_attribute_vec3_float(&vertex_data.position_buffer, \"position\")\n\n .unwrap();\n\n program\n\n .use_attribute_vec3_float(&vertex_data.normal_buffer, \"normal\")\n\n .unwrap();\n\n program\n\n .use_attribute_vec3_float(mesh_surface.maybe_uvs.as_ref().unwrap(), \"uvw\")\n\n .unwrap();\n\n program.draw_elements(&mesh_surface.index_buffer);\n\n }\n\n}\n","file_path":"src/textured_mesh_renderer.rs","rank":60,"score":29520.200878700016},{"content":" pub fn render(\n\n &self,\n\n transformation: &Mat4,\n\n camera: &camera::Camera,\n\n vertex_data: &VertexData,\n\n mesh_surface: &MeshSurface,\n\n material: &Material,\n\n ) {\n\n let program = &self.shader;\n\n program\n\n .add_uniform_float(\"diffuse_intensity\", &material.diffuse_intensity)\n\n .unwrap();\n\n program\n\n .add_uniform_float(\"specular_intensity\", &material.specular_intensity)\n\n .unwrap();\n\n let specular_power = 5.0;\n\n program\n\n .add_uniform_float(\"specular_power\", &specular_power)\n\n .unwrap();\n\n\n","file_path":"src/untextured_mesh_renderer.rs","rank":61,"score":29518.898731216912},{"content":" pub fn render(\n\n &self,\n\n transformation: &Mat4,\n\n camera: &camera::Camera,\n\n vertex_data: &VertexData,\n\n mesh_surface: &MeshSurface,\n\n material: &Material,\n\n image: &Texture2D,\n\n ) {\n\n let program = &self.shader;\n\n program\n\n .add_uniform_float(\"diffuse_intensity\", &material.diffuse_intensity)\n\n .unwrap();\n\n program\n\n .add_uniform_float(\"specular_intensity\", &material.specular_intensity)\n\n .unwrap();\n\n let specular_power = 5.0;\n\n program\n\n .add_uniform_float(\"specular_power\", &specular_power)\n\n .unwrap();\n","file_path":"src/textured_mesh_renderer.rs","rank":62,"score":29518.679097471155},{"content":" program\n\n .add_uniform_vec3(\"color\", &material.diffuse_color)\n\n .unwrap();\n\n program\n\n .add_uniform_mat4(\"modelMatrix\", &transformation)\n\n .unwrap();\n\n program.use_uniform_block(camera.matrix_buffer(), \"Camera\");\n\n program\n\n .add_uniform_mat4(\n\n \"normalMatrix\",\n\n &transformation.invert().unwrap().transpose(),\n\n )\n\n .unwrap();\n\n program\n\n .use_attribute_vec3_float(&vertex_data.position_buffer, \"position\")\n\n .unwrap();\n\n program\n\n .use_attribute_vec3_float(&vertex_data.normal_buffer, \"normal\")\n\n .unwrap();\n\n program.draw_elements(&mesh_surface.index_buffer);\n\n }\n\n}\n","file_path":"src/untextured_mesh_renderer.rs","rank":63,"score":29518.266390690856},{"content":"/*\n\nCopyright 2020 Martin Buck\n\n\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\n\nof this software and associated documentation files (the \"Software\"),\n\nto deal in the Software without restriction, including without limitation the\n\nrights to use, copy, modify, merge, publish, distribute, sublicense,\n\nand/or sell copies of the Software, and to permit persons to whom the Software\n\nis furnished to do so, subject to the following conditions:\n\n\n\nThe above copyright notice and this permission notice shall\n\nbe included all copies or substantial portions of the Software.\n\n\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n\nDAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE\n\nOR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n","file_path":"src/io/ply/load.rs","rank":65,"score":99.39384666875041},{"content":"/*\n\nCopyright 2020 Martin Buck\n\n\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\n\nof this software and associated documentation files (the \"Software\"),\n\nto deal in the Software without restriction, including without limitation the\n\nrights to use, copy, modify, merge, publish, distribute, sublicense,\n\nand/or sell copies of the Software, and to permit persons to whom the Software\n\nis furnished to do so, subject to the following conditions:\n\n\n\nThe above copyright notice and this permission notice shall\n\nbe included all copies or substantial portions of the Software.\n\n\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n\nDAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE\n\nOR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n","file_path":"src/io/off.rs","rank":66,"score":99.39384666875041},{"content":"/*\n\nCopyright 2020 Martin Buck\n\n\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\n\nof this software and associated documentation files (the \"Software\"),\n\nto deal in the Software without restriction, including without limitation the\n\nrights to use, copy, modify, merge, publish, distribute, sublicense,\n\nand/or sell copies of the Software, and to permit persons to whom the Software\n\nis furnished to do so, subject to the following conditions:\n\n\n\nThe above copyright notice and this permission notice shall\n\nbe included all copies or substantial portions of the Software.\n\n\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n\nDAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE\n\nOR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n","file_path":"src/io/ply/types.rs","rank":67,"score":99.39384666875041},{"content":"/*\n\nCopyright 2017 Martin Buck\n\n\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\n\nof this software and associated documentation files (the \"Software\"),\n\nto deal in the Software without restriction, including without limitation the\n\nrights to use, copy, modify, merge, publish, distribute, sublicense,\n\nand/or sell copies of the Software, and to permit persons to whom the Software\n\nis furnished to do so, subject to the following conditions:\n\n\n\nThe above copyright notice and this permission notice shall\n\nbe included all copies or substantial portions of the Software.\n\n\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n\nDAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE\n\nOR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n","file_path":"src/io/ply/mod.rs","rank":68,"score":99.39384666875038},{"content":"/*\n\nCopyright 2020 Martin Buck\n\n\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\n\nof this software and associated documentation files (the \"Software\"),\n\nto deal in the Software without restriction, including without limitation the\n\nrights to use, copy, modify, merge, publish, distribute, sublicense,\n\nand/or sell copies of the Software, and to permit persons to whom the Software\n\nis furnished to do so, subject to the following conditions:\n\n\n\nThe above copyright notice and this permission notice shall\n\nbe included all copies or substantial portions of the Software.\n\n\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n\nDAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE\n\nOR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n","file_path":"src/io/ply/utils.rs","rank":69,"score":99.3938466687504},{"content":"/*\n\nCopyright 2020 Martin Buck\n\n\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\n\nof this software and associated documentation files (the \"Software\"),\n\nto deal in the Software without restriction, including without limitation the\n\nrights to use, copy, modify, merge, publish, distribute, sublicense,\n\nand/or sell copies of the Software, and to permit persons to whom the Software\n\nis furnished to do so, subject to the following conditions:\n\n\n\nThe above copyright notice and this permission notice shall\n\nbe included all copies or substantial portions of the Software.\n\n\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n\nDAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE\n\nOR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n","file_path":"src/io/ply/save.rs","rank":70,"score":99.39384666875041},{"content":"/*\n\nCopyright 2020 Martin Buck\n\n\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\n\nof this software and associated documentation files (the \"Software\"),\n\nto deal in the Software without restriction, including without limitation the\n\nrights to use, copy, modify, merge, publish, distribute, sublicense,\n\nand/or sell copies of the Software, and to permit persons to whom the Software\n\nis furnished to do so, subject to the following conditions:\n\n\n\nThe above copyright notice and this permission notice shall\n\nbe included all copies or substantial portions of the Software.\n\n\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n\nDAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE\n\nOR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n","file_path":"src/io/utils.rs","rank":71,"score":99.3938466687504},{"content":"/*\n\nCopyright 2020 Martin Buck\n\n\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\n\nof this software and associated documentation files (the \"Software\"),\n\nto deal in the Software without restriction, including without limitation the\n\nrights to use, copy, modify, merge, publish, distribute, sublicense,\n\nand/or sell copies of the Software, and to permit persons to whom the Software\n\nis furnished to do so, subject to the following conditions:\n\n\n\nThe above copyright notice and this permission notice shall\n\nbe included all copies or substantial portions of the Software.\n\n\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n\nDAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE\n\nOR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n*/\n\n\n\n//! Module containing the IsByteReader trait and Little/BigReader implementations for reading binary data\n\n\n\nuse std::io::{Read, Result as iRes};\n\n\n\n//------------------------------------------------------------------------------\n\n\n\n/// Trait for binary data readers\n","file_path":"src/io/byte_reader.rs","rank":72,"score":91.4797649532243},{"content":" let mut after = BytesWords::default();\n\n\n\n let mut face_types = vec![];\n\n let mut texture_name = None;\n\n\n\n while let Ok(line) = fetch_line(read, line_buffer) {\n\n *i_line += 1;\n\n\n\n if line.starts_with(b\"comment\") {\n\n let mut words = to_words_skip_empty(line);\n\n match words.nth(1) {\n\n Some(next_word) => {\n\n if next_word == b\"TextureFile\" {\n\n match words.next() {\n\n Some(texture_name_blob) => {\n\n if let Ok(read_texture_name) = str::from_utf8(texture_name_blob) {\n\n info!(\"Read texture name: {}\", read_texture_name);\n\n texture_name = Some(read_texture_name.to_string());\n\n }\n\n }\n","file_path":"src/io/ply/load.rs","rank":74,"score":22.12022877275649},{"content":" break;\n\n }\n\n }\n\n\n\n Ok(())\n\n}\n\n\n\n//------------------------------------------------------------------------------\n\n\n\n/// Error type for .off file operations\n\npub enum OffError {\n\n AccessFile,\n\n InvalidMeshIndices(usize),\n\n LineParse(usize),\n\n}\n\n\n\n/// Result type for .off file operations\n\npub type OffResult<T> = std::result::Result<T, OffError>;\n\n\n\nimpl fmt::Debug for OffError {\n","file_path":"src/io/off.rs","rank":77,"score":20.546943272701043},{"content":" AccessFile,\n\n LineParse(usize),\n\n NoMaterialError(usize),\n\n}\n\n\n\nimpl fmt::Debug for MtlError {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n match self {\n\n Self::AccessFile => write!(f, \"Unable to access file\"),\n\n Self::LineParse(x) => write!(f, \"Unable to parse line {}\", x),\n\n Self::NoMaterialError(x) => write!(f, \"Line {} occurs before newmtl.\", x),\n\n }\n\n }\n\n}\n\n\n\n/// Result type for .obj file operations\n\npub type MtlResult<T> = std::result::Result<T, MtlError>;\n\n\n\nimpl From<ioError> for MtlError {\n\n fn from(_error: ioError) -> Self {\n\n MtlError::AccessFile\n\n }\n\n}\n","file_path":"src/io/mtl.rs","rank":78,"score":20.191666027257945},{"content":" after.bytes += t.size_bytes();\n\n after.words += 1;\n\n }\n\n }\n\n }\n\n HeaderReadState::Face => {\n\n if line.starts_with(b\"property list\") {\n\n let mut words = to_words_skip_empty(line);\n\n skip_n(&mut words, 2); // skip \"property\" and \"list\"\n\n let t_count = FaceType::try_from(Type::try_from(\n\n words.next().ok_or(PlyError::InvalidProperty(*i_line))?,\n\n )?)?;\n\n let t_index = FaceType::try_from(Type::try_from(\n\n words.next().ok_or(PlyError::InvalidProperty(*i_line))?,\n\n )?)?;\n\n let name: String =\n\n str::from_utf8(words.next().ok_or(PlyError::InvalidProperty(*i_line))?)\n\n .unwrap()\n\n .to_string();\n\n\n","file_path":"src/io/ply/load.rs","rank":81,"score":19.25845888121268},{"content":" }\n\n }\n\n Some(_) => {}\n\n }\n\n\n\n if line.starts_with(b\"property\") {\n\n match read_state {\n\n HeaderReadState::Vertex => {\n\n let mut words = to_words_skip_empty(line);\n\n skip_n(&mut words, 1); // skip \"property\"\n\n\n\n let t =\n\n Type::try_from(words.next().ok_or(PlyError::InvalidProperty(*i_line))?)?;\n\n let id = words.next().ok_or(PlyError::InvalidProperty(*i_line))?;\n\n if id == b\"x\" {\n\n opt_fst_type = Some(VertexType::try_from(t)?);\n\n n_types_found += 1;\n\n vertex_order[i_vertex_order] = Xyz::X;\n\n i_vertex_order += 1;\n\n } else if id == b\"y\" {\n","file_path":"src/io/ply/load.rs","rank":82,"score":18.740434432689483},{"content":"//------------------------------------------------------------------------------\n\n\n\n#[derive(Default, Debug)]\n\npub struct BytesWords {\n\n pub bytes: usize,\n\n pub words: usize,\n\n}\n\n\n\n//------------------------------------------------------------------------------\n\n\n\n#[derive(Copy, Clone, Debug)]\n\npub enum VertexType {\n\n Float,\n\n Double,\n\n}\n\n\n\nimpl TryFrom<Type> for VertexType {\n\n type Error = PlyError;\n\n\n\n fn try_from(x: Type) -> PlyResult<Self> {\n","file_path":"src/io/ply/types.rs","rank":83,"score":18.7339620691808},{"content":"*/\n\n\n\n//! Module for interal types for IO operations of the ply file format\n\n\n\nuse core::convert::TryFrom;\n\n\n\nuse std::{fmt, io::Error as ioError};\n\n\n\n//------------------------------------------------------------------------------\n\n\n\n#[derive(Copy, Clone)]\n\npub enum Type {\n\n Char,\n\n UChar,\n\n Short,\n\n UShort,\n\n Int,\n\n UInt,\n\n Float,\n\n Double,\n","file_path":"src/io/ply/types.rs","rank":84,"score":18.58189197914905},{"content":"#[cfg(test)]\n\nmod test {\n\n use crate::io::*;\n\n use rust_3d::*;\n\n use std::{fs::File, io::BufReader};\n\n #[test]\n\n fn load_untextured_obj() {\n\n let box_path = \"src/tests/data/box.obj\".to_string();\n\n let mut m = rust_3d::Mesh3D::<Point3D, PointCloud3D<Point3D>, Vec<usize>>::default();\n\n let mut uv = MaterialInfo::new();\n\n load_obj_mesh(\n\n &mut BufReader::new(File::open(box_path).unwrap()),\n\n &mut m,\n\n &mut uv,\n\n )\n\n .unwrap();\n\n assert_eq!(m.num_vertices(), 8);\n\n assert_eq!(m.num_faces(), 12);\n\n assert_eq!(uv.uv.len(), 0);\n\n assert_eq!(uv.surfaces.contains_key(\"Default\"), true);\n","file_path":"src/tests/io.rs","rank":85,"score":18.561928891541264},{"content":"use three_d::objects::Error;\n\nuse three_d::*;\n\n\n\n/// All of the information needed to render a mesh, in the most convenient\n\n/// form possible for rendering.\n\n\n\n/// Everything associated with a surface.\n\npub struct MeshSurface {\n\n /// Indices for triangular faces. A 1D int array with a\n\n /// stride of 3.\n\n pub index_buffer: ElementBuffer,\n\n\n\n /// UVs. a 1D float array with a stride of 2.\n\n pub maybe_uvs: Option<VertexBuffer>,\n\n\n\n /// The name of the material, if there is one.\n\n pub maybe_material_name: Option<String>,\n\n}\n\n\n\n/// Everything associated with vertices. We separate vertex data from\n","file_path":"src/render_buffers.rs","rank":86,"score":18.36557834334975},{"content":" fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n match self {\n\n Self::AccessFile => write!(f, \"Unable to access file\"),\n\n Self::LineParse(x) => write!(f, \"Unable to parse line {}\", x),\n\n Self::InvalidMeshIndices(x) => {\n\n write!(f, \"File contains invalid mesh indices on line {}\", x)\n\n }\n\n }\n\n }\n\n}\n\n\n\nimpl From<ioError> for OffError {\n\n fn from(_error: ioError) -> Self {\n\n OffError::AccessFile\n\n }\n\n}\n","file_path":"src/io/off.rs","rank":87,"score":18.147739000998932},{"content":" 0.005,\n\n )\n\n .unwrap();\n\n let renderer = model.renderer.as_mut().unwrap();\n\n let camera = model.camera.as_ref().unwrap();\n\n let mesh_groups = &model.mesh;\n\n let materials = &model.materials;\n\n let images = &model.images;\n\n let untextured = model.untextured_mesh_renderer.as_ref();\n\n let textured = model.textured_mesh_renderer.as_ref();\n\n renderer\n\n .geometry_pass(screen_width as usize, screen_height as usize, &|| {\n\n for group in mesh_groups.iter() {\n\n for surface in group.1.surfaces.iter() {\n\n if group.1.visible {\n\n let mut maybe_texture: Option<&Texture2D> = None;\n\n let material = match &surface.maybe_material_name {\n\n Some(material_name) => match materials.get(material_name) {\n\n Some(material) => {\n\n if let Some(texture_name) = &material.texture_name {\n","file_path":"src/render_canvas.rs","rank":89,"score":18.099393243164386},{"content":"\n\n mesh.add_vertex(P::new(x, y, z));\n\n } else {\n\n let mut words = to_words_skip_empty(line);\n\n\n\n let count_face = words.next().ok_or(OffError::LineParse(i_line))?;\n\n\n\n if count_face == b\"3\" {\n\n let a = words\n\n .next()\n\n .and_then(|word| from_ascii(word))\n\n .ok_or(OffError::LineParse(i_line))?;\n\n\n\n let b = words\n\n .next()\n\n .and_then(|word| from_ascii(word))\n\n .ok_or(OffError::LineParse(i_line))?;\n\n\n\n let c = words\n\n .next()\n","file_path":"src/io/off.rs","rank":90,"score":18.03291277003624},{"content":" }\n\n\n\n // safe since checked above\n\n if mesh.num_vertices() < counts.unwrap()[0] {\n\n let mut words = to_words_skip_empty(line);\n\n\n\n let x = words\n\n .next()\n\n .and_then(|word| from_ascii(word))\n\n .ok_or(OffError::LineParse(i_line))?;\n\n\n\n let y = words\n\n .next()\n\n .and_then(|word| from_ascii(word))\n\n .ok_or(OffError::LineParse(i_line))?;\n\n\n\n let z = words\n\n .next()\n\n .and_then(|word| from_ascii(word))\n\n .ok_or(OffError::LineParse(i_line))?;\n","file_path":"src/io/off.rs","rank":91,"score":17.679957725941726},{"content":" if line.is_empty() || line.starts_with(b\"#\") {\n\n continue;\n\n }\n\n\n\n if counts.is_none() {\n\n let mut words = to_words_skip_empty(line);\n\n let n_vertices = words\n\n .next()\n\n .and_then(|word| from_ascii(word))\n\n .ok_or(OffError::LineParse(i_line))?;\n\n let n_faces = words\n\n .next()\n\n .and_then(|word| from_ascii(word))\n\n .ok_or(OffError::LineParse(i_line))?;\n\n\n\n mesh.reserve_vertices(n_vertices);\n\n mesh.reserve_faces(n_faces);\n\n\n\n counts = Some([n_vertices, n_faces]);\n\n continue;\n","file_path":"src/io/off.rs","rank":94,"score":17.12681259287589},{"content":" }\n\n}\n\n\n\n//------------------------------------------------------------------------------\n\n\n\n#[derive(Copy, Clone, Debug)]\n\npub enum Xyz {\n\n X,\n\n Y,\n\n Z,\n\n}\n\n\n\n//------------------------------------------------------------------------------\n\n\n\n#[derive(Copy, Clone, Debug)]\n\npub enum VertexOrder {\n\n Xyz,\n\n Xzy,\n\n Yxz,\n\n Yzx,\n","file_path":"src/io/ply/types.rs","rank":96,"score":16.93610080669944},{"content":"\n\n if line.is_empty() || line.starts_with(b\"#\") {\n\n continue;\n\n }\n\n\n\n if n_vertices.is_none() {\n\n let mut words = to_words_skip_empty(line);\n\n n_vertices = Some(\n\n words\n\n .next()\n\n .and_then(|word| from_ascii(word))\n\n .ok_or(OffError::LineParse(i_line))?,\n\n );\n\n ip.reserve(n_vertices.unwrap());\n\n\n\n continue;\n\n }\n\n\n\n // safe since checked above\n\n if n_added < n_vertices.unwrap() {\n","file_path":"src/io/off.rs","rank":97,"score":16.69218900455187},{"content":" // skip \"map_Kd\"\n\n words.next().ok_or(MtlError::LineParse(i_line))?;\n\n if let Some(next_word) = words.next().and_then(|w| from_ascii(w)) {\n\n if let Some(mtl_name) = mtl_name.clone() {\n\n if let Some(mtl) = result.get_mut(&mtl_name) {\n\n mtl.texture_name = Some(next_word);\n\n } else {\n\n return Err(MtlError::NoMaterialError(i_line));\n\n }\n\n }\n\n }\n\n } else if line.starts_with(b\"Ns \") {\n\n let mut words = to_words_skip_empty(line);\n\n // skip \"map_Kd\"\n\n words.next().ok_or(MtlError::LineParse(i_line))?;\n\n if let Some(next_word) = words.next().and_then(|w| from_ascii(w)) {\n\n if let Some(mtl_name) = mtl_name.clone() {\n\n if let Some(mtl) = result.get_mut(&mtl_name) {\n\n mtl.specular_intensity = next_word;\n\n } else {\n","file_path":"src/io/mtl.rs","rank":98,"score":16.616580901777517},{"content":" .ok_or(PlyError::LineParse(*i_line))?,\n\n );\n\n continue;\n\n }\n\n }\n\n Some(_) => {}\n\n }\n\n\n\n match opt_n_faces {\n\n None => {\n\n if line.starts_with(b\"element face\") {\n\n read_state = HeaderReadState::Face;\n\n let mut words = to_words_skip_empty(line);\n\n opt_n_faces = Some(\n\n words\n\n .nth(2)\n\n .and_then(|w| from_ascii(w))\n\n .ok_or(PlyError::LineParse(*i_line))?,\n\n );\n\n continue;\n","file_path":"src/io/ply/load.rs","rank":99,"score":16.525480002635454}],"string":"[\n {\n \"content\": \"/// Loads an IsMesh3D from the off file format\\n\\npub fn load_off_mesh<EM, P, R>(read: &mut R, mesh: &mut EM) -> OffResult<()>\\n\\nwhere\\n\\n EM: IsFaceEditableMesh<P, Face3> + IsVertexEditableMesh<P, Face3>,\\n\\n P: IsBuildable3D + Clone,\\n\\n R: BufRead,\\n\\n{\\n\\n let mut line_buffer = Vec::new();\\n\\n let mut i_line = 0;\\n\\n\\n\\n let mut off_seen = false;\\n\\n let mut counts = None;\\n\\n\\n\\n while let Ok(line) = fetch_line(read, &mut line_buffer) {\\n\\n i_line += 1;\\n\\n\\n\\n if !off_seen && line.starts_with(b\\\"OFF\\\") {\\n\\n off_seen = true;\\n\\n continue;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/io/off.rs\",\n \"rank\": 0,\n \"score\": 323430.3918512946\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn skip_bytes<R>(read: &mut R, n_bytes: usize) -> std::io::Result<()>\\n\\nwhere\\n\\n R: Read,\\n\\n{\\n\\n let mut buffer = [0u8; 1];\\n\\n for _ in 0..n_bytes {\\n\\n let _ = read.read_exact(&mut buffer)?;\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\\n/// Skip number of elements\\n\",\n \"file_path\": \"src/io/utils.rs\",\n \"rank\": 1,\n \"score\": 238809.35433665093\n },\n {\n \"content\": \"/// Loads IsPushable<Is3D> from the .off file format\\n\\npub fn load_off_points<IP, P, R>(read: &mut R, ip: &mut IP) -> OffResult<()>\\n\\nwhere\\n\\n IP: IsPushable<P>,\\n\\n P: IsBuildable3D,\\n\\n R: BufRead,\\n\\n{\\n\\n let mut line_buffer = Vec::new();\\n\\n let mut i_line = 0;\\n\\n\\n\\n let mut off_seen = false;\\n\\n let mut n_vertices = None;\\n\\n let mut n_added = 0;\\n\\n\\n\\n while let Ok(line) = fetch_line(read, &mut line_buffer) {\\n\\n i_line += 1;\\n\\n\\n\\n if !off_seen && line.starts_with(b\\\"OFF\\\") {\\n\\n off_seen = true;\\n\\n continue;\\n\\n }\\n\",\n \"file_path\": \"src/io/off.rs\",\n \"rank\": 3,\n \"score\": 227814.92701315827\n },\n {\n \"content\": \"/// Loads materials from a .mtl file\\n\\npub fn load_mtl<R>(read: &mut R) -> MtlResult<HashMap<String, Material>>\\n\\nwhere\\n\\n R: BufRead,\\n\\n{\\n\\n let mut line_buffer = Vec::new();\\n\\n let mut i_line = 0;\\n\\n let mut mtl_name: Option<String> = None;\\n\\n let mut result: HashMap<String, Material> = HashMap::new();\\n\\n while let Ok(line) = fetch_line(read, &mut line_buffer) {\\n\\n i_line += 1;\\n\\n if line.starts_with(b\\\"newmtl \\\") {\\n\\n // skip \\\"newmtl\\\"\\n\\n let mut words = to_words_skip_empty(line);\\n\\n words.next().ok_or(MtlError::LineParse(i_line))?;\\n\\n if let Some(next_word) = words.next().and_then(|w| from_ascii(w)) {\\n\\n mtl_name = Some(next_word);\\n\\n result.insert(mtl_name.clone().unwrap(), Material::new());\\n\\n }\\n\\n } else if line.starts_with(b\\\"map_Kd \\\") {\\n\\n let mut words = to_words_skip_empty(line);\\n\",\n \"file_path\": \"src/io/mtl.rs\",\n \"rank\": 5,\n \"score\": 217195.13771809978\n },\n {\n \"content\": \"/// Loads an IsMesh3D from the .ply file format\\n\\npub fn load_ply<EM, P, R>(\\n\\n read: &mut R,\\n\\n mesh: &mut EM,\\n\\n material: &mut Material,\\n\\n material_info: &mut MaterialInfo,\\n\\n name: &String,\\n\\n) -> PlyResult<()>\\n\\nwhere\\n\\n EM: IsFaceEditableMesh<P, Face3> + IsVertexEditableMesh<P, Face3>,\\n\\n P: IsBuildable3D + Clone,\\n\\n R: BufRead,\\n\\n{\\n\\n let mut line_buffer = Vec::new();\\n\\n let mut i_line = 0;\\n\\n let surface = MaterialSurface::new();\\n\\n material_info.surfaces.insert(name.clone(), surface);\\n\\n\\n\\n let header = load_header(read, &mut line_buffer, &mut i_line)?;\\n\\n material.texture_name = header.texture_name.clone();\\n\\n\\n\",\n \"file_path\": \"src/io/ply/load.rs\",\n \"rank\": 6,\n \"score\": 203082.31387108704\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn read_face_type<BR, R>(read: &mut R, t: FaceType) -> PlyResult<usize>\\n\\nwhere\\n\\n BR: IsByteReader,\\n\\n R: Read,\\n\\n{\\n\\n match t {\\n\\n FaceType::Char => Ok(BR::read_i8(read)? as usize),\\n\\n FaceType::UChar => Ok(BR::read_u8(read)? as usize),\\n\\n FaceType::Short => Ok(BR::read_i16(read)? as usize),\\n\\n FaceType::UShort => Ok(BR::read_u16(read)? as usize),\\n\\n FaceType::Int => Ok(BR::read_i32(read)? as usize),\\n\\n FaceType::UInt => Ok(BR::read_u32(read)? as usize),\\n\\n _ => Err(PlyError::InvalidFaceType),\\n\\n }\\n\\n}\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\n\\n\",\n \"file_path\": \"src/io/ply/utils.rs\",\n \"rank\": 7,\n \"score\": 200767.85424448625\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn read_vertex_type<BR, R>(read: &mut R, t: VertexType) -> PlyResult<f64>\\n\\nwhere\\n\\n BR: IsByteReader,\\n\\n R: Read,\\n\\n{\\n\\n Ok(match t {\\n\\n VertexType::Float => BR::read_f32(read)? as f64,\\n\\n VertexType::Double => BR::read_f64(read)?,\\n\\n })\\n\\n}\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\n\\n\",\n \"file_path\": \"src/io/ply/utils.rs\",\n \"rank\": 8,\n \"score\": 181349.06933940266\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn fetch_line<'a, R>(read: &mut R, line_buffer: &'a mut Vec<u8>) -> FetchLineResult<&'a [u8]>\\n\\nwhere\\n\\n R: BufRead,\\n\\n{\\n\\n line_buffer.clear();\\n\\n let n_read = read.read_until(b'\\\\n', line_buffer)?;\\n\\n if n_read == 0 {\\n\\n return Err(FetchLineError);\\n\\n }\\n\\n\\n\\n // We must drop the '\\\\n' we read_until for sure\\n\\n // And might also have to drop additional whitespace\\n\\n let mut ignore_end = 1;\\n\\n for i in 1..line_buffer.len() {\\n\\n if (line_buffer[line_buffer.len() - i - 1] as char).is_whitespace() {\\n\\n ignore_end += 1;\\n\\n } else {\\n\\n break;\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/io/utils.rs\",\n \"rank\": 9,\n \"score\": 176033.91338870264\n },\n {\n \"content\": \"fn load_header<R>(read: &mut R, line_buffer: &mut Vec<u8>, i_line: &mut usize) -> PlyResult<Header>\\n\\nwhere\\n\\n R: BufRead,\\n\\n{\\n\\n let mut vertex_order = [Xyz::X, Xyz::X, Xyz::X];\\n\\n let mut i_vertex_order = 0;\\n\\n\\n\\n let mut ply_found = false;\\n\\n let mut read_state = HeaderReadState::Meta;\\n\\n let mut opt_format = None;\\n\\n let mut opt_n_vertices: Option<usize> = None;\\n\\n let mut opt_n_faces: Option<usize> = None;\\n\\n\\n\\n let mut opt_fst_type = None;\\n\\n let mut opt_snd_type = None;\\n\\n let mut opt_third_type = None;\\n\\n let mut n_types_found = 0;\\n\\n let mut vertex_before = BytesWords::default();\\n\\n let mut vertex_between_first_snd = BytesWords::default();\\n\\n let mut vertex_between_snd_third = BytesWords::default();\\n\",\n \"file_path\": \"src/io/ply/load.rs\",\n \"rank\": 10,\n \"score\": 171214.44435496168\n },\n {\n \"content\": \"fn load_ascii<EM, P, R>(\\n\\n read: &mut R,\\n\\n mesh: &mut EM,\\n\\n header: &Header,\\n\\n line_buffer: &mut Vec<u8>,\\n\\n i_line: &mut usize,\\n\\n material_info: &mut MaterialInfo,\\n\\n name: &String,\\n\\n) -> PlyResult<()>\\n\\nwhere\\n\\n EM: IsFaceEditableMesh<P, Face3> + IsVertexEditableMesh<P, Face3>,\\n\\n P: IsBuildable3D + Clone,\\n\\n R: BufRead,\\n\\n{\\n\\n while let Ok(line) = fetch_line(read, line_buffer) {\\n\\n *i_line += 1;\\n\\n\\n\\n if header.n_vertices > mesh.num_vertices() {\\n\\n let mut words = to_words_skip_empty(line);\\n\\n\\n\",\n \"file_path\": \"src/io/ply/load.rs\",\n \"rank\": 11,\n \"score\": 170370.97573858604\n },\n {\n \"content\": \"fn load_binary<BR, EM, P, R>(\\n\\n read: &mut R,\\n\\n mesh: &mut EM,\\n\\n header: &Header,\\n\\n material_info: &mut MaterialInfo,\\n\\n name: &String,\\n\\n) -> PlyResult<()>\\n\\nwhere\\n\\n EM: IsFaceEditableMesh<P, Face3> + IsVertexEditableMesh<P, Face3>,\\n\\n P: IsBuildable3D + Clone,\\n\\n R: Read,\\n\\n BR: IsByteReader,\\n\\n{\\n\\n for _ in 0..header.n_vertices {\\n\\n skip_bytes(read, header.vertex_format.before.bytes)?;\\n\\n\\n\\n let first = read_vertex_type::<BR, _>(read, header.vertex_format.first)?;\\n\\n\\n\\n skip_bytes(read, header.vertex_format.between_first_snd.bytes)?;\\n\\n\\n\",\n \"file_path\": \"src/io/ply/load.rs\",\n \"rank\": 12,\n \"score\": 163650.02640364625\n },\n {\n \"content\": \"/// Saves an IsMesh3D in the ASCII .ply file format\\n\\npub fn save_ply_ascii<M, P, W>(write: &mut W, mesh: &M) -> PlyResult<()>\\n\\nwhere\\n\\n M: IsMesh<P, Face3>,\\n\\n P: IsBuildable3D,\\n\\n W: Write,\\n\\n{\\n\\n let header = \\\"ply\\\\n\\\".to_string()\\n\\n + \\\"format ascii 1.0\\\\n\\\"\\n\\n + \\\"comment Created by rust-3d\\\\n\\\"\\n\\n + \\\"element vertex \\\"\\n\\n + &mesh.num_vertices().to_string()\\n\\n + \\\"\\\\n\\\"\\n\\n + \\\"property float x\\\\n\\\"\\n\\n + \\\"property float y\\\\n\\\"\\n\\n + \\\"property float z\\\\n\\\"\\n\\n + \\\"element face \\\"\\n\\n + &mesh.num_faces().to_string()\\n\\n + \\\"\\\\n\\\"\\n\\n + \\\"property list uchar uint vertex_indices\\\\n\\\"\\n\\n + \\\"end_header\\\\n\\\";\\n\",\n \"file_path\": \"src/io/ply/save.rs\",\n \"rank\": 13,\n \"score\": 157463.75637735537\n },\n {\n \"content\": \"/// Saves an IsMesh3D in the binary .ply file format\\n\\npub fn save_ply_binary<M, P, W>(write: &mut W, mesh: &M, precision: &Precision) -> PlyResult<()>\\n\\nwhere\\n\\n M: IsMesh<P, Face3>,\\n\\n P: IsBuildable3D,\\n\\n W: Write,\\n\\n{\\n\\n let header = match precision {\\n\\n Precision::P32 => {\\n\\n \\\"ply\\\\n\\\".to_string()\\n\\n + \\\"format binary_big_endian 1.0\\\\n\\\"\\n\\n + \\\"comment Created by rust-3d\\\\n\\\"\\n\\n + \\\"element vertex \\\"\\n\\n + &mesh.num_vertices().to_string()\\n\\n + \\\"\\\\n\\\"\\n\\n + \\\"property float x\\\\n\\\"\\n\\n + \\\"property float y\\\\n\\\"\\n\\n + \\\"property float z\\\\n\\\"\\n\\n + \\\"element face \\\"\\n\\n + &mesh.num_faces().to_string()\\n\\n + \\\"\\\\n\\\"\\n\",\n \"file_path\": \"src/io/ply/save.rs\",\n \"rank\": 14,\n \"score\": 148369.8508730583\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn skip_n<I>(i: &mut I, n: usize)\\n\\nwhere\\n\\n I: Iterator,\\n\\n{\\n\\n for _ in 0..n {\\n\\n i.next();\\n\\n }\\n\\n}\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\n\\n\\n/// Reads a FromStr from ASCII bytes\\n\",\n \"file_path\": \"src/io/utils.rs\",\n \"rank\": 15,\n \"score\": 143428.76253843826\n },\n {\n \"content\": \"/// Saves an IsMesh3D in the ASCII .ply file format with additional colors\\n\\npub fn save_ply_ascii_colored<M, P, W>(write: &mut W, mesh: &M, colors: &Vec<Rgb>) -> PlyResult<()>\\n\\nwhere\\n\\n M: IsMesh<P, Face3>,\\n\\n P: IsBuildable3D,\\n\\n W: Write,\\n\\n{\\n\\n let n_vertices = mesh.num_vertices();\\n\\n let n_faces = mesh.num_faces();\\n\\n\\n\\n if n_vertices != colors.len() {\\n\\n return Err(PlyError::ColorArrayIncorrectLength);\\n\\n }\\n\\n\\n\\n let header = \\\"ply\\\\n\\\".to_string()\\n\\n + \\\"format ascii 1.0\\\\n\\\"\\n\\n + \\\"comment Created by rust-3d\\\\n\\\"\\n\\n + \\\"element vertex \\\"\\n\\n + &n_vertices.to_string()\\n\\n + \\\"\\\\n\\\"\\n\\n + \\\"property float x\\\\n\\\"\\n\",\n \"file_path\": \"src/io/ply/save.rs\",\n \"rank\": 16,\n \"score\": 142136.39063591236\n },\n {\n \"content\": \"pub fn update(model: &mut Model, msg: &Msg) -> ShouldRender {\\n\\n match msg {\\n\\n Msg::Files(files) => {\\n\\n for file in files.into_iter() {\\n\\n let task = {\\n\\n let callback = model.link.callback(Msg::Loaded);\\n\\n model.reader.read_file(file.clone(), callback).unwrap()\\n\\n };\\n\\n model.tasks.push(task);\\n\\n }\\n\\n }\\n\\n Msg::Loaded(file) => {\\n\\n let path = Path::new(&file.name);\\n\\n info!(\\\"Loading file {}\\\", file.name);\\n\\n if let Some(ext) = path.extension() {\\n\\n let maybe_image_format =\\n\\n string_to_format(&ext.to_os_string().into_string().unwrap().to_lowercase());\\n\\n if let Some(image_format) = maybe_image_format {\\n\\n info!(\\\"Loading image {}\\\", file.name);\\n\\n match image::load_from_memory_with_format(&file.content[..], image_format) {\\n\",\n \"file_path\": \"src/mesh_loader.rs\",\n \"rank\": 17,\n \"score\": 128900.32721045848\n },\n {\n \"content\": \"pub fn update(model: &mut Model, msg: &Msg) -> ShouldRender {\\n\\n match msg {\\n\\n Msg::RemoveMesh(event) => {\\n\\n model.mesh.remove(event);\\n\\n return true;\\n\\n }\\n\\n Msg::MeshVisibilityToggle(event) => {\\n\\n let visible = &mut model.mesh.get_mut(event).unwrap().visible;\\n\\n *visible = !(*visible);\\n\\n }\\n\\n _ => {}\\n\\n };\\n\\n false\\n\\n}\\n\",\n \"file_path\": \"src/mesh_list.rs\",\n \"rank\": 18,\n \"score\": 128900.32721045848\n },\n {\n \"content\": \"/// Saves an IsMesh3D in the binary .ply file format with additional colors\\n\\npub fn save_ply_binary_colored<M, P, W>(\\n\\n write: &mut W,\\n\\n mesh: &M,\\n\\n precision: &Precision,\\n\\n colors: &Vec<Rgb>,\\n\\n) -> PlyResult<()>\\n\\nwhere\\n\\n M: IsMesh<P, Face3>,\\n\\n P: IsBuildable3D,\\n\\n W: Write,\\n\\n{\\n\\n let n_vertices = mesh.num_vertices();\\n\\n let n_faces = mesh.num_faces();\\n\\n\\n\\n if n_vertices != colors.len() {\\n\\n return Err(PlyError::ColorArrayIncorrectLength);\\n\\n }\\n\\n\\n\\n let header = match precision {\\n\\n Precision::P32 => {\\n\",\n \"file_path\": \"src/io/ply/save.rs\",\n \"rank\": 19,\n \"score\": 110693.12439252582\n },\n {\n \"content\": \"fn extend_by_vertex(p: &Point3D, array: &mut Vec<f32>) {\\n\\n array.push(p.x() as f32);\\n\\n array.push(p.y() as f32);\\n\\n array.push(p.z() as f32);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/mesh_loader.rs\",\n \"rank\": 20,\n \"score\": 110427.73148720444\n },\n {\n \"content\": \"fn string_to_format(format_string: &String) -> Option<image::ImageFormat> {\\n\\n let test_string = format_string.to_lowercase();\\n\\n if test_string == \\\"png\\\" {\\n\\n Some(image::ImageFormat::Png)\\n\\n } else if test_string == \\\"jpg\\\" || test_string == \\\".jpeg\\\" {\\n\\n Some(image::ImageFormat::Jpeg)\\n\\n } else if test_string == \\\"gif\\\" {\\n\\n Some(image::ImageFormat::Gif)\\n\\n } else if test_string == \\\"webp\\\" {\\n\\n Some(image::ImageFormat::WebP)\\n\\n } else if test_string == \\\"pnm\\\" {\\n\\n Some(image::ImageFormat::Pnm)\\n\\n } else if test_string == \\\"tiff\\\" || test_string == \\\"tiff\\\" {\\n\\n Some(image::ImageFormat::Tiff)\\n\\n } else if test_string == \\\"tga\\\" {\\n\\n Some(image::ImageFormat::Tga)\\n\\n } else if test_string == \\\"dds\\\" {\\n\\n Some(image::ImageFormat::Dds)\\n\\n } else if test_string == \\\"bmp\\\" {\\n\\n Some(image::ImageFormat::Bmp)\\n\\n } else if test_string == \\\"ico\\\" {\\n\\n Some(image::ImageFormat::Ico)\\n\\n } else if test_string == \\\"hdr\\\" {\\n\\n Some(image::ImageFormat::Hdr)\\n\\n } else {\\n\\n None\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/mesh_loader.rs\",\n \"rank\": 21,\n \"score\": 109377.13953942576\n },\n {\n \"content\": \"pub fn rendered(model: &mut Model, first_render: bool) {\\n\\n let canvas = model.node_ref.cast::<HtmlCanvasElement>().unwrap();\\n\\n\\n\\n let gl: GL = canvas\\n\\n .get_context(\\\"webgl2\\\")\\n\\n .unwrap()\\n\\n .unwrap()\\n\\n .dyn_into()\\n\\n .unwrap();\\n\\n\\n\\n model.canvas = Some(canvas);\\n\\n model.gl = new_gl(&gl);\\n\\n let gl_ref = model.gl.as_ref().expect(\\\"GL Context not initialized!\\\");\\n\\n\\n\\n model.renderer = Some(DeferredPipeline::new(&gl_ref).unwrap());\\n\\n model.untextured_mesh_renderer = Some(UntexturedMeshRenderer::new(&gl_ref));\\n\\n model.textured_mesh_renderer = Some(TexturedMeshRenderer::new(&gl_ref));\\n\\n\\n\\n // Camera\\n\\n let camera = Camera::new_perspective(\\n\",\n \"file_path\": \"src/render_canvas.rs\",\n \"rank\": 22,\n \"score\": 107607.81174580553\n },\n {\n \"content\": \"pub fn update(model: &mut Model, msg: &Msg) -> ShouldRender {\\n\\n match msg {\\n\\n Msg::PointerDown(event) => {\\n\\n model.mouse_down = event.button();\\n\\n }\\n\\n Msg::PointerUp(_event) => {\\n\\n model.mouse_down = -1;\\n\\n }\\n\\n Msg::MouseUp(_event) => {\\n\\n model.mouse_down = -1;\\n\\n }\\n\\n Msg::TouchEnd(_event) => {\\n\\n model.mouse_down = -1;\\n\\n }\\n\\n Msg::PointerMove(event) => {\\n\\n if model.mouse_down != -1 {\\n\\n model.mouse_events.push(event.clone());\\n\\n }\\n\\n }\\n\\n Msg::PointerWheel(event) => {\\n\\n model.wheel_events.push(event.clone());\\n\\n }\\n\\n _ => {}\\n\\n }\\n\\n false\\n\\n}\\n\",\n \"file_path\": \"src/input_controller.rs\",\n \"rank\": 23,\n \"score\": 105991.94145957299\n },\n {\n \"content\": \"pub fn update(model: &mut Model, msg: &Msg) -> ShouldRender {\\n\\n match msg {\\n\\n Msg::Render(timestamp) => {\\n\\n render_gl(model, *timestamp);\\n\\n }\\n\\n _ => {}\\n\\n };\\n\\n false\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/render_canvas.rs\",\n \"rank\": 24,\n \"score\": 105991.94145957299\n },\n {\n \"content\": \"pub fn view_mesh_list(model: &Model) -> Html {\\n\\n html! {\\n\\n <table style=\\\"width:100%\\\">\\n\\n { for model.mesh.iter().map(|f| view_element(model, f.0)) }\\n\\n </table>\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/mesh_list.rs\",\n \"rank\": 25,\n \"score\": 104186.93395579242\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn point_with_order<P>(fst: f64, snd: f64, third: f64, order: VertexOrder) -> P\\n\\nwhere\\n\\n P: IsBuildable3D,\\n\\n{\\n\\n match order {\\n\\n VertexOrder::Xyz => P::new(fst, snd, third),\\n\\n VertexOrder::Xzy => P::new(fst, third, snd),\\n\\n VertexOrder::Yxz => P::new(snd, fst, third),\\n\\n VertexOrder::Yzx => P::new(snd, third, fst),\\n\\n VertexOrder::Zxy => P::new(third, fst, snd),\\n\\n VertexOrder::Zyx => P::new(third, snd, fst),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/io/ply/utils.rs\",\n \"rank\": 26,\n \"score\": 104022.75045521706\n },\n {\n \"content\": \"fn create_mesh_surface(\\n\\n model: &mut Model,\\n\\n mesh: &Rust3DMesh,\\n\\n uvs: &rust_3d::PointCloud3D<Point3D>,\\n\\n material_name: Option<String>,\\n\\n surface: &MaterialSurface,\\n\\n) -> MeshSurface {\\n\\n let gl_ref = model.gl.as_ref().expect(\\\"GL Context not initialized!\\\");\\n\\n // Only add faces that belong to this surface.\\n\\n let mut indices: Vec<u32> = vec![];\\n\\n for fid in 0..mesh.num_faces() {\\n\\n let vids = mesh.face_vertex_ids(FId { val: fid }).unwrap();\\n\\n if !surface.faces.contains(&vids.clone()) {\\n\\n continue;\\n\\n }\\n\\n indices.push(vids.a.val as u32);\\n\\n indices.push(vids.b.val as u32);\\n\\n indices.push(vids.c.val as u32);\\n\\n }\\n\\n let mut maybe_uvs: Option<&[f32]> = None;\\n\",\n \"file_path\": \"src/mesh_loader.rs\",\n \"rank\": 27,\n \"score\": 102101.93073526093\n },\n {\n \"content\": \"pub fn view(model: &Model) -> Html {\\n\\n html! {\\n\\n <form>\\n\\n <input id=\\\"load_mesh\\\" type=\\\"file\\\" multiple=true accept=\\\".ply, .obj, .off, .stl, .mtl, .png, .jpeg, .jpg, .gif, .webp, .pnm, .tif, .tiff, .tga, .dds, .bmp, .ico, .hdr\\\" onchange=model.link.callback(move |value| {\\n\\n let mut result = Vec::new();\\n\\n if let ChangeData::Files(files) = value {\\n\\n let files = js_sys::try_iter(&files)\\n\\n .unwrap()\\n\\n .unwrap()\\n\\n .into_iter()\\n\\n .map(|v| File::from(v.unwrap()));\\n\\n result.extend(files);\\n\\n }\\n\\n Msg::Files(result)\\n\\n })/>\\n\\n <label for=\\\"load_mesh\\\">{\\\"Select files to view.\\\"}</label>\\n\\n </form>\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/mesh_loader.rs\",\n \"rank\": 28,\n \"score\": 100576.2789334034\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn collect_index_line(line: &[u8]) -> Option<[usize; 3]> {\\n\\n let mut words = to_words_skip_empty(line);\\n\\n if words.next()? != b\\\"3\\\" {\\n\\n return None;\\n\\n }\\n\\n\\n\\n let a = from_ascii(words.next()?)?;\\n\\n let b = from_ascii(words.next()?)?;\\n\\n let c = from_ascii(words.next()?)?;\\n\\n\\n\\n Some([a, b, c])\\n\\n}\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\n\\n\",\n \"file_path\": \"src/io/ply/utils.rs\",\n \"rank\": 29,\n \"score\": 89797.95361827328\n },\n {\n \"content\": \"/// Divide a mesh by materials, in instances where the only\\n\\n/// buffer we're passing to the shader is the vertex buffer. In\\n\\n/// this case we can use the values and existing order\\n\\n/// directly.\\n\\nfn divide_mesh_by_materials(\\n\\n model: &mut Model,\\n\\n mesh: &Rust3DMesh,\\n\\n material_info: &MaterialInfo,\\n\\n maybe_normals: Option<Vec<f32>>,\\n\\n) -> MeshContainer {\\n\\n let vertices = create_vertex_data(model, mesh, maybe_normals);\\n\\n info!(\\\"Adding model with {} vertices\\\", mesh.num_vertices());\\n\\n let mut surfaces: Vec<MeshSurface> = vec![];\\n\\n if material_info.surfaces.len() > 0 {\\n\\n for surface in material_info.surfaces.iter() {\\n\\n info!(\\n\\n \\\"Adding surface {} with {} faces\\\",\\n\\n surface.0,\\n\\n surface.1.faces.len()\\n\\n );\\n\\n let mesh_surface = create_mesh_surface(\\n\\n model,\\n\\n mesh,\\n\\n &material_info.uv,\\n\",\n \"file_path\": \"src/mesh_loader.rs\",\n \"rank\": 30,\n \"score\": 73687.30636712552\n },\n {\n \"content\": \"fn render_gl(model: &mut Model, _timestamp: f64) {\\n\\n let gl = model.gl.as_ref().expect(\\\"GL Context not initialized!\\\");\\n\\n let screen_width = model.canvas.as_ref().unwrap().width();\\n\\n let screen_height = model.canvas.as_ref().unwrap().height();\\n\\n model\\n\\n .camera\\n\\n .as_mut()\\n\\n .unwrap()\\n\\n .set_size(screen_width as f32, screen_height as f32);\\n\\n\\n\\n for mouse_event in model.mouse_events.iter() {\\n\\n if mouse_event.shift_key() || model.mouse_down == 2 {\\n\\n let target = model.camera.as_ref().unwrap().target();\\n\\n let position = model.camera.as_ref().unwrap().position();\\n\\n let up = model.camera.as_ref().unwrap().up();\\n\\n let forward = target - position;\\n\\n let right = forward.cross(*up);\\n\\n let translation_y = MOVE_SPEED * (mouse_event.movement_y() as f32) * up;\\n\\n let translation_x = -1f32 * MOVE_SPEED * (mouse_event.movement_x() as f32) * right;\\n\\n let translation = translation_x + translation_y;\\n\",\n \"file_path\": \"src/render_canvas.rs\",\n \"rank\": 31,\n \"score\": 72957.34934998934\n },\n {\n \"content\": \"#[cfg(target_arch = \\\"wasm32\\\")]\\n\\npub fn new_gl(gl: &GL) -> Option<Gl> {\\n\\n gl::Glstruct::new(gl.clone()).into()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/render_canvas.rs\",\n \"rank\": 32,\n \"score\": 70747.14583320629\n },\n {\n \"content\": \"#[cfg(not(target_arch = \\\"wasm32\\\"))]\\n\\npub fn new_gl(_gl: &GL) -> Option<Gl> {\\n\\n None\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/render_canvas.rs\",\n \"rank\": 33,\n \"score\": 70747.14583320629\n },\n {\n \"content\": \"/// Per-wedge UVs require that we duplicate any\\n\\n/// vertices that are referenced multiple times\\n\\n/// in the index vector so that the vertex and\\n\\n/// UV buffer that we send to the GPU are the\\n\\n/// same length. The resulting vectors are the\\n\\n/// same length and arrangement of the index\\n\\n/// vector, and the index vector is therefore\\n\\n/// sequential.\\n\\nfn divide_mesh_by_materials_per_wedge(\\n\\n model: &mut Model,\\n\\n mesh: &Rust3DMesh,\\n\\n material_info: &MaterialInfo,\\n\\n) -> MeshContainer {\\n\\n info!(\\\"Rebuilding vertex/UV vectors so they agree.\\\");\\n\\n let gl_ref = model.gl.as_ref().expect(\\\"GL Context not initialized!\\\");\\n\\n let mut vertices = vec![];\\n\\n let mut uvs = vec![];\\n\\n let uv_in = &material_info.uv;\\n\\n if 3 * mesh.num_faces() != uv_in.len() {\\n\\n // This function is only meant to be used with a mesh that has\\n\\n // per-face UVs.\\n\\n panic!(\\n\\n \\\"Expected 1 UV per wedge ({} != {})!\\\",\\n\\n mesh.num_faces() * 3,\\n\\n uv_in.len()\\n\\n );\\n\\n }\\n\\n let mut surface_indices: HashMap<String, Vec<u32>> = HashMap::new();\\n\",\n \"file_path\": \"src/mesh_loader.rs\",\n \"rank\": 34,\n \"score\": 70078.31353593236\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn from_ascii<T>(bytes: &[u8]) -> Option<T>\\n\\nwhere\\n\\n T: FromStr,\\n\\n{\\n\\n if bytes.is_ascii() {\\n\\n unsafe { T::from_str(std::str::from_utf8_unchecked(bytes)).ok() }\\n\\n } else {\\n\\n None\\n\\n }\\n\\n}\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\n\\n\\n/// Fetch a single line\\n\",\n \"file_path\": \"src/io/utils.rs\",\n \"rank\": 35,\n \"score\": 69722.96314782268\n },\n {\n \"content\": \"fn create_vertex_data(\\n\\n model: &mut Model,\\n\\n mesh: &Rust3DMesh,\\n\\n maybe_normals: Option<Vec<f32>>,\\n\\n) -> VertexData {\\n\\n let gl_ref = model.gl.as_ref().expect(\\\"GL Context not initialized!\\\");\\n\\n let mut vertices: Vec<f32> = vec![];\\n\\n let mut indices: Vec<u32> = vec![];\\n\\n for fid in 0..mesh.num_faces() {\\n\\n let vids = mesh.face_vertex_ids(FId { val: fid }).unwrap();\\n\\n indices.push(vids.a.val as u32);\\n\\n indices.push(vids.b.val as u32);\\n\\n indices.push(vids.c.val as u32);\\n\\n }\\n\\n for vid in 0..mesh.num_vertices() {\\n\\n let vertex = mesh.vertex(VId { val: vid }).unwrap();\\n\\n vertices.push(vertex.x as f32);\\n\\n vertices.push(vertex.y as f32);\\n\\n vertices.push(vertex.z as f32);\\n\\n }\\n\",\n \"file_path\": \"src/mesh_loader.rs\",\n \"rank\": 36,\n \"score\": 65427.84252326164\n },\n {\n \"content\": \"type Rust3DMesh = rust_3d::Mesh3D<Point3D, PointCloud3D<Point3D>, Vec<usize>>;\\n\\n\\n\",\n \"file_path\": \"src/mesh_loader.rs\",\n \"rank\": 37,\n \"score\": 64815.71637102769\n },\n {\n \"content\": \"fn view_element(model: &Model, data: &str) -> Html {\\n\\n let mesh_name = data.to_string();\\n\\n let remove_mesh_cb = model\\n\\n .link\\n\\n .callback(move |_| Msg::RemoveMesh(mesh_name.clone()));\\n\\n let mesh_name = data.to_string();\\n\\n let handle_check_cb = model\\n\\n .link\\n\\n .callback(move |_| Msg::MeshVisibilityToggle(mesh_name.clone()));\\n\\n html! {\\n\\n <table>\\n\\n <tr>\\n\\n <td>\\n\\n { data }\\n\\n </td>\\n\\n <td>\\n\\n <input type=\\\"checkbox\\\" checked={model.mesh.get(data).unwrap().visible } onclick=handle_check_cb />\\n\\n </td>\\n\\n <td>\\n\\n <button onclick=remove_mesh_cb.clone()>\\n\\n { \\\"Remove\\\" }\\n\\n </button>\\n\\n </td>\\n\\n </tr>\\n\\n </table>\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/mesh_list.rs\",\n \"rank\": 38,\n \"score\": 55699.27934481435\n },\n {\n \"content\": \"fn compute_normals(indices: &[u32], positions: &[f32]) -> Vec<f32> {\\n\\n let mut normals = vec![0.0f32; positions.len() * 3];\\n\\n for face in 0..indices.len() / 3 {\\n\\n let index0 = indices[face * 3] as usize;\\n\\n let p0 = vec3(\\n\\n positions[index0 * 3],\\n\\n positions[index0 * 3 + 1],\\n\\n positions[index0 * 3 + 2],\\n\\n );\\n\\n let index1 = indices[face * 3 + 1] as usize;\\n\\n let p1 = vec3(\\n\\n positions[index1 * 3],\\n\\n positions[index1 * 3 + 1],\\n\\n positions[index1 * 3 + 2],\\n\\n );\\n\\n let index2 = indices[face * 3 + 2] as usize;\\n\\n let p2 = vec3(\\n\\n positions[index2 * 3],\\n\\n positions[index2 * 3 + 1],\\n\\n positions[index2 * 3 + 2],\\n\",\n \"file_path\": \"src/mesh_loader.rs\",\n \"rank\": 39,\n \"score\": 53815.802242038444\n },\n {\n \"content\": \"/// Trait for binary data readers\\n\\npub trait IsByteReader {\\n\\n fn read_i8<R>(read: &mut R) -> iRes<i8>\\n\\n where\\n\\n R: Read;\\n\\n\\n\\n fn read_u8<R>(read: &mut R) -> iRes<u8>\\n\\n where\\n\\n R: Read;\\n\\n\\n\\n fn read_i16<R>(read: &mut R) -> iRes<i16>\\n\\n where\\n\\n R: Read;\\n\\n\\n\\n fn read_u16<R>(read: &mut R) -> iRes<u16>\\n\\n where\\n\\n R: Read;\\n\\n\\n\\n fn read_i32<R>(read: &mut R) -> iRes<i32>\\n\\n where\\n\\n R: Read;\\n\",\n \"file_path\": \"src/io/byte_reader.rs\",\n \"rank\": 40,\n \"score\": 44705.05673240629\n },\n {\n \"content\": \"fn main() {\\n\\n console_log::init_with_level(Level::Debug).unwrap();\\n\\n yew::start_app::<web_geo_viewer::Model>();\\n\\n}\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 41,\n \"score\": 41674.59254026748\n },\n {\n \"content\": \" Some(surface.0.clone()),\\n\\n surface.1,\\n\\n );\\n\\n surfaces.push(mesh_surface);\\n\\n }\\n\\n } else {\\n\\n let gl_ref = model.gl.as_ref().expect(\\\"GL Context not initialized!\\\");\\n\\n let mut indices: Vec<u32> = vec![];\\n\\n for fid in 0..mesh.num_faces() {\\n\\n let vids = mesh.face_vertex_ids(FId { val: fid }).unwrap();\\n\\n indices.push(vids.a.val as u32);\\n\\n indices.push(vids.b.val as u32);\\n\\n indices.push(vids.c.val as u32);\\n\\n }\\n\\n let surface = MeshSurface::new(gl_ref, &indices[..], None, None).unwrap();\\n\\n surfaces.push(surface);\\n\\n }\\n\\n MeshContainer {\\n\\n vertices: vertices,\\n\\n surfaces: surfaces,\\n\\n visible: true,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/mesh_loader.rs\",\n \"rank\": 42,\n \"score\": 30790.586057504854\n },\n {\n \"content\": \"use super::{MeshContainer, Model, Msg, ShouldRender};\\n\\nuse crate::io::*;\\n\\nuse crate::render_buffers::{MeshSurface, VertexData};\\n\\nuse image::GenericImageView;\\n\\nuse log::*;\\n\\nuse rust_3d::{io::load_stl_mesh_unique, *};\\n\\nuse std::collections::HashMap;\\n\\nuse std::path::Path;\\n\\nuse three_d::core::types::InnerSpace;\\n\\nuse three_d::vec3;\\n\\nuse yew::services::reader::File;\\n\\nuse yew::{html, ChangeData, Html};\\n\\n\\n\",\n \"file_path\": \"src/mesh_loader.rs\",\n \"rank\": 43,\n \"score\": 30790.235060464987\n },\n {\n \"content\": \"\\n\\n // Initialize index vector for each surface.\\n\\n for surface in &material_info.surfaces {\\n\\n surface_indices.insert(surface.0.clone(), vec![]);\\n\\n }\\n\\n let mut all_indices = vec![];\\n\\n for fid in 0..mesh.num_faces() {\\n\\n let vids = mesh.face_vertex_ids(FId { val: fid }).unwrap();\\n\\n all_indices.push((fid * 3 + 0) as u32);\\n\\n all_indices.push((fid * 3 + 1) as u32);\\n\\n all_indices.push((fid * 3 + 2) as u32);\\n\\n // Insert this index into surfaces to which this face belongs.\\n\\n for surface in &material_info.surfaces {\\n\\n if surface.1.faces.contains(&vids) {\\n\\n let index_vector = surface_indices.get_mut(surface.0).unwrap();\\n\\n index_vector.push((fid * 3 + 0) as u32);\\n\\n index_vector.push((fid * 3 + 1) as u32);\\n\\n index_vector.push((fid * 3 + 2) as u32);\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/mesh_loader.rs\",\n \"rank\": 44,\n \"score\": 30787.704243889053\n },\n {\n \"content\": \" match maybe_normals {\\n\\n Some(normals) => {\\n\\n info!(\\\"Using {} provided normals.\\\", normals.len());\\n\\n VertexData::new(gl_ref, &vertices[..], &normals[..]).unwrap()\\n\\n }\\n\\n None => {\\n\\n info!(\\n\\n \\\"computing normals with {} indices and {} indices.\\\",\\n\\n vertices.len(),\\n\\n indices.len()\\n\\n );\\n\\n VertexData::new(\\n\\n gl_ref,\\n\\n &vertices[..],\\n\\n &compute_normals(&indices[..], &vertices[..]),\\n\\n )\\n\\n .unwrap()\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/mesh_loader.rs\",\n \"rank\": 45,\n \"score\": 30786.63082096072\n },\n {\n \"content\": \" let vertex_data = VertexData::new(\\n\\n gl_ref,\\n\\n &vertices[..],\\n\\n &compute_normals(&all_indices[..], &vertices[..]),\\n\\n )\\n\\n .unwrap();\\n\\n let mut surfaces: Vec<MeshSurface> = vec![];\\n\\n for name_and_indices in surface_indices {\\n\\n info!(\\\"Material name {}\\\", name_and_indices.0);\\n\\n let surface = MeshSurface::new(\\n\\n gl_ref,\\n\\n &name_and_indices.1[..],\\n\\n Some(&uvs[..]),\\n\\n Some(name_and_indices.0),\\n\\n )\\n\\n .unwrap();\\n\\n surfaces.push(surface);\\n\\n }\\n\\n MeshContainer {\\n\\n vertices: vertex_data,\\n\\n surfaces: surfaces,\\n\\n visible: true,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/mesh_loader.rs\",\n \"rank\": 46,\n \"score\": 30786.57971138597\n },\n {\n \"content\": \" info!(\\n\\n \\\"Could not load {} as a texture due to error {:?}\\\",\\n\\n file.name, e\\n\\n );\\n\\n }\\n\\n }\\n\\n }\\n\\n Err(e) => {\\n\\n info!(\\n\\n \\\"Could not load {} as an image due to error {}\\\",\\n\\n file.name, e\\n\\n );\\n\\n }\\n\\n }\\n\\n } else if ext == \\\"ply\\\" || ext == \\\"obj\\\" {\\n\\n let mut m = Rust3DMesh::default();\\n\\n let mut material_info = MaterialInfo::new();\\n\\n let mut maybe_normals = None;\\n\\n if ext == \\\"ply\\\" {\\n\\n let mut material = Material::new();\\n\",\n \"file_path\": \"src/mesh_loader.rs\",\n \"rank\": 47,\n \"score\": 30785.46294671563\n },\n {\n \"content\": \" match load_ply(\\n\\n &mut &file.content[..],\\n\\n &mut m,\\n\\n &mut material,\\n\\n &mut material_info,\\n\\n &file.name,\\n\\n ) {\\n\\n Ok(_) => {\\n\\n model.materials.insert(file.name.clone(), material);\\n\\n }\\n\\n Err(e) => {\\n\\n warn!(\\\"Could not load {} as a PLY due to {:?}\\\", file.name, e);\\n\\n }\\n\\n }\\n\\n } else if ext == \\\"obj\\\" {\\n\\n match load_obj_mesh(&mut &file.content[..], &mut m, &mut material_info) {\\n\\n Ok(_) => {}\\n\\n Err(e) => {\\n\\n warn!(\\\"Could not load {} as an OBJ due to {:?}\\\", file.name, e);\\n\\n }\\n\",\n \"file_path\": \"src/mesh_loader.rs\",\n \"rank\": 48,\n \"score\": 30785.244698275957\n },\n {\n \"content\": \" let v0 = mesh.vertex(vids.a).unwrap();\\n\\n extend_by_vertex(&v0, &mut vertices);\\n\\n let v1 = mesh.vertex(vids.b).unwrap();\\n\\n extend_by_vertex(&v1, &mut vertices);\\n\\n let v2 = mesh.vertex(vids.c).unwrap();\\n\\n extend_by_vertex(&v2, &mut vertices);\\n\\n // 1 UV per face, each a point3D, is stored for each face,\\n\\n // for a total of 3 points per face.\\n\\n // UVs.\\n\\n let uv_base_idx = fid * 3;\\n\\n let uv0 = uv_in.get_d(uv_base_idx + 0);\\n\\n extend_by_vertex(&uv0, &mut uvs);\\n\\n let uv1 = uv_in.get_d(uv_base_idx + 1);\\n\\n extend_by_vertex(&uv1, &mut uvs);\\n\\n let uv2 = uv_in.get_d(uv_base_idx + 2);\\n\\n extend_by_vertex(&uv2, &mut uvs);\\n\\n }\\n\\n // we always have to compute normals here since the pre-computed\\n\\n // normals will not match, and it's better to have per-face\\n\\n // normals anyway.\\n\",\n \"file_path\": \"src/mesh_loader.rs\",\n \"rank\": 49,\n \"score\": 30784.560938592855\n },\n {\n \"content\": \" }\\n\\n } else if ext == \\\"off\\\" {\\n\\n match load_off_mesh(&mut &file.content[..], &mut m) {\\n\\n Ok(_) => {}\\n\\n Err(e) => {\\n\\n warn!(\\\"Could not load {} as an off due to {:?}\\\", file.name, e);\\n\\n }\\n\\n }\\n\\n } else if ext == \\\"stl\\\" {\\n\\n let mut r3d_normals = vec![];\\n\\n match load_stl_mesh_unique(\\n\\n &mut &file.content[..],\\n\\n rust_3d::io::StlFormat::Auto,\\n\\n &mut m,\\n\\n &mut r3d_normals,\\n\\n ) {\\n\\n Ok(_) => {\\n\\n let mut normals = vec![];\\n\\n for normal in r3d_normals {\\n\\n normals.push(normal.x as f32);\\n\",\n \"file_path\": \"src/mesh_loader.rs\",\n \"rank\": 50,\n \"score\": 30784.050585210854\n },\n {\n \"content\": \" let mut uv_vec: Vec<f32> = vec![];\\n\\n if uvs.len() > 0 {\\n\\n for point in uvs.data.iter() {\\n\\n uv_vec.push(point.x as f32);\\n\\n uv_vec.push(point.y as f32);\\n\\n uv_vec.push(point.z as f32);\\n\\n }\\n\\n info!(\\\"Loaded {} uvs\\\", uv_vec.len() / 3);\\n\\n maybe_uvs = Some(&uv_vec[..]);\\n\\n }\\n\\n MeshSurface::new(gl_ref, &indices[..], maybe_uvs, material_name).unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/mesh_loader.rs\",\n \"rank\": 51,\n \"score\": 30782.45356211749\n },\n {\n \"content\": \" info!(\\\"Loading an MTL file.\\\");\\n\\n match load_mtl(&mut &file.content[..]) {\\n\\n Ok(materials) => {\\n\\n for material in materials {\\n\\n info!(\\\"Loading material {}: {:?}.\\\", material.0, material.1);\\n\\n model.materials.insert(material.0, material.1);\\n\\n }\\n\\n }\\n\\n Err(e) => {\\n\\n warn!(\\n\\n \\\"Could not load {} as an mtl file due to error: {:?}\\\",\\n\\n file.name, e\\n\\n );\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n _ => {}\\n\\n };\\n\\n false\\n\\n}\\n\",\n \"file_path\": \"src/mesh_loader.rs\",\n \"rank\": 52,\n \"score\": 30781.385931436696\n },\n {\n \"content\": \" }\\n\\n info!(\\n\\n \\\"{} has {} vertices and {} indices\\\",\\n\\n file.name,\\n\\n m.num_vertices(),\\n\\n m.num_faces()\\n\\n );\\n\\n if material_info.uv.len() == 3 * m.num_faces() {\\n\\n // Per-wedge UVs. If a model has both per-wedge and per-vertex\\n\\n // UVs we should prefer per-wedge.\\n\\n let meshes = divide_mesh_by_materials_per_wedge(model, &m, &material_info);\\n\\n model.mesh.insert(file.name.clone(), meshes);\\n\\n } else {\\n\\n // Per-vetex UVs\\n\\n let meshes =\\n\\n divide_mesh_by_materials(model, &m, &material_info, maybe_normals);\\n\\n model.mesh.insert(file.name.clone(), meshes);\\n\\n }\\n\\n return true;\\n\\n } else if ext == \\\"mtl\\\" {\\n\",\n \"file_path\": \"src/mesh_loader.rs\",\n \"rank\": 53,\n \"score\": 30780.875104083978\n },\n {\n \"content\": \" normals.push(normal.x as f32);\\n\\n normals.push(normal.z as f32);\\n\\n }\\n\\n maybe_normals = Some(normals);\\n\\n let meshes = divide_mesh_by_materials(\\n\\n model,\\n\\n &m,\\n\\n &material_info,\\n\\n maybe_normals,\\n\\n );\\n\\n model.mesh.insert(file.name.clone(), meshes);\\n\\n }\\n\\n Err(e) => {\\n\\n warn!(\\\"Could not load {} as an off due to {:?}\\\", file.name, e);\\n\\n }\\n\\n }\\n\\n return true;\\n\\n }\\n\\n if m.num_vertices() == 0 {\\n\\n return false;\\n\",\n \"file_path\": \"src/mesh_loader.rs\",\n \"rank\": 54,\n \"score\": 30780.443064962474\n },\n {\n \"content\": \"use super::{Model, Msg, ShouldRender};\\n\\nuse yew::{html, Html};\\n\\n\\n\",\n \"file_path\": \"src/mesh_list.rs\",\n \"rank\": 55,\n \"score\": 30778.35382992476\n },\n {\n \"content\": \" Ok(image) => {\\n\\n let gl_ref = model.gl.as_ref().expect(\\\"GL Context not initialized!\\\");\\n\\n let (width, height) = image.dimensions();\\n\\n info!(\\\"Loaded {}x{} image {}\\\", file.name, width, height);\\n\\n match three_d::texture::Texture2D::new_with_u8(\\n\\n gl_ref,\\n\\n three_d::Interpolation::Linear,\\n\\n three_d::Interpolation::Linear,\\n\\n Some(three_d::Interpolation::Linear),\\n\\n three_d::Wrapping::ClampToEdge,\\n\\n three_d::Wrapping::ClampToEdge,\\n\\n width,\\n\\n height,\\n\\n &image.to_bytes()[..],\\n\\n ) {\\n\\n Ok(texture) => {\\n\\n info!(\\\"Created texture {}\\\", file.name);\\n\\n model.images.insert(file.name.clone(), texture);\\n\\n }\\n\\n Err(e) => {\\n\",\n \"file_path\": \"src/mesh_loader.rs\",\n \"rank\": 56,\n \"score\": 30777.90934618938\n },\n {\n \"content\": \" );\\n\\n\\n\\n let normal = (p1 - p0).cross(p2 - p0);\\n\\n normals[index0 * 3] += normal.x;\\n\\n normals[index0 * 3 + 1] += normal.y;\\n\\n normals[index0 * 3 + 2] += normal.z;\\n\\n normals[index1 * 3] += normal.x;\\n\\n normals[index1 * 3 + 1] += normal.y;\\n\\n normals[index1 * 3 + 2] += normal.z;\\n\\n normals[index2 * 3] += normal.x;\\n\\n normals[index2 * 3 + 1] += normal.y;\\n\\n normals[index2 * 3 + 2] += normal.z;\\n\\n }\\n\\n\\n\\n for i in 0..normals.len() / 3 {\\n\\n let normal = vec3(normals[3 * i], normals[3 * i + 1], normals[3 * i + 2]).normalize();\\n\\n normals[3 * i] = normal.x;\\n\\n normals[3 * i + 1] = normal.y;\\n\\n normals[3 * i + 2] = normal.z;\\n\\n }\\n\\n normals\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/mesh_loader.rs\",\n \"rank\": 57,\n \"score\": 30774.37159409625\n },\n {\n \"content\": \"use crate::io::Material;\\n\\nuse crate::render_buffers::{MeshSurface, VertexData};\\n\\nuse three_d::*;\\n\\n\\n\\npub struct UntexturedMeshRenderer {\\n\\n shader: program::Program,\\n\\n}\\n\\n\\n\\nimpl UntexturedMeshRenderer {\\n\\n pub fn new(gl: &Gl) -> UntexturedMeshRenderer {\\n\\n UntexturedMeshRenderer {\\n\\n shader: program::Program::from_source(\\n\\n &gl,\\n\\n include_str!(\\\"shaders/mesh_shaded.vert\\\"),\\n\\n include_str!(\\\"shaders/shaded.frag\\\"),\\n\\n )\\n\\n .unwrap(),\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/untextured_mesh_renderer.rs\",\n \"rank\": 58,\n \"score\": 29524.79098066109\n },\n {\n \"content\": \"use crate::io::Material;\\n\\nuse crate::render_buffers::{MeshSurface, VertexData};\\n\\nuse three_d::*;\\n\\n\\n\\npub struct TexturedMeshRenderer {\\n\\n shader: program::Program,\\n\\n}\\n\\n\\n\\nimpl TexturedMeshRenderer {\\n\\n pub fn new(gl: &Gl) -> TexturedMeshRenderer {\\n\\n TexturedMeshRenderer {\\n\\n shader: program::Program::from_source(\\n\\n &gl,\\n\\n include_str!(\\\"shaders/textured.vert\\\"),\\n\\n include_str!(\\\"shaders/textured.frag\\\"),\\n\\n )\\n\\n .unwrap(),\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/textured_mesh_renderer.rs\",\n \"rank\": 59,\n \"score\": 29524.749150035856\n },\n {\n \"content\": \"\\n\\n program\\n\\n .add_uniform_mat4(\\\"modelMatrix\\\", &transformation)\\n\\n .unwrap();\\n\\n\\n\\n program.use_texture(image, \\\"texture0\\\").unwrap();\\n\\n\\n\\n program.use_uniform_block(camera.matrix_buffer(), \\\"Camera\\\");\\n\\n program\\n\\n .add_uniform_mat4(\\n\\n \\\"normalMatrix\\\",\\n\\n &transformation.invert().unwrap().transpose(),\\n\\n )\\n\\n .unwrap();\\n\\n program\\n\\n .use_attribute_vec3_float(&vertex_data.position_buffer, \\\"position\\\")\\n\\n .unwrap();\\n\\n program\\n\\n .use_attribute_vec3_float(&vertex_data.normal_buffer, \\\"normal\\\")\\n\\n .unwrap();\\n\\n program\\n\\n .use_attribute_vec3_float(mesh_surface.maybe_uvs.as_ref().unwrap(), \\\"uvw\\\")\\n\\n .unwrap();\\n\\n program.draw_elements(&mesh_surface.index_buffer);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/textured_mesh_renderer.rs\",\n \"rank\": 60,\n \"score\": 29520.200878700016\n },\n {\n \"content\": \" pub fn render(\\n\\n &self,\\n\\n transformation: &Mat4,\\n\\n camera: &camera::Camera,\\n\\n vertex_data: &VertexData,\\n\\n mesh_surface: &MeshSurface,\\n\\n material: &Material,\\n\\n ) {\\n\\n let program = &self.shader;\\n\\n program\\n\\n .add_uniform_float(\\\"diffuse_intensity\\\", &material.diffuse_intensity)\\n\\n .unwrap();\\n\\n program\\n\\n .add_uniform_float(\\\"specular_intensity\\\", &material.specular_intensity)\\n\\n .unwrap();\\n\\n let specular_power = 5.0;\\n\\n program\\n\\n .add_uniform_float(\\\"specular_power\\\", &specular_power)\\n\\n .unwrap();\\n\\n\\n\",\n \"file_path\": \"src/untextured_mesh_renderer.rs\",\n \"rank\": 61,\n \"score\": 29518.898731216912\n },\n {\n \"content\": \" pub fn render(\\n\\n &self,\\n\\n transformation: &Mat4,\\n\\n camera: &camera::Camera,\\n\\n vertex_data: &VertexData,\\n\\n mesh_surface: &MeshSurface,\\n\\n material: &Material,\\n\\n image: &Texture2D,\\n\\n ) {\\n\\n let program = &self.shader;\\n\\n program\\n\\n .add_uniform_float(\\\"diffuse_intensity\\\", &material.diffuse_intensity)\\n\\n .unwrap();\\n\\n program\\n\\n .add_uniform_float(\\\"specular_intensity\\\", &material.specular_intensity)\\n\\n .unwrap();\\n\\n let specular_power = 5.0;\\n\\n program\\n\\n .add_uniform_float(\\\"specular_power\\\", &specular_power)\\n\\n .unwrap();\\n\",\n \"file_path\": \"src/textured_mesh_renderer.rs\",\n \"rank\": 62,\n \"score\": 29518.679097471155\n },\n {\n \"content\": \" program\\n\\n .add_uniform_vec3(\\\"color\\\", &material.diffuse_color)\\n\\n .unwrap();\\n\\n program\\n\\n .add_uniform_mat4(\\\"modelMatrix\\\", &transformation)\\n\\n .unwrap();\\n\\n program.use_uniform_block(camera.matrix_buffer(), \\\"Camera\\\");\\n\\n program\\n\\n .add_uniform_mat4(\\n\\n \\\"normalMatrix\\\",\\n\\n &transformation.invert().unwrap().transpose(),\\n\\n )\\n\\n .unwrap();\\n\\n program\\n\\n .use_attribute_vec3_float(&vertex_data.position_buffer, \\\"position\\\")\\n\\n .unwrap();\\n\\n program\\n\\n .use_attribute_vec3_float(&vertex_data.normal_buffer, \\\"normal\\\")\\n\\n .unwrap();\\n\\n program.draw_elements(&mesh_surface.index_buffer);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/untextured_mesh_renderer.rs\",\n \"rank\": 63,\n \"score\": 29518.266390690856\n },\n {\n \"content\": \"/*\\n\\nCopyright 2020 Martin Buck\\n\\n\\n\\nPermission is hereby granted, free of charge, to any person obtaining a copy\\n\\nof this software and associated documentation files (the \\\"Software\\\"),\\n\\nto deal in the Software without restriction, including without limitation the\\n\\nrights to use, copy, modify, merge, publish, distribute, sublicense,\\n\\nand/or sell copies of the Software, and to permit persons to whom the Software\\n\\nis furnished to do so, subject to the following conditions:\\n\\n\\n\\nThe above copyright notice and this permission notice shall\\n\\nbe included all copies or substantial portions of the Software.\\n\\n\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND,\\n\\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\\n\\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\\n\\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\\n\\nDAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\\n\\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE\\n\\nOR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\\n\",\n \"file_path\": \"src/io/ply/load.rs\",\n \"rank\": 65,\n \"score\": 99.39384666875041\n },\n {\n \"content\": \"/*\\n\\nCopyright 2020 Martin Buck\\n\\n\\n\\nPermission is hereby granted, free of charge, to any person obtaining a copy\\n\\nof this software and associated documentation files (the \\\"Software\\\"),\\n\\nto deal in the Software without restriction, including without limitation the\\n\\nrights to use, copy, modify, merge, publish, distribute, sublicense,\\n\\nand/or sell copies of the Software, and to permit persons to whom the Software\\n\\nis furnished to do so, subject to the following conditions:\\n\\n\\n\\nThe above copyright notice and this permission notice shall\\n\\nbe included all copies or substantial portions of the Software.\\n\\n\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND,\\n\\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\\n\\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\\n\\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\\n\\nDAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\\n\\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE\\n\\nOR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\\n\",\n \"file_path\": \"src/io/off.rs\",\n \"rank\": 66,\n \"score\": 99.39384666875041\n },\n {\n \"content\": \"/*\\n\\nCopyright 2020 Martin Buck\\n\\n\\n\\nPermission is hereby granted, free of charge, to any person obtaining a copy\\n\\nof this software and associated documentation files (the \\\"Software\\\"),\\n\\nto deal in the Software without restriction, including without limitation the\\n\\nrights to use, copy, modify, merge, publish, distribute, sublicense,\\n\\nand/or sell copies of the Software, and to permit persons to whom the Software\\n\\nis furnished to do so, subject to the following conditions:\\n\\n\\n\\nThe above copyright notice and this permission notice shall\\n\\nbe included all copies or substantial portions of the Software.\\n\\n\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND,\\n\\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\\n\\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\\n\\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\\n\\nDAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\\n\\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE\\n\\nOR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\\n\",\n \"file_path\": \"src/io/ply/types.rs\",\n \"rank\": 67,\n \"score\": 99.39384666875041\n },\n {\n \"content\": \"/*\\n\\nCopyright 2017 Martin Buck\\n\\n\\n\\nPermission is hereby granted, free of charge, to any person obtaining a copy\\n\\nof this software and associated documentation files (the \\\"Software\\\"),\\n\\nto deal in the Software without restriction, including without limitation the\\n\\nrights to use, copy, modify, merge, publish, distribute, sublicense,\\n\\nand/or sell copies of the Software, and to permit persons to whom the Software\\n\\nis furnished to do so, subject to the following conditions:\\n\\n\\n\\nThe above copyright notice and this permission notice shall\\n\\nbe included all copies or substantial portions of the Software.\\n\\n\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND,\\n\\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\\n\\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\\n\\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\\n\\nDAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\\n\\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE\\n\\nOR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\\n\",\n \"file_path\": \"src/io/ply/mod.rs\",\n \"rank\": 68,\n \"score\": 99.39384666875038\n },\n {\n \"content\": \"/*\\n\\nCopyright 2020 Martin Buck\\n\\n\\n\\nPermission is hereby granted, free of charge, to any person obtaining a copy\\n\\nof this software and associated documentation files (the \\\"Software\\\"),\\n\\nto deal in the Software without restriction, including without limitation the\\n\\nrights to use, copy, modify, merge, publish, distribute, sublicense,\\n\\nand/or sell copies of the Software, and to permit persons to whom the Software\\n\\nis furnished to do so, subject to the following conditions:\\n\\n\\n\\nThe above copyright notice and this permission notice shall\\n\\nbe included all copies or substantial portions of the Software.\\n\\n\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND,\\n\\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\\n\\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\\n\\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\\n\\nDAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\\n\\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE\\n\\nOR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\\n\",\n \"file_path\": \"src/io/ply/utils.rs\",\n \"rank\": 69,\n \"score\": 99.3938466687504\n },\n {\n \"content\": \"/*\\n\\nCopyright 2020 Martin Buck\\n\\n\\n\\nPermission is hereby granted, free of charge, to any person obtaining a copy\\n\\nof this software and associated documentation files (the \\\"Software\\\"),\\n\\nto deal in the Software without restriction, including without limitation the\\n\\nrights to use, copy, modify, merge, publish, distribute, sublicense,\\n\\nand/or sell copies of the Software, and to permit persons to whom the Software\\n\\nis furnished to do so, subject to the following conditions:\\n\\n\\n\\nThe above copyright notice and this permission notice shall\\n\\nbe included all copies or substantial portions of the Software.\\n\\n\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND,\\n\\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\\n\\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\\n\\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\\n\\nDAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\\n\\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE\\n\\nOR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\\n\",\n \"file_path\": \"src/io/ply/save.rs\",\n \"rank\": 70,\n \"score\": 99.39384666875041\n },\n {\n \"content\": \"/*\\n\\nCopyright 2020 Martin Buck\\n\\n\\n\\nPermission is hereby granted, free of charge, to any person obtaining a copy\\n\\nof this software and associated documentation files (the \\\"Software\\\"),\\n\\nto deal in the Software without restriction, including without limitation the\\n\\nrights to use, copy, modify, merge, publish, distribute, sublicense,\\n\\nand/or sell copies of the Software, and to permit persons to whom the Software\\n\\nis furnished to do so, subject to the following conditions:\\n\\n\\n\\nThe above copyright notice and this permission notice shall\\n\\nbe included all copies or substantial portions of the Software.\\n\\n\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND,\\n\\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\\n\\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\\n\\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\\n\\nDAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\\n\\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE\\n\\nOR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\\n\",\n \"file_path\": \"src/io/utils.rs\",\n \"rank\": 71,\n \"score\": 99.3938466687504\n },\n {\n \"content\": \"/*\\n\\nCopyright 2020 Martin Buck\\n\\n\\n\\nPermission is hereby granted, free of charge, to any person obtaining a copy\\n\\nof this software and associated documentation files (the \\\"Software\\\"),\\n\\nto deal in the Software without restriction, including without limitation the\\n\\nrights to use, copy, modify, merge, publish, distribute, sublicense,\\n\\nand/or sell copies of the Software, and to permit persons to whom the Software\\n\\nis furnished to do so, subject to the following conditions:\\n\\n\\n\\nThe above copyright notice and this permission notice shall\\n\\nbe included all copies or substantial portions of the Software.\\n\\n\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND,\\n\\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\\n\\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\\n\\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\\n\\nDAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\\n\\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE\\n\\nOR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\\n\\n*/\\n\\n\\n\\n//! Module containing the IsByteReader trait and Little/BigReader implementations for reading binary data\\n\\n\\n\\nuse std::io::{Read, Result as iRes};\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\n\\n\\n/// Trait for binary data readers\\n\",\n \"file_path\": \"src/io/byte_reader.rs\",\n \"rank\": 72,\n \"score\": 91.4797649532243\n },\n {\n \"content\": \" let mut after = BytesWords::default();\\n\\n\\n\\n let mut face_types = vec![];\\n\\n let mut texture_name = None;\\n\\n\\n\\n while let Ok(line) = fetch_line(read, line_buffer) {\\n\\n *i_line += 1;\\n\\n\\n\\n if line.starts_with(b\\\"comment\\\") {\\n\\n let mut words = to_words_skip_empty(line);\\n\\n match words.nth(1) {\\n\\n Some(next_word) => {\\n\\n if next_word == b\\\"TextureFile\\\" {\\n\\n match words.next() {\\n\\n Some(texture_name_blob) => {\\n\\n if let Ok(read_texture_name) = str::from_utf8(texture_name_blob) {\\n\\n info!(\\\"Read texture name: {}\\\", read_texture_name);\\n\\n texture_name = Some(read_texture_name.to_string());\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/io/ply/load.rs\",\n \"rank\": 74,\n \"score\": 22.12022877275649\n },\n {\n \"content\": \" break;\\n\\n }\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\n\\n\\n/// Error type for .off file operations\\n\\npub enum OffError {\\n\\n AccessFile,\\n\\n InvalidMeshIndices(usize),\\n\\n LineParse(usize),\\n\\n}\\n\\n\\n\\n/// Result type for .off file operations\\n\\npub type OffResult<T> = std::result::Result<T, OffError>;\\n\\n\\n\\nimpl fmt::Debug for OffError {\\n\",\n \"file_path\": \"src/io/off.rs\",\n \"rank\": 77,\n \"score\": 20.546943272701043\n },\n {\n \"content\": \" AccessFile,\\n\\n LineParse(usize),\\n\\n NoMaterialError(usize),\\n\\n}\\n\\n\\n\\nimpl fmt::Debug for MtlError {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n match self {\\n\\n Self::AccessFile => write!(f, \\\"Unable to access file\\\"),\\n\\n Self::LineParse(x) => write!(f, \\\"Unable to parse line {}\\\", x),\\n\\n Self::NoMaterialError(x) => write!(f, \\\"Line {} occurs before newmtl.\\\", x),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// Result type for .obj file operations\\n\\npub type MtlResult<T> = std::result::Result<T, MtlError>;\\n\\n\\n\\nimpl From<ioError> for MtlError {\\n\\n fn from(_error: ioError) -> Self {\\n\\n MtlError::AccessFile\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/io/mtl.rs\",\n \"rank\": 78,\n \"score\": 20.191666027257945\n },\n {\n \"content\": \" after.bytes += t.size_bytes();\\n\\n after.words += 1;\\n\\n }\\n\\n }\\n\\n }\\n\\n HeaderReadState::Face => {\\n\\n if line.starts_with(b\\\"property list\\\") {\\n\\n let mut words = to_words_skip_empty(line);\\n\\n skip_n(&mut words, 2); // skip \\\"property\\\" and \\\"list\\\"\\n\\n let t_count = FaceType::try_from(Type::try_from(\\n\\n words.next().ok_or(PlyError::InvalidProperty(*i_line))?,\\n\\n )?)?;\\n\\n let t_index = FaceType::try_from(Type::try_from(\\n\\n words.next().ok_or(PlyError::InvalidProperty(*i_line))?,\\n\\n )?)?;\\n\\n let name: String =\\n\\n str::from_utf8(words.next().ok_or(PlyError::InvalidProperty(*i_line))?)\\n\\n .unwrap()\\n\\n .to_string();\\n\\n\\n\",\n \"file_path\": \"src/io/ply/load.rs\",\n \"rank\": 81,\n \"score\": 19.25845888121268\n },\n {\n \"content\": \" }\\n\\n }\\n\\n Some(_) => {}\\n\\n }\\n\\n\\n\\n if line.starts_with(b\\\"property\\\") {\\n\\n match read_state {\\n\\n HeaderReadState::Vertex => {\\n\\n let mut words = to_words_skip_empty(line);\\n\\n skip_n(&mut words, 1); // skip \\\"property\\\"\\n\\n\\n\\n let t =\\n\\n Type::try_from(words.next().ok_or(PlyError::InvalidProperty(*i_line))?)?;\\n\\n let id = words.next().ok_or(PlyError::InvalidProperty(*i_line))?;\\n\\n if id == b\\\"x\\\" {\\n\\n opt_fst_type = Some(VertexType::try_from(t)?);\\n\\n n_types_found += 1;\\n\\n vertex_order[i_vertex_order] = Xyz::X;\\n\\n i_vertex_order += 1;\\n\\n } else if id == b\\\"y\\\" {\\n\",\n \"file_path\": \"src/io/ply/load.rs\",\n \"rank\": 82,\n \"score\": 18.740434432689483\n },\n {\n \"content\": \"//------------------------------------------------------------------------------\\n\\n\\n\\n#[derive(Default, Debug)]\\n\\npub struct BytesWords {\\n\\n pub bytes: usize,\\n\\n pub words: usize,\\n\\n}\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\n\\n\\n#[derive(Copy, Clone, Debug)]\\n\\npub enum VertexType {\\n\\n Float,\\n\\n Double,\\n\\n}\\n\\n\\n\\nimpl TryFrom<Type> for VertexType {\\n\\n type Error = PlyError;\\n\\n\\n\\n fn try_from(x: Type) -> PlyResult<Self> {\\n\",\n \"file_path\": \"src/io/ply/types.rs\",\n \"rank\": 83,\n \"score\": 18.7339620691808\n },\n {\n \"content\": \"*/\\n\\n\\n\\n//! Module for interal types for IO operations of the ply file format\\n\\n\\n\\nuse core::convert::TryFrom;\\n\\n\\n\\nuse std::{fmt, io::Error as ioError};\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\n\\n\\n#[derive(Copy, Clone)]\\n\\npub enum Type {\\n\\n Char,\\n\\n UChar,\\n\\n Short,\\n\\n UShort,\\n\\n Int,\\n\\n UInt,\\n\\n Float,\\n\\n Double,\\n\",\n \"file_path\": \"src/io/ply/types.rs\",\n \"rank\": 84,\n \"score\": 18.58189197914905\n },\n {\n \"content\": \"#[cfg(test)]\\n\\nmod test {\\n\\n use crate::io::*;\\n\\n use rust_3d::*;\\n\\n use std::{fs::File, io::BufReader};\\n\\n #[test]\\n\\n fn load_untextured_obj() {\\n\\n let box_path = \\\"src/tests/data/box.obj\\\".to_string();\\n\\n let mut m = rust_3d::Mesh3D::<Point3D, PointCloud3D<Point3D>, Vec<usize>>::default();\\n\\n let mut uv = MaterialInfo::new();\\n\\n load_obj_mesh(\\n\\n &mut BufReader::new(File::open(box_path).unwrap()),\\n\\n &mut m,\\n\\n &mut uv,\\n\\n )\\n\\n .unwrap();\\n\\n assert_eq!(m.num_vertices(), 8);\\n\\n assert_eq!(m.num_faces(), 12);\\n\\n assert_eq!(uv.uv.len(), 0);\\n\\n assert_eq!(uv.surfaces.contains_key(\\\"Default\\\"), true);\\n\",\n \"file_path\": \"src/tests/io.rs\",\n \"rank\": 85,\n \"score\": 18.561928891541264\n },\n {\n \"content\": \"use three_d::objects::Error;\\n\\nuse three_d::*;\\n\\n\\n\\n/// All of the information needed to render a mesh, in the most convenient\\n\\n/// form possible for rendering.\\n\\n\\n\\n/// Everything associated with a surface.\\n\\npub struct MeshSurface {\\n\\n /// Indices for triangular faces. A 1D int array with a\\n\\n /// stride of 3.\\n\\n pub index_buffer: ElementBuffer,\\n\\n\\n\\n /// UVs. a 1D float array with a stride of 2.\\n\\n pub maybe_uvs: Option<VertexBuffer>,\\n\\n\\n\\n /// The name of the material, if there is one.\\n\\n pub maybe_material_name: Option<String>,\\n\\n}\\n\\n\\n\\n/// Everything associated with vertices. We separate vertex data from\\n\",\n \"file_path\": \"src/render_buffers.rs\",\n \"rank\": 86,\n \"score\": 18.36557834334975\n },\n {\n \"content\": \" fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n match self {\\n\\n Self::AccessFile => write!(f, \\\"Unable to access file\\\"),\\n\\n Self::LineParse(x) => write!(f, \\\"Unable to parse line {}\\\", x),\\n\\n Self::InvalidMeshIndices(x) => {\\n\\n write!(f, \\\"File contains invalid mesh indices on line {}\\\", x)\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<ioError> for OffError {\\n\\n fn from(_error: ioError) -> Self {\\n\\n OffError::AccessFile\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/io/off.rs\",\n \"rank\": 87,\n \"score\": 18.147739000998932\n },\n {\n \"content\": \" 0.005,\\n\\n )\\n\\n .unwrap();\\n\\n let renderer = model.renderer.as_mut().unwrap();\\n\\n let camera = model.camera.as_ref().unwrap();\\n\\n let mesh_groups = &model.mesh;\\n\\n let materials = &model.materials;\\n\\n let images = &model.images;\\n\\n let untextured = model.untextured_mesh_renderer.as_ref();\\n\\n let textured = model.textured_mesh_renderer.as_ref();\\n\\n renderer\\n\\n .geometry_pass(screen_width as usize, screen_height as usize, &|| {\\n\\n for group in mesh_groups.iter() {\\n\\n for surface in group.1.surfaces.iter() {\\n\\n if group.1.visible {\\n\\n let mut maybe_texture: Option<&Texture2D> = None;\\n\\n let material = match &surface.maybe_material_name {\\n\\n Some(material_name) => match materials.get(material_name) {\\n\\n Some(material) => {\\n\\n if let Some(texture_name) = &material.texture_name {\\n\",\n \"file_path\": \"src/render_canvas.rs\",\n \"rank\": 89,\n \"score\": 18.099393243164386\n },\n {\n \"content\": \"\\n\\n mesh.add_vertex(P::new(x, y, z));\\n\\n } else {\\n\\n let mut words = to_words_skip_empty(line);\\n\\n\\n\\n let count_face = words.next().ok_or(OffError::LineParse(i_line))?;\\n\\n\\n\\n if count_face == b\\\"3\\\" {\\n\\n let a = words\\n\\n .next()\\n\\n .and_then(|word| from_ascii(word))\\n\\n .ok_or(OffError::LineParse(i_line))?;\\n\\n\\n\\n let b = words\\n\\n .next()\\n\\n .and_then(|word| from_ascii(word))\\n\\n .ok_or(OffError::LineParse(i_line))?;\\n\\n\\n\\n let c = words\\n\\n .next()\\n\",\n \"file_path\": \"src/io/off.rs\",\n \"rank\": 90,\n \"score\": 18.03291277003624\n },\n {\n \"content\": \" }\\n\\n\\n\\n // safe since checked above\\n\\n if mesh.num_vertices() < counts.unwrap()[0] {\\n\\n let mut words = to_words_skip_empty(line);\\n\\n\\n\\n let x = words\\n\\n .next()\\n\\n .and_then(|word| from_ascii(word))\\n\\n .ok_or(OffError::LineParse(i_line))?;\\n\\n\\n\\n let y = words\\n\\n .next()\\n\\n .and_then(|word| from_ascii(word))\\n\\n .ok_or(OffError::LineParse(i_line))?;\\n\\n\\n\\n let z = words\\n\\n .next()\\n\\n .and_then(|word| from_ascii(word))\\n\\n .ok_or(OffError::LineParse(i_line))?;\\n\",\n \"file_path\": \"src/io/off.rs\",\n \"rank\": 91,\n \"score\": 17.679957725941726\n },\n {\n \"content\": \" if line.is_empty() || line.starts_with(b\\\"#\\\") {\\n\\n continue;\\n\\n }\\n\\n\\n\\n if counts.is_none() {\\n\\n let mut words = to_words_skip_empty(line);\\n\\n let n_vertices = words\\n\\n .next()\\n\\n .and_then(|word| from_ascii(word))\\n\\n .ok_or(OffError::LineParse(i_line))?;\\n\\n let n_faces = words\\n\\n .next()\\n\\n .and_then(|word| from_ascii(word))\\n\\n .ok_or(OffError::LineParse(i_line))?;\\n\\n\\n\\n mesh.reserve_vertices(n_vertices);\\n\\n mesh.reserve_faces(n_faces);\\n\\n\\n\\n counts = Some([n_vertices, n_faces]);\\n\\n continue;\\n\",\n \"file_path\": \"src/io/off.rs\",\n \"rank\": 94,\n \"score\": 17.12681259287589\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\n\\n\\n#[derive(Copy, Clone, Debug)]\\n\\npub enum Xyz {\\n\\n X,\\n\\n Y,\\n\\n Z,\\n\\n}\\n\\n\\n\\n//------------------------------------------------------------------------------\\n\\n\\n\\n#[derive(Copy, Clone, Debug)]\\n\\npub enum VertexOrder {\\n\\n Xyz,\\n\\n Xzy,\\n\\n Yxz,\\n\\n Yzx,\\n\",\n \"file_path\": \"src/io/ply/types.rs\",\n \"rank\": 96,\n \"score\": 16.93610080669944\n },\n {\n \"content\": \"\\n\\n if line.is_empty() || line.starts_with(b\\\"#\\\") {\\n\\n continue;\\n\\n }\\n\\n\\n\\n if n_vertices.is_none() {\\n\\n let mut words = to_words_skip_empty(line);\\n\\n n_vertices = Some(\\n\\n words\\n\\n .next()\\n\\n .and_then(|word| from_ascii(word))\\n\\n .ok_or(OffError::LineParse(i_line))?,\\n\\n );\\n\\n ip.reserve(n_vertices.unwrap());\\n\\n\\n\\n continue;\\n\\n }\\n\\n\\n\\n // safe since checked above\\n\\n if n_added < n_vertices.unwrap() {\\n\",\n \"file_path\": \"src/io/off.rs\",\n \"rank\": 97,\n \"score\": 16.69218900455187\n },\n {\n \"content\": \" // skip \\\"map_Kd\\\"\\n\\n words.next().ok_or(MtlError::LineParse(i_line))?;\\n\\n if let Some(next_word) = words.next().and_then(|w| from_ascii(w)) {\\n\\n if let Some(mtl_name) = mtl_name.clone() {\\n\\n if let Some(mtl) = result.get_mut(&mtl_name) {\\n\\n mtl.texture_name = Some(next_word);\\n\\n } else {\\n\\n return Err(MtlError::NoMaterialError(i_line));\\n\\n }\\n\\n }\\n\\n }\\n\\n } else if line.starts_with(b\\\"Ns \\\") {\\n\\n let mut words = to_words_skip_empty(line);\\n\\n // skip \\\"map_Kd\\\"\\n\\n words.next().ok_or(MtlError::LineParse(i_line))?;\\n\\n if let Some(next_word) = words.next().and_then(|w| from_ascii(w)) {\\n\\n if let Some(mtl_name) = mtl_name.clone() {\\n\\n if let Some(mtl) = result.get_mut(&mtl_name) {\\n\\n mtl.specular_intensity = next_word;\\n\\n } else {\\n\",\n \"file_path\": \"src/io/mtl.rs\",\n \"rank\": 98,\n \"score\": 16.616580901777517\n },\n {\n \"content\": \" .ok_or(PlyError::LineParse(*i_line))?,\\n\\n );\\n\\n continue;\\n\\n }\\n\\n }\\n\\n Some(_) => {}\\n\\n }\\n\\n\\n\\n match opt_n_faces {\\n\\n None => {\\n\\n if line.starts_with(b\\\"element face\\\") {\\n\\n read_state = HeaderReadState::Face;\\n\\n let mut words = to_words_skip_empty(line);\\n\\n opt_n_faces = Some(\\n\\n words\\n\\n .nth(2)\\n\\n .and_then(|w| from_ascii(w))\\n\\n .ok_or(PlyError::LineParse(*i_line))?,\\n\\n );\\n\\n continue;\\n\",\n \"file_path\": \"src/io/ply/load.rs\",\n \"rank\": 99,\n \"score\": 16.525480002635454\n }\n]","isConversational":false}}},{"rowIdx":1387,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"step09/src/virtio.rs"},"repo_name":{"kind":"string","value":"13696652781/RSCV"},"commit":{"kind":"string","value":"f07db4aad2a5758ceae92fd41cd6e8520d117ace"},"file_code":{"kind":"string","value":"\n\nuse crate::bus::*;\nuse crate::cpu::*;\nuse crate::trap::*;\n\npub const VIRTIO_IRQ: u64 = 1;\n\nconst VRING_DESC_SIZE: u64 = 16;\n\nconst DESC_NUM: u64 = 8;\n\npub const VIRTIO_MAGIC: u64 = VIRTIO_BASE + 0x000;\n\npub const VIRTIO_VERSION: u64 = VIRTIO_BASE + 0x004;\n\npub const VIRTIO_DEVICE_ID: u64 = VIRTIO_BASE + 0x008;\n\npub const VIRTIO_VENDOR_ID: u64 = VIRTIO_BASE + 0x00c;\n\npub const VIRTIO_DEVICE_FEATURES: u64 = VIRTIO_BASE + 0x010;\n\npub const VIRTIO_DRIVER_FEATURES: u64 = VIRTIO_BASE + 0x020;\n\npub const VIRTIO_GUEST_PAGE_SIZE: u64 = VIRTIO_BASE + 0x028;\n\npub const VIRTIO_QUEUE_SEL: u64 = VIRTIO_BASE + 0x030;\n\npub const VIRTIO_QUEUE_NUM_MAX: u64 = VIRTIO_BASE + 0x034;\n\npub const VIRTIO_QUEUE_NUM: u64 = VIRTIO_BASE + 0x038;\n\npub const VIRTIO_QUEUE_PFN: u64 = VIRTIO_BASE + 0x040;\n\npub const VIRTIO_QUEUE_NOTIFY: u64 = VIRTIO_BASE + 0x050;\n\npub const VIRTIO_STATUS: u64 = VIRTIO_BASE + 0x070;\n\npub struct Virtio {\n id: u64,\n driver_features: u32,\n page_size: u32,\n queue_sel: u32,\n queue_num: u32,\n queue_pfn: u32,\n queue_notify: u32,\n status: u32,\n disk: Vec<u8>,\n}\n\nimpl Device for Virtio {\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\n match size {\n 32 => Ok(self.load32(addr)),\n _ => Err(Exception::LoadAccessFault),\n }\n }\n\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\n match size {\n 32 => Ok(self.store32(addr, value)),\n _ => Err(Exception::StoreAMOAccessFault),\n }\n }\n}\n\nimpl Virtio {\n \n pub fn new(disk_image: Vec<u8>) -> Self {\n let mut disk = Vec::new();\n disk.extend(disk_image.iter().cloned());\n\n Self {\n id: 0,\n driver_features: 0,\n page_size: 0,\n queue_sel: 0,\n queue_num: 0,\n queue_pfn: 0,\n queue_notify: 9999, \n status: 0,\n disk,\n }\n }\n\n \n pub fn is_interrupting(&mut self) -> bool {\n if self.queue_notify != 9999 {\n self.queue_notify = 9999;\n return true;\n }\n false\n }\n\n \n pub fn load32(&self, addr: u64) -> u64 {\n match addr {\n VIRTIO_MAGIC => 0x74726976,\n VIRTIO_VERSION => 0x1,\n VIRTIO_DEVICE_ID => 0x2,\n VIRTIO_VENDOR_ID => 0x554d4551,\n VIRTIO_DEVICE_FEATURES => 0, \n VIRTIO_DRIVER_FEATURES => self.driver_features as u64,\n VIRTIO_QUEUE_NUM_MAX => 8,\n VIRTIO_QUEUE_PFN => self.queue_pfn as u64,\n VIRTIO_STATUS => self.status as u64,\n _ => 0,\n }\n }\n\n \n pub fn store32(&mut self, addr: u64, value: u64) {\n let val = value as u32;\n match addr {\n VIRTIO_DEVICE_FEATURES => self.driver_features = val,\n VIRTIO_GUEST_PAGE_SIZE => self.page_size = val,\n VIRTIO_QUEUE_SEL => self.queue_sel = val,\n VIRTIO_QUEUE_NUM => self.queue_num = val,\n VIRTIO_QUEUE_PFN => self.queue_pfn = val,\n VIRTIO_QUEUE_NOTIFY => self.queue_notify = val,\n VIRTIO_STATUS => self.status = val,\n _ => {}\n }\n }\n\n fn get_new_id(&mut self) -> u64 {\n self.id = self.id.wrapping_add(1);\n self.id\n }\n\n fn desc_addr(&self) -> u64 {\n self.queue_pfn as u64 * self.page_size as u64\n }\n\n fn read_disk(&self, addr: u64) -> u64 {\n self.disk[addr as usize] as u64\n }\n\n fn write_disk(&mut self, addr: u64, value: u64) {\n self.disk[addr as usize] = value as u8\n }\n\n \n \n pub fn disk_access(cpu: &mut Cpu) {\n \n \n\n \n \n \n\n \n \n \n let desc_addr = cpu.bus.virtio.desc_addr();\n let avail_addr = cpu.bus.virtio.desc_addr() + 0x40;\n let used_addr = cpu.bus.virtio.desc_addr() + 4096;\n\n \n \n let offset = cpu\n .bus\n .load(avail_addr.wrapping_add(1), 16)\n .expect(\"failed to read offset\");\n \n \n let index = cpu\n .bus\n .load(\n avail_addr.wrapping_add(offset % DESC_NUM).wrapping_add(2),\n 16,\n )\n .expect(\"failed to read index\");\n\n \n let desc_addr0 = desc_addr + VRING_DESC_SIZE * index;\n let addr0 = cpu\n .bus\n .load(desc_addr0, 64)\n .expect(\"failed to read an address field in a descriptor\");\n \n \n \n \n \n \n \n \n let next0 = cpu\n .bus\n .load(desc_addr0.wrapping_add(14), 16)\n .expect(\"failed to read a next field in a descripor\");\n\n \n let desc_addr1 = desc_addr + VRING_DESC_SIZE * next0;\n let addr1 = cpu\n .bus\n .load(desc_addr1, 64)\n .expect(\"failed to read an address field in a descriptor\");\n let len1 = cpu\n .bus\n .load(desc_addr1.wrapping_add(8), 32)\n .expect(\"failed to read a length field in a descriptor\");\n let flags1 = cpu\n .bus\n .load(desc_addr1.wrapping_add(12), 16)\n .expect(\"failed to read a flags field in a descriptor\");\n\n \n \n \n \n \n \n let blk_sector = cpu\n .bus\n .load(addr0.wrapping_add(8), 64)\n .expect(\"failed to read a sector field in a virtio_blk_outhdr\");\n\n \n match (flags1 & 2) == 0 {\n true => {\n \n for i in 0..len1 as u64 {\n let data = cpu\n .bus\n .load(addr1 + i, 8)\n .expect(\"failed to read from memory\");\n cpu.bus.virtio.write_disk(blk_sector * 512 + i, data);\n }\n }\n false => {\n \n for i in 0..len1 as u64 {\n let data = cpu.bus.virtio.read_disk(blk_sector * 512 + i);\n cpu.bus\n .store(addr1 + i, 8, data)\n .expect(\"failed to write to memory\");\n }\n }\n };\n\n \n \n \n \n \n \n let new_id = cpu.bus.virtio.get_new_id();\n cpu.bus\n .store(used_addr.wrapping_add(2), 16, new_id % 8)\n .expect(\"failed to write to memory\");\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nuse crate::bus::*;\nuse crate::cpu::*;\nuse crate::trap::*;\n\npub const VIRTIO_IRQ: u64 = 1;\n\nconst VRING_DESC_SIZE: u64 = 16;\n\nconst DESC_NUM: u64 = 8;\n\npub const VIRTIO_MAGIC: u64 = VIRTIO_BASE + 0x000;\n\npub const VIRTIO_VERSION: u64 = VIRTIO_BASE + 0x004;\n\npub const VIRTIO_DEVICE_ID: u64 = VIRTIO_BASE + 0x008;\n\npub const VIRTIO_VENDOR_ID: u64 = VIRTIO_BASE + 0x00c;\n\npub const VIRTIO_DEVICE_FEATURES: u64 = VIRTIO_BASE + 0x010;\n\npub const VIRTIO_DRIVER_FEATURES: u64 = VIRTIO_BASE + 0x020;\n\npub const VIRTIO_GUEST_PAGE_SIZE: u64 = VIRTIO_BASE + 0x028;\n\npub const VIRTIO_QUEUE_SEL: u64 = VIRTIO_BASE + 0x030;\n\npub const VIRTIO_QUEUE_NUM_MAX: u64 = VIRTIO_BASE + 0x034;\n\npub const VIRTIO_QUEUE_NUM: u64 = VIRTIO_BASE + 0x038;\n\npub const VIRTIO_QUEUE_PFN: u64 = VIRTIO_BASE + 0x040;\n\npub const VIRTIO_QUEUE_NOTIFY: u64 = VIRTIO_BASE + 0x050;\n\npub const VIRTIO_STATUS: u64 = VIRTIO_BASE + 0x070;\n\npub struct Virtio {\n id: u64,\n driver_features: u32,\n page_size: u32,\n queue_sel: u32,\n queue_num: u32,\n queue_pfn: u32,\n queue_notify: u32,\n status: u32,\n disk: Vec<u8>,\n}\n\nimpl Device for Virtio {\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\n match size {\n 32 => Ok(self.load32(addr)),\n _ => Err(Exception::LoadAccessFault),\n }\n }\n\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\n "},"suffix":{"kind":"string","value":"\n }\n}\n\nimpl Virtio {\n \n pub fn new(disk_image: Vec<u8>) -> Self {\n let mut disk = Vec::new();\n disk.extend(disk_image.iter().cloned());\n\n Self {\n id: 0,\n driver_features: 0,\n page_size: 0,\n queue_sel: 0,\n queue_num: 0,\n queue_pfn: 0,\n queue_notify: 9999, \n status: 0,\n disk,\n }\n }\n\n \n pub fn is_interrupting(&mut self) -> bool {\n if self.queue_notify != 9999 {\n self.queue_notify = 9999;\n return true;\n }\n false\n }\n\n \n pub fn load32(&self, addr: u64) -> u64 {\n match addr {\n VIRTIO_MAGIC => 0x74726976,\n VIRTIO_VERSION => 0x1,\n VIRTIO_DEVICE_ID => 0x2,\n VIRTIO_VENDOR_ID => 0x554d4551,\n VIRTIO_DEVICE_FEATURES => 0, \n VIRTIO_DRIVER_FEATURES => self.driver_features as u64,\n VIRTIO_QUEUE_NUM_MAX => 8,\n VIRTIO_QUEUE_PFN => self.queue_pfn as u64,\n VIRTIO_STATUS => self.status as u64,\n _ => 0,\n }\n }\n\n \n pub fn store32(&mut self, addr: u64, value: u64) {\n let val = value as u32;\n match addr {\n VIRTIO_DEVICE_FEATURES => self.driver_features = val,\n VIRTIO_GUEST_PAGE_SIZE => self.page_size = val,\n VIRTIO_QUEUE_SEL => self.queue_sel = val,\n VIRTIO_QUEUE_NUM => self.queue_num = val,\n VIRTIO_QUEUE_PFN => self.queue_pfn = val,\n VIRTIO_QUEUE_NOTIFY => self.queue_notify = val,\n VIRTIO_STATUS => self.status = val,\n _ => {}\n }\n }\n\n fn get_new_id(&mut self) -> u64 {\n self.id = self.id.wrapping_add(1);\n self.id\n }\n\n fn desc_addr(&self) -> u64 {\n self.queue_pfn as u64 * self.page_size as u64\n }\n\n fn read_disk(&self, addr: u64) -> u64 {\n self.disk[addr as usize] as u64\n }\n\n fn write_disk(&mut self, addr: u64, value: u64) {\n self.disk[addr as usize] = value as u8\n }\n\n \n \n pub fn disk_access(cpu: &mut Cpu) {\n \n \n\n \n \n \n\n \n \n \n let desc_addr = cpu.bus.virtio.desc_addr();\n let avail_addr = cpu.bus.virtio.desc_addr() + 0x40;\n let used_addr = cpu.bus.virtio.desc_addr() + 4096;\n\n \n \n let offset = cpu\n .bus\n .load(avail_addr.wrapping_add(1), 16)\n .expect(\"failed to read offset\");\n \n \n let index = cpu\n .bus\n .load(\n avail_addr.wrapping_add(offset % DESC_NUM).wrapping_add(2),\n 16,\n )\n .expect(\"failed to read index\");\n\n \n let desc_addr0 = desc_addr + VRING_DESC_SIZE * index;\n let addr0 = cpu\n .bus\n .load(desc_addr0, 64)\n .expect(\"failed to read an address field in a descriptor\");\n \n \n \n \n \n \n \n \n let next0 = cpu\n .bus\n .load(desc_addr0.wrapping_add(14), 16)\n .expect(\"failed to read a next field in a descripor\");\n\n \n let desc_addr1 = desc_addr + VRING_DESC_SIZE * next0;\n let addr1 = cpu\n .bus\n .load(desc_addr1, 64)\n .expect(\"failed to read an address field in a descriptor\");\n let len1 = cpu\n .bus\n .load(desc_addr1.wrapping_add(8), 32)\n .expect(\"failed to read a length field in a descriptor\");\n let flags1 = cpu\n .bus\n .load(desc_addr1.wrapping_add(12), 16)\n .expect(\"failed to read a flags field in a descriptor\");\n\n \n \n \n \n \n \n let blk_sector = cpu\n .bus\n .load(addr0.wrapping_add(8), 64)\n .expect(\"failed to read a sector field in a virtio_blk_outhdr\");\n\n \n match (flags1 & 2) == 0 {\n true => {\n \n for i in 0..len1 as u64 {\n let data = cpu\n .bus\n .load(addr1 + i, 8)\n .expect(\"failed to read from memory\");\n cpu.bus.virtio.write_disk(blk_sector * 512 + i, data);\n }\n }\n false => {\n \n for i in 0..len1 as u64 {\n let data = cpu.bus.virtio.read_disk(blk_sector * 512 + i);\n cpu.bus\n .store(addr1 + i, 8, data)\n .expect(\"failed to write to memory\");\n }\n }\n };\n\n \n \n \n \n \n \n let new_id = cpu.bus.virtio.get_new_id();\n cpu.bus\n .store(used_addr.wrapping_add(2), 16, new_id % 8)\n .expect(\"failed to write to memory\");\n }\n}\n"},"middle":{"kind":"string","value":"match size {\n 32 => Ok(self.store32(addr, value)),\n _ => Err(Exception::StoreAMOAccessFault),\n }"},"strategy":{"kind":"string","value":"if_condition"},"context_items":{"kind":"list like","value":[{"content":"fn main() -> io::Result<()> {\n\n let args: Vec<String> = env::args().collect();\n\n\n\n if args.len() != 2 {\n\n panic!(\"Usage: rvemu-for-book <filename>\");\n\n }\n\n let mut file = File::open(&args[1])?;\n\n let mut binary = Vec::new();\n\n file.read_to_end(&mut binary)?;\n\n\n\n let mut cpu = Cpu::new(binary);\n\n\n\n loop {\n\n // 1. Fetch.\n\n let inst = match cpu.fetch() {\n\n // Break the loop if an error occurs.\n\n Ok(inst) => inst,\n\n Err(exception) => {\n\n exception.take_trap(&mut cpu);\n\n if exception.is_fatal() {\n","file_path":"step06/src/main.rs","rank":0,"score":104393.75999448093},{"content":"fn main() -> io::Result<()> {\n\n let args: Vec<String> = env::args().collect();\n\n\n\n if args.len() != 2 {\n\n panic!(\"Usage: rvemu-for-book <filename>\");\n\n }\n\n let mut file = File::open(&args[1])?;\n\n let mut binary = Vec::new();\n\n file.read_to_end(&mut binary)?;\n\n\n\n let mut cpu = Cpu::new(binary);\n\n\n\n loop {\n\n // 1. Fetch.\n\n let inst = match cpu.fetch() {\n\n // Break the loop if an error occurs.\n\n Ok(inst) => inst,\n\n Err(exception) => {\n\n exception.take_trap(&mut cpu);\n\n if exception.is_fatal() {\n","file_path":"step07/src/main.rs","rank":1,"score":104393.75999448093},{"content":"fn main() -> io::Result<()> {\n\n let args: Vec<String> = env::args().collect();\n\n\n\n if (args.len() != 2) && (args.len() != 3) {\n\n panic!(\"Usage: rvemu-for-book <filename> <(option) image>\");\n\n }\n\n let mut file = File::open(&args[1])?;\n\n let mut binary = Vec::new();\n\n file.read_to_end(&mut binary)?;\n\n\n\n let mut disk_image = Vec::new();\n\n if args.len() == 3 {\n\n let mut file = File::open(&args[2])?;\n\n file.read_to_end(&mut disk_image)?;\n\n }\n\n\n\n let mut cpu = Cpu::new(binary, disk_image);\n\n\n\n loop {\n\n // 1. Fetch.\n","file_path":"step10/src/main.rs","rank":2,"score":104393.75999448093},{"content":"fn main() -> io::Result<()> {\n\n let args: Vec<String> = env::args().collect();\n\n\n\n if args.len() != 2 {\n\n panic!(\"Usage: rvemu-for-book <filename>\");\n\n }\n\n let mut file = File::open(&args[1])?;\n\n let mut binary = Vec::new();\n\n file.read_to_end(&mut binary)?;\n\n\n\n let mut cpu = Cpu::new(binary);\n\n\n\n loop {\n\n // 1. Fetch.\n\n let inst = match cpu.fetch() {\n\n // Break the loop if an error occurs.\n\n Ok(inst) => inst,\n\n Err(_) => break,\n\n };\n\n\n","file_path":"step03/src/main.rs","rank":3,"score":104393.75999448093},{"content":"fn main() -> io::Result<()> {\n\n let args: Vec<String> = env::args().collect();\n\n\n\n if (args.len() != 2) && (args.len() != 3) {\n\n panic!(\"Usage: rvemu-for-book <filename> <(option) image>\");\n\n }\n\n let mut file = File::open(&args[1])?;\n\n let mut binary = Vec::new();\n\n file.read_to_end(&mut binary)?;\n\n\n\n let mut disk_image = Vec::new();\n\n if args.len() == 3 {\n\n let mut file = File::open(&args[2])?;\n\n file.read_to_end(&mut disk_image)?;\n\n }\n\n\n\n let mut cpu = Cpu::new(binary, disk_image);\n\n\n\n loop {\n\n // 1. Fetch.\n","file_path":"step09/src/main.rs","rank":4,"score":104393.75999448093},{"content":"fn main() -> io::Result<()> {\n\n let args: Vec<String> = env::args().collect();\n\n\n\n if args.len() != 2 {\n\n panic!(\"Usage: rvemu-for-book <filename>\");\n\n }\n\n let mut file = File::open(&args[1])?;\n\n let mut binary = Vec::new();\n\n file.read_to_end(&mut binary)?;\n\n\n\n let mut cpu = Cpu::new(binary);\n\n\n\n loop {\n\n // 1. Fetch.\n\n let inst = match cpu.fetch() {\n\n // Break the loop if an error occurs.\n\n Ok(inst) => inst,\n\n Err(exception) => {\n\n exception.take_trap(&mut cpu);\n\n if exception.is_fatal() {\n","file_path":"step05/src/main.rs","rank":5,"score":104393.75999448093},{"content":"fn main() -> io::Result<()> {\n\n let args: Vec<String> = env::args().collect();\n\n\n\n if args.len() != 2 {\n\n panic!(\"Usage: rvemu-for-book <filename>\");\n\n }\n\n let mut file = File::open(&args[1])?;\n\n let mut binary = Vec::new();\n\n file.read_to_end(&mut binary)?;\n\n\n\n let mut cpu = Cpu::new(binary);\n\n\n\n while cpu.pc < cpu.memory.len() as u64 {\n\n // 1. Fetch.\n\n let inst = cpu.fetch();\n\n\n\n // 2. Add 4 to the program counter.\n\n cpu.pc += 4;\n\n\n\n // 3. Decode.\n\n // 4. Execute.\n\n cpu.execute(inst);\n\n }\n\n cpu.dump_registers();\n\n\n\n Ok(())\n\n}\n","file_path":"step01/src/main.rs","rank":6,"score":104393.75999448093},{"content":"fn main() -> io::Result<()> {\n\n let args: Vec<String> = env::args().collect();\n\n\n\n if args.len() != 2 {\n\n panic!(\"Usage: rvemu-for-book <filename>\");\n\n }\n\n let mut file = File::open(&args[1])?;\n\n let mut binary = Vec::new();\n\n file.read_to_end(&mut binary)?;\n\n\n\n let mut cpu = Cpu::new(binary);\n\n\n\n loop {\n\n // 1. Fetch.\n\n let inst = match cpu.fetch() {\n\n // Break the loop if an error occurs.\n\n Ok(inst) => inst,\n\n Err(exception) => {\n\n exception.take_trap(&mut cpu);\n\n if exception.is_fatal() {\n","file_path":"step08/src/main.rs","rank":7,"score":104393.75999448093},{"content":"fn main() -> io::Result<()> {\n\n let args: Vec<String> = env::args().collect();\n\n\n\n if args.len() != 2 {\n\n panic!(\"Usage: rvemu-for-book <filename>\");\n\n }\n\n let mut file = File::open(&args[1])?;\n\n let mut binary = Vec::new();\n\n file.read_to_end(&mut binary)?;\n\n\n\n let mut cpu = Cpu::new(binary);\n\n\n\n loop {\n\n // 1. Fetch.\n\n let inst = match cpu.fetch() {\n\n // Break the loop if an error occurs.\n\n Ok(inst) => inst,\n\n Err(_) => break,\n\n };\n\n\n","file_path":"step02/src/main.rs","rank":8,"score":104393.75999448093},{"content":"fn main() -> io::Result<()> {\n\n let args: Vec<String> = env::args().collect();\n\n\n\n if args.len() != 2 {\n\n panic!(\"Usage: rvemu-for-book <filename>\");\n\n }\n\n let mut file = File::open(&args[1])?;\n\n let mut binary = Vec::new();\n\n file.read_to_end(&mut binary)?;\n\n\n\n let mut cpu = Cpu::new(binary);\n\n\n\n loop {\n\n // 1. Fetch.\n\n let inst = match cpu.fetch() {\n\n // Break the loop if an error occurs.\n\n Ok(inst) => inst,\n\n Err(_) => break,\n\n };\n\n\n","file_path":"step04/src/main.rs","rank":9,"score":104393.75999448093},{"content":"pub trait Device {\n\n fn load(&self, addr: u64, size: u64) -> Result<u64, Exception>;\n\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception>;\n\n}\n\n\n\n/// The system bus.\n\npub struct Bus {\n\n clint: Clint,\n\n plic: Plic,\n\n memory: Memory,\n\n}\n\n\n\nimpl Bus {\n\n /// Create a new system bus object.\n\n pub fn new(binary: Vec<u8>) -> Bus {\n\n Self {\n\n clint: Clint::new(),\n\n plic: Plic::new(),\n\n memory: Memory::new(binary),\n\n }\n","file_path":"step06/src/bus.rs","rank":10,"score":93089.85741602186},{"content":"pub trait Device {\n\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception>;\n\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception>;\n\n}\n\n\n\n/// The system bus.\n\npub struct Bus {\n\n clint: Clint,\n\n plic: Plic,\n\n pub uart: Uart,\n\n pub virtio: Virtio,\n\n memory: Memory,\n\n}\n\n\n\nimpl Bus {\n\n /// Create a new system bus object.\n\n pub fn new(binary: Vec<u8>, disk_image: Vec<u8>) -> Bus {\n\n Self {\n\n clint: Clint::new(),\n\n plic: Plic::new(),\n","file_path":"step10/src/bus.rs","rank":11,"score":93089.85741602186},{"content":"pub trait Device {\n\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception>;\n\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception>;\n\n}\n\n\n\n/// The system bus.\n\npub struct Bus {\n\n clint: Clint,\n\n plic: Plic,\n\n pub uart: Uart,\n\n pub virtio: Virtio,\n\n memory: Memory,\n\n}\n\n\n\nimpl Bus {\n\n /// Create a new system bus object.\n\n pub fn new(binary: Vec<u8>, disk_image: Vec<u8>) -> Bus {\n\n Self {\n\n clint: Clint::new(),\n\n plic: Plic::new(),\n","file_path":"step09/src/bus.rs","rank":12,"score":93089.85741602186},{"content":"pub trait Device {\n\n fn load(&self, addr: u64, size: u64) -> Result<u64, Exception>;\n\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception>;\n\n}\n\n\n\n/// The system bus.\n\npub struct Bus {\n\n memory: Memory,\n\n}\n\n\n\nimpl Bus {\n\n /// Create a new system bus object.\n\n pub fn new(binary: Vec<u8>) -> Bus {\n\n Self {\n\n memory: Memory::new(binary),\n\n }\n\n }\n\n\n\n pub fn load(&self, addr: u64, size: u64) -> Result<u64, Exception> {\n\n if MEMORY_BASE <= addr {\n","file_path":"step05/src/bus.rs","rank":13,"score":93089.85741602186},{"content":"pub trait Device {\n\n fn load(&self, addr: u64, size: u64) -> Result<u64, ()>;\n\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), ()>;\n\n}\n\n\n\n/// The system bus.\n\npub struct Bus {\n\n memory: Memory,\n\n}\n\n\n\nimpl Bus {\n\n /// Create a new system bus object.\n\n pub fn new(binary: Vec<u8>) -> Bus {\n\n Self {\n\n memory: Memory::new(binary),\n\n }\n\n }\n\n\n\n pub fn load(&self, addr: u64, size: u64) -> Result<u64, ()> {\n\n if MEMORY_BASE <= addr {\n","file_path":"step04/src/bus.rs","rank":14,"score":93089.85741602186},{"content":"pub trait Device {\n\n fn load(&self, addr: u64, size: u64) -> Result<u64, ()>;\n\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), ()>;\n\n}\n\n\n\n/// The system bus.\n\npub struct Bus {\n\n memory: Memory,\n\n}\n\n\n\nimpl Bus {\n\n /// Create a new system bus object.\n\n pub fn new(binary: Vec<u8>) -> Bus {\n\n Self {\n\n memory: Memory::new(binary),\n\n }\n\n }\n\n\n\n pub fn load(&self, addr: u64, size: u64) -> Result<u64, ()> {\n\n if MEMORY_BASE <= addr {\n","file_path":"step03/src/bus.rs","rank":15,"score":93089.85741602186},{"content":"pub trait Device {\n\n fn load(&self, addr: u64, size: u64) -> Result<u64, ()>;\n\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), ()>;\n\n}\n\n\n\n/// The system bus.\n\npub struct Bus {\n\n memory: Memory,\n\n}\n\n\n\nimpl Bus {\n\n /// Create a new system bus object.\n\n pub fn new(binary: Vec<u8>) -> Bus {\n\n Self {\n\n memory: Memory::new(binary),\n\n }\n\n }\n\n\n\n pub fn load(&self, addr: u64, size: u64) -> Result<u64, ()> {\n\n if MEMORY_BASE <= addr {\n","file_path":"step02/src/bus.rs","rank":16,"score":93089.85741602186},{"content":"pub trait Device {\n\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception>;\n\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception>;\n\n}\n\n\n\n/// The system bus.\n\npub struct Bus {\n\n clint: Clint,\n\n plic: Plic,\n\n uart: Uart,\n\n memory: Memory,\n\n}\n\n\n\nimpl Bus {\n\n /// Create a new system bus object.\n\n pub fn new(binary: Vec<u8>) -> Bus {\n\n Self {\n\n clint: Clint::new(),\n\n plic: Plic::new(),\n\n uart: Uart::new(),\n","file_path":"step07/src/bus.rs","rank":17,"score":93089.85741602186},{"content":"pub trait Device {\n\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception>;\n\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception>;\n\n}\n\n\n\n/// The system bus.\n\npub struct Bus {\n\n clint: Clint,\n\n plic: Plic,\n\n pub uart: Uart,\n\n memory: Memory,\n\n}\n\n\n\nimpl Bus {\n\n /// Create a new system bus object.\n\n pub fn new(binary: Vec<u8>) -> Bus {\n\n Self {\n\n clint: Clint::new(),\n\n plic: Plic::new(),\n\n uart: Uart::new(),\n","file_path":"step08/src/bus.rs","rank":18,"score":93089.85741602186},{"content":"/// The CPU to contain registers, a program coutner, and memory.\n\nstruct Cpu {\n\n /// 32 64-bit integer registers.\n\n regs: [u64; 32],\n\n /// Program counter to hold the the memory address of the next instruction that would be executed.\n\n pc: u64,\n\n /// Computer memory to store executable instructions.\n\n memory: Vec<u8>,\n\n}\n\n\n\nimpl Cpu {\n\n /// Create a new `Cpu` object.\n\n fn new(binary: Vec<u8>) -> Self {\n\n let mut regs = [0; 32];\n\n regs[2] = MEMORY_SIZE;\n\n\n\n Self {\n\n regs,\n\n pc: 0,\n\n memory: binary,\n\n }\n","file_path":"step01/src/main.rs","rank":19,"score":61046.844222439904},{"content":"/// The transfer of control to a trap handler caused by either an\n\n/// exception or an interrupt.\n\npub trait Trap {\n\n /// Returns an exception code that identifys the last exception.\n\n fn exception_code(&self) -> u64;\n\n /// Helper method for a trap handler.\n\n fn take_trap(&self, cpu: &mut Cpu) {\n\n let exception_pc = cpu.pc.wrapping_sub(4);\n\n let previous_mode = cpu.mode;\n\n\n\n let cause = self.exception_code();\n\n if (previous_mode <= Mode::Supervisor)\n\n && ((cpu.load_csr(MEDELEG).wrapping_shr(cause as u32)) & 1 != 0)\n\n {\n\n // Handle the trap in S-mode.\n\n cpu.mode = Mode::Supervisor;\n\n\n\n // Set the program counter to the supervisor trap-handler base address (stvec).\n\n cpu.pc = cpu.load_csr(STVEC) & !1;\n\n\n\n // 4.1.9 Supervisor Exception Program Counter (sepc)\n\n // \"The low bit of sepc (sepc[0]) is always zero.\"\n","file_path":"step07/src/trap.rs","rank":20,"score":55485.214292371296},{"content":"/// The transfer of control to a trap handler caused by either an\n\n/// exception or an interrupt.\n\npub trait Trap {\n\n /// Returns an exception code that identifys the last exception.\n\n fn exception_code(&self) -> u64;\n\n /// Trap handler.\n\n fn take_trap(&self, cpu: &mut Cpu);\n\n /// Helper method for a trap handler.\n\n fn take_trap_helper(&self, cpu: &mut Cpu, is_interrupt: bool) {\n\n let exception_pc = cpu.pc.wrapping_sub(4);\n\n let previous_mode = cpu.mode;\n\n\n\n let mut cause = self.exception_code();\n\n // Set an interrupt bit if a trap is an interrupt.\n\n if is_interrupt {\n\n cause = (1 << 63) | cause;\n\n }\n\n if (previous_mode <= Mode::Supervisor)\n\n && ((cpu.load_csr(MEDELEG).wrapping_shr(cause as u32)) & 1 != 0)\n\n {\n\n // Handle the trap in S-mode.\n\n cpu.mode = Mode::Supervisor;\n","file_path":"step08/src/trap.rs","rank":21,"score":55485.214292371296},{"content":"/// The transfer of control to a trap handler caused by either an\n\n/// exception or an interrupt.\n\npub trait Trap {\n\n /// Returns an exception code that identifys the last exception.\n\n fn exception_code(&self) -> u64;\n\n /// Trap handler.\n\n fn take_trap(&self, cpu: &mut Cpu);\n\n /// Helper method for a trap handler.\n\n fn take_trap_helper(&self, cpu: &mut Cpu, is_interrupt: bool) {\n\n let exception_pc = cpu.pc.wrapping_sub(4);\n\n let previous_mode = cpu.mode;\n\n\n\n let mut cause = self.exception_code();\n\n // Set an interrupt bit if a trap is an interrupt.\n\n if is_interrupt {\n\n cause = (1 << 63) | cause;\n\n }\n\n if (previous_mode <= Mode::Supervisor)\n\n && ((cpu.load_csr(MEDELEG).wrapping_shr(cause as u32)) & 1 != 0)\n\n {\n\n // Handle the trap in S-mode.\n\n cpu.mode = Mode::Supervisor;\n","file_path":"step10/src/trap.rs","rank":22,"score":55485.214292371296},{"content":"/// The transfer of control to a trap handler caused by either an\n\n/// exception or an interrupt.\n\npub trait Trap {\n\n /// Returns an exception code that identifys the last exception.\n\n fn exception_code(&self) -> u64;\n\n /// Helper method for a trap handler.\n\n fn take_trap(&self, cpu: &mut Cpu) {\n\n let exception_pc = cpu.pc.wrapping_sub(4);\n\n let previous_mode = cpu.mode;\n\n\n\n let cause = self.exception_code();\n\n if (previous_mode <= Mode::Supervisor)\n\n && ((cpu.load_csr(MEDELEG).wrapping_shr(cause as u32)) & 1 != 0)\n\n {\n\n // Handle the trap in S-mode.\n\n cpu.mode = Mode::Supervisor;\n\n\n\n // Set the program counter to the supervisor trap-handler base address (stvec).\n\n cpu.pc = cpu.load_csr(STVEC) & !1;\n\n\n\n // 4.1.9 Supervisor Exception Program Counter (sepc)\n\n // \"The low bit of sepc (sepc[0]) is always zero.\"\n","file_path":"step05/src/trap.rs","rank":23,"score":55485.214292371296},{"content":"/// The transfer of control to a trap handler caused by either an\n\n/// exception or an interrupt.\n\npub trait Trap {\n\n /// Returns an exception code that identifys the last exception.\n\n fn exception_code(&self) -> u64;\n\n /// Helper method for a trap handler.\n\n fn take_trap(&self, cpu: &mut Cpu) {\n\n let exception_pc = cpu.pc.wrapping_sub(4);\n\n let previous_mode = cpu.mode;\n\n\n\n let cause = self.exception_code();\n\n if (previous_mode <= Mode::Supervisor)\n\n && ((cpu.load_csr(MEDELEG).wrapping_shr(cause as u32)) & 1 != 0)\n\n {\n\n // Handle the trap in S-mode.\n\n cpu.mode = Mode::Supervisor;\n\n\n\n // Set the program counter to the supervisor trap-handler base address (stvec).\n\n cpu.pc = cpu.load_csr(STVEC) & !1;\n\n\n\n // 4.1.9 Supervisor Exception Program Counter (sepc)\n\n // \"The low bit of sepc (sepc[0]) is always zero.\"\n","file_path":"step06/src/trap.rs","rank":24,"score":55485.214292371296},{"content":"/// The transfer of control to a trap handler caused by either an\n\n/// exception or an interrupt.\n\npub trait Trap {\n\n /// Returns an exception code that identifys the last exception.\n\n fn exception_code(&self) -> u64;\n\n /// Trap handler.\n\n fn take_trap(&self, cpu: &mut Cpu);\n\n /// Helper method for a trap handler.\n\n fn take_trap_helper(&self, cpu: &mut Cpu, is_interrupt: bool) {\n\n let exception_pc = cpu.pc.wrapping_sub(4);\n\n let previous_mode = cpu.mode;\n\n\n\n let mut cause = self.exception_code();\n\n // Set an interrupt bit if a trap is an interrupt.\n\n if is_interrupt {\n\n cause = (1 << 63) | cause;\n\n }\n\n if (previous_mode <= Mode::Supervisor)\n\n && ((cpu.load_csr(MEDELEG).wrapping_shr(cause as u32)) & 1 != 0)\n\n {\n\n // Handle the trap in S-mode.\n\n cpu.mode = Mode::Supervisor;\n","file_path":"step09/src/trap.rs","rank":25,"score":55485.214292371296},{"content":" fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\n\n match size {\n\n 32 => Ok(self.load32(addr)),\n\n _ => Err(Exception::LoadAccessFault),\n\n }\n\n }\n\n\n\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\n\n match size {\n\n 32 => Ok(self.store32(addr, value)),\n\n _ => Err(Exception::StoreAMOAccessFault),\n\n }\n\n }\n\n}\n\n\n\nimpl Virtio {\n\n /// Create a new virtio object.\n\n pub fn new(disk_image: Vec<u8>) -> Self {\n\n let mut disk = Vec::new();\n\n disk.extend(disk_image.iter().cloned());\n","file_path":"step10/src/virtio.rs","rank":27,"score":40237.222282289236},{"content":" pub fn store32(&mut self, addr: u64, value: u64) {\n\n let val = value as u32;\n\n match addr {\n\n VIRTIO_DEVICE_FEATURES => self.driver_features = val,\n\n VIRTIO_GUEST_PAGE_SIZE => self.page_size = val,\n\n VIRTIO_QUEUE_SEL => self.queue_sel = val,\n\n VIRTIO_QUEUE_NUM => self.queue_num = val,\n\n VIRTIO_QUEUE_PFN => self.queue_pfn = val,\n\n VIRTIO_QUEUE_NOTIFY => self.queue_notify = val,\n\n VIRTIO_STATUS => self.status = val,\n\n _ => {}\n\n }\n\n }\n\n\n\n fn get_new_id(&mut self) -> u64 {\n\n self.id = self.id.wrapping_add(1);\n\n self.id\n\n }\n\n\n\n fn desc_addr(&self) -> u64 {\n","file_path":"step10/src/virtio.rs","rank":29,"score":40226.75680733346},{"content":"pub const VIRTIO_QUEUE_NOTIFY: u64 = VIRTIO_BASE + 0x050;\n\n/// Device status, read and write. Reading from this register returns the current device status flags.\n\n/// Writing non-zero values to this register sets the status flags, indicating the OS/driver\n\n/// progress. Writing zero (0x0) to this register triggers a device reset.\n\npub const VIRTIO_STATUS: u64 = VIRTIO_BASE + 0x070;\n\n\n\n/// Paravirtualized drivers for IO virtualization.\n\npub struct Virtio {\n\n id: u64,\n\n driver_features: u32,\n\n page_size: u32,\n\n queue_sel: u32,\n\n queue_num: u32,\n\n queue_pfn: u32,\n\n queue_notify: u32,\n\n status: u32,\n\n disk: Vec<u8>,\n\n}\n\n\n\nimpl Device for Virtio {\n","file_path":"step10/src/virtio.rs","rank":31,"score":40225.52531242547},{"content":" self.queue_pfn as u64 * self.page_size as u64\n\n }\n\n\n\n fn read_disk(&self, addr: u64) -> u64 {\n\n self.disk[addr as usize] as u64\n\n }\n\n\n\n fn write_disk(&mut self, addr: u64, value: u64) {\n\n self.disk[addr as usize] = value as u8\n\n }\n\n\n\n /// Access the disk via virtio. This is an associated function which takes a `cpu` object to\n\n /// read and write with a memory directly (DMA).\n\n pub fn disk_access(cpu: &mut Cpu) {\n\n // See more information in\n\n // https://github.com/mit-pdos/xv6-riscv/blob/riscv/kernel/virtio_disk.c\n\n\n\n // the spec says that legacy block operations use three\n\n // descriptors: one for type/reserved/sector, one for\n\n // the data, one for a 1-byte status result.\n","file_path":"step10/src/virtio.rs","rank":32,"score":40221.41997652512},{"content":"pub const VIRTIO_VERSION: u64 = VIRTIO_BASE + 0x004;\n\n/// device type; 1 is net, 2 is disk.\n\npub const VIRTIO_DEVICE_ID: u64 = VIRTIO_BASE + 0x008;\n\n/// Always return 0x554d4551\n\npub const VIRTIO_VENDOR_ID: u64 = VIRTIO_BASE + 0x00c;\n\n/// Device features.\n\npub const VIRTIO_DEVICE_FEATURES: u64 = VIRTIO_BASE + 0x010;\n\n/// Driver features.\n\npub const VIRTIO_DRIVER_FEATURES: u64 = VIRTIO_BASE + 0x020;\n\n/// Page size for PFN, write-only.\n\npub const VIRTIO_GUEST_PAGE_SIZE: u64 = VIRTIO_BASE + 0x028;\n\n/// Select queue, write-only.\n\npub const VIRTIO_QUEUE_SEL: u64 = VIRTIO_BASE + 0x030;\n\n/// Max size of current queue, read-only. In QEMU, `VIRTIO_COUNT = 8`.\n\npub const VIRTIO_QUEUE_NUM_MAX: u64 = VIRTIO_BASE + 0x034;\n\n/// Size of current queue, write-only.\n\npub const VIRTIO_QUEUE_NUM: u64 = VIRTIO_BASE + 0x038;\n\n/// Physical page number for queue, read and write.\n\npub const VIRTIO_QUEUE_PFN: u64 = VIRTIO_BASE + 0x040;\n\n/// Notify the queue number, write-only.\n","file_path":"step10/src/virtio.rs","rank":34,"score":40217.81793432597},{"content":" false\n\n }\n\n\n\n /// Load 4 bytes from virtio only if the addr is valid. Otherwise, return 0.\n\n pub fn load32(&self, addr: u64) -> u64 {\n\n match addr {\n\n VIRTIO_MAGIC => 0x74726976,\n\n VIRTIO_VERSION => 0x1,\n\n VIRTIO_DEVICE_ID => 0x2,\n\n VIRTIO_VENDOR_ID => 0x554d4551,\n\n VIRTIO_DEVICE_FEATURES => 0, // TODO: what should it return?\n\n VIRTIO_DRIVER_FEATURES => self.driver_features as u64,\n\n VIRTIO_QUEUE_NUM_MAX => 8,\n\n VIRTIO_QUEUE_PFN => self.queue_pfn as u64,\n\n VIRTIO_STATUS => self.status as u64,\n\n _ => 0,\n\n }\n\n }\n\n\n\n /// Store 4 bytes to virtio only if the addr is valid. Otherwise, does nothing.\n","file_path":"step10/src/virtio.rs","rank":37,"score":40217.009345708655},{"content":"//! The virtio module contains a virtualization standard for network and disk device drivers.\n\n//! This is the \"legacy\" virtio interface.\n\n//!\n\n//! The virtio spec:\n\n//! https://docs.oasis-open.org/virtio/virtio/v1.1/virtio-v1.1.pdf\n\n\n\nuse crate::bus::*;\n\nuse crate::cpu::*;\n\nuse crate::trap::*;\n\n\n\n/// The interrupt request of virtio.\n\npub const VIRTIO_IRQ: u64 = 1;\n\n\n\nconst VRING_DESC_SIZE: u64 = 16;\n\n/// The number of virtio descriptors. It must be a power of two.\n\nconst DESC_NUM: u64 = 8;\n\n\n\n/// Always return 0x74726976.\n\npub const VIRTIO_MAGIC: u64 = VIRTIO_BASE + 0x000;\n\n/// The version. 1 is legacy.\n","file_path":"step10/src/virtio.rs","rank":38,"score":40215.5551568459},{"content":" }\n\n false => {\n\n // Read disk data and write it to memory directly (DMA).\n\n for i in 0..len1 as u64 {\n\n let data = cpu.bus.virtio.read_disk(blk_sector * 512 + i);\n\n cpu.bus\n\n .store(addr1 + i, 8, data)\n\n .expect(\"failed to write to memory\");\n\n }\n\n }\n\n };\n\n\n\n // Write id to `UsedArea`. Add 2 because of its structure.\n\n // struct UsedArea {\n\n // uint16 flags;\n\n // uint16 id;\n\n // struct VRingUsedElem elems[NUM];\n\n // };\n\n let new_id = cpu.bus.virtio.get_new_id();\n\n cpu.bus\n\n .store(used_addr.wrapping_add(2), 16, new_id % 8)\n\n .expect(\"failed to write to memory\");\n\n }\n\n}\n","file_path":"step10/src/virtio.rs","rank":40,"score":40211.47706527354},{"content":"\n\n Self {\n\n id: 0,\n\n driver_features: 0,\n\n page_size: 0,\n\n queue_sel: 0,\n\n queue_num: 0,\n\n queue_pfn: 0,\n\n queue_notify: 9999, // TODO: what is the correct initial value?\n\n status: 0,\n\n disk,\n\n }\n\n }\n\n\n\n /// Return true if an interrupt is pending.\n\n pub fn is_interrupting(&mut self) -> bool {\n\n if self.queue_notify != 9999 {\n\n self.queue_notify = 9999;\n\n return true;\n\n }\n","file_path":"step10/src/virtio.rs","rank":42,"score":40209.60768745074},{"content":"\n\n // desc = pages -- num * VRingDesc\n\n // avail = pages + 0x40 -- 2 * uint16, then num * uint16\n\n // used = pages + 4096 -- 2 * uint16, then num * vRingUsedElem\n\n let desc_addr = cpu.bus.virtio.desc_addr();\n\n let avail_addr = cpu.bus.virtio.desc_addr() + 0x40;\n\n let used_addr = cpu.bus.virtio.desc_addr() + 4096;\n\n\n\n // avail[0] is flags\n\n // avail[1] tells the device how far to look in avail[2...].\n\n let offset = cpu\n\n .bus\n\n .load(avail_addr.wrapping_add(1), 16)\n\n .expect(\"failed to read offset\");\n\n // avail[2...] are desc[] indices the device should process.\n\n // we only tell device the first index in our chain of descriptors.\n\n let index = cpu\n\n .bus\n\n .load(\n\n avail_addr.wrapping_add(offset % DESC_NUM).wrapping_add(2),\n","file_path":"step10/src/virtio.rs","rank":45,"score":40205.706693824606},{"content":" // uint32 type;\n\n // uint32 reserved;\n\n // uint64 sector;\n\n // } buf0;\n\n let blk_sector = cpu\n\n .bus\n\n .load(addr0.wrapping_add(8), 64)\n\n .expect(\"failed to read a sector field in a virtio_blk_outhdr\");\n\n\n\n // Write to a device if the second bit `flag1` is set.\n\n match (flags1 & 2) == 0 {\n\n true => {\n\n // Read memory data and write it to a disk directly (DMA).\n\n for i in 0..len1 as u64 {\n\n let data = cpu\n\n .bus\n\n .load(addr1 + i, 8)\n\n .expect(\"failed to read from memory\");\n\n cpu.bus.virtio.write_disk(blk_sector * 512 + i, data);\n\n }\n","file_path":"step10/src/virtio.rs","rank":47,"score":40204.97645475709},{"content":" 16,\n\n )\n\n .expect(\"failed to read index\");\n\n\n\n // Read `VRingDesc`, virtio descriptors.\n\n let desc_addr0 = desc_addr + VRING_DESC_SIZE * index;\n\n let addr0 = cpu\n\n .bus\n\n .load(desc_addr0, 64)\n\n .expect(\"failed to read an address field in a descriptor\");\n\n // Add 14 because of `VRingDesc` structure.\n\n // struct VRingDesc {\n\n // uint64 addr;\n\n // uint32 len;\n\n // uint16 flags;\n\n // uint16 next\n\n // };\n\n // The `next` field can be accessed by offset 14 (8 + 4 + 2) bytes.\n\n let next0 = cpu\n\n .bus\n","file_path":"step10/src/virtio.rs","rank":49,"score":40197.841330413285},{"content":" .load(desc_addr0.wrapping_add(14), 16)\n\n .expect(\"failed to read a next field in a descripor\");\n\n\n\n // Read `VRingDesc` again, virtio descriptors.\n\n let desc_addr1 = desc_addr + VRING_DESC_SIZE * next0;\n\n let addr1 = cpu\n\n .bus\n\n .load(desc_addr1, 64)\n\n .expect(\"failed to read an address field in a descriptor\");\n\n let len1 = cpu\n\n .bus\n\n .load(desc_addr1.wrapping_add(8), 32)\n\n .expect(\"failed to read a length field in a descriptor\");\n\n let flags1 = cpu\n\n .bus\n\n .load(desc_addr1.wrapping_add(12), 16)\n\n .expect(\"failed to read a flags field in a descriptor\");\n\n\n\n // Read `virtio_blk_outhdr`. Add 8 because of its structure.\n\n // struct virtio_blk_outhdr {\n","file_path":"step10/src/virtio.rs","rank":51,"score":40197.5243348636},{"content":"impl Device for Clint {\n\n fn load(&self, addr: u64, size: u64) -> Result<u64, Exception> {\n\n match size {\n\n 64 => Ok(self.load64(addr)),\n\n _ => Err(Exception::LoadAccessFault),\n\n }\n\n }\n\n\n\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\n\n match size {\n\n 64 => Ok(self.store64(addr, value)),\n\n _ => Err(Exception::StoreAMOAccessFault),\n\n }\n\n }\n\n}\n\n\n\nimpl Clint {\n\n /// Create a new `Clint` object.\n\n pub fn new() -> Self {\n\n Self {\n","file_path":"step06/src/clint.rs","rank":52,"score":47.71070694758223},{"content":"impl Device for Clint {\n\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\n\n match size {\n\n 64 => Ok(self.load64(addr)),\n\n _ => Err(Exception::LoadAccessFault),\n\n }\n\n }\n\n\n\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\n\n match size {\n\n 64 => Ok(self.store64(addr, value)),\n\n _ => Err(Exception::StoreAMOAccessFault),\n\n }\n\n }\n\n}\n\n\n\nimpl Clint {\n\n /// Create a new `Clint` object.\n\n pub fn new() -> Self {\n\n Self {\n","file_path":"step08/src/clint.rs","rank":53,"score":47.548470694029625},{"content":"impl Device for Clint {\n\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\n\n match size {\n\n 64 => Ok(self.load64(addr)),\n\n _ => Err(Exception::LoadAccessFault),\n\n }\n\n }\n\n\n\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\n\n match size {\n\n 64 => Ok(self.store64(addr, value)),\n\n _ => Err(Exception::StoreAMOAccessFault),\n\n }\n\n }\n\n}\n\n\n\nimpl Clint {\n\n /// Create a new `Clint` object.\n\n pub fn new() -> Self {\n\n Self {\n","file_path":"step09/src/clint.rs","rank":54,"score":47.54847069402964},{"content":"impl Device for Clint {\n\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\n\n match size {\n\n 64 => Ok(self.load64(addr)),\n\n _ => Err(Exception::LoadAccessFault),\n\n }\n\n }\n\n\n\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\n\n match size {\n\n 64 => Ok(self.store64(addr, value)),\n\n _ => Err(Exception::StoreAMOAccessFault),\n\n }\n\n }\n\n}\n\n\n\nimpl Clint {\n\n /// Create a new `Clint` object.\n\n pub fn new() -> Self {\n\n Self {\n","file_path":"step10/src/clint.rs","rank":55,"score":47.54847069402963},{"content":"impl Device for Clint {\n\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\n\n match size {\n\n 64 => Ok(self.load64(addr)),\n\n _ => Err(Exception::LoadAccessFault),\n\n }\n\n }\n\n\n\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\n\n match size {\n\n 64 => Ok(self.store64(addr, value)),\n\n _ => Err(Exception::StoreAMOAccessFault),\n\n }\n\n }\n\n}\n\n\n\nimpl Clint {\n\n /// Create a new `Clint` object.\n\n pub fn new() -> Self {\n\n Self {\n","file_path":"step07/src/clint.rs","rank":56,"score":47.54847069402963},{"content":"pub struct Uart {\n\n /// Pair of an array for UART buffer and a conditional variable.\n\n uart: Arc<(Mutex<[u8; UART_SIZE as usize]>, Condvar)>,\n\n /// Bit if an interrupt happens.\n\n interrupting: Arc<AtomicBool>,\n\n}\n\n\n\nimpl Device for Uart {\n\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\n\n match size {\n\n 8 => Ok(self.load8(addr)),\n\n _ => Err(Exception::LoadAccessFault),\n\n }\n\n }\n\n\n\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\n\n match size {\n\n 8 => Ok(self.store8(addr, value)),\n\n _ => Err(Exception::StoreAMOAccessFault),\n\n }\n","file_path":"step08/src/uart.rs","rank":57,"score":40.40137951543964},{"content":"pub struct Uart {\n\n /// Pair of an array for UART buffer and a conditional variable.\n\n uart: Arc<(Mutex<[u8; UART_SIZE as usize]>, Condvar)>,\n\n /// Bit if an interrupt happens.\n\n interrupting: Arc<AtomicBool>,\n\n}\n\n\n\nimpl Device for Uart {\n\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\n\n match size {\n\n 8 => Ok(self.load8(addr)),\n\n _ => Err(Exception::LoadAccessFault),\n\n }\n\n }\n\n\n\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\n\n match size {\n\n 8 => Ok(self.store8(addr, value)),\n\n _ => Err(Exception::StoreAMOAccessFault),\n\n }\n","file_path":"step10/src/uart.rs","rank":58,"score":40.40137951543964},{"content":"pub struct Uart {\n\n /// Pair of an array for UART buffer and a conditional variable.\n\n uart: Arc<(Mutex<[u8; UART_SIZE as usize]>, Condvar)>,\n\n /// Bit if an interrupt happens.\n\n interrupting: Arc<AtomicBool>,\n\n}\n\n\n\nimpl Device for Uart {\n\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\n\n match size {\n\n 8 => Ok(self.load8(addr)),\n\n _ => Err(Exception::LoadAccessFault),\n\n }\n\n }\n\n\n\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\n\n match size {\n\n 8 => Ok(self.store8(addr, value)),\n\n _ => Err(Exception::StoreAMOAccessFault),\n\n }\n","file_path":"step09/src/uart.rs","rank":59,"score":40.40137951543964},{"content":" senable: u64,\n\n spriority: u64,\n\n sclaim: u64,\n\n}\n\n\n\nimpl Device for Plic {\n\n fn load(&self, addr: u64, size: u64) -> Result<u64, Exception> {\n\n match size {\n\n 32 => Ok(self.load32(addr)),\n\n _ => Err(Exception::LoadAccessFault),\n\n }\n\n }\n\n\n\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\n\n match size {\n\n 32 => Ok(self.store32(addr, value)),\n\n _ => Err(Exception::StoreAMOAccessFault),\n\n }\n\n }\n\n}\n","file_path":"step06/src/plic.rs","rank":60,"score":39.697289755172484},{"content":" senable: u64,\n\n spriority: u64,\n\n sclaim: u64,\n\n}\n\n\n\nimpl Device for Plic {\n\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\n\n match size {\n\n 32 => Ok(self.load32(addr)),\n\n _ => Err(Exception::LoadAccessFault),\n\n }\n\n }\n\n\n\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\n\n match size {\n\n 32 => Ok(self.store32(addr, value)),\n\n _ => Err(Exception::StoreAMOAccessFault),\n\n }\n\n }\n\n}\n","file_path":"step07/src/plic.rs","rank":61,"score":39.566843443417504},{"content":" senable: u64,\n\n spriority: u64,\n\n sclaim: u64,\n\n}\n\n\n\nimpl Device for Plic {\n\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\n\n match size {\n\n 32 => Ok(self.load32(addr)),\n\n _ => Err(Exception::LoadAccessFault),\n\n }\n\n }\n\n\n\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\n\n match size {\n\n 32 => Ok(self.store32(addr, value)),\n\n _ => Err(Exception::StoreAMOAccessFault),\n\n }\n\n }\n\n}\n","file_path":"step09/src/plic.rs","rank":62,"score":39.566843443417504},{"content":" senable: u64,\n\n spriority: u64,\n\n sclaim: u64,\n\n}\n\n\n\nimpl Device for Plic {\n\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\n\n match size {\n\n 32 => Ok(self.load32(addr)),\n\n _ => Err(Exception::LoadAccessFault),\n\n }\n\n }\n\n\n\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\n\n match size {\n\n 32 => Ok(self.store32(addr, value)),\n\n _ => Err(Exception::StoreAMOAccessFault),\n\n }\n\n }\n\n}\n","file_path":"step08/src/plic.rs","rank":63,"score":39.5668434434175},{"content":" senable: u64,\n\n spriority: u64,\n\n sclaim: u64,\n\n}\n\n\n\nimpl Device for Plic {\n\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\n\n match size {\n\n 32 => Ok(self.load32(addr)),\n\n _ => Err(Exception::LoadAccessFault),\n\n }\n\n }\n\n\n\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\n\n match size {\n\n 32 => Ok(self.store32(addr, value)),\n\n _ => Err(Exception::StoreAMOAccessFault),\n\n }\n\n }\n\n}\n","file_path":"step10/src/plic.rs","rank":64,"score":39.5668434434175},{"content":" /// Bit if an interrupt happens.\n\n interrupting: Arc<AtomicBool>,\n\n}\n\n\n\nimpl Device for Uart {\n\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\n\n match size {\n\n 8 => Ok(self.load8(addr)),\n\n _ => Err(Exception::LoadAccessFault),\n\n }\n\n }\n\n\n\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\n\n match size {\n\n 8 => Ok(self.store8(addr, value)),\n\n _ => Err(Exception::StoreAMOAccessFault),\n\n }\n\n }\n\n}\n\n\n","file_path":"step07/src/uart.rs","rank":65,"score":39.22528712780178},{"content":"//! The memory module contains a memory structure and implementation for memory access.\n\n\n\nuse crate::bus::*;\n\nuse crate::trap::*;\n\n\n\n/// Default memory size (128MiB).\n\npub const MEMORY_SIZE: u64 = 1024 * 1024 * 128;\n\n\n\n/// The dynamic random access memory (DRAM).\n\n#[derive(Debug)]\n\npub struct Memory {\n\n pub memory: Vec<u8>,\n\n}\n\n\n\nimpl Device for Memory {\n\n fn load(&self, addr: u64, size: u64) -> Result<u64, Exception> {\n\n match size {\n\n 8 => Ok(self.load8(addr)),\n\n 16 => Ok(self.load16(addr)),\n\n 32 => Ok(self.load32(addr)),\n","file_path":"step05/src/memory.rs","rank":66,"score":39.100729737377506},{"content":"//! The memory module contains a memory structure and implementation for memory access.\n\n\n\nuse crate::bus::*;\n\nuse crate::trap::*;\n\n\n\n/// Default memory size (128MiB).\n\npub const MEMORY_SIZE: u64 = 1024 * 1024 * 128;\n\n\n\n/// The dynamic random access memory (DRAM).\n\n#[derive(Debug)]\n\npub struct Memory {\n\n pub memory: Vec<u8>,\n\n}\n\n\n\nimpl Device for Memory {\n\n fn load(&self, addr: u64, size: u64) -> Result<u64, Exception> {\n\n match size {\n\n 8 => Ok(self.load8(addr)),\n\n 16 => Ok(self.load16(addr)),\n\n 32 => Ok(self.load32(addr)),\n","file_path":"step06/src/memory.rs","rank":67,"score":39.10072973737751},{"content":"//! The memory module contains a memory structure and implementation for memory access.\n\n\n\nuse crate::bus::*;\n\nuse crate::trap::*;\n\n\n\n/// Default memory size (128MiB).\n\npub const MEMORY_SIZE: u64 = 1024 * 1024 * 128;\n\n\n\n/// The dynamic random access memory (DRAM).\n\n#[derive(Debug)]\n\npub struct Memory {\n\n pub memory: Vec<u8>,\n\n}\n\n\n\nimpl Device for Memory {\n\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\n\n match size {\n\n 8 => Ok(self.load8(addr)),\n\n 16 => Ok(self.load16(addr)),\n\n 32 => Ok(self.load32(addr)),\n","file_path":"step08/src/memory.rs","rank":68,"score":38.94906626992906},{"content":"//! The memory module contains a memory structure and implementation for memory access.\n\n\n\nuse crate::bus::*;\n\nuse crate::trap::*;\n\n\n\n/// Default memory size (128MiB).\n\npub const MEMORY_SIZE: u64 = 1024 * 1024 * 128;\n\n\n\n/// The dynamic random access memory (DRAM).\n\n#[derive(Debug)]\n\npub struct Memory {\n\n pub memory: Vec<u8>,\n\n}\n\n\n\nimpl Device for Memory {\n\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\n\n match size {\n\n 8 => Ok(self.load8(addr)),\n\n 16 => Ok(self.load16(addr)),\n\n 32 => Ok(self.load32(addr)),\n","file_path":"step10/src/memory.rs","rank":69,"score":38.94906626992906},{"content":"//! The memory module contains a memory structure and implementation for memory access.\n\n\n\nuse crate::bus::*;\n\nuse crate::trap::*;\n\n\n\n/// Default memory size (128MiB).\n\npub const MEMORY_SIZE: u64 = 1024 * 1024 * 128;\n\n\n\n/// The dynamic random access memory (DRAM).\n\n#[derive(Debug)]\n\npub struct Memory {\n\n pub memory: Vec<u8>,\n\n}\n\n\n\nimpl Device for Memory {\n\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\n\n match size {\n\n 8 => Ok(self.load8(addr)),\n\n 16 => Ok(self.load16(addr)),\n\n 32 => Ok(self.load32(addr)),\n","file_path":"step07/src/memory.rs","rank":70,"score":38.94906626992906},{"content":"//! The memory module contains a memory structure and implementation for memory access.\n\n\n\nuse crate::bus::*;\n\nuse crate::trap::*;\n\n\n\n/// Default memory size (128MiB).\n\npub const MEMORY_SIZE: u64 = 1024 * 1024 * 128;\n\n\n\n/// The dynamic random access memory (DRAM).\n\n#[derive(Debug)]\n\npub struct Memory {\n\n pub memory: Vec<u8>,\n\n}\n\n\n\nimpl Device for Memory {\n\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\n\n match size {\n\n 8 => Ok(self.load8(addr)),\n\n 16 => Ok(self.load16(addr)),\n\n 32 => Ok(self.load32(addr)),\n","file_path":"step09/src/memory.rs","rank":71,"score":38.94906626992906},{"content":" pub fn store_csr(&mut self, addr: usize, value: u64) {\n\n match addr {\n\n SIE => {\n\n self.csrs[MIE] =\n\n (self.csrs[MIE] & !self.csrs[MIDELEG]) | (value & self.csrs[MIDELEG]);\n\n }\n\n _ => self.csrs[addr] = value,\n\n }\n\n }\n\n\n\n /// Load a value from a memory.\n\n pub fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\n\n self.bus.load(addr, size)\n\n }\n\n\n\n /// Store a value to a memory.\n\n pub fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\n\n self.bus.store(addr, size, value)\n\n }\n\n\n","file_path":"step08/src/cpu.rs","rank":72,"score":36.35398844934246},{"content":" 64 => Ok(self.load64(addr)),\n\n _ => Err(Exception::LoadAccessFault),\n\n }\n\n }\n\n\n\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\n\n match size {\n\n 8 => Ok(self.store8(addr, value)),\n\n 16 => Ok(self.store16(addr, value)),\n\n 32 => Ok(self.store32(addr, value)),\n\n 64 => Ok(self.store64(addr, value)),\n\n _ => Err(Exception::StoreAMOAccessFault),\n\n }\n\n }\n\n}\n\n\n\nimpl Memory {\n\n /// Create a new `Memory` object with default memory size.\n\n pub fn new(binary: Vec<u8>) -> Memory {\n\n let mut memory = vec![0; MEMORY_SIZE as usize];\n","file_path":"step05/src/memory.rs","rank":73,"score":36.1478578601221},{"content":" 64 => Ok(self.load64(addr)),\n\n _ => Err(Exception::LoadAccessFault),\n\n }\n\n }\n\n\n\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\n\n match size {\n\n 8 => Ok(self.store8(addr, value)),\n\n 16 => Ok(self.store16(addr, value)),\n\n 32 => Ok(self.store32(addr, value)),\n\n 64 => Ok(self.store64(addr, value)),\n\n _ => Err(Exception::StoreAMOAccessFault),\n\n }\n\n }\n\n}\n\n\n\nimpl Memory {\n\n /// Create a new `Memory` object with default memory size.\n\n pub fn new(binary: Vec<u8>) -> Memory {\n\n let mut memory = vec![0; MEMORY_SIZE as usize];\n","file_path":"step06/src/memory.rs","rank":74,"score":36.147857860122095},{"content":" 64 => Ok(self.load64(addr)),\n\n _ => Err(Exception::LoadAccessFault),\n\n }\n\n }\n\n\n\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\n\n match size {\n\n 8 => Ok(self.store8(addr, value)),\n\n 16 => Ok(self.store16(addr, value)),\n\n 32 => Ok(self.store32(addr, value)),\n\n 64 => Ok(self.store64(addr, value)),\n\n _ => Err(Exception::StoreAMOAccessFault),\n\n }\n\n }\n\n}\n\n\n\nimpl Memory {\n\n /// Create a new `Memory` object with default memory size.\n\n pub fn new(binary: Vec<u8>) -> Memory {\n\n let mut memory = vec![0; MEMORY_SIZE as usize];\n","file_path":"step08/src/memory.rs","rank":75,"score":36.1478578601221},{"content":" 64 => Ok(self.load64(addr)),\n\n _ => Err(Exception::LoadAccessFault),\n\n }\n\n }\n\n\n\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\n\n match size {\n\n 8 => Ok(self.store8(addr, value)),\n\n 16 => Ok(self.store16(addr, value)),\n\n 32 => Ok(self.store32(addr, value)),\n\n 64 => Ok(self.store64(addr, value)),\n\n _ => Err(Exception::StoreAMOAccessFault),\n\n }\n\n }\n\n}\n\n\n\nimpl Memory {\n\n /// Create a new `Memory` object with default memory size.\n\n pub fn new(binary: Vec<u8>) -> Memory {\n\n let mut memory = vec![0; MEMORY_SIZE as usize];\n","file_path":"step09/src/memory.rs","rank":76,"score":36.1478578601221},{"content":" 64 => Ok(self.load64(addr)),\n\n _ => Err(Exception::LoadAccessFault),\n\n }\n\n }\n\n\n\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\n\n match size {\n\n 8 => Ok(self.store8(addr, value)),\n\n 16 => Ok(self.store16(addr, value)),\n\n 32 => Ok(self.store32(addr, value)),\n\n 64 => Ok(self.store64(addr, value)),\n\n _ => Err(Exception::StoreAMOAccessFault),\n\n }\n\n }\n\n}\n\n\n\nimpl Memory {\n\n /// Create a new `Memory` object with default memory size.\n\n pub fn new(binary: Vec<u8>) -> Memory {\n\n let mut memory = vec![0; MEMORY_SIZE as usize];\n","file_path":"step10/src/memory.rs","rank":77,"score":36.147857860122095},{"content":" 64 => Ok(self.load64(addr)),\n\n _ => Err(Exception::LoadAccessFault),\n\n }\n\n }\n\n\n\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\n\n match size {\n\n 8 => Ok(self.store8(addr, value)),\n\n 16 => Ok(self.store16(addr, value)),\n\n 32 => Ok(self.store32(addr, value)),\n\n 64 => Ok(self.store64(addr, value)),\n\n _ => Err(Exception::StoreAMOAccessFault),\n\n }\n\n }\n\n}\n\n\n\nimpl Memory {\n\n /// Create a new `Memory` object with default memory size.\n\n pub fn new(binary: Vec<u8>) -> Memory {\n\n let mut memory = vec![0; MEMORY_SIZE as usize];\n","file_path":"step07/src/memory.rs","rank":78,"score":36.147857860122095},{"content":"//! The memory module contains a memory structure and implementation for memory access.\n\n\n\nuse crate::bus::*;\n\n\n\n/// Default memory size (128MiB).\n\npub const MEMORY_SIZE: u64 = 1024 * 1024 * 128;\n\n\n\n/// The dynamic random access memory (DRAM).\n\n#[derive(Debug)]\n\npub struct Memory {\n\n pub memory: Vec<u8>,\n\n}\n\n\n\nimpl Device for Memory {\n\n fn load(&self, addr: u64, size: u64) -> Result<u64, ()> {\n\n match size {\n\n 8 => Ok(self.load8(addr)),\n\n 16 => Ok(self.load16(addr)),\n\n 32 => Ok(self.load32(addr)),\n\n 64 => Ok(self.load64(addr)),\n","file_path":"step02/src/memory.rs","rank":79,"score":35.316985180086974},{"content":"//! The memory module contains a memory structure and implementation for memory access.\n\n\n\nuse crate::bus::*;\n\n\n\n/// Default memory size (128MiB).\n\npub const MEMORY_SIZE: u64 = 1024 * 1024 * 128;\n\n\n\n/// The dynamic random access memory (DRAM).\n\n#[derive(Debug)]\n\npub struct Memory {\n\n pub memory: Vec<u8>,\n\n}\n\n\n\nimpl Device for Memory {\n\n fn load(&self, addr: u64, size: u64) -> Result<u64, ()> {\n\n match size {\n\n 8 => Ok(self.load8(addr)),\n\n 16 => Ok(self.load16(addr)),\n\n 32 => Ok(self.load32(addr)),\n\n 64 => Ok(self.load64(addr)),\n","file_path":"step04/src/memory.rs","rank":80,"score":35.316985180086974},{"content":"//! The memory module contains a memory structure and implementation for memory access.\n\n\n\nuse crate::bus::*;\n\n\n\n/// Default memory size (128MiB).\n\npub const MEMORY_SIZE: u64 = 1024 * 1024 * 128;\n\n\n\n/// The dynamic random access memory (DRAM).\n\n#[derive(Debug)]\n\npub struct Memory {\n\n pub memory: Vec<u8>,\n\n}\n\n\n\nimpl Device for Memory {\n\n fn load(&self, addr: u64, size: u64) -> Result<u64, ()> {\n\n match size {\n\n 8 => Ok(self.load8(addr)),\n\n 16 => Ok(self.load16(addr)),\n\n 32 => Ok(self.load32(addr)),\n\n 64 => Ok(self.load64(addr)),\n","file_path":"step03/src/memory.rs","rank":81,"score":35.31698518008698},{"content":" return self.memory.load(addr, size);\n\n }\n\n Err(Exception::LoadAccessFault)\n\n }\n\n\n\n pub fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\n\n if CLINT_BASE <= addr && addr < CLINT_BASE + CLINT_SIZE {\n\n return self.clint.store(addr, size, value);\n\n }\n\n if PLIC_BASE <= addr && addr < PLIC_BASE + PLIC_SIZE {\n\n return self.plic.store(addr, size, value);\n\n }\n\n if UART_BASE <= addr && addr < UART_BASE + UART_SIZE {\n\n return self.uart.store(addr, size, value);\n\n }\n\n if VIRTIO_BASE <= addr && addr < VIRTIO_BASE + VIRTIO_SIZE {\n\n return self.virtio.store(addr, size, value);\n\n }\n\n if MEMORY_BASE <= addr {\n\n return self.memory.store(addr, size, value);\n\n }\n\n Err(Exception::StoreAMOAccessFault)\n\n }\n\n}\n","file_path":"step09/src/bus.rs","rank":82,"score":34.54944104027901},{"content":" return self.memory.load(addr, size);\n\n }\n\n Err(Exception::LoadAccessFault)\n\n }\n\n\n\n pub fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\n\n if CLINT_BASE <= addr && addr < CLINT_BASE + CLINT_SIZE {\n\n return self.clint.store(addr, size, value);\n\n }\n\n if PLIC_BASE <= addr && addr < PLIC_BASE + PLIC_SIZE {\n\n return self.plic.store(addr, size, value);\n\n }\n\n if UART_BASE <= addr && addr < UART_BASE + UART_SIZE {\n\n return self.uart.store(addr, size, value);\n\n }\n\n if VIRTIO_BASE <= addr && addr < VIRTIO_BASE + VIRTIO_SIZE {\n\n return self.virtio.store(addr, size, value);\n\n }\n\n if MEMORY_BASE <= addr {\n\n return self.memory.store(addr, size, value);\n\n }\n\n Err(Exception::StoreAMOAccessFault)\n\n }\n\n}\n","file_path":"step10/src/bus.rs","rank":83,"score":34.54944104027901},{"content":" SIE => {\n\n self.csrs[MIE] =\n\n (self.csrs[MIE] & !self.csrs[MIDELEG]) | (value & self.csrs[MIDELEG]);\n\n }\n\n _ => self.csrs[addr] = value,\n\n }\n\n }\n\n\n\n /// Load a value from a memory.\n\n pub fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\n\n self.bus.load(addr, size)\n\n }\n\n\n\n /// Store a value to a memory.\n\n pub fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\n\n self.bus.store(addr, size, value)\n\n }\n\n\n\n /// Get an instruction from the memory.\n\n pub fn fetch(&mut self) -> Result<u64, Exception> {\n","file_path":"step07/src/cpu.rs","rank":84,"score":34.086090623295455},{"content":" SIE => {\n\n self.csrs[MIE] =\n\n (self.csrs[MIE] & !self.csrs[MIDELEG]) | (value & self.csrs[MIDELEG]);\n\n }\n\n _ => self.csrs[addr] = value,\n\n }\n\n }\n\n\n\n /// Load a value from a memory.\n\n pub fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\n\n self.bus.load(addr, size)\n\n }\n\n\n\n /// Store a value to a memory.\n\n pub fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\n\n self.bus.store(addr, size, value)\n\n }\n\n\n\n /// Get an instruction from the memory.\n\n pub fn fetch(&mut self) -> Result<u64, Exception> {\n","file_path":"step05/src/cpu.rs","rank":85,"score":34.086090623295455},{"content":" SIE => {\n\n self.csrs[MIE] =\n\n (self.csrs[MIE] & !self.csrs[MIDELEG]) | (value & self.csrs[MIDELEG]);\n\n }\n\n _ => self.csrs[addr] = value,\n\n }\n\n }\n\n\n\n /// Load a value from a memory.\n\n pub fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\n\n self.bus.load(addr, size)\n\n }\n\n\n\n /// Store a value to a memory.\n\n pub fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\n\n self.bus.store(addr, size, value)\n\n }\n\n\n\n /// Get an instruction from the memory.\n\n pub fn fetch(&mut self) -> Result<u64, Exception> {\n","file_path":"step06/src/cpu.rs","rank":86,"score":34.08609062329546},{"content":"\n\n /// Store a value to a memory.\n\n pub fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\n\n let p_addr = self.translate(addr, AccessType::Store)?;\n\n self.bus.store(p_addr, size, value)\n\n }\n\n\n\n /// Get an instruction from the memory.\n\n pub fn fetch(&mut self) -> Result<u64, Exception> {\n\n let p_pc = self.translate(self.pc, AccessType::Instruction)?;\n\n match self.bus.load(p_pc, 32) {\n\n Ok(inst) => Ok(inst),\n\n Err(_e) => Err(Exception::InstructionAccessFault),\n\n }\n\n }\n\n\n\n /// Execute an instruction after decoding. Return true if an error happens, otherwise false.\n\n pub fn execute(&mut self, inst: u64) -> Result<(), Exception> {\n\n let opcode = inst & 0x0000007f;\n\n let rd = ((inst & 0x00000f80) >> 7) as usize;\n","file_path":"step10/src/cpu.rs","rank":87,"score":33.696420600009496},{"content":" _ => self.csrs[addr],\n\n }\n\n }\n\n\n\n /// Store a value to a CSR.\n\n pub fn store_csr(&mut self, addr: usize, value: u64) {\n\n match addr {\n\n SIE => {\n\n self.csrs[MIE] =\n\n (self.csrs[MIE] & !self.csrs[MIDELEG]) | (value & self.csrs[MIDELEG]);\n\n }\n\n _ => self.csrs[addr] = value,\n\n }\n\n }\n\n\n\n /// Load a value from a memory.\n\n pub fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\n\n let p_addr = self.translate(addr, AccessType::Load)?;\n\n self.bus.load(p_addr, size)\n\n }\n","file_path":"step10/src/cpu.rs","rank":88,"score":33.37439635884545},{"content":" SIE => self.csrs[MIE] & self.csrs[MIDELEG],\n\n _ => self.csrs[addr],\n\n }\n\n }\n\n\n\n /// Store a value to a CSR.\n\n pub fn store_csr(&mut self, addr: usize, value: u64) {\n\n match addr {\n\n SIE => {\n\n self.csrs[MIE] =\n\n (self.csrs[MIE] & !self.csrs[MIDELEG]) | (value & self.csrs[MIDELEG]);\n\n }\n\n _ => self.csrs[addr] = value,\n\n }\n\n }\n\n\n\n /// Load a value from a memory.\n\n pub fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\n\n self.bus.load(addr, size)\n\n }\n","file_path":"step09/src/cpu.rs","rank":89,"score":33.32426821463284},{"content":"\n\n /// Store a value to a memory.\n\n pub fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\n\n self.bus.store(addr, size, value)\n\n }\n\n\n\n /// Get an instruction from the memory.\n\n pub fn fetch(&mut self) -> Result<u64, Exception> {\n\n match self.bus.load(self.pc, 32) {\n\n Ok(inst) => Ok(inst),\n\n Err(_e) => Err(Exception::InstructionAccessFault),\n\n }\n\n }\n\n\n\n /// Execute an instruction after decoding. Return true if an error happens, otherwise false.\n\n pub fn execute(&mut self, inst: u64) -> Result<(), Exception> {\n\n let opcode = inst & 0x0000007f;\n\n let rd = ((inst & 0x00000f80) >> 7) as usize;\n\n let rs1 = ((inst & 0x000f8000) >> 15) as usize;\n\n let rs2 = ((inst & 0x01f00000) >> 20) as usize;\n","file_path":"step09/src/cpu.rs","rank":90,"score":33.23179024771652},{"content":" self.csrs[MIE] =\n\n (self.csrs[MIE] & !self.csrs[MIDELEG]) | (value & self.csrs[MIDELEG]);\n\n }\n\n _ => self.csrs[addr] = value,\n\n }\n\n }\n\n\n\n /// Load a value from a memory.\n\n pub fn load(&mut self, addr: u64, size: u64) -> Result<u64, ()> {\n\n self.bus.load(addr, size)\n\n }\n\n\n\n /// Store a value to a memory.\n\n pub fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), ()> {\n\n self.bus.store(addr, size, value)\n\n }\n\n\n\n /// Get an instruction from the memory.\n\n pub fn fetch(&mut self) -> Result<u64, ()> {\n\n match self.bus.load(self.pc, 32) {\n","file_path":"step04/src/cpu.rs","rank":91,"score":32.575272332270806},{"content":" println!(\"{}\", output);\n\n }\n\n\n\n /// Load a value from a memory.\n\n pub fn load(&mut self, addr: u64, size: u64) -> Result<u64, ()> {\n\n self.bus.load(addr, size)\n\n }\n\n\n\n /// Store a value to a memory.\n\n pub fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), ()> {\n\n self.bus.store(addr, size, value)\n\n }\n\n\n\n /// Get an instruction from the memory.\n\n pub fn fetch(&mut self) -> Result<u64, ()> {\n\n match self.bus.load(self.pc, 32) {\n\n Ok(inst) => Ok(inst),\n\n Err(_e) => Err(()),\n\n }\n\n }\n","file_path":"step02/src/cpu.rs","rank":92,"score":32.38509771067909},{"content":" _ => Err(()),\n\n }\n\n }\n\n\n\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), ()> {\n\n match size {\n\n 8 => Ok(self.store8(addr, value)),\n\n 16 => Ok(self.store16(addr, value)),\n\n 32 => Ok(self.store32(addr, value)),\n\n 64 => Ok(self.store64(addr, value)),\n\n _ => Err(()),\n\n }\n\n }\n\n}\n\n\n\nimpl Memory {\n\n /// Create a new `Memory` object with default memory size.\n\n pub fn new(binary: Vec<u8>) -> Memory {\n\n let mut memory = vec![0; MEMORY_SIZE as usize];\n\n memory.splice(..binary.len(), binary.iter().cloned());\n","file_path":"step04/src/memory.rs","rank":93,"score":32.211373280605514},{"content":" _ => Err(()),\n\n }\n\n }\n\n\n\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), ()> {\n\n match size {\n\n 8 => Ok(self.store8(addr, value)),\n\n 16 => Ok(self.store16(addr, value)),\n\n 32 => Ok(self.store32(addr, value)),\n\n 64 => Ok(self.store64(addr, value)),\n\n _ => Err(()),\n\n }\n\n }\n\n}\n\n\n\nimpl Memory {\n\n /// Create a new `Memory` object with default memory size.\n\n pub fn new(binary: Vec<u8>) -> Memory {\n\n let mut memory = vec![0; MEMORY_SIZE as usize];\n\n memory.splice(..binary.len(), binary.iter().cloned());\n","file_path":"step03/src/memory.rs","rank":94,"score":32.211373280605514},{"content":" _ => Err(()),\n\n }\n\n }\n\n\n\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), ()> {\n\n match size {\n\n 8 => Ok(self.store8(addr, value)),\n\n 16 => Ok(self.store16(addr, value)),\n\n 32 => Ok(self.store32(addr, value)),\n\n 64 => Ok(self.store64(addr, value)),\n\n _ => Err(()),\n\n }\n\n }\n\n}\n\n\n\nimpl Memory {\n\n /// Create a new `Memory` object with default memory size.\n\n pub fn new(binary: Vec<u8>) -> Memory {\n\n let mut memory = vec![0; MEMORY_SIZE as usize];\n\n memory.splice(..binary.len(), binary.iter().cloned());\n","file_path":"step02/src/memory.rs","rank":95,"score":32.21137328060552},{"content":" uart: Uart::new(),\n\n virtio: Virtio::new(disk_image),\n\n memory: Memory::new(binary),\n\n }\n\n }\n\n\n\n pub fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\n\n if CLINT_BASE <= addr && addr < CLINT_BASE + CLINT_SIZE {\n\n return self.clint.load(addr, size);\n\n }\n\n if PLIC_BASE <= addr && addr < PLIC_BASE + PLIC_SIZE {\n\n return self.plic.load(addr, size);\n\n }\n\n if UART_BASE <= addr && addr < UART_BASE + UART_SIZE {\n\n return self.uart.load(addr, size);\n\n }\n\n if VIRTIO_BASE <= addr && addr < VIRTIO_BASE + VIRTIO_SIZE {\n\n return self.virtio.load(addr, size);\n\n }\n\n if MEMORY_BASE <= addr {\n","file_path":"step09/src/bus.rs","rank":96,"score":32.1063318657451},{"content":" uart: Uart::new(),\n\n virtio: Virtio::new(disk_image),\n\n memory: Memory::new(binary),\n\n }\n\n }\n\n\n\n pub fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\n\n if CLINT_BASE <= addr && addr < CLINT_BASE + CLINT_SIZE {\n\n return self.clint.load(addr, size);\n\n }\n\n if PLIC_BASE <= addr && addr < PLIC_BASE + PLIC_SIZE {\n\n return self.plic.load(addr, size);\n\n }\n\n if UART_BASE <= addr && addr < UART_BASE + UART_SIZE {\n\n return self.uart.load(addr, size);\n\n }\n\n if VIRTIO_BASE <= addr && addr < VIRTIO_BASE + VIRTIO_SIZE {\n\n return self.virtio.load(addr, size);\n\n }\n\n if MEMORY_BASE <= addr {\n","file_path":"step10/src/bus.rs","rank":97,"score":32.10633186574509},{"content":" }\n\n\n\n pub fn load(&self, addr: u64, size: u64) -> Result<u64, Exception> {\n\n if CLINT_BASE <= addr && addr < CLINT_BASE + CLINT_SIZE {\n\n return self.clint.load(addr, size);\n\n }\n\n if PLIC_BASE <= addr && addr < PLIC_BASE + PLIC_SIZE {\n\n return self.plic.load(addr, size);\n\n }\n\n if MEMORY_BASE <= addr {\n\n return self.memory.load(addr, size);\n\n }\n\n Err(Exception::LoadAccessFault)\n\n }\n\n\n\n pub fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\n\n if CLINT_BASE <= addr && addr < CLINT_BASE + CLINT_SIZE {\n\n return self.clint.store(addr, size, value);\n\n }\n\n if PLIC_BASE <= addr && addr < PLIC_BASE + PLIC_SIZE {\n\n return self.plic.store(addr, size, value);\n\n }\n\n if MEMORY_BASE <= addr {\n\n return self.memory.store(addr, size, value);\n\n }\n\n Err(Exception::StoreAMOAccessFault)\n\n }\n\n}\n","file_path":"step06/src/bus.rs","rank":98,"score":31.93868862060419},{"content":" return self.memory.load(addr, size);\n\n }\n\n Err(Exception::LoadAccessFault)\n\n }\n\n\n\n pub fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\n\n if MEMORY_BASE <= addr {\n\n return self.memory.store(addr, size, value);\n\n }\n\n Err(Exception::StoreAMOAccessFault)\n\n }\n\n}\n","file_path":"step05/src/bus.rs","rank":99,"score":31.439669198842715}],"string":"[\n {\n \"content\": \"fn main() -> io::Result<()> {\\n\\n let args: Vec<String> = env::args().collect();\\n\\n\\n\\n if args.len() != 2 {\\n\\n panic!(\\\"Usage: rvemu-for-book <filename>\\\");\\n\\n }\\n\\n let mut file = File::open(&args[1])?;\\n\\n let mut binary = Vec::new();\\n\\n file.read_to_end(&mut binary)?;\\n\\n\\n\\n let mut cpu = Cpu::new(binary);\\n\\n\\n\\n loop {\\n\\n // 1. Fetch.\\n\\n let inst = match cpu.fetch() {\\n\\n // Break the loop if an error occurs.\\n\\n Ok(inst) => inst,\\n\\n Err(exception) => {\\n\\n exception.take_trap(&mut cpu);\\n\\n if exception.is_fatal() {\\n\",\n \"file_path\": \"step06/src/main.rs\",\n \"rank\": 0,\n \"score\": 104393.75999448093\n },\n {\n \"content\": \"fn main() -> io::Result<()> {\\n\\n let args: Vec<String> = env::args().collect();\\n\\n\\n\\n if args.len() != 2 {\\n\\n panic!(\\\"Usage: rvemu-for-book <filename>\\\");\\n\\n }\\n\\n let mut file = File::open(&args[1])?;\\n\\n let mut binary = Vec::new();\\n\\n file.read_to_end(&mut binary)?;\\n\\n\\n\\n let mut cpu = Cpu::new(binary);\\n\\n\\n\\n loop {\\n\\n // 1. Fetch.\\n\\n let inst = match cpu.fetch() {\\n\\n // Break the loop if an error occurs.\\n\\n Ok(inst) => inst,\\n\\n Err(exception) => {\\n\\n exception.take_trap(&mut cpu);\\n\\n if exception.is_fatal() {\\n\",\n \"file_path\": \"step07/src/main.rs\",\n \"rank\": 1,\n \"score\": 104393.75999448093\n },\n {\n \"content\": \"fn main() -> io::Result<()> {\\n\\n let args: Vec<String> = env::args().collect();\\n\\n\\n\\n if (args.len() != 2) && (args.len() != 3) {\\n\\n panic!(\\\"Usage: rvemu-for-book <filename> <(option) image>\\\");\\n\\n }\\n\\n let mut file = File::open(&args[1])?;\\n\\n let mut binary = Vec::new();\\n\\n file.read_to_end(&mut binary)?;\\n\\n\\n\\n let mut disk_image = Vec::new();\\n\\n if args.len() == 3 {\\n\\n let mut file = File::open(&args[2])?;\\n\\n file.read_to_end(&mut disk_image)?;\\n\\n }\\n\\n\\n\\n let mut cpu = Cpu::new(binary, disk_image);\\n\\n\\n\\n loop {\\n\\n // 1. Fetch.\\n\",\n \"file_path\": \"step10/src/main.rs\",\n \"rank\": 2,\n \"score\": 104393.75999448093\n },\n {\n \"content\": \"fn main() -> io::Result<()> {\\n\\n let args: Vec<String> = env::args().collect();\\n\\n\\n\\n if args.len() != 2 {\\n\\n panic!(\\\"Usage: rvemu-for-book <filename>\\\");\\n\\n }\\n\\n let mut file = File::open(&args[1])?;\\n\\n let mut binary = Vec::new();\\n\\n file.read_to_end(&mut binary)?;\\n\\n\\n\\n let mut cpu = Cpu::new(binary);\\n\\n\\n\\n loop {\\n\\n // 1. Fetch.\\n\\n let inst = match cpu.fetch() {\\n\\n // Break the loop if an error occurs.\\n\\n Ok(inst) => inst,\\n\\n Err(_) => break,\\n\\n };\\n\\n\\n\",\n \"file_path\": \"step03/src/main.rs\",\n \"rank\": 3,\n \"score\": 104393.75999448093\n },\n {\n \"content\": \"fn main() -> io::Result<()> {\\n\\n let args: Vec<String> = env::args().collect();\\n\\n\\n\\n if (args.len() != 2) && (args.len() != 3) {\\n\\n panic!(\\\"Usage: rvemu-for-book <filename> <(option) image>\\\");\\n\\n }\\n\\n let mut file = File::open(&args[1])?;\\n\\n let mut binary = Vec::new();\\n\\n file.read_to_end(&mut binary)?;\\n\\n\\n\\n let mut disk_image = Vec::new();\\n\\n if args.len() == 3 {\\n\\n let mut file = File::open(&args[2])?;\\n\\n file.read_to_end(&mut disk_image)?;\\n\\n }\\n\\n\\n\\n let mut cpu = Cpu::new(binary, disk_image);\\n\\n\\n\\n loop {\\n\\n // 1. Fetch.\\n\",\n \"file_path\": \"step09/src/main.rs\",\n \"rank\": 4,\n \"score\": 104393.75999448093\n },\n {\n \"content\": \"fn main() -> io::Result<()> {\\n\\n let args: Vec<String> = env::args().collect();\\n\\n\\n\\n if args.len() != 2 {\\n\\n panic!(\\\"Usage: rvemu-for-book <filename>\\\");\\n\\n }\\n\\n let mut file = File::open(&args[1])?;\\n\\n let mut binary = Vec::new();\\n\\n file.read_to_end(&mut binary)?;\\n\\n\\n\\n let mut cpu = Cpu::new(binary);\\n\\n\\n\\n loop {\\n\\n // 1. Fetch.\\n\\n let inst = match cpu.fetch() {\\n\\n // Break the loop if an error occurs.\\n\\n Ok(inst) => inst,\\n\\n Err(exception) => {\\n\\n exception.take_trap(&mut cpu);\\n\\n if exception.is_fatal() {\\n\",\n \"file_path\": \"step05/src/main.rs\",\n \"rank\": 5,\n \"score\": 104393.75999448093\n },\n {\n \"content\": \"fn main() -> io::Result<()> {\\n\\n let args: Vec<String> = env::args().collect();\\n\\n\\n\\n if args.len() != 2 {\\n\\n panic!(\\\"Usage: rvemu-for-book <filename>\\\");\\n\\n }\\n\\n let mut file = File::open(&args[1])?;\\n\\n let mut binary = Vec::new();\\n\\n file.read_to_end(&mut binary)?;\\n\\n\\n\\n let mut cpu = Cpu::new(binary);\\n\\n\\n\\n while cpu.pc < cpu.memory.len() as u64 {\\n\\n // 1. Fetch.\\n\\n let inst = cpu.fetch();\\n\\n\\n\\n // 2. Add 4 to the program counter.\\n\\n cpu.pc += 4;\\n\\n\\n\\n // 3. Decode.\\n\\n // 4. Execute.\\n\\n cpu.execute(inst);\\n\\n }\\n\\n cpu.dump_registers();\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"step01/src/main.rs\",\n \"rank\": 6,\n \"score\": 104393.75999448093\n },\n {\n \"content\": \"fn main() -> io::Result<()> {\\n\\n let args: Vec<String> = env::args().collect();\\n\\n\\n\\n if args.len() != 2 {\\n\\n panic!(\\\"Usage: rvemu-for-book <filename>\\\");\\n\\n }\\n\\n let mut file = File::open(&args[1])?;\\n\\n let mut binary = Vec::new();\\n\\n file.read_to_end(&mut binary)?;\\n\\n\\n\\n let mut cpu = Cpu::new(binary);\\n\\n\\n\\n loop {\\n\\n // 1. Fetch.\\n\\n let inst = match cpu.fetch() {\\n\\n // Break the loop if an error occurs.\\n\\n Ok(inst) => inst,\\n\\n Err(exception) => {\\n\\n exception.take_trap(&mut cpu);\\n\\n if exception.is_fatal() {\\n\",\n \"file_path\": \"step08/src/main.rs\",\n \"rank\": 7,\n \"score\": 104393.75999448093\n },\n {\n \"content\": \"fn main() -> io::Result<()> {\\n\\n let args: Vec<String> = env::args().collect();\\n\\n\\n\\n if args.len() != 2 {\\n\\n panic!(\\\"Usage: rvemu-for-book <filename>\\\");\\n\\n }\\n\\n let mut file = File::open(&args[1])?;\\n\\n let mut binary = Vec::new();\\n\\n file.read_to_end(&mut binary)?;\\n\\n\\n\\n let mut cpu = Cpu::new(binary);\\n\\n\\n\\n loop {\\n\\n // 1. Fetch.\\n\\n let inst = match cpu.fetch() {\\n\\n // Break the loop if an error occurs.\\n\\n Ok(inst) => inst,\\n\\n Err(_) => break,\\n\\n };\\n\\n\\n\",\n \"file_path\": \"step02/src/main.rs\",\n \"rank\": 8,\n \"score\": 104393.75999448093\n },\n {\n \"content\": \"fn main() -> io::Result<()> {\\n\\n let args: Vec<String> = env::args().collect();\\n\\n\\n\\n if args.len() != 2 {\\n\\n panic!(\\\"Usage: rvemu-for-book <filename>\\\");\\n\\n }\\n\\n let mut file = File::open(&args[1])?;\\n\\n let mut binary = Vec::new();\\n\\n file.read_to_end(&mut binary)?;\\n\\n\\n\\n let mut cpu = Cpu::new(binary);\\n\\n\\n\\n loop {\\n\\n // 1. Fetch.\\n\\n let inst = match cpu.fetch() {\\n\\n // Break the loop if an error occurs.\\n\\n Ok(inst) => inst,\\n\\n Err(_) => break,\\n\\n };\\n\\n\\n\",\n \"file_path\": \"step04/src/main.rs\",\n \"rank\": 9,\n \"score\": 104393.75999448093\n },\n {\n \"content\": \"pub trait Device {\\n\\n fn load(&self, addr: u64, size: u64) -> Result<u64, Exception>;\\n\\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception>;\\n\\n}\\n\\n\\n\\n/// The system bus.\\n\\npub struct Bus {\\n\\n clint: Clint,\\n\\n plic: Plic,\\n\\n memory: Memory,\\n\\n}\\n\\n\\n\\nimpl Bus {\\n\\n /// Create a new system bus object.\\n\\n pub fn new(binary: Vec<u8>) -> Bus {\\n\\n Self {\\n\\n clint: Clint::new(),\\n\\n plic: Plic::new(),\\n\\n memory: Memory::new(binary),\\n\\n }\\n\",\n \"file_path\": \"step06/src/bus.rs\",\n \"rank\": 10,\n \"score\": 93089.85741602186\n },\n {\n \"content\": \"pub trait Device {\\n\\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception>;\\n\\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception>;\\n\\n}\\n\\n\\n\\n/// The system bus.\\n\\npub struct Bus {\\n\\n clint: Clint,\\n\\n plic: Plic,\\n\\n pub uart: Uart,\\n\\n pub virtio: Virtio,\\n\\n memory: Memory,\\n\\n}\\n\\n\\n\\nimpl Bus {\\n\\n /// Create a new system bus object.\\n\\n pub fn new(binary: Vec<u8>, disk_image: Vec<u8>) -> Bus {\\n\\n Self {\\n\\n clint: Clint::new(),\\n\\n plic: Plic::new(),\\n\",\n \"file_path\": \"step10/src/bus.rs\",\n \"rank\": 11,\n \"score\": 93089.85741602186\n },\n {\n \"content\": \"pub trait Device {\\n\\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception>;\\n\\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception>;\\n\\n}\\n\\n\\n\\n/// The system bus.\\n\\npub struct Bus {\\n\\n clint: Clint,\\n\\n plic: Plic,\\n\\n pub uart: Uart,\\n\\n pub virtio: Virtio,\\n\\n memory: Memory,\\n\\n}\\n\\n\\n\\nimpl Bus {\\n\\n /// Create a new system bus object.\\n\\n pub fn new(binary: Vec<u8>, disk_image: Vec<u8>) -> Bus {\\n\\n Self {\\n\\n clint: Clint::new(),\\n\\n plic: Plic::new(),\\n\",\n \"file_path\": \"step09/src/bus.rs\",\n \"rank\": 12,\n \"score\": 93089.85741602186\n },\n {\n \"content\": \"pub trait Device {\\n\\n fn load(&self, addr: u64, size: u64) -> Result<u64, Exception>;\\n\\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception>;\\n\\n}\\n\\n\\n\\n/// The system bus.\\n\\npub struct Bus {\\n\\n memory: Memory,\\n\\n}\\n\\n\\n\\nimpl Bus {\\n\\n /// Create a new system bus object.\\n\\n pub fn new(binary: Vec<u8>) -> Bus {\\n\\n Self {\\n\\n memory: Memory::new(binary),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn load(&self, addr: u64, size: u64) -> Result<u64, Exception> {\\n\\n if MEMORY_BASE <= addr {\\n\",\n \"file_path\": \"step05/src/bus.rs\",\n \"rank\": 13,\n \"score\": 93089.85741602186\n },\n {\n \"content\": \"pub trait Device {\\n\\n fn load(&self, addr: u64, size: u64) -> Result<u64, ()>;\\n\\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), ()>;\\n\\n}\\n\\n\\n\\n/// The system bus.\\n\\npub struct Bus {\\n\\n memory: Memory,\\n\\n}\\n\\n\\n\\nimpl Bus {\\n\\n /// Create a new system bus object.\\n\\n pub fn new(binary: Vec<u8>) -> Bus {\\n\\n Self {\\n\\n memory: Memory::new(binary),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn load(&self, addr: u64, size: u64) -> Result<u64, ()> {\\n\\n if MEMORY_BASE <= addr {\\n\",\n \"file_path\": \"step04/src/bus.rs\",\n \"rank\": 14,\n \"score\": 93089.85741602186\n },\n {\n \"content\": \"pub trait Device {\\n\\n fn load(&self, addr: u64, size: u64) -> Result<u64, ()>;\\n\\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), ()>;\\n\\n}\\n\\n\\n\\n/// The system bus.\\n\\npub struct Bus {\\n\\n memory: Memory,\\n\\n}\\n\\n\\n\\nimpl Bus {\\n\\n /// Create a new system bus object.\\n\\n pub fn new(binary: Vec<u8>) -> Bus {\\n\\n Self {\\n\\n memory: Memory::new(binary),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn load(&self, addr: u64, size: u64) -> Result<u64, ()> {\\n\\n if MEMORY_BASE <= addr {\\n\",\n \"file_path\": \"step03/src/bus.rs\",\n \"rank\": 15,\n \"score\": 93089.85741602186\n },\n {\n \"content\": \"pub trait Device {\\n\\n fn load(&self, addr: u64, size: u64) -> Result<u64, ()>;\\n\\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), ()>;\\n\\n}\\n\\n\\n\\n/// The system bus.\\n\\npub struct Bus {\\n\\n memory: Memory,\\n\\n}\\n\\n\\n\\nimpl Bus {\\n\\n /// Create a new system bus object.\\n\\n pub fn new(binary: Vec<u8>) -> Bus {\\n\\n Self {\\n\\n memory: Memory::new(binary),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn load(&self, addr: u64, size: u64) -> Result<u64, ()> {\\n\\n if MEMORY_BASE <= addr {\\n\",\n \"file_path\": \"step02/src/bus.rs\",\n \"rank\": 16,\n \"score\": 93089.85741602186\n },\n {\n \"content\": \"pub trait Device {\\n\\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception>;\\n\\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception>;\\n\\n}\\n\\n\\n\\n/// The system bus.\\n\\npub struct Bus {\\n\\n clint: Clint,\\n\\n plic: Plic,\\n\\n uart: Uart,\\n\\n memory: Memory,\\n\\n}\\n\\n\\n\\nimpl Bus {\\n\\n /// Create a new system bus object.\\n\\n pub fn new(binary: Vec<u8>) -> Bus {\\n\\n Self {\\n\\n clint: Clint::new(),\\n\\n plic: Plic::new(),\\n\\n uart: Uart::new(),\\n\",\n \"file_path\": \"step07/src/bus.rs\",\n \"rank\": 17,\n \"score\": 93089.85741602186\n },\n {\n \"content\": \"pub trait Device {\\n\\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception>;\\n\\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception>;\\n\\n}\\n\\n\\n\\n/// The system bus.\\n\\npub struct Bus {\\n\\n clint: Clint,\\n\\n plic: Plic,\\n\\n pub uart: Uart,\\n\\n memory: Memory,\\n\\n}\\n\\n\\n\\nimpl Bus {\\n\\n /// Create a new system bus object.\\n\\n pub fn new(binary: Vec<u8>) -> Bus {\\n\\n Self {\\n\\n clint: Clint::new(),\\n\\n plic: Plic::new(),\\n\\n uart: Uart::new(),\\n\",\n \"file_path\": \"step08/src/bus.rs\",\n \"rank\": 18,\n \"score\": 93089.85741602186\n },\n {\n \"content\": \"/// The CPU to contain registers, a program coutner, and memory.\\n\\nstruct Cpu {\\n\\n /// 32 64-bit integer registers.\\n\\n regs: [u64; 32],\\n\\n /// Program counter to hold the the memory address of the next instruction that would be executed.\\n\\n pc: u64,\\n\\n /// Computer memory to store executable instructions.\\n\\n memory: Vec<u8>,\\n\\n}\\n\\n\\n\\nimpl Cpu {\\n\\n /// Create a new `Cpu` object.\\n\\n fn new(binary: Vec<u8>) -> Self {\\n\\n let mut regs = [0; 32];\\n\\n regs[2] = MEMORY_SIZE;\\n\\n\\n\\n Self {\\n\\n regs,\\n\\n pc: 0,\\n\\n memory: binary,\\n\\n }\\n\",\n \"file_path\": \"step01/src/main.rs\",\n \"rank\": 19,\n \"score\": 61046.844222439904\n },\n {\n \"content\": \"/// The transfer of control to a trap handler caused by either an\\n\\n/// exception or an interrupt.\\n\\npub trait Trap {\\n\\n /// Returns an exception code that identifys the last exception.\\n\\n fn exception_code(&self) -> u64;\\n\\n /// Helper method for a trap handler.\\n\\n fn take_trap(&self, cpu: &mut Cpu) {\\n\\n let exception_pc = cpu.pc.wrapping_sub(4);\\n\\n let previous_mode = cpu.mode;\\n\\n\\n\\n let cause = self.exception_code();\\n\\n if (previous_mode <= Mode::Supervisor)\\n\\n && ((cpu.load_csr(MEDELEG).wrapping_shr(cause as u32)) & 1 != 0)\\n\\n {\\n\\n // Handle the trap in S-mode.\\n\\n cpu.mode = Mode::Supervisor;\\n\\n\\n\\n // Set the program counter to the supervisor trap-handler base address (stvec).\\n\\n cpu.pc = cpu.load_csr(STVEC) & !1;\\n\\n\\n\\n // 4.1.9 Supervisor Exception Program Counter (sepc)\\n\\n // \\\"The low bit of sepc (sepc[0]) is always zero.\\\"\\n\",\n \"file_path\": \"step07/src/trap.rs\",\n \"rank\": 20,\n \"score\": 55485.214292371296\n },\n {\n \"content\": \"/// The transfer of control to a trap handler caused by either an\\n\\n/// exception or an interrupt.\\n\\npub trait Trap {\\n\\n /// Returns an exception code that identifys the last exception.\\n\\n fn exception_code(&self) -> u64;\\n\\n /// Trap handler.\\n\\n fn take_trap(&self, cpu: &mut Cpu);\\n\\n /// Helper method for a trap handler.\\n\\n fn take_trap_helper(&self, cpu: &mut Cpu, is_interrupt: bool) {\\n\\n let exception_pc = cpu.pc.wrapping_sub(4);\\n\\n let previous_mode = cpu.mode;\\n\\n\\n\\n let mut cause = self.exception_code();\\n\\n // Set an interrupt bit if a trap is an interrupt.\\n\\n if is_interrupt {\\n\\n cause = (1 << 63) | cause;\\n\\n }\\n\\n if (previous_mode <= Mode::Supervisor)\\n\\n && ((cpu.load_csr(MEDELEG).wrapping_shr(cause as u32)) & 1 != 0)\\n\\n {\\n\\n // Handle the trap in S-mode.\\n\\n cpu.mode = Mode::Supervisor;\\n\",\n \"file_path\": \"step08/src/trap.rs\",\n \"rank\": 21,\n \"score\": 55485.214292371296\n },\n {\n \"content\": \"/// The transfer of control to a trap handler caused by either an\\n\\n/// exception or an interrupt.\\n\\npub trait Trap {\\n\\n /// Returns an exception code that identifys the last exception.\\n\\n fn exception_code(&self) -> u64;\\n\\n /// Trap handler.\\n\\n fn take_trap(&self, cpu: &mut Cpu);\\n\\n /// Helper method for a trap handler.\\n\\n fn take_trap_helper(&self, cpu: &mut Cpu, is_interrupt: bool) {\\n\\n let exception_pc = cpu.pc.wrapping_sub(4);\\n\\n let previous_mode = cpu.mode;\\n\\n\\n\\n let mut cause = self.exception_code();\\n\\n // Set an interrupt bit if a trap is an interrupt.\\n\\n if is_interrupt {\\n\\n cause = (1 << 63) | cause;\\n\\n }\\n\\n if (previous_mode <= Mode::Supervisor)\\n\\n && ((cpu.load_csr(MEDELEG).wrapping_shr(cause as u32)) & 1 != 0)\\n\\n {\\n\\n // Handle the trap in S-mode.\\n\\n cpu.mode = Mode::Supervisor;\\n\",\n \"file_path\": \"step10/src/trap.rs\",\n \"rank\": 22,\n \"score\": 55485.214292371296\n },\n {\n \"content\": \"/// The transfer of control to a trap handler caused by either an\\n\\n/// exception or an interrupt.\\n\\npub trait Trap {\\n\\n /// Returns an exception code that identifys the last exception.\\n\\n fn exception_code(&self) -> u64;\\n\\n /// Helper method for a trap handler.\\n\\n fn take_trap(&self, cpu: &mut Cpu) {\\n\\n let exception_pc = cpu.pc.wrapping_sub(4);\\n\\n let previous_mode = cpu.mode;\\n\\n\\n\\n let cause = self.exception_code();\\n\\n if (previous_mode <= Mode::Supervisor)\\n\\n && ((cpu.load_csr(MEDELEG).wrapping_shr(cause as u32)) & 1 != 0)\\n\\n {\\n\\n // Handle the trap in S-mode.\\n\\n cpu.mode = Mode::Supervisor;\\n\\n\\n\\n // Set the program counter to the supervisor trap-handler base address (stvec).\\n\\n cpu.pc = cpu.load_csr(STVEC) & !1;\\n\\n\\n\\n // 4.1.9 Supervisor Exception Program Counter (sepc)\\n\\n // \\\"The low bit of sepc (sepc[0]) is always zero.\\\"\\n\",\n \"file_path\": \"step05/src/trap.rs\",\n \"rank\": 23,\n \"score\": 55485.214292371296\n },\n {\n \"content\": \"/// The transfer of control to a trap handler caused by either an\\n\\n/// exception or an interrupt.\\n\\npub trait Trap {\\n\\n /// Returns an exception code that identifys the last exception.\\n\\n fn exception_code(&self) -> u64;\\n\\n /// Helper method for a trap handler.\\n\\n fn take_trap(&self, cpu: &mut Cpu) {\\n\\n let exception_pc = cpu.pc.wrapping_sub(4);\\n\\n let previous_mode = cpu.mode;\\n\\n\\n\\n let cause = self.exception_code();\\n\\n if (previous_mode <= Mode::Supervisor)\\n\\n && ((cpu.load_csr(MEDELEG).wrapping_shr(cause as u32)) & 1 != 0)\\n\\n {\\n\\n // Handle the trap in S-mode.\\n\\n cpu.mode = Mode::Supervisor;\\n\\n\\n\\n // Set the program counter to the supervisor trap-handler base address (stvec).\\n\\n cpu.pc = cpu.load_csr(STVEC) & !1;\\n\\n\\n\\n // 4.1.9 Supervisor Exception Program Counter (sepc)\\n\\n // \\\"The low bit of sepc (sepc[0]) is always zero.\\\"\\n\",\n \"file_path\": \"step06/src/trap.rs\",\n \"rank\": 24,\n \"score\": 55485.214292371296\n },\n {\n \"content\": \"/// The transfer of control to a trap handler caused by either an\\n\\n/// exception or an interrupt.\\n\\npub trait Trap {\\n\\n /// Returns an exception code that identifys the last exception.\\n\\n fn exception_code(&self) -> u64;\\n\\n /// Trap handler.\\n\\n fn take_trap(&self, cpu: &mut Cpu);\\n\\n /// Helper method for a trap handler.\\n\\n fn take_trap_helper(&self, cpu: &mut Cpu, is_interrupt: bool) {\\n\\n let exception_pc = cpu.pc.wrapping_sub(4);\\n\\n let previous_mode = cpu.mode;\\n\\n\\n\\n let mut cause = self.exception_code();\\n\\n // Set an interrupt bit if a trap is an interrupt.\\n\\n if is_interrupt {\\n\\n cause = (1 << 63) | cause;\\n\\n }\\n\\n if (previous_mode <= Mode::Supervisor)\\n\\n && ((cpu.load_csr(MEDELEG).wrapping_shr(cause as u32)) & 1 != 0)\\n\\n {\\n\\n // Handle the trap in S-mode.\\n\\n cpu.mode = Mode::Supervisor;\\n\",\n \"file_path\": \"step09/src/trap.rs\",\n \"rank\": 25,\n \"score\": 55485.214292371296\n },\n {\n \"content\": \" fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\\n\\n match size {\\n\\n 32 => Ok(self.load32(addr)),\\n\\n _ => Err(Exception::LoadAccessFault),\\n\\n }\\n\\n }\\n\\n\\n\\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\\n\\n match size {\\n\\n 32 => Ok(self.store32(addr, value)),\\n\\n _ => Err(Exception::StoreAMOAccessFault),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Virtio {\\n\\n /// Create a new virtio object.\\n\\n pub fn new(disk_image: Vec<u8>) -> Self {\\n\\n let mut disk = Vec::new();\\n\\n disk.extend(disk_image.iter().cloned());\\n\",\n \"file_path\": \"step10/src/virtio.rs\",\n \"rank\": 27,\n \"score\": 40237.222282289236\n },\n {\n \"content\": \" pub fn store32(&mut self, addr: u64, value: u64) {\\n\\n let val = value as u32;\\n\\n match addr {\\n\\n VIRTIO_DEVICE_FEATURES => self.driver_features = val,\\n\\n VIRTIO_GUEST_PAGE_SIZE => self.page_size = val,\\n\\n VIRTIO_QUEUE_SEL => self.queue_sel = val,\\n\\n VIRTIO_QUEUE_NUM => self.queue_num = val,\\n\\n VIRTIO_QUEUE_PFN => self.queue_pfn = val,\\n\\n VIRTIO_QUEUE_NOTIFY => self.queue_notify = val,\\n\\n VIRTIO_STATUS => self.status = val,\\n\\n _ => {}\\n\\n }\\n\\n }\\n\\n\\n\\n fn get_new_id(&mut self) -> u64 {\\n\\n self.id = self.id.wrapping_add(1);\\n\\n self.id\\n\\n }\\n\\n\\n\\n fn desc_addr(&self) -> u64 {\\n\",\n \"file_path\": \"step10/src/virtio.rs\",\n \"rank\": 29,\n \"score\": 40226.75680733346\n },\n {\n \"content\": \"pub const VIRTIO_QUEUE_NOTIFY: u64 = VIRTIO_BASE + 0x050;\\n\\n/// Device status, read and write. Reading from this register returns the current device status flags.\\n\\n/// Writing non-zero values to this register sets the status flags, indicating the OS/driver\\n\\n/// progress. Writing zero (0x0) to this register triggers a device reset.\\n\\npub const VIRTIO_STATUS: u64 = VIRTIO_BASE + 0x070;\\n\\n\\n\\n/// Paravirtualized drivers for IO virtualization.\\n\\npub struct Virtio {\\n\\n id: u64,\\n\\n driver_features: u32,\\n\\n page_size: u32,\\n\\n queue_sel: u32,\\n\\n queue_num: u32,\\n\\n queue_pfn: u32,\\n\\n queue_notify: u32,\\n\\n status: u32,\\n\\n disk: Vec<u8>,\\n\\n}\\n\\n\\n\\nimpl Device for Virtio {\\n\",\n \"file_path\": \"step10/src/virtio.rs\",\n \"rank\": 31,\n \"score\": 40225.52531242547\n },\n {\n \"content\": \" self.queue_pfn as u64 * self.page_size as u64\\n\\n }\\n\\n\\n\\n fn read_disk(&self, addr: u64) -> u64 {\\n\\n self.disk[addr as usize] as u64\\n\\n }\\n\\n\\n\\n fn write_disk(&mut self, addr: u64, value: u64) {\\n\\n self.disk[addr as usize] = value as u8\\n\\n }\\n\\n\\n\\n /// Access the disk via virtio. This is an associated function which takes a `cpu` object to\\n\\n /// read and write with a memory directly (DMA).\\n\\n pub fn disk_access(cpu: &mut Cpu) {\\n\\n // See more information in\\n\\n // https://github.com/mit-pdos/xv6-riscv/blob/riscv/kernel/virtio_disk.c\\n\\n\\n\\n // the spec says that legacy block operations use three\\n\\n // descriptors: one for type/reserved/sector, one for\\n\\n // the data, one for a 1-byte status result.\\n\",\n \"file_path\": \"step10/src/virtio.rs\",\n \"rank\": 32,\n \"score\": 40221.41997652512\n },\n {\n \"content\": \"pub const VIRTIO_VERSION: u64 = VIRTIO_BASE + 0x004;\\n\\n/// device type; 1 is net, 2 is disk.\\n\\npub const VIRTIO_DEVICE_ID: u64 = VIRTIO_BASE + 0x008;\\n\\n/// Always return 0x554d4551\\n\\npub const VIRTIO_VENDOR_ID: u64 = VIRTIO_BASE + 0x00c;\\n\\n/// Device features.\\n\\npub const VIRTIO_DEVICE_FEATURES: u64 = VIRTIO_BASE + 0x010;\\n\\n/// Driver features.\\n\\npub const VIRTIO_DRIVER_FEATURES: u64 = VIRTIO_BASE + 0x020;\\n\\n/// Page size for PFN, write-only.\\n\\npub const VIRTIO_GUEST_PAGE_SIZE: u64 = VIRTIO_BASE + 0x028;\\n\\n/// Select queue, write-only.\\n\\npub const VIRTIO_QUEUE_SEL: u64 = VIRTIO_BASE + 0x030;\\n\\n/// Max size of current queue, read-only. In QEMU, `VIRTIO_COUNT = 8`.\\n\\npub const VIRTIO_QUEUE_NUM_MAX: u64 = VIRTIO_BASE + 0x034;\\n\\n/// Size of current queue, write-only.\\n\\npub const VIRTIO_QUEUE_NUM: u64 = VIRTIO_BASE + 0x038;\\n\\n/// Physical page number for queue, read and write.\\n\\npub const VIRTIO_QUEUE_PFN: u64 = VIRTIO_BASE + 0x040;\\n\\n/// Notify the queue number, write-only.\\n\",\n \"file_path\": \"step10/src/virtio.rs\",\n \"rank\": 34,\n \"score\": 40217.81793432597\n },\n {\n \"content\": \" false\\n\\n }\\n\\n\\n\\n /// Load 4 bytes from virtio only if the addr is valid. Otherwise, return 0.\\n\\n pub fn load32(&self, addr: u64) -> u64 {\\n\\n match addr {\\n\\n VIRTIO_MAGIC => 0x74726976,\\n\\n VIRTIO_VERSION => 0x1,\\n\\n VIRTIO_DEVICE_ID => 0x2,\\n\\n VIRTIO_VENDOR_ID => 0x554d4551,\\n\\n VIRTIO_DEVICE_FEATURES => 0, // TODO: what should it return?\\n\\n VIRTIO_DRIVER_FEATURES => self.driver_features as u64,\\n\\n VIRTIO_QUEUE_NUM_MAX => 8,\\n\\n VIRTIO_QUEUE_PFN => self.queue_pfn as u64,\\n\\n VIRTIO_STATUS => self.status as u64,\\n\\n _ => 0,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Store 4 bytes to virtio only if the addr is valid. Otherwise, does nothing.\\n\",\n \"file_path\": \"step10/src/virtio.rs\",\n \"rank\": 37,\n \"score\": 40217.009345708655\n },\n {\n \"content\": \"//! The virtio module contains a virtualization standard for network and disk device drivers.\\n\\n//! This is the \\\"legacy\\\" virtio interface.\\n\\n//!\\n\\n//! The virtio spec:\\n\\n//! https://docs.oasis-open.org/virtio/virtio/v1.1/virtio-v1.1.pdf\\n\\n\\n\\nuse crate::bus::*;\\n\\nuse crate::cpu::*;\\n\\nuse crate::trap::*;\\n\\n\\n\\n/// The interrupt request of virtio.\\n\\npub const VIRTIO_IRQ: u64 = 1;\\n\\n\\n\\nconst VRING_DESC_SIZE: u64 = 16;\\n\\n/// The number of virtio descriptors. It must be a power of two.\\n\\nconst DESC_NUM: u64 = 8;\\n\\n\\n\\n/// Always return 0x74726976.\\n\\npub const VIRTIO_MAGIC: u64 = VIRTIO_BASE + 0x000;\\n\\n/// The version. 1 is legacy.\\n\",\n \"file_path\": \"step10/src/virtio.rs\",\n \"rank\": 38,\n \"score\": 40215.5551568459\n },\n {\n \"content\": \" }\\n\\n false => {\\n\\n // Read disk data and write it to memory directly (DMA).\\n\\n for i in 0..len1 as u64 {\\n\\n let data = cpu.bus.virtio.read_disk(blk_sector * 512 + i);\\n\\n cpu.bus\\n\\n .store(addr1 + i, 8, data)\\n\\n .expect(\\\"failed to write to memory\\\");\\n\\n }\\n\\n }\\n\\n };\\n\\n\\n\\n // Write id to `UsedArea`. Add 2 because of its structure.\\n\\n // struct UsedArea {\\n\\n // uint16 flags;\\n\\n // uint16 id;\\n\\n // struct VRingUsedElem elems[NUM];\\n\\n // };\\n\\n let new_id = cpu.bus.virtio.get_new_id();\\n\\n cpu.bus\\n\\n .store(used_addr.wrapping_add(2), 16, new_id % 8)\\n\\n .expect(\\\"failed to write to memory\\\");\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"step10/src/virtio.rs\",\n \"rank\": 40,\n \"score\": 40211.47706527354\n },\n {\n \"content\": \"\\n\\n Self {\\n\\n id: 0,\\n\\n driver_features: 0,\\n\\n page_size: 0,\\n\\n queue_sel: 0,\\n\\n queue_num: 0,\\n\\n queue_pfn: 0,\\n\\n queue_notify: 9999, // TODO: what is the correct initial value?\\n\\n status: 0,\\n\\n disk,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Return true if an interrupt is pending.\\n\\n pub fn is_interrupting(&mut self) -> bool {\\n\\n if self.queue_notify != 9999 {\\n\\n self.queue_notify = 9999;\\n\\n return true;\\n\\n }\\n\",\n \"file_path\": \"step10/src/virtio.rs\",\n \"rank\": 42,\n \"score\": 40209.60768745074\n },\n {\n \"content\": \"\\n\\n // desc = pages -- num * VRingDesc\\n\\n // avail = pages + 0x40 -- 2 * uint16, then num * uint16\\n\\n // used = pages + 4096 -- 2 * uint16, then num * vRingUsedElem\\n\\n let desc_addr = cpu.bus.virtio.desc_addr();\\n\\n let avail_addr = cpu.bus.virtio.desc_addr() + 0x40;\\n\\n let used_addr = cpu.bus.virtio.desc_addr() + 4096;\\n\\n\\n\\n // avail[0] is flags\\n\\n // avail[1] tells the device how far to look in avail[2...].\\n\\n let offset = cpu\\n\\n .bus\\n\\n .load(avail_addr.wrapping_add(1), 16)\\n\\n .expect(\\\"failed to read offset\\\");\\n\\n // avail[2...] are desc[] indices the device should process.\\n\\n // we only tell device the first index in our chain of descriptors.\\n\\n let index = cpu\\n\\n .bus\\n\\n .load(\\n\\n avail_addr.wrapping_add(offset % DESC_NUM).wrapping_add(2),\\n\",\n \"file_path\": \"step10/src/virtio.rs\",\n \"rank\": 45,\n \"score\": 40205.706693824606\n },\n {\n \"content\": \" // uint32 type;\\n\\n // uint32 reserved;\\n\\n // uint64 sector;\\n\\n // } buf0;\\n\\n let blk_sector = cpu\\n\\n .bus\\n\\n .load(addr0.wrapping_add(8), 64)\\n\\n .expect(\\\"failed to read a sector field in a virtio_blk_outhdr\\\");\\n\\n\\n\\n // Write to a device if the second bit `flag1` is set.\\n\\n match (flags1 & 2) == 0 {\\n\\n true => {\\n\\n // Read memory data and write it to a disk directly (DMA).\\n\\n for i in 0..len1 as u64 {\\n\\n let data = cpu\\n\\n .bus\\n\\n .load(addr1 + i, 8)\\n\\n .expect(\\\"failed to read from memory\\\");\\n\\n cpu.bus.virtio.write_disk(blk_sector * 512 + i, data);\\n\\n }\\n\",\n \"file_path\": \"step10/src/virtio.rs\",\n \"rank\": 47,\n \"score\": 40204.97645475709\n },\n {\n \"content\": \" 16,\\n\\n )\\n\\n .expect(\\\"failed to read index\\\");\\n\\n\\n\\n // Read `VRingDesc`, virtio descriptors.\\n\\n let desc_addr0 = desc_addr + VRING_DESC_SIZE * index;\\n\\n let addr0 = cpu\\n\\n .bus\\n\\n .load(desc_addr0, 64)\\n\\n .expect(\\\"failed to read an address field in a descriptor\\\");\\n\\n // Add 14 because of `VRingDesc` structure.\\n\\n // struct VRingDesc {\\n\\n // uint64 addr;\\n\\n // uint32 len;\\n\\n // uint16 flags;\\n\\n // uint16 next\\n\\n // };\\n\\n // The `next` field can be accessed by offset 14 (8 + 4 + 2) bytes.\\n\\n let next0 = cpu\\n\\n .bus\\n\",\n \"file_path\": \"step10/src/virtio.rs\",\n \"rank\": 49,\n \"score\": 40197.841330413285\n },\n {\n \"content\": \" .load(desc_addr0.wrapping_add(14), 16)\\n\\n .expect(\\\"failed to read a next field in a descripor\\\");\\n\\n\\n\\n // Read `VRingDesc` again, virtio descriptors.\\n\\n let desc_addr1 = desc_addr + VRING_DESC_SIZE * next0;\\n\\n let addr1 = cpu\\n\\n .bus\\n\\n .load(desc_addr1, 64)\\n\\n .expect(\\\"failed to read an address field in a descriptor\\\");\\n\\n let len1 = cpu\\n\\n .bus\\n\\n .load(desc_addr1.wrapping_add(8), 32)\\n\\n .expect(\\\"failed to read a length field in a descriptor\\\");\\n\\n let flags1 = cpu\\n\\n .bus\\n\\n .load(desc_addr1.wrapping_add(12), 16)\\n\\n .expect(\\\"failed to read a flags field in a descriptor\\\");\\n\\n\\n\\n // Read `virtio_blk_outhdr`. Add 8 because of its structure.\\n\\n // struct virtio_blk_outhdr {\\n\",\n \"file_path\": \"step10/src/virtio.rs\",\n \"rank\": 51,\n \"score\": 40197.5243348636\n },\n {\n \"content\": \"impl Device for Clint {\\n\\n fn load(&self, addr: u64, size: u64) -> Result<u64, Exception> {\\n\\n match size {\\n\\n 64 => Ok(self.load64(addr)),\\n\\n _ => Err(Exception::LoadAccessFault),\\n\\n }\\n\\n }\\n\\n\\n\\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\\n\\n match size {\\n\\n 64 => Ok(self.store64(addr, value)),\\n\\n _ => Err(Exception::StoreAMOAccessFault),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Clint {\\n\\n /// Create a new `Clint` object.\\n\\n pub fn new() -> Self {\\n\\n Self {\\n\",\n \"file_path\": \"step06/src/clint.rs\",\n \"rank\": 52,\n \"score\": 47.71070694758223\n },\n {\n \"content\": \"impl Device for Clint {\\n\\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\\n\\n match size {\\n\\n 64 => Ok(self.load64(addr)),\\n\\n _ => Err(Exception::LoadAccessFault),\\n\\n }\\n\\n }\\n\\n\\n\\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\\n\\n match size {\\n\\n 64 => Ok(self.store64(addr, value)),\\n\\n _ => Err(Exception::StoreAMOAccessFault),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Clint {\\n\\n /// Create a new `Clint` object.\\n\\n pub fn new() -> Self {\\n\\n Self {\\n\",\n \"file_path\": \"step08/src/clint.rs\",\n \"rank\": 53,\n \"score\": 47.548470694029625\n },\n {\n \"content\": \"impl Device for Clint {\\n\\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\\n\\n match size {\\n\\n 64 => Ok(self.load64(addr)),\\n\\n _ => Err(Exception::LoadAccessFault),\\n\\n }\\n\\n }\\n\\n\\n\\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\\n\\n match size {\\n\\n 64 => Ok(self.store64(addr, value)),\\n\\n _ => Err(Exception::StoreAMOAccessFault),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Clint {\\n\\n /// Create a new `Clint` object.\\n\\n pub fn new() -> Self {\\n\\n Self {\\n\",\n \"file_path\": \"step09/src/clint.rs\",\n \"rank\": 54,\n \"score\": 47.54847069402964\n },\n {\n \"content\": \"impl Device for Clint {\\n\\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\\n\\n match size {\\n\\n 64 => Ok(self.load64(addr)),\\n\\n _ => Err(Exception::LoadAccessFault),\\n\\n }\\n\\n }\\n\\n\\n\\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\\n\\n match size {\\n\\n 64 => Ok(self.store64(addr, value)),\\n\\n _ => Err(Exception::StoreAMOAccessFault),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Clint {\\n\\n /// Create a new `Clint` object.\\n\\n pub fn new() -> Self {\\n\\n Self {\\n\",\n \"file_path\": \"step10/src/clint.rs\",\n \"rank\": 55,\n \"score\": 47.54847069402963\n },\n {\n \"content\": \"impl Device for Clint {\\n\\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\\n\\n match size {\\n\\n 64 => Ok(self.load64(addr)),\\n\\n _ => Err(Exception::LoadAccessFault),\\n\\n }\\n\\n }\\n\\n\\n\\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\\n\\n match size {\\n\\n 64 => Ok(self.store64(addr, value)),\\n\\n _ => Err(Exception::StoreAMOAccessFault),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Clint {\\n\\n /// Create a new `Clint` object.\\n\\n pub fn new() -> Self {\\n\\n Self {\\n\",\n \"file_path\": \"step07/src/clint.rs\",\n \"rank\": 56,\n \"score\": 47.54847069402963\n },\n {\n \"content\": \"pub struct Uart {\\n\\n /// Pair of an array for UART buffer and a conditional variable.\\n\\n uart: Arc<(Mutex<[u8; UART_SIZE as usize]>, Condvar)>,\\n\\n /// Bit if an interrupt happens.\\n\\n interrupting: Arc<AtomicBool>,\\n\\n}\\n\\n\\n\\nimpl Device for Uart {\\n\\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\\n\\n match size {\\n\\n 8 => Ok(self.load8(addr)),\\n\\n _ => Err(Exception::LoadAccessFault),\\n\\n }\\n\\n }\\n\\n\\n\\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\\n\\n match size {\\n\\n 8 => Ok(self.store8(addr, value)),\\n\\n _ => Err(Exception::StoreAMOAccessFault),\\n\\n }\\n\",\n \"file_path\": \"step08/src/uart.rs\",\n \"rank\": 57,\n \"score\": 40.40137951543964\n },\n {\n \"content\": \"pub struct Uart {\\n\\n /// Pair of an array for UART buffer and a conditional variable.\\n\\n uart: Arc<(Mutex<[u8; UART_SIZE as usize]>, Condvar)>,\\n\\n /// Bit if an interrupt happens.\\n\\n interrupting: Arc<AtomicBool>,\\n\\n}\\n\\n\\n\\nimpl Device for Uart {\\n\\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\\n\\n match size {\\n\\n 8 => Ok(self.load8(addr)),\\n\\n _ => Err(Exception::LoadAccessFault),\\n\\n }\\n\\n }\\n\\n\\n\\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\\n\\n match size {\\n\\n 8 => Ok(self.store8(addr, value)),\\n\\n _ => Err(Exception::StoreAMOAccessFault),\\n\\n }\\n\",\n \"file_path\": \"step10/src/uart.rs\",\n \"rank\": 58,\n \"score\": 40.40137951543964\n },\n {\n \"content\": \"pub struct Uart {\\n\\n /// Pair of an array for UART buffer and a conditional variable.\\n\\n uart: Arc<(Mutex<[u8; UART_SIZE as usize]>, Condvar)>,\\n\\n /// Bit if an interrupt happens.\\n\\n interrupting: Arc<AtomicBool>,\\n\\n}\\n\\n\\n\\nimpl Device for Uart {\\n\\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\\n\\n match size {\\n\\n 8 => Ok(self.load8(addr)),\\n\\n _ => Err(Exception::LoadAccessFault),\\n\\n }\\n\\n }\\n\\n\\n\\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\\n\\n match size {\\n\\n 8 => Ok(self.store8(addr, value)),\\n\\n _ => Err(Exception::StoreAMOAccessFault),\\n\\n }\\n\",\n \"file_path\": \"step09/src/uart.rs\",\n \"rank\": 59,\n \"score\": 40.40137951543964\n },\n {\n \"content\": \" senable: u64,\\n\\n spriority: u64,\\n\\n sclaim: u64,\\n\\n}\\n\\n\\n\\nimpl Device for Plic {\\n\\n fn load(&self, addr: u64, size: u64) -> Result<u64, Exception> {\\n\\n match size {\\n\\n 32 => Ok(self.load32(addr)),\\n\\n _ => Err(Exception::LoadAccessFault),\\n\\n }\\n\\n }\\n\\n\\n\\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\\n\\n match size {\\n\\n 32 => Ok(self.store32(addr, value)),\\n\\n _ => Err(Exception::StoreAMOAccessFault),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"step06/src/plic.rs\",\n \"rank\": 60,\n \"score\": 39.697289755172484\n },\n {\n \"content\": \" senable: u64,\\n\\n spriority: u64,\\n\\n sclaim: u64,\\n\\n}\\n\\n\\n\\nimpl Device for Plic {\\n\\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\\n\\n match size {\\n\\n 32 => Ok(self.load32(addr)),\\n\\n _ => Err(Exception::LoadAccessFault),\\n\\n }\\n\\n }\\n\\n\\n\\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\\n\\n match size {\\n\\n 32 => Ok(self.store32(addr, value)),\\n\\n _ => Err(Exception::StoreAMOAccessFault),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"step07/src/plic.rs\",\n \"rank\": 61,\n \"score\": 39.566843443417504\n },\n {\n \"content\": \" senable: u64,\\n\\n spriority: u64,\\n\\n sclaim: u64,\\n\\n}\\n\\n\\n\\nimpl Device for Plic {\\n\\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\\n\\n match size {\\n\\n 32 => Ok(self.load32(addr)),\\n\\n _ => Err(Exception::LoadAccessFault),\\n\\n }\\n\\n }\\n\\n\\n\\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\\n\\n match size {\\n\\n 32 => Ok(self.store32(addr, value)),\\n\\n _ => Err(Exception::StoreAMOAccessFault),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"step09/src/plic.rs\",\n \"rank\": 62,\n \"score\": 39.566843443417504\n },\n {\n \"content\": \" senable: u64,\\n\\n spriority: u64,\\n\\n sclaim: u64,\\n\\n}\\n\\n\\n\\nimpl Device for Plic {\\n\\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\\n\\n match size {\\n\\n 32 => Ok(self.load32(addr)),\\n\\n _ => Err(Exception::LoadAccessFault),\\n\\n }\\n\\n }\\n\\n\\n\\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\\n\\n match size {\\n\\n 32 => Ok(self.store32(addr, value)),\\n\\n _ => Err(Exception::StoreAMOAccessFault),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"step08/src/plic.rs\",\n \"rank\": 63,\n \"score\": 39.5668434434175\n },\n {\n \"content\": \" senable: u64,\\n\\n spriority: u64,\\n\\n sclaim: u64,\\n\\n}\\n\\n\\n\\nimpl Device for Plic {\\n\\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\\n\\n match size {\\n\\n 32 => Ok(self.load32(addr)),\\n\\n _ => Err(Exception::LoadAccessFault),\\n\\n }\\n\\n }\\n\\n\\n\\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\\n\\n match size {\\n\\n 32 => Ok(self.store32(addr, value)),\\n\\n _ => Err(Exception::StoreAMOAccessFault),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"step10/src/plic.rs\",\n \"rank\": 64,\n \"score\": 39.5668434434175\n },\n {\n \"content\": \" /// Bit if an interrupt happens.\\n\\n interrupting: Arc<AtomicBool>,\\n\\n}\\n\\n\\n\\nimpl Device for Uart {\\n\\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\\n\\n match size {\\n\\n 8 => Ok(self.load8(addr)),\\n\\n _ => Err(Exception::LoadAccessFault),\\n\\n }\\n\\n }\\n\\n\\n\\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\\n\\n match size {\\n\\n 8 => Ok(self.store8(addr, value)),\\n\\n _ => Err(Exception::StoreAMOAccessFault),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"step07/src/uart.rs\",\n \"rank\": 65,\n \"score\": 39.22528712780178\n },\n {\n \"content\": \"//! The memory module contains a memory structure and implementation for memory access.\\n\\n\\n\\nuse crate::bus::*;\\n\\nuse crate::trap::*;\\n\\n\\n\\n/// Default memory size (128MiB).\\n\\npub const MEMORY_SIZE: u64 = 1024 * 1024 * 128;\\n\\n\\n\\n/// The dynamic random access memory (DRAM).\\n\\n#[derive(Debug)]\\n\\npub struct Memory {\\n\\n pub memory: Vec<u8>,\\n\\n}\\n\\n\\n\\nimpl Device for Memory {\\n\\n fn load(&self, addr: u64, size: u64) -> Result<u64, Exception> {\\n\\n match size {\\n\\n 8 => Ok(self.load8(addr)),\\n\\n 16 => Ok(self.load16(addr)),\\n\\n 32 => Ok(self.load32(addr)),\\n\",\n \"file_path\": \"step05/src/memory.rs\",\n \"rank\": 66,\n \"score\": 39.100729737377506\n },\n {\n \"content\": \"//! The memory module contains a memory structure and implementation for memory access.\\n\\n\\n\\nuse crate::bus::*;\\n\\nuse crate::trap::*;\\n\\n\\n\\n/// Default memory size (128MiB).\\n\\npub const MEMORY_SIZE: u64 = 1024 * 1024 * 128;\\n\\n\\n\\n/// The dynamic random access memory (DRAM).\\n\\n#[derive(Debug)]\\n\\npub struct Memory {\\n\\n pub memory: Vec<u8>,\\n\\n}\\n\\n\\n\\nimpl Device for Memory {\\n\\n fn load(&self, addr: u64, size: u64) -> Result<u64, Exception> {\\n\\n match size {\\n\\n 8 => Ok(self.load8(addr)),\\n\\n 16 => Ok(self.load16(addr)),\\n\\n 32 => Ok(self.load32(addr)),\\n\",\n \"file_path\": \"step06/src/memory.rs\",\n \"rank\": 67,\n \"score\": 39.10072973737751\n },\n {\n \"content\": \"//! The memory module contains a memory structure and implementation for memory access.\\n\\n\\n\\nuse crate::bus::*;\\n\\nuse crate::trap::*;\\n\\n\\n\\n/// Default memory size (128MiB).\\n\\npub const MEMORY_SIZE: u64 = 1024 * 1024 * 128;\\n\\n\\n\\n/// The dynamic random access memory (DRAM).\\n\\n#[derive(Debug)]\\n\\npub struct Memory {\\n\\n pub memory: Vec<u8>,\\n\\n}\\n\\n\\n\\nimpl Device for Memory {\\n\\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\\n\\n match size {\\n\\n 8 => Ok(self.load8(addr)),\\n\\n 16 => Ok(self.load16(addr)),\\n\\n 32 => Ok(self.load32(addr)),\\n\",\n \"file_path\": \"step08/src/memory.rs\",\n \"rank\": 68,\n \"score\": 38.94906626992906\n },\n {\n \"content\": \"//! The memory module contains a memory structure and implementation for memory access.\\n\\n\\n\\nuse crate::bus::*;\\n\\nuse crate::trap::*;\\n\\n\\n\\n/// Default memory size (128MiB).\\n\\npub const MEMORY_SIZE: u64 = 1024 * 1024 * 128;\\n\\n\\n\\n/// The dynamic random access memory (DRAM).\\n\\n#[derive(Debug)]\\n\\npub struct Memory {\\n\\n pub memory: Vec<u8>,\\n\\n}\\n\\n\\n\\nimpl Device for Memory {\\n\\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\\n\\n match size {\\n\\n 8 => Ok(self.load8(addr)),\\n\\n 16 => Ok(self.load16(addr)),\\n\\n 32 => Ok(self.load32(addr)),\\n\",\n \"file_path\": \"step10/src/memory.rs\",\n \"rank\": 69,\n \"score\": 38.94906626992906\n },\n {\n \"content\": \"//! The memory module contains a memory structure and implementation for memory access.\\n\\n\\n\\nuse crate::bus::*;\\n\\nuse crate::trap::*;\\n\\n\\n\\n/// Default memory size (128MiB).\\n\\npub const MEMORY_SIZE: u64 = 1024 * 1024 * 128;\\n\\n\\n\\n/// The dynamic random access memory (DRAM).\\n\\n#[derive(Debug)]\\n\\npub struct Memory {\\n\\n pub memory: Vec<u8>,\\n\\n}\\n\\n\\n\\nimpl Device for Memory {\\n\\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\\n\\n match size {\\n\\n 8 => Ok(self.load8(addr)),\\n\\n 16 => Ok(self.load16(addr)),\\n\\n 32 => Ok(self.load32(addr)),\\n\",\n \"file_path\": \"step07/src/memory.rs\",\n \"rank\": 70,\n \"score\": 38.94906626992906\n },\n {\n \"content\": \"//! The memory module contains a memory structure and implementation for memory access.\\n\\n\\n\\nuse crate::bus::*;\\n\\nuse crate::trap::*;\\n\\n\\n\\n/// Default memory size (128MiB).\\n\\npub const MEMORY_SIZE: u64 = 1024 * 1024 * 128;\\n\\n\\n\\n/// The dynamic random access memory (DRAM).\\n\\n#[derive(Debug)]\\n\\npub struct Memory {\\n\\n pub memory: Vec<u8>,\\n\\n}\\n\\n\\n\\nimpl Device for Memory {\\n\\n fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\\n\\n match size {\\n\\n 8 => Ok(self.load8(addr)),\\n\\n 16 => Ok(self.load16(addr)),\\n\\n 32 => Ok(self.load32(addr)),\\n\",\n \"file_path\": \"step09/src/memory.rs\",\n \"rank\": 71,\n \"score\": 38.94906626992906\n },\n {\n \"content\": \" pub fn store_csr(&mut self, addr: usize, value: u64) {\\n\\n match addr {\\n\\n SIE => {\\n\\n self.csrs[MIE] =\\n\\n (self.csrs[MIE] & !self.csrs[MIDELEG]) | (value & self.csrs[MIDELEG]);\\n\\n }\\n\\n _ => self.csrs[addr] = value,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Load a value from a memory.\\n\\n pub fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\\n\\n self.bus.load(addr, size)\\n\\n }\\n\\n\\n\\n /// Store a value to a memory.\\n\\n pub fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\\n\\n self.bus.store(addr, size, value)\\n\\n }\\n\\n\\n\",\n \"file_path\": \"step08/src/cpu.rs\",\n \"rank\": 72,\n \"score\": 36.35398844934246\n },\n {\n \"content\": \" 64 => Ok(self.load64(addr)),\\n\\n _ => Err(Exception::LoadAccessFault),\\n\\n }\\n\\n }\\n\\n\\n\\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\\n\\n match size {\\n\\n 8 => Ok(self.store8(addr, value)),\\n\\n 16 => Ok(self.store16(addr, value)),\\n\\n 32 => Ok(self.store32(addr, value)),\\n\\n 64 => Ok(self.store64(addr, value)),\\n\\n _ => Err(Exception::StoreAMOAccessFault),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Memory {\\n\\n /// Create a new `Memory` object with default memory size.\\n\\n pub fn new(binary: Vec<u8>) -> Memory {\\n\\n let mut memory = vec![0; MEMORY_SIZE as usize];\\n\",\n \"file_path\": \"step05/src/memory.rs\",\n \"rank\": 73,\n \"score\": 36.1478578601221\n },\n {\n \"content\": \" 64 => Ok(self.load64(addr)),\\n\\n _ => Err(Exception::LoadAccessFault),\\n\\n }\\n\\n }\\n\\n\\n\\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\\n\\n match size {\\n\\n 8 => Ok(self.store8(addr, value)),\\n\\n 16 => Ok(self.store16(addr, value)),\\n\\n 32 => Ok(self.store32(addr, value)),\\n\\n 64 => Ok(self.store64(addr, value)),\\n\\n _ => Err(Exception::StoreAMOAccessFault),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Memory {\\n\\n /// Create a new `Memory` object with default memory size.\\n\\n pub fn new(binary: Vec<u8>) -> Memory {\\n\\n let mut memory = vec![0; MEMORY_SIZE as usize];\\n\",\n \"file_path\": \"step06/src/memory.rs\",\n \"rank\": 74,\n \"score\": 36.147857860122095\n },\n {\n \"content\": \" 64 => Ok(self.load64(addr)),\\n\\n _ => Err(Exception::LoadAccessFault),\\n\\n }\\n\\n }\\n\\n\\n\\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\\n\\n match size {\\n\\n 8 => Ok(self.store8(addr, value)),\\n\\n 16 => Ok(self.store16(addr, value)),\\n\\n 32 => Ok(self.store32(addr, value)),\\n\\n 64 => Ok(self.store64(addr, value)),\\n\\n _ => Err(Exception::StoreAMOAccessFault),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Memory {\\n\\n /// Create a new `Memory` object with default memory size.\\n\\n pub fn new(binary: Vec<u8>) -> Memory {\\n\\n let mut memory = vec![0; MEMORY_SIZE as usize];\\n\",\n \"file_path\": \"step08/src/memory.rs\",\n \"rank\": 75,\n \"score\": 36.1478578601221\n },\n {\n \"content\": \" 64 => Ok(self.load64(addr)),\\n\\n _ => Err(Exception::LoadAccessFault),\\n\\n }\\n\\n }\\n\\n\\n\\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\\n\\n match size {\\n\\n 8 => Ok(self.store8(addr, value)),\\n\\n 16 => Ok(self.store16(addr, value)),\\n\\n 32 => Ok(self.store32(addr, value)),\\n\\n 64 => Ok(self.store64(addr, value)),\\n\\n _ => Err(Exception::StoreAMOAccessFault),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Memory {\\n\\n /// Create a new `Memory` object with default memory size.\\n\\n pub fn new(binary: Vec<u8>) -> Memory {\\n\\n let mut memory = vec![0; MEMORY_SIZE as usize];\\n\",\n \"file_path\": \"step09/src/memory.rs\",\n \"rank\": 76,\n \"score\": 36.1478578601221\n },\n {\n \"content\": \" 64 => Ok(self.load64(addr)),\\n\\n _ => Err(Exception::LoadAccessFault),\\n\\n }\\n\\n }\\n\\n\\n\\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\\n\\n match size {\\n\\n 8 => Ok(self.store8(addr, value)),\\n\\n 16 => Ok(self.store16(addr, value)),\\n\\n 32 => Ok(self.store32(addr, value)),\\n\\n 64 => Ok(self.store64(addr, value)),\\n\\n _ => Err(Exception::StoreAMOAccessFault),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Memory {\\n\\n /// Create a new `Memory` object with default memory size.\\n\\n pub fn new(binary: Vec<u8>) -> Memory {\\n\\n let mut memory = vec![0; MEMORY_SIZE as usize];\\n\",\n \"file_path\": \"step10/src/memory.rs\",\n \"rank\": 77,\n \"score\": 36.147857860122095\n },\n {\n \"content\": \" 64 => Ok(self.load64(addr)),\\n\\n _ => Err(Exception::LoadAccessFault),\\n\\n }\\n\\n }\\n\\n\\n\\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\\n\\n match size {\\n\\n 8 => Ok(self.store8(addr, value)),\\n\\n 16 => Ok(self.store16(addr, value)),\\n\\n 32 => Ok(self.store32(addr, value)),\\n\\n 64 => Ok(self.store64(addr, value)),\\n\\n _ => Err(Exception::StoreAMOAccessFault),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Memory {\\n\\n /// Create a new `Memory` object with default memory size.\\n\\n pub fn new(binary: Vec<u8>) -> Memory {\\n\\n let mut memory = vec![0; MEMORY_SIZE as usize];\\n\",\n \"file_path\": \"step07/src/memory.rs\",\n \"rank\": 78,\n \"score\": 36.147857860122095\n },\n {\n \"content\": \"//! The memory module contains a memory structure and implementation for memory access.\\n\\n\\n\\nuse crate::bus::*;\\n\\n\\n\\n/// Default memory size (128MiB).\\n\\npub const MEMORY_SIZE: u64 = 1024 * 1024 * 128;\\n\\n\\n\\n/// The dynamic random access memory (DRAM).\\n\\n#[derive(Debug)]\\n\\npub struct Memory {\\n\\n pub memory: Vec<u8>,\\n\\n}\\n\\n\\n\\nimpl Device for Memory {\\n\\n fn load(&self, addr: u64, size: u64) -> Result<u64, ()> {\\n\\n match size {\\n\\n 8 => Ok(self.load8(addr)),\\n\\n 16 => Ok(self.load16(addr)),\\n\\n 32 => Ok(self.load32(addr)),\\n\\n 64 => Ok(self.load64(addr)),\\n\",\n \"file_path\": \"step02/src/memory.rs\",\n \"rank\": 79,\n \"score\": 35.316985180086974\n },\n {\n \"content\": \"//! The memory module contains a memory structure and implementation for memory access.\\n\\n\\n\\nuse crate::bus::*;\\n\\n\\n\\n/// Default memory size (128MiB).\\n\\npub const MEMORY_SIZE: u64 = 1024 * 1024 * 128;\\n\\n\\n\\n/// The dynamic random access memory (DRAM).\\n\\n#[derive(Debug)]\\n\\npub struct Memory {\\n\\n pub memory: Vec<u8>,\\n\\n}\\n\\n\\n\\nimpl Device for Memory {\\n\\n fn load(&self, addr: u64, size: u64) -> Result<u64, ()> {\\n\\n match size {\\n\\n 8 => Ok(self.load8(addr)),\\n\\n 16 => Ok(self.load16(addr)),\\n\\n 32 => Ok(self.load32(addr)),\\n\\n 64 => Ok(self.load64(addr)),\\n\",\n \"file_path\": \"step04/src/memory.rs\",\n \"rank\": 80,\n \"score\": 35.316985180086974\n },\n {\n \"content\": \"//! The memory module contains a memory structure and implementation for memory access.\\n\\n\\n\\nuse crate::bus::*;\\n\\n\\n\\n/// Default memory size (128MiB).\\n\\npub const MEMORY_SIZE: u64 = 1024 * 1024 * 128;\\n\\n\\n\\n/// The dynamic random access memory (DRAM).\\n\\n#[derive(Debug)]\\n\\npub struct Memory {\\n\\n pub memory: Vec<u8>,\\n\\n}\\n\\n\\n\\nimpl Device for Memory {\\n\\n fn load(&self, addr: u64, size: u64) -> Result<u64, ()> {\\n\\n match size {\\n\\n 8 => Ok(self.load8(addr)),\\n\\n 16 => Ok(self.load16(addr)),\\n\\n 32 => Ok(self.load32(addr)),\\n\\n 64 => Ok(self.load64(addr)),\\n\",\n \"file_path\": \"step03/src/memory.rs\",\n \"rank\": 81,\n \"score\": 35.31698518008698\n },\n {\n \"content\": \" return self.memory.load(addr, size);\\n\\n }\\n\\n Err(Exception::LoadAccessFault)\\n\\n }\\n\\n\\n\\n pub fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\\n\\n if CLINT_BASE <= addr && addr < CLINT_BASE + CLINT_SIZE {\\n\\n return self.clint.store(addr, size, value);\\n\\n }\\n\\n if PLIC_BASE <= addr && addr < PLIC_BASE + PLIC_SIZE {\\n\\n return self.plic.store(addr, size, value);\\n\\n }\\n\\n if UART_BASE <= addr && addr < UART_BASE + UART_SIZE {\\n\\n return self.uart.store(addr, size, value);\\n\\n }\\n\\n if VIRTIO_BASE <= addr && addr < VIRTIO_BASE + VIRTIO_SIZE {\\n\\n return self.virtio.store(addr, size, value);\\n\\n }\\n\\n if MEMORY_BASE <= addr {\\n\\n return self.memory.store(addr, size, value);\\n\\n }\\n\\n Err(Exception::StoreAMOAccessFault)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"step09/src/bus.rs\",\n \"rank\": 82,\n \"score\": 34.54944104027901\n },\n {\n \"content\": \" return self.memory.load(addr, size);\\n\\n }\\n\\n Err(Exception::LoadAccessFault)\\n\\n }\\n\\n\\n\\n pub fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\\n\\n if CLINT_BASE <= addr && addr < CLINT_BASE + CLINT_SIZE {\\n\\n return self.clint.store(addr, size, value);\\n\\n }\\n\\n if PLIC_BASE <= addr && addr < PLIC_BASE + PLIC_SIZE {\\n\\n return self.plic.store(addr, size, value);\\n\\n }\\n\\n if UART_BASE <= addr && addr < UART_BASE + UART_SIZE {\\n\\n return self.uart.store(addr, size, value);\\n\\n }\\n\\n if VIRTIO_BASE <= addr && addr < VIRTIO_BASE + VIRTIO_SIZE {\\n\\n return self.virtio.store(addr, size, value);\\n\\n }\\n\\n if MEMORY_BASE <= addr {\\n\\n return self.memory.store(addr, size, value);\\n\\n }\\n\\n Err(Exception::StoreAMOAccessFault)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"step10/src/bus.rs\",\n \"rank\": 83,\n \"score\": 34.54944104027901\n },\n {\n \"content\": \" SIE => {\\n\\n self.csrs[MIE] =\\n\\n (self.csrs[MIE] & !self.csrs[MIDELEG]) | (value & self.csrs[MIDELEG]);\\n\\n }\\n\\n _ => self.csrs[addr] = value,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Load a value from a memory.\\n\\n pub fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\\n\\n self.bus.load(addr, size)\\n\\n }\\n\\n\\n\\n /// Store a value to a memory.\\n\\n pub fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\\n\\n self.bus.store(addr, size, value)\\n\\n }\\n\\n\\n\\n /// Get an instruction from the memory.\\n\\n pub fn fetch(&mut self) -> Result<u64, Exception> {\\n\",\n \"file_path\": \"step07/src/cpu.rs\",\n \"rank\": 84,\n \"score\": 34.086090623295455\n },\n {\n \"content\": \" SIE => {\\n\\n self.csrs[MIE] =\\n\\n (self.csrs[MIE] & !self.csrs[MIDELEG]) | (value & self.csrs[MIDELEG]);\\n\\n }\\n\\n _ => self.csrs[addr] = value,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Load a value from a memory.\\n\\n pub fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\\n\\n self.bus.load(addr, size)\\n\\n }\\n\\n\\n\\n /// Store a value to a memory.\\n\\n pub fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\\n\\n self.bus.store(addr, size, value)\\n\\n }\\n\\n\\n\\n /// Get an instruction from the memory.\\n\\n pub fn fetch(&mut self) -> Result<u64, Exception> {\\n\",\n \"file_path\": \"step05/src/cpu.rs\",\n \"rank\": 85,\n \"score\": 34.086090623295455\n },\n {\n \"content\": \" SIE => {\\n\\n self.csrs[MIE] =\\n\\n (self.csrs[MIE] & !self.csrs[MIDELEG]) | (value & self.csrs[MIDELEG]);\\n\\n }\\n\\n _ => self.csrs[addr] = value,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Load a value from a memory.\\n\\n pub fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\\n\\n self.bus.load(addr, size)\\n\\n }\\n\\n\\n\\n /// Store a value to a memory.\\n\\n pub fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\\n\\n self.bus.store(addr, size, value)\\n\\n }\\n\\n\\n\\n /// Get an instruction from the memory.\\n\\n pub fn fetch(&mut self) -> Result<u64, Exception> {\\n\",\n \"file_path\": \"step06/src/cpu.rs\",\n \"rank\": 86,\n \"score\": 34.08609062329546\n },\n {\n \"content\": \"\\n\\n /// Store a value to a memory.\\n\\n pub fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\\n\\n let p_addr = self.translate(addr, AccessType::Store)?;\\n\\n self.bus.store(p_addr, size, value)\\n\\n }\\n\\n\\n\\n /// Get an instruction from the memory.\\n\\n pub fn fetch(&mut self) -> Result<u64, Exception> {\\n\\n let p_pc = self.translate(self.pc, AccessType::Instruction)?;\\n\\n match self.bus.load(p_pc, 32) {\\n\\n Ok(inst) => Ok(inst),\\n\\n Err(_e) => Err(Exception::InstructionAccessFault),\\n\\n }\\n\\n }\\n\\n\\n\\n /// Execute an instruction after decoding. Return true if an error happens, otherwise false.\\n\\n pub fn execute(&mut self, inst: u64) -> Result<(), Exception> {\\n\\n let opcode = inst & 0x0000007f;\\n\\n let rd = ((inst & 0x00000f80) >> 7) as usize;\\n\",\n \"file_path\": \"step10/src/cpu.rs\",\n \"rank\": 87,\n \"score\": 33.696420600009496\n },\n {\n \"content\": \" _ => self.csrs[addr],\\n\\n }\\n\\n }\\n\\n\\n\\n /// Store a value to a CSR.\\n\\n pub fn store_csr(&mut self, addr: usize, value: u64) {\\n\\n match addr {\\n\\n SIE => {\\n\\n self.csrs[MIE] =\\n\\n (self.csrs[MIE] & !self.csrs[MIDELEG]) | (value & self.csrs[MIDELEG]);\\n\\n }\\n\\n _ => self.csrs[addr] = value,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Load a value from a memory.\\n\\n pub fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\\n\\n let p_addr = self.translate(addr, AccessType::Load)?;\\n\\n self.bus.load(p_addr, size)\\n\\n }\\n\",\n \"file_path\": \"step10/src/cpu.rs\",\n \"rank\": 88,\n \"score\": 33.37439635884545\n },\n {\n \"content\": \" SIE => self.csrs[MIE] & self.csrs[MIDELEG],\\n\\n _ => self.csrs[addr],\\n\\n }\\n\\n }\\n\\n\\n\\n /// Store a value to a CSR.\\n\\n pub fn store_csr(&mut self, addr: usize, value: u64) {\\n\\n match addr {\\n\\n SIE => {\\n\\n self.csrs[MIE] =\\n\\n (self.csrs[MIE] & !self.csrs[MIDELEG]) | (value & self.csrs[MIDELEG]);\\n\\n }\\n\\n _ => self.csrs[addr] = value,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Load a value from a memory.\\n\\n pub fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\\n\\n self.bus.load(addr, size)\\n\\n }\\n\",\n \"file_path\": \"step09/src/cpu.rs\",\n \"rank\": 89,\n \"score\": 33.32426821463284\n },\n {\n \"content\": \"\\n\\n /// Store a value to a memory.\\n\\n pub fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\\n\\n self.bus.store(addr, size, value)\\n\\n }\\n\\n\\n\\n /// Get an instruction from the memory.\\n\\n pub fn fetch(&mut self) -> Result<u64, Exception> {\\n\\n match self.bus.load(self.pc, 32) {\\n\\n Ok(inst) => Ok(inst),\\n\\n Err(_e) => Err(Exception::InstructionAccessFault),\\n\\n }\\n\\n }\\n\\n\\n\\n /// Execute an instruction after decoding. Return true if an error happens, otherwise false.\\n\\n pub fn execute(&mut self, inst: u64) -> Result<(), Exception> {\\n\\n let opcode = inst & 0x0000007f;\\n\\n let rd = ((inst & 0x00000f80) >> 7) as usize;\\n\\n let rs1 = ((inst & 0x000f8000) >> 15) as usize;\\n\\n let rs2 = ((inst & 0x01f00000) >> 20) as usize;\\n\",\n \"file_path\": \"step09/src/cpu.rs\",\n \"rank\": 90,\n \"score\": 33.23179024771652\n },\n {\n \"content\": \" self.csrs[MIE] =\\n\\n (self.csrs[MIE] & !self.csrs[MIDELEG]) | (value & self.csrs[MIDELEG]);\\n\\n }\\n\\n _ => self.csrs[addr] = value,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Load a value from a memory.\\n\\n pub fn load(&mut self, addr: u64, size: u64) -> Result<u64, ()> {\\n\\n self.bus.load(addr, size)\\n\\n }\\n\\n\\n\\n /// Store a value to a memory.\\n\\n pub fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), ()> {\\n\\n self.bus.store(addr, size, value)\\n\\n }\\n\\n\\n\\n /// Get an instruction from the memory.\\n\\n pub fn fetch(&mut self) -> Result<u64, ()> {\\n\\n match self.bus.load(self.pc, 32) {\\n\",\n \"file_path\": \"step04/src/cpu.rs\",\n \"rank\": 91,\n \"score\": 32.575272332270806\n },\n {\n \"content\": \" println!(\\\"{}\\\", output);\\n\\n }\\n\\n\\n\\n /// Load a value from a memory.\\n\\n pub fn load(&mut self, addr: u64, size: u64) -> Result<u64, ()> {\\n\\n self.bus.load(addr, size)\\n\\n }\\n\\n\\n\\n /// Store a value to a memory.\\n\\n pub fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), ()> {\\n\\n self.bus.store(addr, size, value)\\n\\n }\\n\\n\\n\\n /// Get an instruction from the memory.\\n\\n pub fn fetch(&mut self) -> Result<u64, ()> {\\n\\n match self.bus.load(self.pc, 32) {\\n\\n Ok(inst) => Ok(inst),\\n\\n Err(_e) => Err(()),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"step02/src/cpu.rs\",\n \"rank\": 92,\n \"score\": 32.38509771067909\n },\n {\n \"content\": \" _ => Err(()),\\n\\n }\\n\\n }\\n\\n\\n\\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), ()> {\\n\\n match size {\\n\\n 8 => Ok(self.store8(addr, value)),\\n\\n 16 => Ok(self.store16(addr, value)),\\n\\n 32 => Ok(self.store32(addr, value)),\\n\\n 64 => Ok(self.store64(addr, value)),\\n\\n _ => Err(()),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Memory {\\n\\n /// Create a new `Memory` object with default memory size.\\n\\n pub fn new(binary: Vec<u8>) -> Memory {\\n\\n let mut memory = vec![0; MEMORY_SIZE as usize];\\n\\n memory.splice(..binary.len(), binary.iter().cloned());\\n\",\n \"file_path\": \"step04/src/memory.rs\",\n \"rank\": 93,\n \"score\": 32.211373280605514\n },\n {\n \"content\": \" _ => Err(()),\\n\\n }\\n\\n }\\n\\n\\n\\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), ()> {\\n\\n match size {\\n\\n 8 => Ok(self.store8(addr, value)),\\n\\n 16 => Ok(self.store16(addr, value)),\\n\\n 32 => Ok(self.store32(addr, value)),\\n\\n 64 => Ok(self.store64(addr, value)),\\n\\n _ => Err(()),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Memory {\\n\\n /// Create a new `Memory` object with default memory size.\\n\\n pub fn new(binary: Vec<u8>) -> Memory {\\n\\n let mut memory = vec![0; MEMORY_SIZE as usize];\\n\\n memory.splice(..binary.len(), binary.iter().cloned());\\n\",\n \"file_path\": \"step03/src/memory.rs\",\n \"rank\": 94,\n \"score\": 32.211373280605514\n },\n {\n \"content\": \" _ => Err(()),\\n\\n }\\n\\n }\\n\\n\\n\\n fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), ()> {\\n\\n match size {\\n\\n 8 => Ok(self.store8(addr, value)),\\n\\n 16 => Ok(self.store16(addr, value)),\\n\\n 32 => Ok(self.store32(addr, value)),\\n\\n 64 => Ok(self.store64(addr, value)),\\n\\n _ => Err(()),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Memory {\\n\\n /// Create a new `Memory` object with default memory size.\\n\\n pub fn new(binary: Vec<u8>) -> Memory {\\n\\n let mut memory = vec![0; MEMORY_SIZE as usize];\\n\\n memory.splice(..binary.len(), binary.iter().cloned());\\n\",\n \"file_path\": \"step02/src/memory.rs\",\n \"rank\": 95,\n \"score\": 32.21137328060552\n },\n {\n \"content\": \" uart: Uart::new(),\\n\\n virtio: Virtio::new(disk_image),\\n\\n memory: Memory::new(binary),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\\n\\n if CLINT_BASE <= addr && addr < CLINT_BASE + CLINT_SIZE {\\n\\n return self.clint.load(addr, size);\\n\\n }\\n\\n if PLIC_BASE <= addr && addr < PLIC_BASE + PLIC_SIZE {\\n\\n return self.plic.load(addr, size);\\n\\n }\\n\\n if UART_BASE <= addr && addr < UART_BASE + UART_SIZE {\\n\\n return self.uart.load(addr, size);\\n\\n }\\n\\n if VIRTIO_BASE <= addr && addr < VIRTIO_BASE + VIRTIO_SIZE {\\n\\n return self.virtio.load(addr, size);\\n\\n }\\n\\n if MEMORY_BASE <= addr {\\n\",\n \"file_path\": \"step09/src/bus.rs\",\n \"rank\": 96,\n \"score\": 32.1063318657451\n },\n {\n \"content\": \" uart: Uart::new(),\\n\\n virtio: Virtio::new(disk_image),\\n\\n memory: Memory::new(binary),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn load(&mut self, addr: u64, size: u64) -> Result<u64, Exception> {\\n\\n if CLINT_BASE <= addr && addr < CLINT_BASE + CLINT_SIZE {\\n\\n return self.clint.load(addr, size);\\n\\n }\\n\\n if PLIC_BASE <= addr && addr < PLIC_BASE + PLIC_SIZE {\\n\\n return self.plic.load(addr, size);\\n\\n }\\n\\n if UART_BASE <= addr && addr < UART_BASE + UART_SIZE {\\n\\n return self.uart.load(addr, size);\\n\\n }\\n\\n if VIRTIO_BASE <= addr && addr < VIRTIO_BASE + VIRTIO_SIZE {\\n\\n return self.virtio.load(addr, size);\\n\\n }\\n\\n if MEMORY_BASE <= addr {\\n\",\n \"file_path\": \"step10/src/bus.rs\",\n \"rank\": 97,\n \"score\": 32.10633186574509\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub fn load(&self, addr: u64, size: u64) -> Result<u64, Exception> {\\n\\n if CLINT_BASE <= addr && addr < CLINT_BASE + CLINT_SIZE {\\n\\n return self.clint.load(addr, size);\\n\\n }\\n\\n if PLIC_BASE <= addr && addr < PLIC_BASE + PLIC_SIZE {\\n\\n return self.plic.load(addr, size);\\n\\n }\\n\\n if MEMORY_BASE <= addr {\\n\\n return self.memory.load(addr, size);\\n\\n }\\n\\n Err(Exception::LoadAccessFault)\\n\\n }\\n\\n\\n\\n pub fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\\n\\n if CLINT_BASE <= addr && addr < CLINT_BASE + CLINT_SIZE {\\n\\n return self.clint.store(addr, size, value);\\n\\n }\\n\\n if PLIC_BASE <= addr && addr < PLIC_BASE + PLIC_SIZE {\\n\\n return self.plic.store(addr, size, value);\\n\\n }\\n\\n if MEMORY_BASE <= addr {\\n\\n return self.memory.store(addr, size, value);\\n\\n }\\n\\n Err(Exception::StoreAMOAccessFault)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"step06/src/bus.rs\",\n \"rank\": 98,\n \"score\": 31.93868862060419\n },\n {\n \"content\": \" return self.memory.load(addr, size);\\n\\n }\\n\\n Err(Exception::LoadAccessFault)\\n\\n }\\n\\n\\n\\n pub fn store(&mut self, addr: u64, size: u64, value: u64) -> Result<(), Exception> {\\n\\n if MEMORY_BASE <= addr {\\n\\n return self.memory.store(addr, size, value);\\n\\n }\\n\\n Err(Exception::StoreAMOAccessFault)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"step05/src/bus.rs\",\n \"rank\": 99,\n \"score\": 31.439669198842715\n }\n]","isConversational":false}}},{"rowIdx":1388,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"descriptor/src/ranges.rs"},"repo_name":{"kind":"string","value":"Moxinilian/rendy"},"commit":{"kind":"string","value":"c521b6d97d8154042bcc2215c7d7906cc70d7282"},"file_code":{"kind":"string","value":"use std::{\n cmp::Ordering,\n ops::{Add, AddAssign, Mul, MulAssign, Sub, SubAssign},\n};\n\npub use gfx_hal::pso::{DescriptorRangeDesc, DescriptorSetLayoutBinding, DescriptorType};\n\nconst DESCPTOR_TYPES_COUNT: usize = 11;\n\nconst DESCRIPTOR_TYPES: [DescriptorType; DESCPTOR_TYPES_COUNT] = [\n DescriptorType::Sampler,\n DescriptorType::CombinedImageSampler,\n DescriptorType::SampledImage,\n DescriptorType::StorageImage,\n DescriptorType::UniformTexelBuffer,\n DescriptorType::StorageTexelBuffer,\n DescriptorType::UniformBuffer,\n DescriptorType::StorageBuffer,\n DescriptorType::UniformBufferDynamic,\n DescriptorType::StorageBufferDynamic,\n DescriptorType::InputAttachment,\n];\n\n#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]\npub struct DescriptorRanges {\n counts: [u32; DESCPTOR_TYPES_COUNT],\n}\n\nimpl DescriptorRanges {\n \n pub fn zero() -> Self {\n DescriptorRanges {\n counts: [0; DESCPTOR_TYPES_COUNT],\n }\n }\n\n \n \n pub fn add_binding(&mut self, binding: DescriptorSetLayoutBinding) {\n self.counts[binding.ty as usize] += binding.count as u32;\n }\n\n \n \n pub fn iter(&self) -> DescriptorRangesIter<'_> {\n DescriptorRangesIter {\n counts: &self.counts,\n index: 0,\n }\n }\n\n \n pub fn counts(&self) -> &[u32] {\n &self.counts\n }\n\n \n pub fn counts_mut(&mut self) -> &mut [u32] {\n &mut self.counts\n }\n\n \n pub fn from_bindings(bindings: &[DescriptorSetLayoutBinding]) -> Self {\n let mut descs = Self::zero();\n\n for binding in bindings {\n descs.counts[binding.ty as usize] += binding.count as u32;\n }\n\n descs\n }\n\n \n pub fn from_binding_iter<I>(bindings: I) -> Self\n where\n I: Iterator<Item = DescriptorSetLayoutBinding>\n {\n let mut descs = Self::zero();\n\n for binding in bindings {\n descs.counts[binding.ty as usize] += binding.count as u32;\n }\n\n descs\n }\n}\n\nimpl PartialOrd for DescriptorRanges {\n fn partial_cmp(&self, other: &Self) -> Option<std::cmp::Ordering> {\n let mut ord = self.counts[0].partial_cmp(&other.counts[0])?;\n for i in 1..DESCPTOR_TYPES_COUNT {\n match (ord, self.counts[i].partial_cmp(&other.counts[i])?) {\n (Ordering::Less, Ordering::Greater) | (Ordering::Greater, Ordering::Less) => {\n return None;\n }\n (Ordering::Equal, new) => ord = new,\n _ => (),\n }\n }\n Some(ord)\n }\n}\n\nimpl Add for DescriptorRanges {\n type Output = Self;\n fn add(mut self, rhs: Self) -> Self {\n self += rhs;\n self\n }\n}\n\nimpl AddAssign for DescriptorRanges {\n fn add_assign(&mut self, rhs: Self) {\n for i in 0..DESCPTOR_TYPES_COUNT {\n self.counts[i] += rhs.counts[i];\n }\n }\n}\n\nimpl Sub for DescriptorRanges {\n type Output = Self;\n fn sub(mut self, rhs: Self) -> Self {\n self -= rhs;\n self\n }\n}\n\nimpl SubAssign for DescriptorRanges {\n fn sub_assign(&mut self, rhs: Self) {\n for i in 0..DESCPTOR_TYPES_COUNT {\n self.counts[i] -= rhs.counts[i];\n }\n }\n}\n\nimpl Mul<u32> for DescriptorRanges {\n type Output = Self;\n fn mul(mut self, rhs: u32) -> Self {\n self *= rhs;\n self\n }\n}\n\nimpl MulAssign<u32> for DescriptorRanges {\n fn mul_assign(&mut self, rhs: u32) {\n for i in 0..DESCPTOR_TYPES_COUNT {\n self.counts[i] *= rhs;\n }\n }\n}\n\nimpl<'a> IntoIterator for &'a DescriptorRanges {\n type Item = DescriptorRangeDesc;\n type IntoIter = DescriptorRangesIter<'a>;\n\n fn into_iter(self) -> DescriptorRangesIter<'a> {\n self.iter()\n }\n}\n\npub struct DescriptorRangesIter<'a> {\n counts: &'a [u32; DESCPTOR_TYPES_COUNT],\n index: u8,\n}\n\nimpl<'a> Iterator for DescriptorRangesIter<'a> {\n type Item = DescriptorRangeDesc;\n\n fn next(&mut self) -> Option<DescriptorRangeDesc> {\n loop {\n let index = self.index as usize;\n if index >= DESCPTOR_TYPES_COUNT {\n return None;\n } else {\n self.index += 1;\n if self.counts[index] > 0 {\n return Some(DescriptorRangeDesc {\n count: self.counts[index] as usize,\n ty: DESCRIPTOR_TYPES[index],\n });\n }\n }\n }\n }\n}\n"},"prefix":{"kind":"string","value":"use std::{\n cmp::Ordering,\n ops::{Add, AddAssign, Mul, MulAssign, Sub, SubAssign},\n};\n\npub use gfx_hal::pso::{DescriptorRangeDesc, DescriptorSetLayoutBinding, DescriptorType};\n\nconst DESCPTOR_TYPES_COUNT: usize = 11;\n\nconst DESCRIPTOR_TYPES: [DescriptorType; DESCPTOR_TYPES_COUNT] = [\n DescriptorType::Sampler,\n DescriptorType::CombinedImageSampler,\n DescriptorType::SampledImage,\n DescriptorType::StorageImage,\n DescriptorType::UniformTexelBuffer,\n DescriptorType::StorageTexelBuffer,\n DescriptorType::UniformBuffer,\n DescriptorType::StorageBuffer,\n DescriptorType::UniformBufferDynamic,\n DescriptorType::StorageBufferDynamic,\n DescriptorType::InputAttachment,\n];\n\n#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]\npub struct DescriptorRanges {\n counts: [u32; DESCPTOR_TYPES_COUNT],\n}\n\nimpl DescriptorRanges {\n \n pub fn zero() -> Self {\n DescriptorRanges {\n counts: [0; DESCPTOR_TYPES_COUNT],\n }\n }\n\n \n \n pub fn add_binding(&mut self, binding: DescriptorSetLayoutBinding) {\n self.counts[binding.ty as usize] += binding.count as u32;\n }\n\n \n \n pub fn iter(&self) -> DescriptorRangesIter<'_> {\n DescriptorRangesIter {\n counts: &self.counts,\n index: 0,\n }\n }\n\n \n pub fn counts(&self) -> &[u32] {\n &self.counts\n }\n\n \n pub fn counts_mut(&mut self) -> &mut [u32] {\n &mut self.counts\n }\n\n \n pub fn from_bindings(bindings: &[DescriptorSetLayoutBinding]) -> Self {\n let mut descs = Self::zero();\n\n for binding in bindings {\n descs.counts[binding.ty as usize] += binding.count as u32;\n }\n\n descs\n }\n\n \n pub fn from_binding_iter<I>(bindings: I) -> Self\n where\n I: Iterator<Item = DescriptorSetLayoutBinding>\n {\n let mut descs = Self::zero();\n\n for binding in bindings {\n descs.counts[binding.ty as usize] += binding.count as u32;\n }\n\n descs\n }\n}\n\nimpl PartialOrd for DescriptorRanges {\n fn partial_cmp(&self, other: &Self) -> Option<std::cmp::Ordering> {\n let mut ord = self.counts[0].partial_cmp(&other.counts[0])?;\n for i in 1..DESCPTOR_TYPES_COUNT {\n match (ord, self.counts[i].partial_cmp(&other.counts[i])?) {\n (Ordering::Less, Ordering::Greater) | (Ordering::Greater, Ordering::Less) => {\n return None;\n }\n (Ordering::Equal, new) => ord = new,\n _ => (),\n }\n }\n Some(ord)\n }\n}\n\nimpl Add for DescriptorRanges {\n type Output = Self;\n fn add(mut self, rhs: Self) -> Self {\n self += rhs;\n self\n }\n}\n\nimpl AddAssign for DescriptorRanges {\n fn add_assign(&mut self, rhs: Self) {\n for i in 0..DESCPTOR_TYPES_COUNT {\n self.counts[i] += rhs.counts[i];\n }\n }\n}\n\nimpl Sub for DescriptorRanges {\n type Output = Self;\n fn sub(mut self, rhs: Self) -> Self {\n self -= rhs;\n self\n }\n}\n\nimpl SubAssign for DescriptorRanges {\n fn sub_assign(&mut self, rhs: Self) {\n for i in 0..DESCPTOR_TYPES_COUNT {\n self.counts[i] -= rhs.counts[i];\n }\n }\n}\n\nimpl Mul<u32> for DescriptorRanges {\n type Output = Self;\n fn mul(mut self, rhs: u32) -> Self {\n self *= rhs;\n self\n }\n}\n\nimpl MulAssign<u32> for DescriptorRanges {\n fn mul_assign(&mut self, rhs: u32) {\n for i in 0..DESCPTOR_TYPES_COUNT {\n self.counts[i] *= rhs;\n }\n }\n}\n\nimpl<'a> IntoIterator for &'a DescriptorRanges {\n type Item = DescriptorRangeDesc;\n type IntoIter = DescriptorRangesIter<'a>;\n\n fn into_iter(self) -> DescriptorRangesIter<'a> {\n self.iter()\n }\n}\n\npub struct DescriptorRangesIter<'a> {\n counts: &'a [u32; DESCPTOR_TYPES_COUNT],\n index: u8,\n}\n\nimpl<'a> Iterator for DescriptorRangesIter<'a> {\n type Item = DescriptorRangeDesc;\n\n fn next(&mut self) -> Option<DescriptorRangeDesc> {\n loop {\n let index = self.index as usize;\n if index >= DESCPTOR_TYPES_COUNT {\n return None;\n } else {\n self.index += 1;\n if self.counts[index] > 0 {\n return "},"suffix":{"kind":"string","value":";\n }\n }\n }\n }\n}\n"},"middle":{"kind":"string","value":"Some(DescriptorRangeDesc {\n count: self.counts[index] as usize,\n ty: DESCRIPTOR_TYPES[index],\n })"},"strategy":{"kind":"string","value":"call_expression"},"context_items":{"kind":"list like","value":[{"content":"/// Trait for vertex attributes to implement\n\npub trait AsAttribute: Debug + PartialEq + PartialOrd + Copy + Send + Sync + 'static {\n\n /// Name of the attribute\n\n const NAME: &'static str;\n\n /// Attribute format.\n\n const FORMAT: Format;\n\n}\n\n\n\n/// A unique identifier for vertex attribute of given name, format and array index.\n\n#[derive(Debug, Clone, Copy, Hash, PartialEq, Eq, PartialOrd, Ord)]\n\npub struct AttrUuid(u16);\n\n\n\nlazy_static::lazy_static! {\n\n static ref UUID_MAP: parking_lot::RwLock<fnv::FnvHashMap<(Cow<'static, str>, u8, Format), AttrUuid>> =\n\n Default::default();\n\n}\n\n\n","file_path":"util/src/types/vertex.rs","rank":0,"score":264876.4016146197},{"content":"/// Trait implemented by all valid vertex formats.\n\npub trait AsVertex: Debug + PartialEq + PartialOrd + Copy + Sized + Send + Sync + 'static {\n\n /// List of all attributes formats with name and offset.\n\n fn vertex() -> VertexFormat;\n\n}\n\n\n\nimpl<T> AsVertex for T\n\nwhere\n\n T: AsAttribute,\n\n{\n\n fn vertex() -> VertexFormat {\n\n VertexFormat::new(Some((T::FORMAT, T::NAME)))\n\n }\n\n}\n\n\n\n/// Vertex format with position and RGBA8 color attributes.\n\n#[repr(C)]\n\n#[derive(Clone, Copy, Debug, PartialEq, PartialOrd)]\n\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n\npub struct PosColor {\n\n /// Position of the vertex in 3D space.\n","file_path":"util/src/types/vertex.rs","rank":1,"score":256411.80980042164},{"content":"/// Calculate the number of mip levels for a 2D image with given dimensions\n\npub fn mip_levels_from_dims(width: u32, height: u32) -> u8 {\n\n ((32 - width.max(height).leading_zeros()).max(1) as u8).min(gfx_hal::image::MAX_LEVEL)\n\n}\n\n\n\n/// Generics-free texture builder.\n\n#[derive(Clone, Derivative)]\n\n#[derivative(Debug)]\n\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n\n/// Struct for staging data in preparation of building a `Texture`\n\npub struct TextureBuilder<'a> {\n\n kind: image::Kind,\n\n view_kind: image::ViewKind,\n\n format: Format,\n\n #[derivative(Debug = \"ignore\")]\n\n data: std::borrow::Cow<'a, [u8]>,\n\n data_width: u32,\n\n data_height: u32,\n\n sampler_info: gfx_hal::image::SamplerInfo,\n\n swizzle: Swizzle,\n\n mip_levels: MipLevels,\n","file_path":"texture/src/texture.rs","rank":2,"score":244031.49301182342},{"content":"/// Trait to abstract of specific access flags.\n\npub trait AccessFlags: Copy + Debug + BitOr<Output = Self> + BitOrAssign + 'static {\n\n /// Get flags value with no flags set.\n\n fn empty() -> Self;\n\n\n\n /// Check if this access must be exclusive.\n\n ///\n\n /// Basically this checks if all flags are known read flags.\n\n fn exclusive(&self) -> bool;\n\n}\n\n\n\nimpl AccessFlags for gfx_hal::buffer::Access {\n\n #[inline]\n\n fn empty() -> Self {\n\n Self::empty()\n\n }\n\n\n\n #[inline]\n\n fn exclusive(&self) -> bool {\n\n self.intersects(\n\n Self::SHADER_WRITE | Self::TRANSFER_WRITE | Self::HOST_WRITE | Self::MEMORY_WRITE,\n","file_path":"chain/src/resource.rs","rank":3,"score":239480.66162868554},{"content":"/// Trait to abstract of specific usage flags.\n\npub trait UsageFlags: Copy + Debug + BitOr<Output = Self> + BitOrAssign + 'static {}\n\n\n\nimpl UsageFlags for gfx_hal::buffer::Usage {}\n\nimpl UsageFlags for gfx_hal::image::Usage {}\n\n\n","file_path":"chain/src/resource.rs","rank":4,"score":239480.6616286856},{"content":"/// Cast vec of some arbitrary type into vec of bytes.\n\n/// Can lead to UB if allocator changes. Use with caution.\n\n/// TODO: Replace with something safer.\n\npub fn cast_vec<T: Copy>(mut vec: Vec<T>) -> Vec<u8> {\n\n let len = std::mem::size_of::<T>() * vec.len();\n\n let cap = std::mem::size_of::<T>() * vec.capacity();\n\n let ptr = vec.as_mut_ptr();\n\n std::mem::forget(vec);\n\n unsafe { Vec::from_raw_parts(ptr as _, len, cap) }\n\n}\n\n\n","file_path":"util/src/casts.rs","rank":5,"score":233854.20633805537},{"content":"/// Retreive a unique identifier for vertex attribute of given name, format and array index.\n\n///\n\n/// Non-array attributes should always use index 0.\n\n/// Matrices and arrays must be specified as a series of attributes with the same name and consecutive indices.\n\npub fn attribute_uuid(name: &str, index: u8, format: Format) -> AttrUuid {\n\n let read_map = UUID_MAP.read();\n\n if let Some(val) = read_map.get(&(Cow::Borrowed(name), index, format)) {\n\n return *val;\n\n }\n\n drop(read_map);\n\n\n\n let mut write_map = UUID_MAP.write();\n\n // First check again if value was not written by previous owner of the lock.\n\n if let Some(val) = write_map.get(&(Cow::Borrowed(name), index, format)) {\n\n return *val;\n\n }\n\n\n\n // uuid 0 is reserved for unused attribute indices\n\n let val = AttrUuid(write_map.len() as u16 + 1);\n\n write_map.insert((Cow::Owned(name.to_owned()), index, format), val);\n\n val\n\n}\n\n\n\n/// Type for position attribute of vertex.\n","file_path":"util/src/types/vertex.rs","rank":6,"score":233365.71346518685},{"content":"struct LookupBuilder<I: Hash + Eq + Copy> {\n\n forward: fnv::FnvHashMap<I, usize>,\n\n backward: Vec<I>,\n\n}\n\nimpl<I: Hash + Eq + Copy> LookupBuilder<I> {\n\n fn new() -> LookupBuilder<I> {\n\n LookupBuilder {\n\n forward: fnv::FnvHashMap::default(),\n\n backward: Vec::new(),\n\n }\n\n }\n\n\n\n fn forward(&mut self, id: I) -> usize {\n\n if let Some(&id_num) = self.forward.get(&id) {\n\n id_num\n\n } else {\n\n let id_num = self.backward.len();\n\n self.backward.push(id);\n\n self.forward.insert(id, id_num);\n\n id_num\n\n }\n\n }\n\n}\n\n\n","file_path":"chain/src/collect.rs","rank":7,"score":226389.55817929108},{"content":"/// Cast `cow` of some arbitrary type into `cow` of bytes.\n\n/// Can lead to UB if allocator changes. Use with caution.\n\n/// TODO: Replace with something safer.\n\npub fn cast_cow<T: Copy>(cow: Cow<'_, [T]>) -> Cow<'_, [u8]> {\n\n match cow {\n\n Cow::Borrowed(slice) => Cow::Borrowed(cast_slice(slice)),\n\n Cow::Owned(vec) => Cow::Owned(cast_vec(vec)),\n\n }\n\n}\n\n\n","file_path":"util/src/casts.rs","rank":8,"score":212440.2066574345},{"content":"/// Abstract capability specifier.\n\npub trait Capability: Copy + std::fmt::Debug + 'static {\n\n /// Try to create capability instance from queue_type.\n\n /// Instance will be created if all required queue_type set.\n\n fn from_queue_type(queue_type: QueueType) -> Option<Self>;\n\n\n\n /// Convert into `QueueType`\n\n fn into_queue_type(self) -> QueueType;\n\n}\n\n\n\nimpl Capability for QueueType {\n\n fn from_queue_type(queue_type: QueueType) -> Option<Self> {\n\n Some(queue_type)\n\n }\n\n\n\n fn into_queue_type(self) -> QueueType {\n\n self\n\n }\n\n}\n\n\n\nimpl Capability for Transfer {\n","file_path":"command/src/capability.rs","rank":9,"score":208087.76399878052},{"content":"/// Type-level usage flags.\n\n/// It defines if buffer can be resubmitted without reset.\n\n/// Or even resubmitted while being executed.\n\npub trait Usage: Copy + Default + std::fmt::Debug + 'static {\n\n /// Flags required to begin command buffer.\n\n fn flags(&self) -> gfx_hal::command::CommandBufferFlags;\n\n}\n\n\n\nimpl Usage for OneShot {\n\n fn flags(&self) -> gfx_hal::command::CommandBufferFlags {\n\n gfx_hal::command::CommandBufferFlags::ONE_TIME_SUBMIT\n\n }\n\n}\n\n\n\nimpl Usage for MultiShot {\n\n fn flags(&self) -> gfx_hal::command::CommandBufferFlags {\n\n gfx_hal::command::CommandBufferFlags::empty()\n\n }\n\n}\n\n\n\nimpl Usage for MultiShot<SimultaneousUse> {\n\n fn flags(&self) -> gfx_hal::command::CommandBufferFlags {\n\n gfx_hal::command::CommandBufferFlags::SIMULTANEOUS_USE\n\n }\n\n}\n\n\n\nimpl Usage for NoSimultaneousUse {\n\n fn flags(&self) -> gfx_hal::command::CommandBufferFlags {\n\n gfx_hal::command::CommandBufferFlags::empty()\n\n }\n\n}\n\n\n","file_path":"command/src/buffer/usage.rs","rank":10,"score":196678.41728714987},{"content":"/// Type-level buffer level flag.\n\n/// It defines whether buffer can be submitted to the command queues\n\n/// or executed as part of the primary buffers.\n\npub trait Level: Copy + Default + std::fmt::Debug + 'static {\n\n /// Get raw level value for command buffer allocation.\n\n fn raw_level(&self) -> gfx_hal::command::RawLevel;\n\n}\n\n\n\nimpl Level for PrimaryLevel {\n\n fn raw_level(&self) -> gfx_hal::command::RawLevel {\n\n gfx_hal::command::RawLevel::Primary\n\n }\n\n}\n\n\n\nimpl Level for SecondaryLevel {\n\n fn raw_level(&self) -> gfx_hal::command::RawLevel {\n\n gfx_hal::command::RawLevel::Secondary\n\n }\n\n}\n","file_path":"command/src/buffer/level.rs","rank":11,"score":196678.27636510605},{"content":"/// Specify flags required for command pool creation to allow individual buffer reset.\n\npub trait Reset: Copy + Default + std::fmt::Debug + 'static {\n\n /// Get flags for reset parameter.\n\n fn flags(&self) -> gfx_hal::pool::CommandPoolCreateFlags;\n\n}\n\n\n\nimpl Reset for IndividualReset {\n\n fn flags(&self) -> gfx_hal::pool::CommandPoolCreateFlags {\n\n gfx_hal::pool::CommandPoolCreateFlags::RESET_INDIVIDUAL\n\n }\n\n}\n\n\n\nimpl Reset for NoIndividualReset {\n\n fn flags(&self) -> gfx_hal::pool::CommandPoolCreateFlags {\n\n gfx_hal::pool::CommandPoolCreateFlags::empty()\n\n }\n\n}\n\n\n","file_path":"command/src/buffer/reset.rs","rank":12,"score":196673.78782065873},{"content":"/// AsPixel trait for extracting the underlying data representation information from a Rust data type\n\n/// # Example\n\n/// ```rust,no-run\n\n/// struct Rgba([u8; 4]);\n\n/// ```\n\npub trait AsPixel: Copy + std::fmt::Debug + Default + Send + Sync + 'static {\n\n /// Name of the pixel type.\n\n const NAME: &'static str;\n\n\n\n /// Size of the pixel.\n\n const SIZE: u32;\n\n\n\n /// Pixel format.\n\n const FORMAT: gfx_hal::format::Format;\n\n}\n\n\n\nmacro_rules! impl_pixel {\n\n ($($alias:ident = $channels:ident $size:ident $type:ident;)*) => {\n\n $(\n\n /// Pixel type alias.\n\n pub type $alias = Pixel<$channels, $size, $type>;\n\n\n\n impl AsPixel for $alias {\n\n const NAME: &'static str = stringify!($alias);\n\n const SIZE: u32 = num_channels!($channels) * <$size as ChannelSize>::SIZE;\n","file_path":"texture/src/pixel.rs","rank":13,"score":187091.98860042845},{"content":"#[allow(unused)]\n\ntype NoWaits<B> = std::iter::Empty<(\n\n &'static <B as gfx_hal::Backend>::Semaphore,\n\n gfx_hal::pso::PipelineStage,\n\n)>;\n","file_path":"command/src/family/submission.rs","rank":14,"score":186173.38463780028},{"content":"/// Memory usage trait.\n\npub trait MemoryUsage: std::fmt::Debug {\n\n /// Get set of properties required for the usage.\n\n fn properties_required(&self) -> gfx_hal::memory::Properties;\n\n\n\n /// Get comparable fitness value for memory properties.\n\n ///\n\n /// # Panics\n\n ///\n\n /// This function will panic if properties set doesn't contain required properties.\n\n fn memory_fitness(&self, properties: gfx_hal::memory::Properties) -> u32;\n\n\n\n /// Get comparable fitness value for memory allocator.\n\n fn allocator_fitness(&self, kind: Kind) -> u32;\n\n}\n\n\n\nimpl<T> MemoryUsage for T\n\nwhere\n\n T: std::ops::Deref + std::fmt::Debug,\n\n T::Target: MemoryUsage,\n\n{\n","file_path":"memory/src/usage.rs","rank":15,"score":185048.27412001727},{"content":"fn index_stride(index_type: gfx_hal::IndexType) -> usize {\n\n match index_type {\n\n gfx_hal::IndexType::U16 => size_of::<u16>(),\n\n gfx_hal::IndexType::U32 => size_of::<u32>(),\n\n }\n\n}\n\n\n\nimpl<'a> MeshBuilder<'a> {\n\n /// Create empty builder.\n\n pub fn new() -> Self {\n\n MeshBuilder {\n\n vertices: smallvec::SmallVec::new(),\n\n indices: None,\n\n prim: gfx_hal::Primitive::TriangleList,\n\n }\n\n }\n\n\n\n /// Convert builder into fully owned type. This forces internal vertex and index buffers\n\n /// to be cloned, which allows borrowed source buffers to be released.\n\n pub fn into_owned(self) -> MeshBuilder<'static> {\n","file_path":"mesh/src/mesh.rs","rank":16,"score":184043.16280914433},{"content":"/// Trait implemented for type-level render pass relation flags.\n\n/// `RenderPassContinue` and `OutsideRenderPass`.\n\npub trait RenderPassRelation<L>: Copy + Default + std::fmt::Debug + 'static {\n\n /// Flags required to begin command buffer.\n\n fn flags(&self) -> gfx_hal::command::CommandBufferFlags;\n\n}\n\n\n\nimpl RenderPassRelation<SecondaryLevel> for RenderPassContinue {\n\n fn flags(&self) -> gfx_hal::command::CommandBufferFlags {\n\n gfx_hal::command::CommandBufferFlags::RENDER_PASS_CONTINUE\n\n }\n\n}\n\n\n\nimpl<L> RenderPassRelation<L> for OutsideRenderPass {\n\n fn flags(&self) -> gfx_hal::command::CommandBufferFlags {\n\n gfx_hal::command::CommandBufferFlags::empty()\n\n }\n\n}\n","file_path":"command/src/buffer/usage.rs","rank":17,"score":183189.02971598716},{"content":"/// Descriptor for render group\n\npub trait RenderGroupDesc<B: Backend, T: ?Sized>: std::fmt::Debug {\n\n /// Make render group builder.\n\n fn builder(self) -> DescBuilder<B, T, Self>\n\n where\n\n Self: Sized,\n\n {\n\n DescBuilder {\n\n desc: self,\n\n buffers: Vec::new(),\n\n images: Vec::new(),\n\n dependencies: Vec::new(),\n\n marker: std::marker::PhantomData,\n\n }\n\n }\n\n\n\n /// Get buffers used by the group. Empty by default.\n\n fn buffers(&self) -> Vec<BufferAccess> {\n\n Vec::new()\n\n }\n\n\n","file_path":"graph/src/node/render/group/mod.rs","rank":18,"score":177155.7074051562},{"content":"/// Cast slice of some arbitrary type into slice of bytes.\n\npub fn cast_slice<T>(slice: &[T]) -> &[u8] {\n\n let len = std::mem::size_of::<T>() * slice.len();\n\n let ptr = slice.as_ptr();\n\n unsafe { std::slice::from_raw_parts(ptr as _, len) }\n\n}\n\n\n","file_path":"util/src/casts.rs","rank":19,"score":175867.4137690505},{"content":"/// Description of the node.\n\n/// Implementation of the builder type provide framegraph with static information about node\n\n/// that is used for building the node.\n\npub trait NodeDesc<B: Backend, T: ?Sized>: std::fmt::Debug + Sized + 'static {\n\n /// Node this builder builds.\n\n type Node: Node<B, T>;\n\n\n\n /// Make node builder.\n\n fn builder(self) -> DescBuilder<B, T, Self> {\n\n DescBuilder {\n\n desc: self,\n\n buffers: Vec::new(),\n\n images: Vec::new(),\n\n dependencies: Vec::new(),\n\n marker: std::marker::PhantomData,\n\n }\n\n }\n\n\n\n /// Get set or buffer resources the node uses.\n\n fn buffers(&self) -> Vec<BufferAccess> {\n\n Vec::new()\n\n }\n\n\n","file_path":"graph/src/node/mod.rs","rank":20,"score":174680.72337986546},{"content":"/// Descriptor for simple graphics pipeline implementation.\n\npub trait SimpleGraphicsPipelineDesc<B: Backend, T: ?Sized>: std::fmt::Debug {\n\n /// Simple graphics pipeline implementation\n\n type Pipeline: SimpleGraphicsPipeline<B, T>;\n\n\n\n /// Make simple render group builder.\n\n fn builder(self) -> DescBuilder<B, T, SimpleRenderGroupDesc<Self>>\n\n where\n\n Self: Sized,\n\n {\n\n SimpleRenderGroupDesc { inner: self }.builder()\n\n }\n\n\n\n /// Get set or buffer resources the node uses.\n\n fn buffers(&self) -> Vec<BufferAccess> {\n\n Vec::new()\n\n }\n\n\n\n /// Get set or image resources the node uses.\n\n fn images(&self) -> Vec<ImageAccess> {\n\n Vec::new()\n","file_path":"graph/src/node/render/group/simple.rs","rank":21,"score":174359.30249549152},{"content":"/// Logically compares two descriptor layout bindings to determine their relational equality.\n\npub fn compare_bindings(\n\n lhv: &gfx_hal::pso::DescriptorSetLayoutBinding,\n\n rhv: &gfx_hal::pso::DescriptorSetLayoutBinding,\n\n) -> BindingEquality {\n\n if lhv.binding == rhv.binding\n\n && lhv.count == rhv.count\n\n && lhv.immutable_samplers == rhv.immutable_samplers\n\n && lhv.ty == rhv.ty\n\n {\n\n return BindingEquality::Equal;\n\n } else {\n\n if lhv.binding == rhv.binding {\n\n return BindingEquality::SameBindingNonEqual;\n\n }\n\n }\n\n\n\n return BindingEquality::NotEqual;\n\n}\n\n\n\n/// This enum provides logical comparison results for sets. Because shaders can share bindings,\n\n/// we cannot do a strict equality check for exclusion - we must see if shaders match, or if they are the same bindings\n\n/// but mismatched descriptions.\n","file_path":"shader/src/reflect/mod.rs","rank":22,"score":173809.71608693583},{"content":"#[allow(unused)]\n\ntype NoSubmits<B> = std::iter::Empty<Submit<B, NoSimultaneousUse, PrimaryLevel, OutsideRenderPass>>;\n\n\n\n/// Command queue submission.\n\n#[derive(Debug)]\n\npub struct Submission<B, W = NoWaits<B>, C = NoSubmits<B>, S = NoSignals<B>> {\n\n /// Iterator over semaphores with stage flag to wait on.\n\n pub waits: W,\n\n\n\n /// Iterator over submittables.\n\n pub submits: C,\n\n\n\n /// Iterator over semaphores to signal.\n\n pub signals: S,\n\n\n\n /// Marker type for submission backend.\n\n pub marker: std::marker::PhantomData<fn() -> B>,\n\n}\n\n\n\nimpl<B> Submission<B>\n\nwhere\n","file_path":"command/src/family/submission.rs","rank":23,"score":172434.39678776462},{"content":"/// Find required synchronization for all submissions in `Chains`.\n\npub fn sync<F, S, W>(chains: &Chains, mut new_semaphore: F) -> Schedule<SyncData<S, W>>\n\nwhere\n\n F: FnMut() -> (S, W),\n\n{\n\n let ref schedule = chains.schedule;\n\n let ref buffers = chains.buffers;\n\n let ref images = chains.images;\n\n\n\n let mut sync = SyncTemp(fnv::FnvHashMap::default());\n\n for (&id, chain) in buffers {\n\n sync_chain(id, chain, schedule, &mut sync);\n\n }\n\n for (&id, chain) in images {\n\n sync_chain(id, chain, schedule, &mut sync);\n\n }\n\n if schedule.queue_count() > 1 {\n\n optimize(schedule, &mut sync);\n\n }\n\n\n\n let mut result = Schedule::new();\n","file_path":"chain/src/sync.rs","rank":24,"score":158488.2464830378},{"content":"/// Check if slice is sorted using ordered key and key extractor\n\nfn is_slice_sorted_by_key<'a, T, K: Ord>(slice: &'a [T], f: impl Fn(&'a T) -> K) -> bool {\n\n if let Some((first, slice)) = slice.split_first() {\n\n let mut cmp = f(first);\n\n for item in slice {\n\n let item = f(item);\n\n if cmp > item {\n\n return false;\n\n }\n\n cmp = item;\n\n }\n\n }\n\n true\n\n}\n\n\n\nimpl<'a, A> From<Vec<A>> for MeshBuilder<'a>\n\nwhere\n\n A: AsVertex + 'a,\n\n{\n\n fn from(vertices: Vec<A>) -> Self {\n\n MeshBuilder::new().with_vertices(vertices)\n","file_path":"mesh/src/mesh.rs","rank":25,"score":157241.5384744396},{"content":"/// Dynamic node builder that emits `DynNode`.\n\npub trait NodeBuilder<B: Backend, T: ?Sized>: std::fmt::Debug {\n\n /// Pick family for this node to be executed onto.\n\n fn family(&self, factory: &mut Factory<B>, families: &[Family<B>]) -> Option<FamilyId>;\n\n\n\n /// Get buffer accessed by the node.\n\n fn buffers(&self) -> Vec<(BufferId, BufferAccess)>;\n\n\n\n /// Get images accessed by the node.\n\n fn images(&self) -> Vec<(ImageId, ImageAccess)>;\n\n\n\n /// Indices of nodes this one dependes on.\n\n fn dependencies(&self) -> Vec<NodeId>;\n\n\n\n /// Build node.\n\n fn build<'a>(\n\n self: Box<Self>,\n\n ctx: &GraphContext<B>,\n\n factory: &mut Factory<B>,\n\n family: &mut Family<B>,\n\n queue: usize,\n","file_path":"graph/src/node/mod.rs","rank":26,"score":155917.74154184808},{"content":"/// Builder fror render group.\n\npub trait RenderGroupBuilder<B: Backend, T: ?Sized>: std::fmt::Debug {\n\n /// Make subpass from render group.\n\n fn into_subpass(self) -> SubpassBuilder<B, T>\n\n where\n\n Self: Sized + 'static,\n\n {\n\n SubpassBuilder::new().with_group(self)\n\n }\n\n\n\n /// Number of color output images.\n\n fn colors(&self) -> usize;\n\n\n\n /// Is depth image used.\n\n fn depth(&self) -> bool;\n\n\n\n /// Get buffers used by the group\n\n fn buffers(&self) -> Vec<(BufferId, BufferAccess)>;\n\n\n\n /// Get images used by the group\n\n fn images(&self) -> Vec<(ImageId, ImageAccess)>;\n","file_path":"graph/src/node/render/group/mod.rs","rank":27,"score":148936.18876677073},{"content":"#[allow(unused)]\n\ntype NoSignals<B> = std::iter::Empty<&'static <B as gfx_hal::Backend>::Semaphore>;\n","file_path":"command/src/family/submission.rs","rank":28,"score":148874.81456953293},{"content":"/// Trait-object safe `Node`.\n\npub trait DynNode<B: Backend, T: ?Sized>: std::fmt::Debug + Sync + Send {\n\n /// Record commands required by node.\n\n /// Recorded buffers go into `submits`.\n\n unsafe fn run<'a>(\n\n &mut self,\n\n ctx: &GraphContext<B>,\n\n factory: &Factory<B>,\n\n queue: &mut Queue<B>,\n\n aux: &T,\n\n frames: &Frames<B>,\n\n waits: &[(&'a B::Semaphore, gfx_hal::pso::PipelineStage)],\n\n signals: &[&'a B::Semaphore],\n\n fence: Option<&mut Fence<B>>,\n\n );\n\n\n\n /// Dispose of the node.\n\n ///\n\n /// # Safety\n\n ///\n\n /// Must be called after waiting for device idle.\n","file_path":"graph/src/node/mod.rs","rank":29,"score":145715.28809988915},{"content":"/// One or more graphics pipelines to be called in subpass.\n\npub trait RenderGroup<B: Backend, T: ?Sized>: std::fmt::Debug + Send + Sync {\n\n /// Prepare resources and data for rendering.\n\n fn prepare(\n\n &mut self,\n\n factory: &Factory<B>,\n\n queue: QueueId,\n\n index: usize,\n\n subpass: gfx_hal::pass::Subpass<'_, B>,\n\n aux: &T,\n\n ) -> PrepareResult;\n\n\n\n /// Record commands.\n\n fn draw_inline(\n\n &mut self,\n\n encoder: RenderPassEncoder<'_, B>,\n\n index: usize,\n\n subpass: gfx_hal::pass::Subpass<'_, B>,\n\n aux: &T,\n\n );\n\n\n\n /// Free all resources and destroy group instance.\n\n fn dispose(self: Box<Self>, factory: &mut Factory<B>, aux: &T);\n\n}\n\n\n","file_path":"graph/src/node/render/group/mod.rs","rank":30,"score":141413.4070264092},{"content":"/// Load mesh data from obj.\n\npub fn load_from_obj(\n\n bytes: &[u8],\n\n) -> Result<Vec<(MeshBuilder<'static>, Option<String>)>, failure::Error> {\n\n let string = std::str::from_utf8(bytes)?;\n\n let set = obj::parse(string).map_err(|e| {\n\n failure::format_err!(\n\n \"Error during parsing obj-file at line '{}': {}\",\n\n e.line_number,\n\n e.message\n\n )\n\n })?;\n\n load_from_data(set)\n\n}\n\n\n","file_path":"mesh/src/format/obj.rs","rank":31,"score":135914.31321578793},{"content":"#[allow(unused_variables)]\n\npub fn init<B>(\n\n config: Config<impl DevicesConfigure, impl HeapsConfigure, impl QueuesConfigure>,\n\n) -> Result<(Factory<B>, Families<B>), failure::Error>\n\nwhere\n\n B: Backend,\n\n{\n\n log::debug!(\"Creating factory\");\n\n rendy_backend_match!(B as backend => {\n\n profile_scope!(concat!(\"init_factory\"));\n\n let instance = backend::Instance::create(\"Rendy\", 1);\n\n Ok(identical_cast(init_with_instance(instance, config)?))\n\n });\n\n}\n\n\n","file_path":"factory/src/factory.rs","rank":32,"score":134720.78352098085},{"content":"/// Initialize `Factory` and Queue `Families` associated with Device\n\n/// using existing `Instance`.\n\npub fn init_with_instance<B>(\n\n instance: impl gfx_hal::Instance<Backend = B>,\n\n config: Config<impl DevicesConfigure, impl HeapsConfigure, impl QueuesConfigure>,\n\n) -> Result<(Factory<B>, Families<B>), failure::Error>\n\nwhere\n\n B: Backend,\n\n{\n\n rendy_with_slow_safety_checks!(\n\n log::warn!(\"Slow safety checks are enabled! Disable them in production by enabling the 'no-slow-safety-checks' feature!\")\n\n );\n\n let mut adapters = instance.enumerate_adapters();\n\n\n\n if adapters.is_empty() {\n\n failure::bail!(\"No physical devices found\");\n\n }\n\n\n\n log::debug!(\n\n \"Physical devices:\\n{:#?}\",\n\n adapters\n\n .iter()\n","file_path":"factory/src/factory.rs","rank":33,"score":132067.3761895332},{"content":"/// Attempts to load a Texture from an image.\n\npub fn load_from_image<R>(\n\n mut reader: R,\n\n config: ImageTextureConfig,\n\n) -> Result<TextureBuilder<'static>, failure::Error>\n\nwhere\n\n R: std::io::BufRead + std::io::Seek,\n\n{\n\n use gfx_hal::format::{Component, Swizzle};\n\n use image::{DynamicImage, GenericImageView};\n\n\n\n let image_format = config.format.map_or_else(\n\n || {\n\n let r = reader.by_ref();\n\n // Longest size of image crate supported magic bytes\n\n let mut format_magic_bytes = [0u8; 10];\n\n r.read_exact(&mut format_magic_bytes)?;\n\n r.seek(std::io::SeekFrom::Current(-10))?;\n\n image::guess_format(&format_magic_bytes)\n\n },\n\n |f| Ok(f),\n","file_path":"texture/src/format/image.rs","rank":34,"score":129579.94498612928},{"content":"/// Convert graph barriers into gfx barriers.\n\npub fn gfx_release_barriers<'a, B: Backend>(\n\n ctx: &'a GraphContext<B>,\n\n buffers: impl IntoIterator<Item = &'a NodeBuffer>,\n\n images: impl IntoIterator<Item = &'a NodeImage>,\n\n) -> (\n\n std::ops::Range<gfx_hal::pso::PipelineStage>,\n\n Vec<gfx_hal::memory::Barrier<'a, B>>,\n\n) {\n\n let mut bstart = gfx_hal::pso::PipelineStage::empty();\n\n let mut bend = gfx_hal::pso::PipelineStage::empty();\n\n\n\n let mut istart = gfx_hal::pso::PipelineStage::empty();\n\n let mut iend = gfx_hal::pso::PipelineStage::empty();\n\n\n\n let barriers: Vec<gfx_hal::memory::Barrier<'_, B>> = buffers\n\n .into_iter()\n\n .filter_map(|buffer| {\n\n buffer.release.as_ref().map(|release| {\n\n bstart |= release.stages.start;\n\n bend |= release.stages.end;\n","file_path":"graph/src/node/mod.rs","rank":35,"score":118673.97627534963},{"content":"/// Chech if slice o f ordered values is sorted.\n\nfn is_slice_sorted<T: Ord>(slice: &[T]) -> bool {\n\n is_slice_sorted_by_key(slice, |i| i)\n\n}\n\n\n","file_path":"mesh/src/mesh.rs","rank":36,"score":117413.429933376},{"content":"/// Convert graph barriers into gfx barriers.\n\npub fn gfx_acquire_barriers<'a, 'b, B: Backend>(\n\n ctx: &'a GraphContext<B>,\n\n buffers: impl IntoIterator<Item = &'b NodeBuffer>,\n\n images: impl IntoIterator<Item = &'b NodeImage>,\n\n) -> (\n\n std::ops::Range<gfx_hal::pso::PipelineStage>,\n\n Vec<gfx_hal::memory::Barrier<'a, B>>,\n\n) {\n\n let mut bstart = gfx_hal::pso::PipelineStage::empty();\n\n let mut bend = gfx_hal::pso::PipelineStage::empty();\n\n\n\n let mut istart = gfx_hal::pso::PipelineStage::empty();\n\n let mut iend = gfx_hal::pso::PipelineStage::empty();\n\n\n\n let barriers: Vec<gfx_hal::memory::Barrier<'_, B>> = buffers\n\n .into_iter()\n\n .filter_map(|buffer| {\n\n buffer.acquire.as_ref().map(|acquire| {\n\n bstart |= acquire.stages.start;\n\n bend |= acquire.stages.end;\n","file_path":"graph/src/node/mod.rs","rank":37,"score":115985.12453492222},{"content":"fn align_by(align: usize, value: usize) -> usize {\n\n ((value + align - 1) / align) * align\n\n}\n\n\n\n/// Single mesh is a collection of buffer ranges that provides available attributes.\n\n/// Usually exactly one mesh is used per draw call.\n\n#[derive(Debug)]\n\npub struct Mesh<B: gfx_hal::Backend> {\n\n vertex_buffer: Escape<Buffer<B>>,\n\n vertex_layouts: Vec<VertexBufferLayout>,\n\n index_buffer: Option<IndexBuffer<B>>,\n\n prim: gfx_hal::Primitive,\n\n len: u32,\n\n}\n\n\n\nimpl<B> Mesh<B>\n\nwhere\n\n B: gfx_hal::Backend,\n\n{\n\n /// Build new mesh with `MeshBuilder`\n","file_path":"mesh/src/mesh.rs","rank":38,"score":111781.73153625792},{"content":"#[derive(Debug, Default)]\n\nstruct GravBounceDesc;\n\n\n\nimpl<B, T> NodeDesc<B, T> for GravBounceDesc\n\nwhere\n\n B: hal::Backend,\n\n T: ?Sized,\n\n{\n\n type Node = GravBounce<B>;\n\n\n\n fn buffers(&self) -> Vec<BufferAccess> {\n\n vec![BufferAccess {\n\n access: hal::buffer::Access::SHADER_READ | hal::buffer::Access::SHADER_WRITE,\n\n stages: hal::pso::PipelineStage::COMPUTE_SHADER,\n\n usage: hal::buffer::Usage::STORAGE | hal::buffer::Usage::TRANSFER_DST,\n\n }]\n\n }\n\n\n\n fn build<'a>(\n\n self,\n\n ctx: &GraphContext<B>,\n","file_path":"rendy/examples/quads/main.rs","rank":39,"score":109052.74898449902},{"content":"/// Represent types that can be interpreted as list of vertex attributes.\n\npub trait AsAttributes {\n\n /// The iterator type for retreived attributes\n\n type Iter: Iterator<Item = Attribute>;\n\n /// Retreive a list of vertex attributes with offsets relative to beginning of that list\n\n fn attributes(self) -> Self::Iter;\n\n}\n\n\n\nimpl AsAttributes for Vec<Attribute> {\n\n type Iter = std::vec::IntoIter<Attribute>;\n\n fn attributes(self) -> Self::Iter {\n\n self.into_iter()\n\n }\n\n}\n\n\n\nimpl AsAttributes for VertexFormat {\n\n type Iter = std::vec::IntoIter<Attribute>;\n\n fn attributes(self) -> Self::Iter {\n\n self.attributes.into_iter()\n\n }\n\n}\n","file_path":"util/src/types/vertex.rs","rank":40,"score":108842.48712193337},{"content":"fn optimize<S>(schedule: &Schedule<S>, sync: &mut SyncTemp) {\n\n for queue in schedule.iter().flat_map(|family| family.iter()) {\n\n let mut found = fnv::FnvHashMap::default();\n\n for submission in queue.iter() {\n\n optimize_submission(submission.id(), &mut found, sync);\n\n }\n\n }\n\n}\n","file_path":"chain/src/sync.rs","rank":41,"score":108657.92843783982},{"content":"/// Function copied from range_contains RFC rust implementation in nightly\n\nfn range_contains<U, R>(range: &R, item: &U) -> bool\n\nwhere\n\n U: ?Sized + PartialOrd<U>,\n\n R: RangeBounds<U>,\n\n{\n\n (match range.start_bound() {\n\n Bound::Included(ref start) => *start <= item,\n\n Bound::Excluded(ref start) => *start < item,\n\n Bound::Unbounded => true,\n\n }) && (match range.end_bound() {\n\n Bound::Included(ref end) => item <= *end,\n\n Bound::Excluded(ref end) => item < *end,\n\n Bound::Unbounded => true,\n\n })\n\n}\n","file_path":"shader/src/reflect/mod.rs","rank":42,"score":106918.8936618085},{"content":"#[derive(Debug, Default)]\n\nstruct SpriteGraphicsPipelineDesc;\n\n\n","file_path":"rendy/examples/sprite/main.rs","rank":43,"score":106559.16805680966},{"content":"#[derive(Debug, Default)]\n\nstruct QuadsRenderPipelineDesc;\n\n\n","file_path":"rendy/examples/quads/main.rs","rank":44,"score":106559.16805680966},{"content":"#[derive(Debug, Default)]\n\nstruct MeshRenderPipelineDesc;\n\n\n","file_path":"rendy/examples/meshes/main.rs","rank":45,"score":106559.16805680966},{"content":"#[derive(Debug, Default)]\n\nstruct TriangleRenderPipelineDesc;\n\n\n","file_path":"rendy/examples/triangle/main.rs","rank":46,"score":106559.16805680966},{"content":"#[derive(Debug, Default)]\n\nstruct TriangleRenderPipelineDesc;\n\n\n","file_path":"rendy/examples/source_shaders/main.rs","rank":47,"score":104224.9084714688},{"content":"/// Casts identical types.\n\n/// Useful in generic environment where caller knows that two types are the same\n\n/// but Rust is not convinced.\n\n///\n\n/// # Panics\n\n///\n\n/// Panics if types are actually different.\n\n///\n\n/// # Example\n\n///\n\n/// ```\n\n/// # extern crate rendy_util;\n\n/// # use rendy_util::identical_cast;\n\n/// # use std::any::TypeId;\n\n/// # fn foo<T: 'static>() {\n\n/// if TypeId::of::<T>() == TypeId::of::<u32>() {\n\n/// let value: T = identical_cast(42u32);\n\n/// }\n\n/// # }\n\n///\n\n/// ```\n\npub fn identical_cast<T: 'static, U: 'static>(value: T) -> U {\n\n assert_eq!(TypeId::of::<T>(), TypeId::of::<U>());\n\n unsafe {\n\n // We know types are the same.\n\n let mut value = std::mem::ManuallyDrop::new(value);\n\n let ptr: *mut T = &mut *value;\n\n std::ptr::read(ptr as *mut U)\n\n }\n\n}\n","file_path":"util/src/casts.rs","rank":48,"score":103628.22196445594},{"content":"/// Calculate automatic `Chains` for nodes.\n\n/// This function tries to find the most appropriate schedule for nodes execution.\n\npub fn collect<Q>(nodes: Vec<Node>, max_queues: Q) -> Chains\n\nwhere\n\n Q: Fn(gfx_hal::queue::QueueFamilyId) -> usize,\n\n{\n\n // Resolve nodes into a form faster to work with.\n\n let (nodes, mut unscheduled_nodes) = resolve_nodes(nodes, max_queues);\n\n let mut ready_nodes = Vec::new();\n\n\n\n // Chains.\n\n let mut images: Vec<ChainData<Image>> = fill(nodes.images.len());\n\n let mut buffers: Vec<ChainData<Buffer>> = fill(nodes.buffers.len());\n\n\n\n // Schedule\n\n let mut schedule = Vec::with_capacity(nodes.queues.len());\n\n for i in 0..nodes.queues.len() {\n\n schedule.push(QueueData {\n\n queue: Queue::new(nodes.queues[i]),\n\n wait_factor: 0,\n\n });\n\n }\n","file_path":"chain/src/collect.rs","rank":49,"score":103602.2942894169},{"content":"fn add_to_chain<R, S>(\n\n id: Id,\n\n family: gfx_hal::queue::QueueFamilyId,\n\n chain_data: &mut ChainData<R>,\n\n sid: SubmissionId,\n\n submission: &mut Submission<S>,\n\n state: State<R>,\n\n set_link: impl FnOnce(&mut Submission<S>, Id, usize),\n\n) where\n\n R: Resource,\n\n{\n\n let node = LinkNode { sid, state };\n\n\n\n chain_data.current_family = Some(family);\n\n chain_data.current_link_wait_factor = max(\n\n submission.wait_factor() + 1,\n\n chain_data.current_link_wait_factor,\n\n );\n\n\n\n let ref mut chain = chain_data.chain;\n","file_path":"chain/src/collect.rs","rank":50,"score":103289.89386206659},{"content":"#[cfg(feature = \"no-slow-safety-checks\")]\n\nfn new_instance_id() -> InstanceId {\n\n InstanceId {}\n\n}\n\n\n","file_path":"util/src/wrap.rs","rank":51,"score":102669.70826530422},{"content":"fn push_vertex_desc(\n\n elements: &[gfx_hal::pso::Element<gfx_hal::format::Format>],\n\n stride: gfx_hal::pso::ElemStride,\n\n rate: gfx_hal::pso::VertexInputRate,\n\n vertex_buffers: &mut Vec<gfx_hal::pso::VertexBufferDesc>,\n\n attributes: &mut Vec<gfx_hal::pso::AttributeDesc>,\n\n) {\n\n let index = vertex_buffers.len() as gfx_hal::pso::BufferIndex;\n\n\n\n vertex_buffers.push(gfx_hal::pso::VertexBufferDesc {\n\n binding: index,\n\n stride,\n\n rate,\n\n });\n\n\n\n let mut location = attributes.last().map_or(0, |a| a.location + 1);\n\n for &element in elements {\n\n attributes.push(gfx_hal::pso::AttributeDesc {\n\n location,\n\n binding: index,\n\n element,\n\n });\n\n location += 1;\n\n }\n\n}\n","file_path":"graph/src/node/render/group/simple.rs","rank":52,"score":102480.8145217411},{"content":"fn max_chunks_per_size() -> usize {\n\n let value = (std::mem::size_of::<usize>() * 8).pow(4);\n\n debug_assert!(fits_u32(value));\n\n value\n\n}\n","file_path":"memory/src/allocator/dynamic.rs","rank":53,"score":100339.71154720121},{"content":"/// Trait for memory region suitable for host writes.\n\npub trait Write<T: Copy> {\n\n /// Get mutable slice of `T` bound to mapped range.\n\n ///\n\n /// # Safety\n\n ///\n\n /// * Returned slice should not be read.\n\n unsafe fn slice(&mut self) -> &mut [T];\n\n\n\n /// Write data into mapped memory sub-region.\n\n ///\n\n /// # Panic\n\n ///\n\n /// Panics if `data.len()` is greater than this sub-region len.\n\n fn write(&mut self, data: &[T]) {\n\n unsafe {\n\n let slice = self.slice();\n\n assert!(data.len() <= slice.len());\n\n copy_nonoverlapping(data.as_ptr(), slice.as_mut_ptr(), data.len());\n\n }\n\n }\n","file_path":"memory/src/mapping/write.rs","rank":54,"score":100273.76464432149},{"content":"#[cfg(feature = \"no-slow-safety-checks\")]\n\nfn new_device_id(instance: InstanceId) -> DeviceId {\n\n DeviceId { instance }\n\n}\n\n\n\n/// Id of the hal instance.\n\n#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]\n\npub struct InstanceId {\n\n /// Unique id.\n\n #[cfg(not(feature = \"no-slow-safety-checks\"))]\n\n pub id: u32,\n\n}\n\n\n\nimpl InstanceId {\n\n /// Create new instance id.\n\n pub fn new() -> Self {\n\n new_instance_id()\n\n }\n\n}\n\n\n\n/// Raw instance wrapper with id.\n","file_path":"util/src/wrap.rs","rank":55,"score":92550.08383893355},{"content":"fn fill<T: Default>(num: usize) -> Vec<T> {\n\n let mut vec = Vec::with_capacity(num);\n\n for _ in 0..num {\n\n vec.push(T::default());\n\n }\n\n vec\n\n}\n\n\n","file_path":"chain/src/collect.rs","rank":56,"score":90627.97670858382},{"content":"fn sync_chain<R, S>(id: Id, chain: &Chain<R>, schedule: &Schedule<S>, sync: &mut SyncTemp)\n\nwhere\n\n R: Resource,\n\n{\n\n let uid = id.into();\n\n\n\n let pairs = chain\n\n .links()\n\n .windows(2)\n\n .map(|pair| (&pair[0], &pair[1]))\n\n .chain(\n\n chain\n\n .links()\n\n .first()\n\n .and_then(|first| chain.links().last().map(move |last| (last, first))),\n\n );\n\n\n\n for (prev_link, link) in pairs {\n\n log::trace!(\"Sync {:#?}:{:#?}\", prev_link.access(), link.access());\n\n if prev_link.family() == link.family() {\n","file_path":"chain/src/sync.rs","rank":57,"score":87819.95639828179},{"content":"struct SyncTemp(fnv::FnvHashMap<SubmissionId, SyncData<Semaphore, Semaphore>>);\n\nimpl SyncTemp {\n\n fn get_sync(&mut self, sid: SubmissionId) -> &mut SyncData<Semaphore, Semaphore> {\n\n self.0.entry(sid).or_insert_with(|| SyncData::new())\n\n }\n\n}\n\n\n","file_path":"chain/src/sync.rs","rank":58,"score":82696.44080356683},{"content":"fn match_kind(kind: Kind, view_kind: ViewKind, view_caps: ViewCapabilities) -> bool {\n\n match kind {\n\n Kind::D1(..) => match view_kind {\n\n ViewKind::D1 | ViewKind::D1Array => true,\n\n _ => false,\n\n },\n\n Kind::D2(..) => match view_kind {\n\n ViewKind::D2 | ViewKind::D2Array => true,\n\n ViewKind::Cube => {\n\n if view_caps.contains(ViewCapabilities::KIND_CUBE) {\n\n true\n\n } else {\n\n false\n\n }\n\n }\n\n _ => false,\n\n },\n\n Kind::D3(..) => {\n\n if view_caps == ViewCapabilities::KIND_2D_ARRAY {\n\n if view_kind == ViewKind::D2 {\n","file_path":"resource/src/image.rs","rank":59,"score":78854.39654856178},{"content":"#[derive(Clone, Debug, PartialEq, Eq, Hash)]\n\nstruct Semaphore {\n\n id: Id,\n\n points: Range<SubmissionId>,\n\n}\n\n\n\nimpl Semaphore {\n\n fn new(id: Id, points: Range<SubmissionId>) -> Self {\n\n Semaphore { id, points }\n\n }\n\n}\n\n\n\n/// Semaphore signal info.\n\n/// There must be paired wait.\n\n#[derive(Copy, Clone, Debug, PartialEq, Eq)]\n\npub struct Signal<S>(S);\n\n\n\nimpl<S> Signal<S> {\n\n /// Create signaling for specified point.\n\n /// At this point `Wait` must be created as well.\n\n /// `id` and `point` combination must be unique.\n","file_path":"chain/src/sync.rs","rank":60,"score":75514.72545184026},{"content":"fn resolve_nodes<Q>(nodes: Vec<Node>, max_queues: Q) -> (ResolvedNodeSet, Vec<usize>)\n\nwhere\n\n Q: Fn(gfx_hal::queue::QueueFamilyId) -> usize,\n\n{\n\n let node_count = nodes.len();\n\n\n\n let mut unscheduled_nodes = fill(nodes.len());\n\n let mut reified_nodes: Vec<ResolvedNode> = fill(nodes.len());\n\n let mut node_ids = LookupBuilder::new();\n\n let mut queues = LookupBuilder::new();\n\n let mut buffers = LookupBuilder::new();\n\n let mut images = LookupBuilder::new();\n\n\n\n let mut family_full = fnv::FnvHashMap::default();\n\n for node in nodes {\n\n let family = node.family;\n\n if !family_full.contains_key(&family) {\n\n let count = max_queues(family);\n\n assert!(count > 0, \"Cannot create a family with 0 max queues.\");\n\n for i in 0..count {\n","file_path":"chain/src/collect.rs","rank":61,"score":75514.12919358836},{"content":"#[derive(PartialEq, PartialOrd, Eq, Ord)]\n\nstruct Fitness {\n\n transfers: usize,\n\n wait_factor: usize,\n\n}\n\n\n","file_path":"chain/src/collect.rs","rank":62,"score":75510.75273099831},{"content":"#[derive(Clone, Copy, Debug)]\n\n#[repr(C, align(16))]\n\nstruct Light {\n\n pos: nalgebra::Vector3<f32>,\n\n pad: f32,\n\n intencity: f32,\n\n}\n\n\n","file_path":"rendy/examples/meshes/main.rs","rank":63,"score":73970.0688158061},{"content":"#[derive(Debug)]\n\nstruct Camera {\n\n view: nalgebra::Projective3<f32>,\n\n proj: nalgebra::Perspective3<f32>,\n\n}\n\n\n","file_path":"rendy/examples/meshes/main.rs","rank":64,"score":73965.40854538152},{"content":"struct ResolvedNode {\n\n id: usize,\n\n family: gfx_hal::queue::QueueFamilyId,\n\n queues: Range<usize>,\n\n rev_deps: Vec<usize>,\n\n buffers: Vec<(usize, State<Buffer>)>,\n\n images: Vec<(usize, State<Image>)>,\n\n}\n\n\n\nimpl Default for ResolvedNode {\n\n fn default() -> Self {\n\n ResolvedNode {\n\n id: 0,\n\n family: gfx_hal::queue::QueueFamilyId(0),\n\n queues: 0..0,\n\n rev_deps: Vec::new(),\n\n buffers: Vec::new(),\n\n images: Vec::new(),\n\n }\n\n }\n\n}\n\n\n","file_path":"chain/src/collect.rs","rank":65,"score":73960.28564862139},{"content":"struct QueueData {\n\n queue: Queue<Unsynchronized>,\n\n wait_factor: usize,\n\n}\n\n\n","file_path":"chain/src/collect.rs","rank":66,"score":73960.28564862139},{"content":"fn fitness(\n\n node: &ResolvedNode,\n\n images: &mut Vec<ChainData<Image>>,\n\n buffers: &mut Vec<ChainData<Buffer>>,\n\n schedule: &mut Vec<QueueData>,\n\n) -> (Fitness, usize) {\n\n let mut transfers = 0;\n\n let mut wait_factor_from_chains = 0;\n\n\n\n // Collect minimal waits required and resource transfers count.\n\n for &(id, _) in &node.buffers {\n\n let chain = &buffers[id];\n\n if chain\n\n .current_family\n\n .map_or(false, |family| family != node.family)\n\n {\n\n transfers += 1;\n\n }\n\n wait_factor_from_chains = max(wait_factor_from_chains, chain.last_link_wait_factor);\n\n }\n","file_path":"chain/src/collect.rs","rank":67,"score":73731.57040879273},{"content":"#[repr(C)]\n\n#[derive(Copy, Clone)]\n\nstruct PosVel {\n\n pos: [f32; 2],\n\n vel: [f32; 2],\n\n}\n\n\n\nlazy_static::lazy_static! {\n\n static ref RENDER_VERTEX: SpirvShader = SourceShaderInfo::new(\n\n include_str!(\"render.vert\"),\n\n concat!(env!(\"CARGO_MANIFEST_DIR\"), \"/examples/quads/render.vert\").into(),\n\n ShaderKind::Vertex,\n\n SourceLanguage::GLSL,\n\n \"main\",\n\n ).precompile().unwrap();\n\n\n\n static ref RENDER_FRAGMENT: SpirvShader = SourceShaderInfo::new(\n\n include_str!(\"render.frag\"),\n\n concat!(env!(\"CARGO_MANIFEST_DIR\"), \"/examples/quads/render.frag\").into(),\n\n ShaderKind::Fragment,\n\n SourceLanguage::GLSL,\n\n \"main\",\n","file_path":"rendy/examples/quads/main.rs","rank":68,"score":72535.28141386082},{"content":"#[derive(Clone, Copy)]\n\n#[repr(C, align(16))]\n\nstruct UniformArgs {\n\n proj: nalgebra::Matrix4<f32>,\n\n view: nalgebra::Matrix4<f32>,\n\n lights_count: i32,\n\n pad: [i32; 3],\n\n lights: [Light; MAX_LIGHTS],\n\n}\n\n\n","file_path":"rendy/examples/meshes/main.rs","rank":69,"score":72535.22428154098},{"content":"struct ResolvedNodeSet {\n\n nodes: Vec<ResolvedNode>,\n\n queues: Vec<QueueId>,\n\n buffers: Vec<Id>,\n\n images: Vec<Id>,\n\n}\n\n\n","file_path":"chain/src/collect.rs","rank":70,"score":72530.22213123558},{"content":"#[cfg(any(feature = \"dx12\", feature = \"metal\", feature = \"vulkan\"))]\n\nfn run(\n\n event_loop: &mut EventsLoop,\n\n factory: &mut Factory<Backend>,\n\n families: &mut Families<Backend>,\n\n mut graph: Graph<Backend, ()>,\n\n) -> Result<(), failure::Error> {\n\n let started = std::time::Instant::now();\n\n\n\n let mut frames = 0u64..;\n\n let mut elapsed = started.elapsed();\n\n\n\n for _ in &mut frames {\n\n factory.maintain(families);\n\n event_loop.poll_events(|_| ());\n\n graph.run(factory, families, &());\n\n\n\n elapsed = started.elapsed();\n\n if elapsed >= std::time::Duration::new(5, 0) {\n\n break;\n\n }\n","file_path":"rendy/examples/triangle/main.rs","rank":71,"score":72199.29949737784},{"content":"fn subresource_to_range(\n\n sub: &gfx_hal::image::SubresourceLayers,\n\n) -> gfx_hal::image::SubresourceRange {\n\n gfx_hal::image::SubresourceRange {\n\n aspects: sub.aspects,\n\n levels: sub.level..sub.level + 1,\n\n layers: sub.layers.clone(),\n\n }\n\n}\n\n\n\n/// A region to be blitted including the source and destination images and states,\n\n#[derive(Debug, Clone)]\n\npub struct BlitRegion {\n\n /// Region to blit from\n\n pub src: BlitImageState,\n\n /// Region to blit to\n\n pub dst: BlitImageState,\n\n}\n\n\n\nimpl BlitRegion {\n","file_path":"factory/src/blitter.rs","rank":72,"score":72199.29949737784},{"content":"#[cfg(any(feature = \"dx12\", feature = \"metal\", feature = \"vulkan\"))]\n\nfn run(\n\n event_loop: &mut EventsLoop,\n\n factory: &mut Factory<Backend>,\n\n families: &mut Families<Backend>,\n\n window: &Window,\n\n) -> Result<(), failure::Error> {\n\n let mut graph = build_graph(factory, families, window.clone());\n\n\n\n let started = std::time::Instant::now();\n\n\n\n let mut last_window_size = window.get_inner_size();\n\n let mut need_rebuild = false;\n\n\n\n let mut frames = 0u64..;\n\n let mut elapsed = started.elapsed();\n\n\n\n for _ in &mut frames {\n\n factory.maintain(families);\n\n event_loop.poll_events(|_| ());\n\n let new_window_size = window.get_inner_size();\n","file_path":"rendy/examples/quads/main.rs","rank":73,"score":72199.29949737784},{"content":"#[cfg(not(any(feature = \"dx12\", feature = \"metal\", feature = \"vulkan\")))]\n\nfn main() {\n\n panic!(\"Specify feature: { dx12, metal, vulkan }\");\n\n}\n","file_path":"rendy/examples/triangle/main.rs","rank":74,"score":72199.29949737784},{"content":"#[cfg(not(any(feature = \"dx12\", feature = \"metal\", feature = \"vulkan\")))]\n\nfn main() {\n\n panic!(\"Specify feature: { dx12, metal, vulkan }\");\n\n}\n","file_path":"rendy/examples/meshes/main.rs","rank":75,"score":72199.29949737784},{"content":"#[cfg(not(any(feature = \"dx12\", feature = \"metal\", feature = \"vulkan\")))]\n\nfn main() {\n\n panic!(\"Specify feature: { dx12, metal, vulkan }\");\n\n}\n","file_path":"rendy/examples/sprite/main.rs","rank":76,"score":72199.29949737784},{"content":"#[cfg(not(any(feature = \"dx12\", feature = \"metal\", feature = \"vulkan\")))]\n\nfn main() {\n\n panic!(\"Specify feature: { dx12, metal, vulkan }\");\n\n}\n","file_path":"rendy/examples/init/main.rs","rank":77,"score":72199.29949737784},{"content":"fn common_layout(\n\n acc: Option<gfx_hal::image::Layout>,\n\n layout: gfx_hal::image::Layout,\n\n) -> gfx_hal::image::Layout {\n\n match (acc, layout) {\n\n (None, layout) => layout,\n\n (Some(left), right) if left == right => left,\n\n (\n\n Some(gfx_hal::image::Layout::DepthStencilReadOnlyOptimal),\n\n gfx_hal::image::Layout::DepthStencilAttachmentOptimal,\n\n ) => gfx_hal::image::Layout::DepthStencilAttachmentOptimal,\n\n (\n\n Some(gfx_hal::image::Layout::DepthStencilAttachmentOptimal),\n\n gfx_hal::image::Layout::DepthStencilReadOnlyOptimal,\n\n ) => gfx_hal::image::Layout::DepthStencilAttachmentOptimal,\n\n (Some(_), _) => gfx_hal::image::Layout::General,\n\n }\n\n}\n","file_path":"chain/src/resource.rs","rank":78,"score":72199.29949737784},{"content":"fn optimize_submission(\n\n sid: SubmissionId,\n\n found: &mut fnv::FnvHashMap<QueueId, usize>,\n\n sync: &mut SyncTemp,\n\n) {\n\n let mut to_remove = Vec::new();\n\n if let Some(sync_data) = sync.0.get_mut(&sid) {\n\n sync_data\n\n .wait\n\n .sort_unstable_by_key(|wait| (wait.stage(), wait.semaphore().points.end.index()));\n\n sync_data.wait.retain(|wait| {\n\n let start = wait.semaphore().points.start;\n\n if let Some(synched_to) = found.get_mut(&start.queue()) {\n\n if *synched_to >= start.index() {\n\n to_remove.push(wait.semaphore().clone());\n\n return false;\n\n } else {\n\n *synched_to = start.index();\n\n return true;\n\n }\n","file_path":"chain/src/sync.rs","rank":79,"score":72199.29949737784},{"content":"#[cfg(not(any(feature = \"dx12\", feature = \"metal\", feature = \"vulkan\")))]\n\nfn main() {\n\n panic!(\"Specify feature: { dx12, metal, vulkan }\");\n\n}\n","file_path":"rendy/examples/quads/main.rs","rank":80,"score":72199.29949737784},{"content":"#[cfg(any(feature = \"dx12\", feature = \"metal\", feature = \"vulkan\"))]\n\nfn run(\n\n event_loop: &mut EventsLoop,\n\n factory: &mut Factory<Backend>,\n\n families: &mut Families<Backend>,\n\n mut graph: Graph<Backend, ()>,\n\n) -> Result<(), failure::Error> {\n\n let started = std::time::Instant::now();\n\n\n\n std::thread::spawn(move || {\n\n while started.elapsed() < std::time::Duration::new(30, 0) {\n\n std::thread::sleep(std::time::Duration::new(1, 0));\n\n }\n\n\n\n std::process::abort();\n\n });\n\n\n\n let mut frames = 0u64..;\n\n let mut elapsed = started.elapsed();\n\n\n\n for _ in &mut frames {\n","file_path":"rendy/examples/sprite/main.rs","rank":81,"score":72199.29949737784},{"content":"#[derive(Clone, Debug)]\n\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n\nstruct RawIndices<'a> {\n\n #[cfg_attr(feature = \"serde\", serde(with = \"serde_bytes\", borrow))]\n\n indices: Cow<'a, [u8]>,\n\n index_type: gfx_hal::IndexType,\n\n}\n\n\n","file_path":"mesh/src/mesh.rs","rank":82,"score":71695.37562673271},{"content":"#[derive(Clone, Debug)]\n\n#[cfg_attr(feature = \"serde\", derive(serde::Serialize, serde::Deserialize))]\n\nstruct RawVertices<'a> {\n\n #[cfg_attr(feature = \"serde\", serde(with = \"serde_bytes\", borrow))]\n\n vertices: Cow<'a, [u8]>,\n\n format: VertexFormat,\n\n}\n\n\n","file_path":"mesh/src/mesh.rs","rank":83,"score":71695.37562673271},{"content":"/// raw hal type for vertex attribute\n\ntype AttributeElem = gfx_hal::pso::Element<Format>;\n\n\n\n/// Vertex attribute type.\n\n#[derive(Clone, Debug, Derivative)]\n\n#[derivative(PartialEq, Eq, Hash)]\n\npub struct Attribute {\n\n /// globally unique identifier for attribute's semantic\n\n uuid: AttrUuid,\n\n /// hal type with offset and format\n\n element: AttributeElem,\n\n /// Attribute array index. Matrix attributes are treated like array of vectors.\n\n #[derivative(PartialEq = \"ignore\")]\n\n #[derivative(Hash = \"ignore\")]\n\n index: u8,\n\n /// Attribute name as used in the shader\n\n #[derivative(PartialEq = \"ignore\")]\n\n #[derivative(Hash = \"ignore\")]\n\n name: Cow<'static, str>,\n\n}\n\n\n","file_path":"util/src/types/vertex.rs","rank":84,"score":71494.95823204632},{"content":"/// Interface to create shader modules from shaders.\n\n/// Implemented for static shaders via [`compile_to_spirv!`] macro.\n\n///\n\npub trait Shader {\n\n /// Get spirv bytecode.\n\n fn spirv(&self) -> Result<std::borrow::Cow<'_, [u8]>, failure::Error>;\n\n\n\n /// Get the entry point of the shader.\n\n fn entry(&self) -> &str;\n\n\n\n /// Get the gfx_hal representation of this shaders kind/stage.\n\n fn stage(&self) -> ShaderStageFlags;\n\n\n\n /// Create shader module.\n\n ///\n\n /// Spir-V bytecode must adhere valid usage on this Vulkan spec page:\n\n /// https://www.khronos.org/registry/vulkan/specs/1.1-extensions/man/html/VkShaderModuleCreateInfo.html\n\n unsafe fn module<B>(\n\n &self,\n\n factory: &rendy_factory::Factory<B>,\n\n ) -> Result<B::ShaderModule, failure::Error>\n\n where\n\n B: Backend,\n","file_path":"shader/src/lib.rs","rank":85,"score":71387.79529109996},{"content":"#[cfg(any(feature = \"dx12\", feature = \"metal\", feature = \"vulkan\"))]\n\nfn run(\n\n event_loop: &mut EventsLoop,\n\n factory: &mut Factory<Backend>,\n\n families: &mut Families<Backend>,\n\n mut graph: Graph<Backend, ()>,\n\n) -> Result<(), failure::Error> {\n\n let started = std::time::Instant::now();\n\n\n\n let mut frames = 0u64..;\n\n let mut elapsed = started.elapsed();\n\n\n\n for _ in &mut frames {\n\n factory.maintain(families);\n\n event_loop.poll_events(|_| ());\n\n graph.run(factory, families, &mut ());\n\n\n\n elapsed = started.elapsed();\n\n if elapsed >= std::time::Duration::new(5, 0) {\n\n break;\n\n }\n","file_path":"rendy/examples/source_shaders/main.rs","rank":86,"score":70775.30658472994},{"content":"fn compare_set(\n\n lhv: &[gfx_hal::pso::DescriptorSetLayoutBinding],\n\n rhv: &[gfx_hal::pso::DescriptorSetLayoutBinding],\n\n) -> SetEquality {\n\n // Bindings may not be in order, so we need to make a copy and index them by binding.\n\n let mut lhv_bindings = HashMap::new();\n\n lhv.iter().for_each(|b| {\n\n lhv_bindings.insert(b.binding, b);\n\n });\n\n\n\n let mut rhv_bindings = HashMap::new();\n\n rhv.iter().for_each(|b| {\n\n rhv_bindings.insert(b.binding, b);\n\n });\n\n\n\n let predicate = if lhv.len() == rhv.len() {\n\n SetEquality::Equal\n\n } else if lhv.len() > rhv.len() {\n\n SetEquality::SupersetOf\n\n } else {\n","file_path":"shader/src/reflect/mod.rs","rank":87,"score":70775.30658472994},{"content":"fn load_from_data(\n\n obj_set: obj::ObjSet,\n\n) -> Result<Vec<(MeshBuilder<'static>, Option<String>)>, failure::Error> {\n\n // Takes a list of objects that contain geometries that contain shapes that contain\n\n // vertex/texture/normal indices into the main list of vertices, and converts to\n\n // MeshBuilders with Position, Normal, TexCoord.\n\n trace!(\"Loading mesh\");\n\n let mut objects = vec![];\n\n\n\n for object in obj_set.objects {\n\n for geometry in &object.geometry {\n\n let mut builder = MeshBuilder::new();\n\n\n\n let mut indices = Vec::new();\n\n\n\n geometry.shapes.iter().for_each(|shape| {\n\n if let obj::Primitive::Triangle(v1, v2, v3) = shape.primitive {\n\n indices.push(v1);\n\n indices.push(v2);\n\n indices.push(v3);\n","file_path":"mesh/src/format/obj.rs","rank":88,"score":70775.30658472994},{"content":"#[cfg(any(feature = \"dx12\", feature = \"metal\", feature = \"vulkan\"))]\n\nfn build_graph(\n\n factory: &mut Factory<Backend>,\n\n families: &mut Families<Backend>,\n\n window: &Window,\n\n) -> Graph<Backend, ()> {\n\n let surface = factory.create_surface(window);\n\n\n\n let mut graph_builder = GraphBuilder::<Backend, ()>::new();\n\n\n\n let posvel = graph_builder.create_buffer(QUADS as u64 * std::mem::size_of::<[f32; 4]>() as u64);\n\n\n\n let size = window\n\n .get_inner_size()\n\n .unwrap()\n\n .to_physical(window.get_hidpi_factor());\n\n let window_kind = hal::image::Kind::D2(size.width as u32, size.height as u32, 1, 1);\n\n\n\n let color = graph_builder.create_image(\n\n window_kind,\n\n 1,\n","file_path":"rendy/examples/quads/main.rs","rank":89,"score":70775.30658472994},{"content":"/// Helper function to find buffer with compatible format.\n\nfn find_compatible_buffer(\n\n vertex_layouts: &[VertexBufferLayout],\n\n format: &VertexFormat,\n\n) -> Option<usize> {\n\n debug_assert!(is_slice_sorted(&*format.attributes));\n\n for (i, layout) in vertex_layouts.iter().enumerate() {\n\n debug_assert!(is_slice_sorted(&*layout.format.attributes));\n\n if is_compatible(&layout.format, format) {\n\n return Some(i);\n\n }\n\n }\n\n None\n\n}\n\n\n","file_path":"mesh/src/mesh.rs","rank":90,"score":70775.30658472994},{"content":"#[cfg(not(any(feature = \"dx12\", feature = \"metal\", feature = \"vulkan\")))]\n\nfn main() {\n\n panic!(\"Specify feature: { dx12, metal, vulkan }\");\n\n}\n","file_path":"rendy/examples/source_shaders/main.rs","rank":91,"score":70775.30658472994},{"content":"use super::queue::QueueId;\n\nuse crate::Id;\n\n\n\n/// Submission id.\n\n#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]\n\npub struct SubmissionId {\n\n /// Queue id of the submission.\n\n pub queue: QueueId,\n\n\n\n /// Index of the queue.\n\n pub index: usize,\n\n}\n\n\n\nimpl SubmissionId {\n\n /// Create new id from queue id and index.\n\n pub fn new(queue: QueueId, index: usize) -> Self {\n\n SubmissionId { queue, index }\n\n }\n\n\n\n /// Get family id.\n","file_path":"chain/src/schedule/submission.rs","rank":97,"score":43.61942218682145},{"content":"use super::submission::{Submission, SubmissionId};\n\n\n\n/// Queue id.\n\n#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]\n\npub struct QueueId {\n\n /// Family id of the queue.\n\n pub family: gfx_hal::queue::QueueFamilyId,\n\n\n\n /// Index of the queue.\n\n pub index: usize,\n\n}\n\n\n\nimpl QueueId {\n\n /// Create queue id from family id and index.\n\n pub fn new(family: gfx_hal::queue::QueueFamilyId, index: usize) -> Self {\n\n QueueId {\n\n family: family,\n\n index,\n\n }\n\n }\n","file_path":"chain/src/schedule/queue.rs","rank":99,"score":40.383088114974484}],"string":"[\n {\n \"content\": \"/// Trait for vertex attributes to implement\\n\\npub trait AsAttribute: Debug + PartialEq + PartialOrd + Copy + Send + Sync + 'static {\\n\\n /// Name of the attribute\\n\\n const NAME: &'static str;\\n\\n /// Attribute format.\\n\\n const FORMAT: Format;\\n\\n}\\n\\n\\n\\n/// A unique identifier for vertex attribute of given name, format and array index.\\n\\n#[derive(Debug, Clone, Copy, Hash, PartialEq, Eq, PartialOrd, Ord)]\\n\\npub struct AttrUuid(u16);\\n\\n\\n\\nlazy_static::lazy_static! {\\n\\n static ref UUID_MAP: parking_lot::RwLock<fnv::FnvHashMap<(Cow<'static, str>, u8, Format), AttrUuid>> =\\n\\n Default::default();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"util/src/types/vertex.rs\",\n \"rank\": 0,\n \"score\": 264876.4016146197\n },\n {\n \"content\": \"/// Trait implemented by all valid vertex formats.\\n\\npub trait AsVertex: Debug + PartialEq + PartialOrd + Copy + Sized + Send + Sync + 'static {\\n\\n /// List of all attributes formats with name and offset.\\n\\n fn vertex() -> VertexFormat;\\n\\n}\\n\\n\\n\\nimpl<T> AsVertex for T\\n\\nwhere\\n\\n T: AsAttribute,\\n\\n{\\n\\n fn vertex() -> VertexFormat {\\n\\n VertexFormat::new(Some((T::FORMAT, T::NAME)))\\n\\n }\\n\\n}\\n\\n\\n\\n/// Vertex format with position and RGBA8 color attributes.\\n\\n#[repr(C)]\\n\\n#[derive(Clone, Copy, Debug, PartialEq, PartialOrd)]\\n\\n#[cfg_attr(feature = \\\"serde\\\", derive(serde::Serialize, serde::Deserialize))]\\n\\npub struct PosColor {\\n\\n /// Position of the vertex in 3D space.\\n\",\n \"file_path\": \"util/src/types/vertex.rs\",\n \"rank\": 1,\n \"score\": 256411.80980042164\n },\n {\n \"content\": \"/// Calculate the number of mip levels for a 2D image with given dimensions\\n\\npub fn mip_levels_from_dims(width: u32, height: u32) -> u8 {\\n\\n ((32 - width.max(height).leading_zeros()).max(1) as u8).min(gfx_hal::image::MAX_LEVEL)\\n\\n}\\n\\n\\n\\n/// Generics-free texture builder.\\n\\n#[derive(Clone, Derivative)]\\n\\n#[derivative(Debug)]\\n\\n#[cfg_attr(feature = \\\"serde\\\", derive(serde::Serialize, serde::Deserialize))]\\n\\n/// Struct for staging data in preparation of building a `Texture`\\n\\npub struct TextureBuilder<'a> {\\n\\n kind: image::Kind,\\n\\n view_kind: image::ViewKind,\\n\\n format: Format,\\n\\n #[derivative(Debug = \\\"ignore\\\")]\\n\\n data: std::borrow::Cow<'a, [u8]>,\\n\\n data_width: u32,\\n\\n data_height: u32,\\n\\n sampler_info: gfx_hal::image::SamplerInfo,\\n\\n swizzle: Swizzle,\\n\\n mip_levels: MipLevels,\\n\",\n \"file_path\": \"texture/src/texture.rs\",\n \"rank\": 2,\n \"score\": 244031.49301182342\n },\n {\n \"content\": \"/// Trait to abstract of specific access flags.\\n\\npub trait AccessFlags: Copy + Debug + BitOr<Output = Self> + BitOrAssign + 'static {\\n\\n /// Get flags value with no flags set.\\n\\n fn empty() -> Self;\\n\\n\\n\\n /// Check if this access must be exclusive.\\n\\n ///\\n\\n /// Basically this checks if all flags are known read flags.\\n\\n fn exclusive(&self) -> bool;\\n\\n}\\n\\n\\n\\nimpl AccessFlags for gfx_hal::buffer::Access {\\n\\n #[inline]\\n\\n fn empty() -> Self {\\n\\n Self::empty()\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn exclusive(&self) -> bool {\\n\\n self.intersects(\\n\\n Self::SHADER_WRITE | Self::TRANSFER_WRITE | Self::HOST_WRITE | Self::MEMORY_WRITE,\\n\",\n \"file_path\": \"chain/src/resource.rs\",\n \"rank\": 3,\n \"score\": 239480.66162868554\n },\n {\n \"content\": \"/// Trait to abstract of specific usage flags.\\n\\npub trait UsageFlags: Copy + Debug + BitOr<Output = Self> + BitOrAssign + 'static {}\\n\\n\\n\\nimpl UsageFlags for gfx_hal::buffer::Usage {}\\n\\nimpl UsageFlags for gfx_hal::image::Usage {}\\n\\n\\n\",\n \"file_path\": \"chain/src/resource.rs\",\n \"rank\": 4,\n \"score\": 239480.6616286856\n },\n {\n \"content\": \"/// Cast vec of some arbitrary type into vec of bytes.\\n\\n/// Can lead to UB if allocator changes. Use with caution.\\n\\n/// TODO: Replace with something safer.\\n\\npub fn cast_vec<T: Copy>(mut vec: Vec<T>) -> Vec<u8> {\\n\\n let len = std::mem::size_of::<T>() * vec.len();\\n\\n let cap = std::mem::size_of::<T>() * vec.capacity();\\n\\n let ptr = vec.as_mut_ptr();\\n\\n std::mem::forget(vec);\\n\\n unsafe { Vec::from_raw_parts(ptr as _, len, cap) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"util/src/casts.rs\",\n \"rank\": 5,\n \"score\": 233854.20633805537\n },\n {\n \"content\": \"/// Retreive a unique identifier for vertex attribute of given name, format and array index.\\n\\n///\\n\\n/// Non-array attributes should always use index 0.\\n\\n/// Matrices and arrays must be specified as a series of attributes with the same name and consecutive indices.\\n\\npub fn attribute_uuid(name: &str, index: u8, format: Format) -> AttrUuid {\\n\\n let read_map = UUID_MAP.read();\\n\\n if let Some(val) = read_map.get(&(Cow::Borrowed(name), index, format)) {\\n\\n return *val;\\n\\n }\\n\\n drop(read_map);\\n\\n\\n\\n let mut write_map = UUID_MAP.write();\\n\\n // First check again if value was not written by previous owner of the lock.\\n\\n if let Some(val) = write_map.get(&(Cow::Borrowed(name), index, format)) {\\n\\n return *val;\\n\\n }\\n\\n\\n\\n // uuid 0 is reserved for unused attribute indices\\n\\n let val = AttrUuid(write_map.len() as u16 + 1);\\n\\n write_map.insert((Cow::Owned(name.to_owned()), index, format), val);\\n\\n val\\n\\n}\\n\\n\\n\\n/// Type for position attribute of vertex.\\n\",\n \"file_path\": \"util/src/types/vertex.rs\",\n \"rank\": 6,\n \"score\": 233365.71346518685\n },\n {\n \"content\": \"struct LookupBuilder<I: Hash + Eq + Copy> {\\n\\n forward: fnv::FnvHashMap<I, usize>,\\n\\n backward: Vec<I>,\\n\\n}\\n\\nimpl<I: Hash + Eq + Copy> LookupBuilder<I> {\\n\\n fn new() -> LookupBuilder<I> {\\n\\n LookupBuilder {\\n\\n forward: fnv::FnvHashMap::default(),\\n\\n backward: Vec::new(),\\n\\n }\\n\\n }\\n\\n\\n\\n fn forward(&mut self, id: I) -> usize {\\n\\n if let Some(&id_num) = self.forward.get(&id) {\\n\\n id_num\\n\\n } else {\\n\\n let id_num = self.backward.len();\\n\\n self.backward.push(id);\\n\\n self.forward.insert(id, id_num);\\n\\n id_num\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"chain/src/collect.rs\",\n \"rank\": 7,\n \"score\": 226389.55817929108\n },\n {\n \"content\": \"/// Cast `cow` of some arbitrary type into `cow` of bytes.\\n\\n/// Can lead to UB if allocator changes. Use with caution.\\n\\n/// TODO: Replace with something safer.\\n\\npub fn cast_cow<T: Copy>(cow: Cow<'_, [T]>) -> Cow<'_, [u8]> {\\n\\n match cow {\\n\\n Cow::Borrowed(slice) => Cow::Borrowed(cast_slice(slice)),\\n\\n Cow::Owned(vec) => Cow::Owned(cast_vec(vec)),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"util/src/casts.rs\",\n \"rank\": 8,\n \"score\": 212440.2066574345\n },\n {\n \"content\": \"/// Abstract capability specifier.\\n\\npub trait Capability: Copy + std::fmt::Debug + 'static {\\n\\n /// Try to create capability instance from queue_type.\\n\\n /// Instance will be created if all required queue_type set.\\n\\n fn from_queue_type(queue_type: QueueType) -> Option<Self>;\\n\\n\\n\\n /// Convert into `QueueType`\\n\\n fn into_queue_type(self) -> QueueType;\\n\\n}\\n\\n\\n\\nimpl Capability for QueueType {\\n\\n fn from_queue_type(queue_type: QueueType) -> Option<Self> {\\n\\n Some(queue_type)\\n\\n }\\n\\n\\n\\n fn into_queue_type(self) -> QueueType {\\n\\n self\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Capability for Transfer {\\n\",\n \"file_path\": \"command/src/capability.rs\",\n \"rank\": 9,\n \"score\": 208087.76399878052\n },\n {\n \"content\": \"/// Type-level usage flags.\\n\\n/// It defines if buffer can be resubmitted without reset.\\n\\n/// Or even resubmitted while being executed.\\n\\npub trait Usage: Copy + Default + std::fmt::Debug + 'static {\\n\\n /// Flags required to begin command buffer.\\n\\n fn flags(&self) -> gfx_hal::command::CommandBufferFlags;\\n\\n}\\n\\n\\n\\nimpl Usage for OneShot {\\n\\n fn flags(&self) -> gfx_hal::command::CommandBufferFlags {\\n\\n gfx_hal::command::CommandBufferFlags::ONE_TIME_SUBMIT\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Usage for MultiShot {\\n\\n fn flags(&self) -> gfx_hal::command::CommandBufferFlags {\\n\\n gfx_hal::command::CommandBufferFlags::empty()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Usage for MultiShot<SimultaneousUse> {\\n\\n fn flags(&self) -> gfx_hal::command::CommandBufferFlags {\\n\\n gfx_hal::command::CommandBufferFlags::SIMULTANEOUS_USE\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Usage for NoSimultaneousUse {\\n\\n fn flags(&self) -> gfx_hal::command::CommandBufferFlags {\\n\\n gfx_hal::command::CommandBufferFlags::empty()\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"command/src/buffer/usage.rs\",\n \"rank\": 10,\n \"score\": 196678.41728714987\n },\n {\n \"content\": \"/// Type-level buffer level flag.\\n\\n/// It defines whether buffer can be submitted to the command queues\\n\\n/// or executed as part of the primary buffers.\\n\\npub trait Level: Copy + Default + std::fmt::Debug + 'static {\\n\\n /// Get raw level value for command buffer allocation.\\n\\n fn raw_level(&self) -> gfx_hal::command::RawLevel;\\n\\n}\\n\\n\\n\\nimpl Level for PrimaryLevel {\\n\\n fn raw_level(&self) -> gfx_hal::command::RawLevel {\\n\\n gfx_hal::command::RawLevel::Primary\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Level for SecondaryLevel {\\n\\n fn raw_level(&self) -> gfx_hal::command::RawLevel {\\n\\n gfx_hal::command::RawLevel::Secondary\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"command/src/buffer/level.rs\",\n \"rank\": 11,\n \"score\": 196678.27636510605\n },\n {\n \"content\": \"/// Specify flags required for command pool creation to allow individual buffer reset.\\n\\npub trait Reset: Copy + Default + std::fmt::Debug + 'static {\\n\\n /// Get flags for reset parameter.\\n\\n fn flags(&self) -> gfx_hal::pool::CommandPoolCreateFlags;\\n\\n}\\n\\n\\n\\nimpl Reset for IndividualReset {\\n\\n fn flags(&self) -> gfx_hal::pool::CommandPoolCreateFlags {\\n\\n gfx_hal::pool::CommandPoolCreateFlags::RESET_INDIVIDUAL\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Reset for NoIndividualReset {\\n\\n fn flags(&self) -> gfx_hal::pool::CommandPoolCreateFlags {\\n\\n gfx_hal::pool::CommandPoolCreateFlags::empty()\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"command/src/buffer/reset.rs\",\n \"rank\": 12,\n \"score\": 196673.78782065873\n },\n {\n \"content\": \"/// AsPixel trait for extracting the underlying data representation information from a Rust data type\\n\\n/// # Example\\n\\n/// ```rust,no-run\\n\\n/// struct Rgba([u8; 4]);\\n\\n/// ```\\n\\npub trait AsPixel: Copy + std::fmt::Debug + Default + Send + Sync + 'static {\\n\\n /// Name of the pixel type.\\n\\n const NAME: &'static str;\\n\\n\\n\\n /// Size of the pixel.\\n\\n const SIZE: u32;\\n\\n\\n\\n /// Pixel format.\\n\\n const FORMAT: gfx_hal::format::Format;\\n\\n}\\n\\n\\n\\nmacro_rules! impl_pixel {\\n\\n ($($alias:ident = $channels:ident $size:ident $type:ident;)*) => {\\n\\n $(\\n\\n /// Pixel type alias.\\n\\n pub type $alias = Pixel<$channels, $size, $type>;\\n\\n\\n\\n impl AsPixel for $alias {\\n\\n const NAME: &'static str = stringify!($alias);\\n\\n const SIZE: u32 = num_channels!($channels) * <$size as ChannelSize>::SIZE;\\n\",\n \"file_path\": \"texture/src/pixel.rs\",\n \"rank\": 13,\n \"score\": 187091.98860042845\n },\n {\n \"content\": \"#[allow(unused)]\\n\\ntype NoWaits<B> = std::iter::Empty<(\\n\\n &'static <B as gfx_hal::Backend>::Semaphore,\\n\\n gfx_hal::pso::PipelineStage,\\n\\n)>;\\n\",\n \"file_path\": \"command/src/family/submission.rs\",\n \"rank\": 14,\n \"score\": 186173.38463780028\n },\n {\n \"content\": \"/// Memory usage trait.\\n\\npub trait MemoryUsage: std::fmt::Debug {\\n\\n /// Get set of properties required for the usage.\\n\\n fn properties_required(&self) -> gfx_hal::memory::Properties;\\n\\n\\n\\n /// Get comparable fitness value for memory properties.\\n\\n ///\\n\\n /// # Panics\\n\\n ///\\n\\n /// This function will panic if properties set doesn't contain required properties.\\n\\n fn memory_fitness(&self, properties: gfx_hal::memory::Properties) -> u32;\\n\\n\\n\\n /// Get comparable fitness value for memory allocator.\\n\\n fn allocator_fitness(&self, kind: Kind) -> u32;\\n\\n}\\n\\n\\n\\nimpl<T> MemoryUsage for T\\n\\nwhere\\n\\n T: std::ops::Deref + std::fmt::Debug,\\n\\n T::Target: MemoryUsage,\\n\\n{\\n\",\n \"file_path\": \"memory/src/usage.rs\",\n \"rank\": 15,\n \"score\": 185048.27412001727\n },\n {\n \"content\": \"fn index_stride(index_type: gfx_hal::IndexType) -> usize {\\n\\n match index_type {\\n\\n gfx_hal::IndexType::U16 => size_of::<u16>(),\\n\\n gfx_hal::IndexType::U32 => size_of::<u32>(),\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> MeshBuilder<'a> {\\n\\n /// Create empty builder.\\n\\n pub fn new() -> Self {\\n\\n MeshBuilder {\\n\\n vertices: smallvec::SmallVec::new(),\\n\\n indices: None,\\n\\n prim: gfx_hal::Primitive::TriangleList,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Convert builder into fully owned type. This forces internal vertex and index buffers\\n\\n /// to be cloned, which allows borrowed source buffers to be released.\\n\\n pub fn into_owned(self) -> MeshBuilder<'static> {\\n\",\n \"file_path\": \"mesh/src/mesh.rs\",\n \"rank\": 16,\n \"score\": 184043.16280914433\n },\n {\n \"content\": \"/// Trait implemented for type-level render pass relation flags.\\n\\n/// `RenderPassContinue` and `OutsideRenderPass`.\\n\\npub trait RenderPassRelation<L>: Copy + Default + std::fmt::Debug + 'static {\\n\\n /// Flags required to begin command buffer.\\n\\n fn flags(&self) -> gfx_hal::command::CommandBufferFlags;\\n\\n}\\n\\n\\n\\nimpl RenderPassRelation<SecondaryLevel> for RenderPassContinue {\\n\\n fn flags(&self) -> gfx_hal::command::CommandBufferFlags {\\n\\n gfx_hal::command::CommandBufferFlags::RENDER_PASS_CONTINUE\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<L> RenderPassRelation<L> for OutsideRenderPass {\\n\\n fn flags(&self) -> gfx_hal::command::CommandBufferFlags {\\n\\n gfx_hal::command::CommandBufferFlags::empty()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"command/src/buffer/usage.rs\",\n \"rank\": 17,\n \"score\": 183189.02971598716\n },\n {\n \"content\": \"/// Descriptor for render group\\n\\npub trait RenderGroupDesc<B: Backend, T: ?Sized>: std::fmt::Debug {\\n\\n /// Make render group builder.\\n\\n fn builder(self) -> DescBuilder<B, T, Self>\\n\\n where\\n\\n Self: Sized,\\n\\n {\\n\\n DescBuilder {\\n\\n desc: self,\\n\\n buffers: Vec::new(),\\n\\n images: Vec::new(),\\n\\n dependencies: Vec::new(),\\n\\n marker: std::marker::PhantomData,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Get buffers used by the group. Empty by default.\\n\\n fn buffers(&self) -> Vec<BufferAccess> {\\n\\n Vec::new()\\n\\n }\\n\\n\\n\",\n \"file_path\": \"graph/src/node/render/group/mod.rs\",\n \"rank\": 18,\n \"score\": 177155.7074051562\n },\n {\n \"content\": \"/// Cast slice of some arbitrary type into slice of bytes.\\n\\npub fn cast_slice<T>(slice: &[T]) -> &[u8] {\\n\\n let len = std::mem::size_of::<T>() * slice.len();\\n\\n let ptr = slice.as_ptr();\\n\\n unsafe { std::slice::from_raw_parts(ptr as _, len) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"util/src/casts.rs\",\n \"rank\": 19,\n \"score\": 175867.4137690505\n },\n {\n \"content\": \"/// Description of the node.\\n\\n/// Implementation of the builder type provide framegraph with static information about node\\n\\n/// that is used for building the node.\\n\\npub trait NodeDesc<B: Backend, T: ?Sized>: std::fmt::Debug + Sized + 'static {\\n\\n /// Node this builder builds.\\n\\n type Node: Node<B, T>;\\n\\n\\n\\n /// Make node builder.\\n\\n fn builder(self) -> DescBuilder<B, T, Self> {\\n\\n DescBuilder {\\n\\n desc: self,\\n\\n buffers: Vec::new(),\\n\\n images: Vec::new(),\\n\\n dependencies: Vec::new(),\\n\\n marker: std::marker::PhantomData,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Get set or buffer resources the node uses.\\n\\n fn buffers(&self) -> Vec<BufferAccess> {\\n\\n Vec::new()\\n\\n }\\n\\n\\n\",\n \"file_path\": \"graph/src/node/mod.rs\",\n \"rank\": 20,\n \"score\": 174680.72337986546\n },\n {\n \"content\": \"/// Descriptor for simple graphics pipeline implementation.\\n\\npub trait SimpleGraphicsPipelineDesc<B: Backend, T: ?Sized>: std::fmt::Debug {\\n\\n /// Simple graphics pipeline implementation\\n\\n type Pipeline: SimpleGraphicsPipeline<B, T>;\\n\\n\\n\\n /// Make simple render group builder.\\n\\n fn builder(self) -> DescBuilder<B, T, SimpleRenderGroupDesc<Self>>\\n\\n where\\n\\n Self: Sized,\\n\\n {\\n\\n SimpleRenderGroupDesc { inner: self }.builder()\\n\\n }\\n\\n\\n\\n /// Get set or buffer resources the node uses.\\n\\n fn buffers(&self) -> Vec<BufferAccess> {\\n\\n Vec::new()\\n\\n }\\n\\n\\n\\n /// Get set or image resources the node uses.\\n\\n fn images(&self) -> Vec<ImageAccess> {\\n\\n Vec::new()\\n\",\n \"file_path\": \"graph/src/node/render/group/simple.rs\",\n \"rank\": 21,\n \"score\": 174359.30249549152\n },\n {\n \"content\": \"/// Logically compares two descriptor layout bindings to determine their relational equality.\\n\\npub fn compare_bindings(\\n\\n lhv: &gfx_hal::pso::DescriptorSetLayoutBinding,\\n\\n rhv: &gfx_hal::pso::DescriptorSetLayoutBinding,\\n\\n) -> BindingEquality {\\n\\n if lhv.binding == rhv.binding\\n\\n && lhv.count == rhv.count\\n\\n && lhv.immutable_samplers == rhv.immutable_samplers\\n\\n && lhv.ty == rhv.ty\\n\\n {\\n\\n return BindingEquality::Equal;\\n\\n } else {\\n\\n if lhv.binding == rhv.binding {\\n\\n return BindingEquality::SameBindingNonEqual;\\n\\n }\\n\\n }\\n\\n\\n\\n return BindingEquality::NotEqual;\\n\\n}\\n\\n\\n\\n/// This enum provides logical comparison results for sets. Because shaders can share bindings,\\n\\n/// we cannot do a strict equality check for exclusion - we must see if shaders match, or if they are the same bindings\\n\\n/// but mismatched descriptions.\\n\",\n \"file_path\": \"shader/src/reflect/mod.rs\",\n \"rank\": 22,\n \"score\": 173809.71608693583\n },\n {\n \"content\": \"#[allow(unused)]\\n\\ntype NoSubmits<B> = std::iter::Empty<Submit<B, NoSimultaneousUse, PrimaryLevel, OutsideRenderPass>>;\\n\\n\\n\\n/// Command queue submission.\\n\\n#[derive(Debug)]\\n\\npub struct Submission<B, W = NoWaits<B>, C = NoSubmits<B>, S = NoSignals<B>> {\\n\\n /// Iterator over semaphores with stage flag to wait on.\\n\\n pub waits: W,\\n\\n\\n\\n /// Iterator over submittables.\\n\\n pub submits: C,\\n\\n\\n\\n /// Iterator over semaphores to signal.\\n\\n pub signals: S,\\n\\n\\n\\n /// Marker type for submission backend.\\n\\n pub marker: std::marker::PhantomData<fn() -> B>,\\n\\n}\\n\\n\\n\\nimpl<B> Submission<B>\\n\\nwhere\\n\",\n \"file_path\": \"command/src/family/submission.rs\",\n \"rank\": 23,\n \"score\": 172434.39678776462\n },\n {\n \"content\": \"/// Find required synchronization for all submissions in `Chains`.\\n\\npub fn sync<F, S, W>(chains: &Chains, mut new_semaphore: F) -> Schedule<SyncData<S, W>>\\n\\nwhere\\n\\n F: FnMut() -> (S, W),\\n\\n{\\n\\n let ref schedule = chains.schedule;\\n\\n let ref buffers = chains.buffers;\\n\\n let ref images = chains.images;\\n\\n\\n\\n let mut sync = SyncTemp(fnv::FnvHashMap::default());\\n\\n for (&id, chain) in buffers {\\n\\n sync_chain(id, chain, schedule, &mut sync);\\n\\n }\\n\\n for (&id, chain) in images {\\n\\n sync_chain(id, chain, schedule, &mut sync);\\n\\n }\\n\\n if schedule.queue_count() > 1 {\\n\\n optimize(schedule, &mut sync);\\n\\n }\\n\\n\\n\\n let mut result = Schedule::new();\\n\",\n \"file_path\": \"chain/src/sync.rs\",\n \"rank\": 24,\n \"score\": 158488.2464830378\n },\n {\n \"content\": \"/// Check if slice is sorted using ordered key and key extractor\\n\\nfn is_slice_sorted_by_key<'a, T, K: Ord>(slice: &'a [T], f: impl Fn(&'a T) -> K) -> bool {\\n\\n if let Some((first, slice)) = slice.split_first() {\\n\\n let mut cmp = f(first);\\n\\n for item in slice {\\n\\n let item = f(item);\\n\\n if cmp > item {\\n\\n return false;\\n\\n }\\n\\n cmp = item;\\n\\n }\\n\\n }\\n\\n true\\n\\n}\\n\\n\\n\\nimpl<'a, A> From<Vec<A>> for MeshBuilder<'a>\\n\\nwhere\\n\\n A: AsVertex + 'a,\\n\\n{\\n\\n fn from(vertices: Vec<A>) -> Self {\\n\\n MeshBuilder::new().with_vertices(vertices)\\n\",\n \"file_path\": \"mesh/src/mesh.rs\",\n \"rank\": 25,\n \"score\": 157241.5384744396\n },\n {\n \"content\": \"/// Dynamic node builder that emits `DynNode`.\\n\\npub trait NodeBuilder<B: Backend, T: ?Sized>: std::fmt::Debug {\\n\\n /// Pick family for this node to be executed onto.\\n\\n fn family(&self, factory: &mut Factory<B>, families: &[Family<B>]) -> Option<FamilyId>;\\n\\n\\n\\n /// Get buffer accessed by the node.\\n\\n fn buffers(&self) -> Vec<(BufferId, BufferAccess)>;\\n\\n\\n\\n /// Get images accessed by the node.\\n\\n fn images(&self) -> Vec<(ImageId, ImageAccess)>;\\n\\n\\n\\n /// Indices of nodes this one dependes on.\\n\\n fn dependencies(&self) -> Vec<NodeId>;\\n\\n\\n\\n /// Build node.\\n\\n fn build<'a>(\\n\\n self: Box<Self>,\\n\\n ctx: &GraphContext<B>,\\n\\n factory: &mut Factory<B>,\\n\\n family: &mut Family<B>,\\n\\n queue: usize,\\n\",\n \"file_path\": \"graph/src/node/mod.rs\",\n \"rank\": 26,\n \"score\": 155917.74154184808\n },\n {\n \"content\": \"/// Builder fror render group.\\n\\npub trait RenderGroupBuilder<B: Backend, T: ?Sized>: std::fmt::Debug {\\n\\n /// Make subpass from render group.\\n\\n fn into_subpass(self) -> SubpassBuilder<B, T>\\n\\n where\\n\\n Self: Sized + 'static,\\n\\n {\\n\\n SubpassBuilder::new().with_group(self)\\n\\n }\\n\\n\\n\\n /// Number of color output images.\\n\\n fn colors(&self) -> usize;\\n\\n\\n\\n /// Is depth image used.\\n\\n fn depth(&self) -> bool;\\n\\n\\n\\n /// Get buffers used by the group\\n\\n fn buffers(&self) -> Vec<(BufferId, BufferAccess)>;\\n\\n\\n\\n /// Get images used by the group\\n\\n fn images(&self) -> Vec<(ImageId, ImageAccess)>;\\n\",\n \"file_path\": \"graph/src/node/render/group/mod.rs\",\n \"rank\": 27,\n \"score\": 148936.18876677073\n },\n {\n \"content\": \"#[allow(unused)]\\n\\ntype NoSignals<B> = std::iter::Empty<&'static <B as gfx_hal::Backend>::Semaphore>;\\n\",\n \"file_path\": \"command/src/family/submission.rs\",\n \"rank\": 28,\n \"score\": 148874.81456953293\n },\n {\n \"content\": \"/// Trait-object safe `Node`.\\n\\npub trait DynNode<B: Backend, T: ?Sized>: std::fmt::Debug + Sync + Send {\\n\\n /// Record commands required by node.\\n\\n /// Recorded buffers go into `submits`.\\n\\n unsafe fn run<'a>(\\n\\n &mut self,\\n\\n ctx: &GraphContext<B>,\\n\\n factory: &Factory<B>,\\n\\n queue: &mut Queue<B>,\\n\\n aux: &T,\\n\\n frames: &Frames<B>,\\n\\n waits: &[(&'a B::Semaphore, gfx_hal::pso::PipelineStage)],\\n\\n signals: &[&'a B::Semaphore],\\n\\n fence: Option<&mut Fence<B>>,\\n\\n );\\n\\n\\n\\n /// Dispose of the node.\\n\\n ///\\n\\n /// # Safety\\n\\n ///\\n\\n /// Must be called after waiting for device idle.\\n\",\n \"file_path\": \"graph/src/node/mod.rs\",\n \"rank\": 29,\n \"score\": 145715.28809988915\n },\n {\n \"content\": \"/// One or more graphics pipelines to be called in subpass.\\n\\npub trait RenderGroup<B: Backend, T: ?Sized>: std::fmt::Debug + Send + Sync {\\n\\n /// Prepare resources and data for rendering.\\n\\n fn prepare(\\n\\n &mut self,\\n\\n factory: &Factory<B>,\\n\\n queue: QueueId,\\n\\n index: usize,\\n\\n subpass: gfx_hal::pass::Subpass<'_, B>,\\n\\n aux: &T,\\n\\n ) -> PrepareResult;\\n\\n\\n\\n /// Record commands.\\n\\n fn draw_inline(\\n\\n &mut self,\\n\\n encoder: RenderPassEncoder<'_, B>,\\n\\n index: usize,\\n\\n subpass: gfx_hal::pass::Subpass<'_, B>,\\n\\n aux: &T,\\n\\n );\\n\\n\\n\\n /// Free all resources and destroy group instance.\\n\\n fn dispose(self: Box<Self>, factory: &mut Factory<B>, aux: &T);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"graph/src/node/render/group/mod.rs\",\n \"rank\": 30,\n \"score\": 141413.4070264092\n },\n {\n \"content\": \"/// Load mesh data from obj.\\n\\npub fn load_from_obj(\\n\\n bytes: &[u8],\\n\\n) -> Result<Vec<(MeshBuilder<'static>, Option<String>)>, failure::Error> {\\n\\n let string = std::str::from_utf8(bytes)?;\\n\\n let set = obj::parse(string).map_err(|e| {\\n\\n failure::format_err!(\\n\\n \\\"Error during parsing obj-file at line '{}': {}\\\",\\n\\n e.line_number,\\n\\n e.message\\n\\n )\\n\\n })?;\\n\\n load_from_data(set)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"mesh/src/format/obj.rs\",\n \"rank\": 31,\n \"score\": 135914.31321578793\n },\n {\n \"content\": \"#[allow(unused_variables)]\\n\\npub fn init<B>(\\n\\n config: Config<impl DevicesConfigure, impl HeapsConfigure, impl QueuesConfigure>,\\n\\n) -> Result<(Factory<B>, Families<B>), failure::Error>\\n\\nwhere\\n\\n B: Backend,\\n\\n{\\n\\n log::debug!(\\\"Creating factory\\\");\\n\\n rendy_backend_match!(B as backend => {\\n\\n profile_scope!(concat!(\\\"init_factory\\\"));\\n\\n let instance = backend::Instance::create(\\\"Rendy\\\", 1);\\n\\n Ok(identical_cast(init_with_instance(instance, config)?))\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"factory/src/factory.rs\",\n \"rank\": 32,\n \"score\": 134720.78352098085\n },\n {\n \"content\": \"/// Initialize `Factory` and Queue `Families` associated with Device\\n\\n/// using existing `Instance`.\\n\\npub fn init_with_instance<B>(\\n\\n instance: impl gfx_hal::Instance<Backend = B>,\\n\\n config: Config<impl DevicesConfigure, impl HeapsConfigure, impl QueuesConfigure>,\\n\\n) -> Result<(Factory<B>, Families<B>), failure::Error>\\n\\nwhere\\n\\n B: Backend,\\n\\n{\\n\\n rendy_with_slow_safety_checks!(\\n\\n log::warn!(\\\"Slow safety checks are enabled! Disable them in production by enabling the 'no-slow-safety-checks' feature!\\\")\\n\\n );\\n\\n let mut adapters = instance.enumerate_adapters();\\n\\n\\n\\n if adapters.is_empty() {\\n\\n failure::bail!(\\\"No physical devices found\\\");\\n\\n }\\n\\n\\n\\n log::debug!(\\n\\n \\\"Physical devices:\\\\n{:#?}\\\",\\n\\n adapters\\n\\n .iter()\\n\",\n \"file_path\": \"factory/src/factory.rs\",\n \"rank\": 33,\n \"score\": 132067.3761895332\n },\n {\n \"content\": \"/// Attempts to load a Texture from an image.\\n\\npub fn load_from_image<R>(\\n\\n mut reader: R,\\n\\n config: ImageTextureConfig,\\n\\n) -> Result<TextureBuilder<'static>, failure::Error>\\n\\nwhere\\n\\n R: std::io::BufRead + std::io::Seek,\\n\\n{\\n\\n use gfx_hal::format::{Component, Swizzle};\\n\\n use image::{DynamicImage, GenericImageView};\\n\\n\\n\\n let image_format = config.format.map_or_else(\\n\\n || {\\n\\n let r = reader.by_ref();\\n\\n // Longest size of image crate supported magic bytes\\n\\n let mut format_magic_bytes = [0u8; 10];\\n\\n r.read_exact(&mut format_magic_bytes)?;\\n\\n r.seek(std::io::SeekFrom::Current(-10))?;\\n\\n image::guess_format(&format_magic_bytes)\\n\\n },\\n\\n |f| Ok(f),\\n\",\n \"file_path\": \"texture/src/format/image.rs\",\n \"rank\": 34,\n \"score\": 129579.94498612928\n },\n {\n \"content\": \"/// Convert graph barriers into gfx barriers.\\n\\npub fn gfx_release_barriers<'a, B: Backend>(\\n\\n ctx: &'a GraphContext<B>,\\n\\n buffers: impl IntoIterator<Item = &'a NodeBuffer>,\\n\\n images: impl IntoIterator<Item = &'a NodeImage>,\\n\\n) -> (\\n\\n std::ops::Range<gfx_hal::pso::PipelineStage>,\\n\\n Vec<gfx_hal::memory::Barrier<'a, B>>,\\n\\n) {\\n\\n let mut bstart = gfx_hal::pso::PipelineStage::empty();\\n\\n let mut bend = gfx_hal::pso::PipelineStage::empty();\\n\\n\\n\\n let mut istart = gfx_hal::pso::PipelineStage::empty();\\n\\n let mut iend = gfx_hal::pso::PipelineStage::empty();\\n\\n\\n\\n let barriers: Vec<gfx_hal::memory::Barrier<'_, B>> = buffers\\n\\n .into_iter()\\n\\n .filter_map(|buffer| {\\n\\n buffer.release.as_ref().map(|release| {\\n\\n bstart |= release.stages.start;\\n\\n bend |= release.stages.end;\\n\",\n \"file_path\": \"graph/src/node/mod.rs\",\n \"rank\": 35,\n \"score\": 118673.97627534963\n },\n {\n \"content\": \"/// Chech if slice o f ordered values is sorted.\\n\\nfn is_slice_sorted<T: Ord>(slice: &[T]) -> bool {\\n\\n is_slice_sorted_by_key(slice, |i| i)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"mesh/src/mesh.rs\",\n \"rank\": 36,\n \"score\": 117413.429933376\n },\n {\n \"content\": \"/// Convert graph barriers into gfx barriers.\\n\\npub fn gfx_acquire_barriers<'a, 'b, B: Backend>(\\n\\n ctx: &'a GraphContext<B>,\\n\\n buffers: impl IntoIterator<Item = &'b NodeBuffer>,\\n\\n images: impl IntoIterator<Item = &'b NodeImage>,\\n\\n) -> (\\n\\n std::ops::Range<gfx_hal::pso::PipelineStage>,\\n\\n Vec<gfx_hal::memory::Barrier<'a, B>>,\\n\\n) {\\n\\n let mut bstart = gfx_hal::pso::PipelineStage::empty();\\n\\n let mut bend = gfx_hal::pso::PipelineStage::empty();\\n\\n\\n\\n let mut istart = gfx_hal::pso::PipelineStage::empty();\\n\\n let mut iend = gfx_hal::pso::PipelineStage::empty();\\n\\n\\n\\n let barriers: Vec<gfx_hal::memory::Barrier<'_, B>> = buffers\\n\\n .into_iter()\\n\\n .filter_map(|buffer| {\\n\\n buffer.acquire.as_ref().map(|acquire| {\\n\\n bstart |= acquire.stages.start;\\n\\n bend |= acquire.stages.end;\\n\",\n \"file_path\": \"graph/src/node/mod.rs\",\n \"rank\": 37,\n \"score\": 115985.12453492222\n },\n {\n \"content\": \"fn align_by(align: usize, value: usize) -> usize {\\n\\n ((value + align - 1) / align) * align\\n\\n}\\n\\n\\n\\n/// Single mesh is a collection of buffer ranges that provides available attributes.\\n\\n/// Usually exactly one mesh is used per draw call.\\n\\n#[derive(Debug)]\\n\\npub struct Mesh<B: gfx_hal::Backend> {\\n\\n vertex_buffer: Escape<Buffer<B>>,\\n\\n vertex_layouts: Vec<VertexBufferLayout>,\\n\\n index_buffer: Option<IndexBuffer<B>>,\\n\\n prim: gfx_hal::Primitive,\\n\\n len: u32,\\n\\n}\\n\\n\\n\\nimpl<B> Mesh<B>\\n\\nwhere\\n\\n B: gfx_hal::Backend,\\n\\n{\\n\\n /// Build new mesh with `MeshBuilder`\\n\",\n \"file_path\": \"mesh/src/mesh.rs\",\n \"rank\": 38,\n \"score\": 111781.73153625792\n },\n {\n \"content\": \"#[derive(Debug, Default)]\\n\\nstruct GravBounceDesc;\\n\\n\\n\\nimpl<B, T> NodeDesc<B, T> for GravBounceDesc\\n\\nwhere\\n\\n B: hal::Backend,\\n\\n T: ?Sized,\\n\\n{\\n\\n type Node = GravBounce<B>;\\n\\n\\n\\n fn buffers(&self) -> Vec<BufferAccess> {\\n\\n vec![BufferAccess {\\n\\n access: hal::buffer::Access::SHADER_READ | hal::buffer::Access::SHADER_WRITE,\\n\\n stages: hal::pso::PipelineStage::COMPUTE_SHADER,\\n\\n usage: hal::buffer::Usage::STORAGE | hal::buffer::Usage::TRANSFER_DST,\\n\\n }]\\n\\n }\\n\\n\\n\\n fn build<'a>(\\n\\n self,\\n\\n ctx: &GraphContext<B>,\\n\",\n \"file_path\": \"rendy/examples/quads/main.rs\",\n \"rank\": 39,\n \"score\": 109052.74898449902\n },\n {\n \"content\": \"/// Represent types that can be interpreted as list of vertex attributes.\\n\\npub trait AsAttributes {\\n\\n /// The iterator type for retreived attributes\\n\\n type Iter: Iterator<Item = Attribute>;\\n\\n /// Retreive a list of vertex attributes with offsets relative to beginning of that list\\n\\n fn attributes(self) -> Self::Iter;\\n\\n}\\n\\n\\n\\nimpl AsAttributes for Vec<Attribute> {\\n\\n type Iter = std::vec::IntoIter<Attribute>;\\n\\n fn attributes(self) -> Self::Iter {\\n\\n self.into_iter()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl AsAttributes for VertexFormat {\\n\\n type Iter = std::vec::IntoIter<Attribute>;\\n\\n fn attributes(self) -> Self::Iter {\\n\\n self.attributes.into_iter()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"util/src/types/vertex.rs\",\n \"rank\": 40,\n \"score\": 108842.48712193337\n },\n {\n \"content\": \"fn optimize<S>(schedule: &Schedule<S>, sync: &mut SyncTemp) {\\n\\n for queue in schedule.iter().flat_map(|family| family.iter()) {\\n\\n let mut found = fnv::FnvHashMap::default();\\n\\n for submission in queue.iter() {\\n\\n optimize_submission(submission.id(), &mut found, sync);\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"chain/src/sync.rs\",\n \"rank\": 41,\n \"score\": 108657.92843783982\n },\n {\n \"content\": \"/// Function copied from range_contains RFC rust implementation in nightly\\n\\nfn range_contains<U, R>(range: &R, item: &U) -> bool\\n\\nwhere\\n\\n U: ?Sized + PartialOrd<U>,\\n\\n R: RangeBounds<U>,\\n\\n{\\n\\n (match range.start_bound() {\\n\\n Bound::Included(ref start) => *start <= item,\\n\\n Bound::Excluded(ref start) => *start < item,\\n\\n Bound::Unbounded => true,\\n\\n }) && (match range.end_bound() {\\n\\n Bound::Included(ref end) => item <= *end,\\n\\n Bound::Excluded(ref end) => item < *end,\\n\\n Bound::Unbounded => true,\\n\\n })\\n\\n}\\n\",\n \"file_path\": \"shader/src/reflect/mod.rs\",\n \"rank\": 42,\n \"score\": 106918.8936618085\n },\n {\n \"content\": \"#[derive(Debug, Default)]\\n\\nstruct SpriteGraphicsPipelineDesc;\\n\\n\\n\",\n \"file_path\": \"rendy/examples/sprite/main.rs\",\n \"rank\": 43,\n \"score\": 106559.16805680966\n },\n {\n \"content\": \"#[derive(Debug, Default)]\\n\\nstruct QuadsRenderPipelineDesc;\\n\\n\\n\",\n \"file_path\": \"rendy/examples/quads/main.rs\",\n \"rank\": 44,\n \"score\": 106559.16805680966\n },\n {\n \"content\": \"#[derive(Debug, Default)]\\n\\nstruct MeshRenderPipelineDesc;\\n\\n\\n\",\n \"file_path\": \"rendy/examples/meshes/main.rs\",\n \"rank\": 45,\n \"score\": 106559.16805680966\n },\n {\n \"content\": \"#[derive(Debug, Default)]\\n\\nstruct TriangleRenderPipelineDesc;\\n\\n\\n\",\n \"file_path\": \"rendy/examples/triangle/main.rs\",\n \"rank\": 46,\n \"score\": 106559.16805680966\n },\n {\n \"content\": \"#[derive(Debug, Default)]\\n\\nstruct TriangleRenderPipelineDesc;\\n\\n\\n\",\n \"file_path\": \"rendy/examples/source_shaders/main.rs\",\n \"rank\": 47,\n \"score\": 104224.9084714688\n },\n {\n \"content\": \"/// Casts identical types.\\n\\n/// Useful in generic environment where caller knows that two types are the same\\n\\n/// but Rust is not convinced.\\n\\n///\\n\\n/// # Panics\\n\\n///\\n\\n/// Panics if types are actually different.\\n\\n///\\n\\n/// # Example\\n\\n///\\n\\n/// ```\\n\\n/// # extern crate rendy_util;\\n\\n/// # use rendy_util::identical_cast;\\n\\n/// # use std::any::TypeId;\\n\\n/// # fn foo<T: 'static>() {\\n\\n/// if TypeId::of::<T>() == TypeId::of::<u32>() {\\n\\n/// let value: T = identical_cast(42u32);\\n\\n/// }\\n\\n/// # }\\n\\n///\\n\\n/// ```\\n\\npub fn identical_cast<T: 'static, U: 'static>(value: T) -> U {\\n\\n assert_eq!(TypeId::of::<T>(), TypeId::of::<U>());\\n\\n unsafe {\\n\\n // We know types are the same.\\n\\n let mut value = std::mem::ManuallyDrop::new(value);\\n\\n let ptr: *mut T = &mut *value;\\n\\n std::ptr::read(ptr as *mut U)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"util/src/casts.rs\",\n \"rank\": 48,\n \"score\": 103628.22196445594\n },\n {\n \"content\": \"/// Calculate automatic `Chains` for nodes.\\n\\n/// This function tries to find the most appropriate schedule for nodes execution.\\n\\npub fn collect<Q>(nodes: Vec<Node>, max_queues: Q) -> Chains\\n\\nwhere\\n\\n Q: Fn(gfx_hal::queue::QueueFamilyId) -> usize,\\n\\n{\\n\\n // Resolve nodes into a form faster to work with.\\n\\n let (nodes, mut unscheduled_nodes) = resolve_nodes(nodes, max_queues);\\n\\n let mut ready_nodes = Vec::new();\\n\\n\\n\\n // Chains.\\n\\n let mut images: Vec<ChainData<Image>> = fill(nodes.images.len());\\n\\n let mut buffers: Vec<ChainData<Buffer>> = fill(nodes.buffers.len());\\n\\n\\n\\n // Schedule\\n\\n let mut schedule = Vec::with_capacity(nodes.queues.len());\\n\\n for i in 0..nodes.queues.len() {\\n\\n schedule.push(QueueData {\\n\\n queue: Queue::new(nodes.queues[i]),\\n\\n wait_factor: 0,\\n\\n });\\n\\n }\\n\",\n \"file_path\": \"chain/src/collect.rs\",\n \"rank\": 49,\n \"score\": 103602.2942894169\n },\n {\n \"content\": \"fn add_to_chain<R, S>(\\n\\n id: Id,\\n\\n family: gfx_hal::queue::QueueFamilyId,\\n\\n chain_data: &mut ChainData<R>,\\n\\n sid: SubmissionId,\\n\\n submission: &mut Submission<S>,\\n\\n state: State<R>,\\n\\n set_link: impl FnOnce(&mut Submission<S>, Id, usize),\\n\\n) where\\n\\n R: Resource,\\n\\n{\\n\\n let node = LinkNode { sid, state };\\n\\n\\n\\n chain_data.current_family = Some(family);\\n\\n chain_data.current_link_wait_factor = max(\\n\\n submission.wait_factor() + 1,\\n\\n chain_data.current_link_wait_factor,\\n\\n );\\n\\n\\n\\n let ref mut chain = chain_data.chain;\\n\",\n \"file_path\": \"chain/src/collect.rs\",\n \"rank\": 50,\n \"score\": 103289.89386206659\n },\n {\n \"content\": \"#[cfg(feature = \\\"no-slow-safety-checks\\\")]\\n\\nfn new_instance_id() -> InstanceId {\\n\\n InstanceId {}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"util/src/wrap.rs\",\n \"rank\": 51,\n \"score\": 102669.70826530422\n },\n {\n \"content\": \"fn push_vertex_desc(\\n\\n elements: &[gfx_hal::pso::Element<gfx_hal::format::Format>],\\n\\n stride: gfx_hal::pso::ElemStride,\\n\\n rate: gfx_hal::pso::VertexInputRate,\\n\\n vertex_buffers: &mut Vec<gfx_hal::pso::VertexBufferDesc>,\\n\\n attributes: &mut Vec<gfx_hal::pso::AttributeDesc>,\\n\\n) {\\n\\n let index = vertex_buffers.len() as gfx_hal::pso::BufferIndex;\\n\\n\\n\\n vertex_buffers.push(gfx_hal::pso::VertexBufferDesc {\\n\\n binding: index,\\n\\n stride,\\n\\n rate,\\n\\n });\\n\\n\\n\\n let mut location = attributes.last().map_or(0, |a| a.location + 1);\\n\\n for &element in elements {\\n\\n attributes.push(gfx_hal::pso::AttributeDesc {\\n\\n location,\\n\\n binding: index,\\n\\n element,\\n\\n });\\n\\n location += 1;\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"graph/src/node/render/group/simple.rs\",\n \"rank\": 52,\n \"score\": 102480.8145217411\n },\n {\n \"content\": \"fn max_chunks_per_size() -> usize {\\n\\n let value = (std::mem::size_of::<usize>() * 8).pow(4);\\n\\n debug_assert!(fits_u32(value));\\n\\n value\\n\\n}\\n\",\n \"file_path\": \"memory/src/allocator/dynamic.rs\",\n \"rank\": 53,\n \"score\": 100339.71154720121\n },\n {\n \"content\": \"/// Trait for memory region suitable for host writes.\\n\\npub trait Write<T: Copy> {\\n\\n /// Get mutable slice of `T` bound to mapped range.\\n\\n ///\\n\\n /// # Safety\\n\\n ///\\n\\n /// * Returned slice should not be read.\\n\\n unsafe fn slice(&mut self) -> &mut [T];\\n\\n\\n\\n /// Write data into mapped memory sub-region.\\n\\n ///\\n\\n /// # Panic\\n\\n ///\\n\\n /// Panics if `data.len()` is greater than this sub-region len.\\n\\n fn write(&mut self, data: &[T]) {\\n\\n unsafe {\\n\\n let slice = self.slice();\\n\\n assert!(data.len() <= slice.len());\\n\\n copy_nonoverlapping(data.as_ptr(), slice.as_mut_ptr(), data.len());\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"memory/src/mapping/write.rs\",\n \"rank\": 54,\n \"score\": 100273.76464432149\n },\n {\n \"content\": \"#[cfg(feature = \\\"no-slow-safety-checks\\\")]\\n\\nfn new_device_id(instance: InstanceId) -> DeviceId {\\n\\n DeviceId { instance }\\n\\n}\\n\\n\\n\\n/// Id of the hal instance.\\n\\n#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]\\n\\npub struct InstanceId {\\n\\n /// Unique id.\\n\\n #[cfg(not(feature = \\\"no-slow-safety-checks\\\"))]\\n\\n pub id: u32,\\n\\n}\\n\\n\\n\\nimpl InstanceId {\\n\\n /// Create new instance id.\\n\\n pub fn new() -> Self {\\n\\n new_instance_id()\\n\\n }\\n\\n}\\n\\n\\n\\n/// Raw instance wrapper with id.\\n\",\n \"file_path\": \"util/src/wrap.rs\",\n \"rank\": 55,\n \"score\": 92550.08383893355\n },\n {\n \"content\": \"fn fill<T: Default>(num: usize) -> Vec<T> {\\n\\n let mut vec = Vec::with_capacity(num);\\n\\n for _ in 0..num {\\n\\n vec.push(T::default());\\n\\n }\\n\\n vec\\n\\n}\\n\\n\\n\",\n \"file_path\": \"chain/src/collect.rs\",\n \"rank\": 56,\n \"score\": 90627.97670858382\n },\n {\n \"content\": \"fn sync_chain<R, S>(id: Id, chain: &Chain<R>, schedule: &Schedule<S>, sync: &mut SyncTemp)\\n\\nwhere\\n\\n R: Resource,\\n\\n{\\n\\n let uid = id.into();\\n\\n\\n\\n let pairs = chain\\n\\n .links()\\n\\n .windows(2)\\n\\n .map(|pair| (&pair[0], &pair[1]))\\n\\n .chain(\\n\\n chain\\n\\n .links()\\n\\n .first()\\n\\n .and_then(|first| chain.links().last().map(move |last| (last, first))),\\n\\n );\\n\\n\\n\\n for (prev_link, link) in pairs {\\n\\n log::trace!(\\\"Sync {:#?}:{:#?}\\\", prev_link.access(), link.access());\\n\\n if prev_link.family() == link.family() {\\n\",\n \"file_path\": \"chain/src/sync.rs\",\n \"rank\": 57,\n \"score\": 87819.95639828179\n },\n {\n \"content\": \"struct SyncTemp(fnv::FnvHashMap<SubmissionId, SyncData<Semaphore, Semaphore>>);\\n\\nimpl SyncTemp {\\n\\n fn get_sync(&mut self, sid: SubmissionId) -> &mut SyncData<Semaphore, Semaphore> {\\n\\n self.0.entry(sid).or_insert_with(|| SyncData::new())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"chain/src/sync.rs\",\n \"rank\": 58,\n \"score\": 82696.44080356683\n },\n {\n \"content\": \"fn match_kind(kind: Kind, view_kind: ViewKind, view_caps: ViewCapabilities) -> bool {\\n\\n match kind {\\n\\n Kind::D1(..) => match view_kind {\\n\\n ViewKind::D1 | ViewKind::D1Array => true,\\n\\n _ => false,\\n\\n },\\n\\n Kind::D2(..) => match view_kind {\\n\\n ViewKind::D2 | ViewKind::D2Array => true,\\n\\n ViewKind::Cube => {\\n\\n if view_caps.contains(ViewCapabilities::KIND_CUBE) {\\n\\n true\\n\\n } else {\\n\\n false\\n\\n }\\n\\n }\\n\\n _ => false,\\n\\n },\\n\\n Kind::D3(..) => {\\n\\n if view_caps == ViewCapabilities::KIND_2D_ARRAY {\\n\\n if view_kind == ViewKind::D2 {\\n\",\n \"file_path\": \"resource/src/image.rs\",\n \"rank\": 59,\n \"score\": 78854.39654856178\n },\n {\n \"content\": \"#[derive(Clone, Debug, PartialEq, Eq, Hash)]\\n\\nstruct Semaphore {\\n\\n id: Id,\\n\\n points: Range<SubmissionId>,\\n\\n}\\n\\n\\n\\nimpl Semaphore {\\n\\n fn new(id: Id, points: Range<SubmissionId>) -> Self {\\n\\n Semaphore { id, points }\\n\\n }\\n\\n}\\n\\n\\n\\n/// Semaphore signal info.\\n\\n/// There must be paired wait.\\n\\n#[derive(Copy, Clone, Debug, PartialEq, Eq)]\\n\\npub struct Signal<S>(S);\\n\\n\\n\\nimpl<S> Signal<S> {\\n\\n /// Create signaling for specified point.\\n\\n /// At this point `Wait` must be created as well.\\n\\n /// `id` and `point` combination must be unique.\\n\",\n \"file_path\": \"chain/src/sync.rs\",\n \"rank\": 60,\n \"score\": 75514.72545184026\n },\n {\n \"content\": \"fn resolve_nodes<Q>(nodes: Vec<Node>, max_queues: Q) -> (ResolvedNodeSet, Vec<usize>)\\n\\nwhere\\n\\n Q: Fn(gfx_hal::queue::QueueFamilyId) -> usize,\\n\\n{\\n\\n let node_count = nodes.len();\\n\\n\\n\\n let mut unscheduled_nodes = fill(nodes.len());\\n\\n let mut reified_nodes: Vec<ResolvedNode> = fill(nodes.len());\\n\\n let mut node_ids = LookupBuilder::new();\\n\\n let mut queues = LookupBuilder::new();\\n\\n let mut buffers = LookupBuilder::new();\\n\\n let mut images = LookupBuilder::new();\\n\\n\\n\\n let mut family_full = fnv::FnvHashMap::default();\\n\\n for node in nodes {\\n\\n let family = node.family;\\n\\n if !family_full.contains_key(&family) {\\n\\n let count = max_queues(family);\\n\\n assert!(count > 0, \\\"Cannot create a family with 0 max queues.\\\");\\n\\n for i in 0..count {\\n\",\n \"file_path\": \"chain/src/collect.rs\",\n \"rank\": 61,\n \"score\": 75514.12919358836\n },\n {\n \"content\": \"#[derive(PartialEq, PartialOrd, Eq, Ord)]\\n\\nstruct Fitness {\\n\\n transfers: usize,\\n\\n wait_factor: usize,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"chain/src/collect.rs\",\n \"rank\": 62,\n \"score\": 75510.75273099831\n },\n {\n \"content\": \"#[derive(Clone, Copy, Debug)]\\n\\n#[repr(C, align(16))]\\n\\nstruct Light {\\n\\n pos: nalgebra::Vector3<f32>,\\n\\n pad: f32,\\n\\n intencity: f32,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rendy/examples/meshes/main.rs\",\n \"rank\": 63,\n \"score\": 73970.0688158061\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct Camera {\\n\\n view: nalgebra::Projective3<f32>,\\n\\n proj: nalgebra::Perspective3<f32>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rendy/examples/meshes/main.rs\",\n \"rank\": 64,\n \"score\": 73965.40854538152\n },\n {\n \"content\": \"struct ResolvedNode {\\n\\n id: usize,\\n\\n family: gfx_hal::queue::QueueFamilyId,\\n\\n queues: Range<usize>,\\n\\n rev_deps: Vec<usize>,\\n\\n buffers: Vec<(usize, State<Buffer>)>,\\n\\n images: Vec<(usize, State<Image>)>,\\n\\n}\\n\\n\\n\\nimpl Default for ResolvedNode {\\n\\n fn default() -> Self {\\n\\n ResolvedNode {\\n\\n id: 0,\\n\\n family: gfx_hal::queue::QueueFamilyId(0),\\n\\n queues: 0..0,\\n\\n rev_deps: Vec::new(),\\n\\n buffers: Vec::new(),\\n\\n images: Vec::new(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"chain/src/collect.rs\",\n \"rank\": 65,\n \"score\": 73960.28564862139\n },\n {\n \"content\": \"struct QueueData {\\n\\n queue: Queue<Unsynchronized>,\\n\\n wait_factor: usize,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"chain/src/collect.rs\",\n \"rank\": 66,\n \"score\": 73960.28564862139\n },\n {\n \"content\": \"fn fitness(\\n\\n node: &ResolvedNode,\\n\\n images: &mut Vec<ChainData<Image>>,\\n\\n buffers: &mut Vec<ChainData<Buffer>>,\\n\\n schedule: &mut Vec<QueueData>,\\n\\n) -> (Fitness, usize) {\\n\\n let mut transfers = 0;\\n\\n let mut wait_factor_from_chains = 0;\\n\\n\\n\\n // Collect minimal waits required and resource transfers count.\\n\\n for &(id, _) in &node.buffers {\\n\\n let chain = &buffers[id];\\n\\n if chain\\n\\n .current_family\\n\\n .map_or(false, |family| family != node.family)\\n\\n {\\n\\n transfers += 1;\\n\\n }\\n\\n wait_factor_from_chains = max(wait_factor_from_chains, chain.last_link_wait_factor);\\n\\n }\\n\",\n \"file_path\": \"chain/src/collect.rs\",\n \"rank\": 67,\n \"score\": 73731.57040879273\n },\n {\n \"content\": \"#[repr(C)]\\n\\n#[derive(Copy, Clone)]\\n\\nstruct PosVel {\\n\\n pos: [f32; 2],\\n\\n vel: [f32; 2],\\n\\n}\\n\\n\\n\\nlazy_static::lazy_static! {\\n\\n static ref RENDER_VERTEX: SpirvShader = SourceShaderInfo::new(\\n\\n include_str!(\\\"render.vert\\\"),\\n\\n concat!(env!(\\\"CARGO_MANIFEST_DIR\\\"), \\\"/examples/quads/render.vert\\\").into(),\\n\\n ShaderKind::Vertex,\\n\\n SourceLanguage::GLSL,\\n\\n \\\"main\\\",\\n\\n ).precompile().unwrap();\\n\\n\\n\\n static ref RENDER_FRAGMENT: SpirvShader = SourceShaderInfo::new(\\n\\n include_str!(\\\"render.frag\\\"),\\n\\n concat!(env!(\\\"CARGO_MANIFEST_DIR\\\"), \\\"/examples/quads/render.frag\\\").into(),\\n\\n ShaderKind::Fragment,\\n\\n SourceLanguage::GLSL,\\n\\n \\\"main\\\",\\n\",\n \"file_path\": \"rendy/examples/quads/main.rs\",\n \"rank\": 68,\n \"score\": 72535.28141386082\n },\n {\n \"content\": \"#[derive(Clone, Copy)]\\n\\n#[repr(C, align(16))]\\n\\nstruct UniformArgs {\\n\\n proj: nalgebra::Matrix4<f32>,\\n\\n view: nalgebra::Matrix4<f32>,\\n\\n lights_count: i32,\\n\\n pad: [i32; 3],\\n\\n lights: [Light; MAX_LIGHTS],\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rendy/examples/meshes/main.rs\",\n \"rank\": 69,\n \"score\": 72535.22428154098\n },\n {\n \"content\": \"struct ResolvedNodeSet {\\n\\n nodes: Vec<ResolvedNode>,\\n\\n queues: Vec<QueueId>,\\n\\n buffers: Vec<Id>,\\n\\n images: Vec<Id>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"chain/src/collect.rs\",\n \"rank\": 70,\n \"score\": 72530.22213123558\n },\n {\n \"content\": \"#[cfg(any(feature = \\\"dx12\\\", feature = \\\"metal\\\", feature = \\\"vulkan\\\"))]\\n\\nfn run(\\n\\n event_loop: &mut EventsLoop,\\n\\n factory: &mut Factory<Backend>,\\n\\n families: &mut Families<Backend>,\\n\\n mut graph: Graph<Backend, ()>,\\n\\n) -> Result<(), failure::Error> {\\n\\n let started = std::time::Instant::now();\\n\\n\\n\\n let mut frames = 0u64..;\\n\\n let mut elapsed = started.elapsed();\\n\\n\\n\\n for _ in &mut frames {\\n\\n factory.maintain(families);\\n\\n event_loop.poll_events(|_| ());\\n\\n graph.run(factory, families, &());\\n\\n\\n\\n elapsed = started.elapsed();\\n\\n if elapsed >= std::time::Duration::new(5, 0) {\\n\\n break;\\n\\n }\\n\",\n \"file_path\": \"rendy/examples/triangle/main.rs\",\n \"rank\": 71,\n \"score\": 72199.29949737784\n },\n {\n \"content\": \"fn subresource_to_range(\\n\\n sub: &gfx_hal::image::SubresourceLayers,\\n\\n) -> gfx_hal::image::SubresourceRange {\\n\\n gfx_hal::image::SubresourceRange {\\n\\n aspects: sub.aspects,\\n\\n levels: sub.level..sub.level + 1,\\n\\n layers: sub.layers.clone(),\\n\\n }\\n\\n}\\n\\n\\n\\n/// A region to be blitted including the source and destination images and states,\\n\\n#[derive(Debug, Clone)]\\n\\npub struct BlitRegion {\\n\\n /// Region to blit from\\n\\n pub src: BlitImageState,\\n\\n /// Region to blit to\\n\\n pub dst: BlitImageState,\\n\\n}\\n\\n\\n\\nimpl BlitRegion {\\n\",\n \"file_path\": \"factory/src/blitter.rs\",\n \"rank\": 72,\n \"score\": 72199.29949737784\n },\n {\n \"content\": \"#[cfg(any(feature = \\\"dx12\\\", feature = \\\"metal\\\", feature = \\\"vulkan\\\"))]\\n\\nfn run(\\n\\n event_loop: &mut EventsLoop,\\n\\n factory: &mut Factory<Backend>,\\n\\n families: &mut Families<Backend>,\\n\\n window: &Window,\\n\\n) -> Result<(), failure::Error> {\\n\\n let mut graph = build_graph(factory, families, window.clone());\\n\\n\\n\\n let started = std::time::Instant::now();\\n\\n\\n\\n let mut last_window_size = window.get_inner_size();\\n\\n let mut need_rebuild = false;\\n\\n\\n\\n let mut frames = 0u64..;\\n\\n let mut elapsed = started.elapsed();\\n\\n\\n\\n for _ in &mut frames {\\n\\n factory.maintain(families);\\n\\n event_loop.poll_events(|_| ());\\n\\n let new_window_size = window.get_inner_size();\\n\",\n \"file_path\": \"rendy/examples/quads/main.rs\",\n \"rank\": 73,\n \"score\": 72199.29949737784\n },\n {\n \"content\": \"#[cfg(not(any(feature = \\\"dx12\\\", feature = \\\"metal\\\", feature = \\\"vulkan\\\")))]\\n\\nfn main() {\\n\\n panic!(\\\"Specify feature: { dx12, metal, vulkan }\\\");\\n\\n}\\n\",\n \"file_path\": \"rendy/examples/triangle/main.rs\",\n \"rank\": 74,\n \"score\": 72199.29949737784\n },\n {\n \"content\": \"#[cfg(not(any(feature = \\\"dx12\\\", feature = \\\"metal\\\", feature = \\\"vulkan\\\")))]\\n\\nfn main() {\\n\\n panic!(\\\"Specify feature: { dx12, metal, vulkan }\\\");\\n\\n}\\n\",\n \"file_path\": \"rendy/examples/meshes/main.rs\",\n \"rank\": 75,\n \"score\": 72199.29949737784\n },\n {\n \"content\": \"#[cfg(not(any(feature = \\\"dx12\\\", feature = \\\"metal\\\", feature = \\\"vulkan\\\")))]\\n\\nfn main() {\\n\\n panic!(\\\"Specify feature: { dx12, metal, vulkan }\\\");\\n\\n}\\n\",\n \"file_path\": \"rendy/examples/sprite/main.rs\",\n \"rank\": 76,\n \"score\": 72199.29949737784\n },\n {\n \"content\": \"#[cfg(not(any(feature = \\\"dx12\\\", feature = \\\"metal\\\", feature = \\\"vulkan\\\")))]\\n\\nfn main() {\\n\\n panic!(\\\"Specify feature: { dx12, metal, vulkan }\\\");\\n\\n}\\n\",\n \"file_path\": \"rendy/examples/init/main.rs\",\n \"rank\": 77,\n \"score\": 72199.29949737784\n },\n {\n \"content\": \"fn common_layout(\\n\\n acc: Option<gfx_hal::image::Layout>,\\n\\n layout: gfx_hal::image::Layout,\\n\\n) -> gfx_hal::image::Layout {\\n\\n match (acc, layout) {\\n\\n (None, layout) => layout,\\n\\n (Some(left), right) if left == right => left,\\n\\n (\\n\\n Some(gfx_hal::image::Layout::DepthStencilReadOnlyOptimal),\\n\\n gfx_hal::image::Layout::DepthStencilAttachmentOptimal,\\n\\n ) => gfx_hal::image::Layout::DepthStencilAttachmentOptimal,\\n\\n (\\n\\n Some(gfx_hal::image::Layout::DepthStencilAttachmentOptimal),\\n\\n gfx_hal::image::Layout::DepthStencilReadOnlyOptimal,\\n\\n ) => gfx_hal::image::Layout::DepthStencilAttachmentOptimal,\\n\\n (Some(_), _) => gfx_hal::image::Layout::General,\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"chain/src/resource.rs\",\n \"rank\": 78,\n \"score\": 72199.29949737784\n },\n {\n \"content\": \"fn optimize_submission(\\n\\n sid: SubmissionId,\\n\\n found: &mut fnv::FnvHashMap<QueueId, usize>,\\n\\n sync: &mut SyncTemp,\\n\\n) {\\n\\n let mut to_remove = Vec::new();\\n\\n if let Some(sync_data) = sync.0.get_mut(&sid) {\\n\\n sync_data\\n\\n .wait\\n\\n .sort_unstable_by_key(|wait| (wait.stage(), wait.semaphore().points.end.index()));\\n\\n sync_data.wait.retain(|wait| {\\n\\n let start = wait.semaphore().points.start;\\n\\n if let Some(synched_to) = found.get_mut(&start.queue()) {\\n\\n if *synched_to >= start.index() {\\n\\n to_remove.push(wait.semaphore().clone());\\n\\n return false;\\n\\n } else {\\n\\n *synched_to = start.index();\\n\\n return true;\\n\\n }\\n\",\n \"file_path\": \"chain/src/sync.rs\",\n \"rank\": 79,\n \"score\": 72199.29949737784\n },\n {\n \"content\": \"#[cfg(not(any(feature = \\\"dx12\\\", feature = \\\"metal\\\", feature = \\\"vulkan\\\")))]\\n\\nfn main() {\\n\\n panic!(\\\"Specify feature: { dx12, metal, vulkan }\\\");\\n\\n}\\n\",\n \"file_path\": \"rendy/examples/quads/main.rs\",\n \"rank\": 80,\n \"score\": 72199.29949737784\n },\n {\n \"content\": \"#[cfg(any(feature = \\\"dx12\\\", feature = \\\"metal\\\", feature = \\\"vulkan\\\"))]\\n\\nfn run(\\n\\n event_loop: &mut EventsLoop,\\n\\n factory: &mut Factory<Backend>,\\n\\n families: &mut Families<Backend>,\\n\\n mut graph: Graph<Backend, ()>,\\n\\n) -> Result<(), failure::Error> {\\n\\n let started = std::time::Instant::now();\\n\\n\\n\\n std::thread::spawn(move || {\\n\\n while started.elapsed() < std::time::Duration::new(30, 0) {\\n\\n std::thread::sleep(std::time::Duration::new(1, 0));\\n\\n }\\n\\n\\n\\n std::process::abort();\\n\\n });\\n\\n\\n\\n let mut frames = 0u64..;\\n\\n let mut elapsed = started.elapsed();\\n\\n\\n\\n for _ in &mut frames {\\n\",\n \"file_path\": \"rendy/examples/sprite/main.rs\",\n \"rank\": 81,\n \"score\": 72199.29949737784\n },\n {\n \"content\": \"#[derive(Clone, Debug)]\\n\\n#[cfg_attr(feature = \\\"serde\\\", derive(serde::Serialize, serde::Deserialize))]\\n\\nstruct RawIndices<'a> {\\n\\n #[cfg_attr(feature = \\\"serde\\\", serde(with = \\\"serde_bytes\\\", borrow))]\\n\\n indices: Cow<'a, [u8]>,\\n\\n index_type: gfx_hal::IndexType,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"mesh/src/mesh.rs\",\n \"rank\": 82,\n \"score\": 71695.37562673271\n },\n {\n \"content\": \"#[derive(Clone, Debug)]\\n\\n#[cfg_attr(feature = \\\"serde\\\", derive(serde::Serialize, serde::Deserialize))]\\n\\nstruct RawVertices<'a> {\\n\\n #[cfg_attr(feature = \\\"serde\\\", serde(with = \\\"serde_bytes\\\", borrow))]\\n\\n vertices: Cow<'a, [u8]>,\\n\\n format: VertexFormat,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"mesh/src/mesh.rs\",\n \"rank\": 83,\n \"score\": 71695.37562673271\n },\n {\n \"content\": \"/// raw hal type for vertex attribute\\n\\ntype AttributeElem = gfx_hal::pso::Element<Format>;\\n\\n\\n\\n/// Vertex attribute type.\\n\\n#[derive(Clone, Debug, Derivative)]\\n\\n#[derivative(PartialEq, Eq, Hash)]\\n\\npub struct Attribute {\\n\\n /// globally unique identifier for attribute's semantic\\n\\n uuid: AttrUuid,\\n\\n /// hal type with offset and format\\n\\n element: AttributeElem,\\n\\n /// Attribute array index. Matrix attributes are treated like array of vectors.\\n\\n #[derivative(PartialEq = \\\"ignore\\\")]\\n\\n #[derivative(Hash = \\\"ignore\\\")]\\n\\n index: u8,\\n\\n /// Attribute name as used in the shader\\n\\n #[derivative(PartialEq = \\\"ignore\\\")]\\n\\n #[derivative(Hash = \\\"ignore\\\")]\\n\\n name: Cow<'static, str>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"util/src/types/vertex.rs\",\n \"rank\": 84,\n \"score\": 71494.95823204632\n },\n {\n \"content\": \"/// Interface to create shader modules from shaders.\\n\\n/// Implemented for static shaders via [`compile_to_spirv!`] macro.\\n\\n///\\n\\npub trait Shader {\\n\\n /// Get spirv bytecode.\\n\\n fn spirv(&self) -> Result<std::borrow::Cow<'_, [u8]>, failure::Error>;\\n\\n\\n\\n /// Get the entry point of the shader.\\n\\n fn entry(&self) -> &str;\\n\\n\\n\\n /// Get the gfx_hal representation of this shaders kind/stage.\\n\\n fn stage(&self) -> ShaderStageFlags;\\n\\n\\n\\n /// Create shader module.\\n\\n ///\\n\\n /// Spir-V bytecode must adhere valid usage on this Vulkan spec page:\\n\\n /// https://www.khronos.org/registry/vulkan/specs/1.1-extensions/man/html/VkShaderModuleCreateInfo.html\\n\\n unsafe fn module<B>(\\n\\n &self,\\n\\n factory: &rendy_factory::Factory<B>,\\n\\n ) -> Result<B::ShaderModule, failure::Error>\\n\\n where\\n\\n B: Backend,\\n\",\n \"file_path\": \"shader/src/lib.rs\",\n \"rank\": 85,\n \"score\": 71387.79529109996\n },\n {\n \"content\": \"#[cfg(any(feature = \\\"dx12\\\", feature = \\\"metal\\\", feature = \\\"vulkan\\\"))]\\n\\nfn run(\\n\\n event_loop: &mut EventsLoop,\\n\\n factory: &mut Factory<Backend>,\\n\\n families: &mut Families<Backend>,\\n\\n mut graph: Graph<Backend, ()>,\\n\\n) -> Result<(), failure::Error> {\\n\\n let started = std::time::Instant::now();\\n\\n\\n\\n let mut frames = 0u64..;\\n\\n let mut elapsed = started.elapsed();\\n\\n\\n\\n for _ in &mut frames {\\n\\n factory.maintain(families);\\n\\n event_loop.poll_events(|_| ());\\n\\n graph.run(factory, families, &mut ());\\n\\n\\n\\n elapsed = started.elapsed();\\n\\n if elapsed >= std::time::Duration::new(5, 0) {\\n\\n break;\\n\\n }\\n\",\n \"file_path\": \"rendy/examples/source_shaders/main.rs\",\n \"rank\": 86,\n \"score\": 70775.30658472994\n },\n {\n \"content\": \"fn compare_set(\\n\\n lhv: &[gfx_hal::pso::DescriptorSetLayoutBinding],\\n\\n rhv: &[gfx_hal::pso::DescriptorSetLayoutBinding],\\n\\n) -> SetEquality {\\n\\n // Bindings may not be in order, so we need to make a copy and index them by binding.\\n\\n let mut lhv_bindings = HashMap::new();\\n\\n lhv.iter().for_each(|b| {\\n\\n lhv_bindings.insert(b.binding, b);\\n\\n });\\n\\n\\n\\n let mut rhv_bindings = HashMap::new();\\n\\n rhv.iter().for_each(|b| {\\n\\n rhv_bindings.insert(b.binding, b);\\n\\n });\\n\\n\\n\\n let predicate = if lhv.len() == rhv.len() {\\n\\n SetEquality::Equal\\n\\n } else if lhv.len() > rhv.len() {\\n\\n SetEquality::SupersetOf\\n\\n } else {\\n\",\n \"file_path\": \"shader/src/reflect/mod.rs\",\n \"rank\": 87,\n \"score\": 70775.30658472994\n },\n {\n \"content\": \"fn load_from_data(\\n\\n obj_set: obj::ObjSet,\\n\\n) -> Result<Vec<(MeshBuilder<'static>, Option<String>)>, failure::Error> {\\n\\n // Takes a list of objects that contain geometries that contain shapes that contain\\n\\n // vertex/texture/normal indices into the main list of vertices, and converts to\\n\\n // MeshBuilders with Position, Normal, TexCoord.\\n\\n trace!(\\\"Loading mesh\\\");\\n\\n let mut objects = vec![];\\n\\n\\n\\n for object in obj_set.objects {\\n\\n for geometry in &object.geometry {\\n\\n let mut builder = MeshBuilder::new();\\n\\n\\n\\n let mut indices = Vec::new();\\n\\n\\n\\n geometry.shapes.iter().for_each(|shape| {\\n\\n if let obj::Primitive::Triangle(v1, v2, v3) = shape.primitive {\\n\\n indices.push(v1);\\n\\n indices.push(v2);\\n\\n indices.push(v3);\\n\",\n \"file_path\": \"mesh/src/format/obj.rs\",\n \"rank\": 88,\n \"score\": 70775.30658472994\n },\n {\n \"content\": \"#[cfg(any(feature = \\\"dx12\\\", feature = \\\"metal\\\", feature = \\\"vulkan\\\"))]\\n\\nfn build_graph(\\n\\n factory: &mut Factory<Backend>,\\n\\n families: &mut Families<Backend>,\\n\\n window: &Window,\\n\\n) -> Graph<Backend, ()> {\\n\\n let surface = factory.create_surface(window);\\n\\n\\n\\n let mut graph_builder = GraphBuilder::<Backend, ()>::new();\\n\\n\\n\\n let posvel = graph_builder.create_buffer(QUADS as u64 * std::mem::size_of::<[f32; 4]>() as u64);\\n\\n\\n\\n let size = window\\n\\n .get_inner_size()\\n\\n .unwrap()\\n\\n .to_physical(window.get_hidpi_factor());\\n\\n let window_kind = hal::image::Kind::D2(size.width as u32, size.height as u32, 1, 1);\\n\\n\\n\\n let color = graph_builder.create_image(\\n\\n window_kind,\\n\\n 1,\\n\",\n \"file_path\": \"rendy/examples/quads/main.rs\",\n \"rank\": 89,\n \"score\": 70775.30658472994\n },\n {\n \"content\": \"/// Helper function to find buffer with compatible format.\\n\\nfn find_compatible_buffer(\\n\\n vertex_layouts: &[VertexBufferLayout],\\n\\n format: &VertexFormat,\\n\\n) -> Option<usize> {\\n\\n debug_assert!(is_slice_sorted(&*format.attributes));\\n\\n for (i, layout) in vertex_layouts.iter().enumerate() {\\n\\n debug_assert!(is_slice_sorted(&*layout.format.attributes));\\n\\n if is_compatible(&layout.format, format) {\\n\\n return Some(i);\\n\\n }\\n\\n }\\n\\n None\\n\\n}\\n\\n\\n\",\n \"file_path\": \"mesh/src/mesh.rs\",\n \"rank\": 90,\n \"score\": 70775.30658472994\n },\n {\n \"content\": \"#[cfg(not(any(feature = \\\"dx12\\\", feature = \\\"metal\\\", feature = \\\"vulkan\\\")))]\\n\\nfn main() {\\n\\n panic!(\\\"Specify feature: { dx12, metal, vulkan }\\\");\\n\\n}\\n\",\n \"file_path\": \"rendy/examples/source_shaders/main.rs\",\n \"rank\": 91,\n \"score\": 70775.30658472994\n },\n {\n \"content\": \"use super::queue::QueueId;\\n\\nuse crate::Id;\\n\\n\\n\\n/// Submission id.\\n\\n#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]\\n\\npub struct SubmissionId {\\n\\n /// Queue id of the submission.\\n\\n pub queue: QueueId,\\n\\n\\n\\n /// Index of the queue.\\n\\n pub index: usize,\\n\\n}\\n\\n\\n\\nimpl SubmissionId {\\n\\n /// Create new id from queue id and index.\\n\\n pub fn new(queue: QueueId, index: usize) -> Self {\\n\\n SubmissionId { queue, index }\\n\\n }\\n\\n\\n\\n /// Get family id.\\n\",\n \"file_path\": \"chain/src/schedule/submission.rs\",\n \"rank\": 97,\n \"score\": 43.61942218682145\n },\n {\n \"content\": \"use super::submission::{Submission, SubmissionId};\\n\\n\\n\\n/// Queue id.\\n\\n#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]\\n\\npub struct QueueId {\\n\\n /// Family id of the queue.\\n\\n pub family: gfx_hal::queue::QueueFamilyId,\\n\\n\\n\\n /// Index of the queue.\\n\\n pub index: usize,\\n\\n}\\n\\n\\n\\nimpl QueueId {\\n\\n /// Create queue id from family id and index.\\n\\n pub fn new(family: gfx_hal::queue::QueueFamilyId, index: usize) -> Self {\\n\\n QueueId {\\n\\n family: family,\\n\\n index,\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"chain/src/schedule/queue.rs\",\n \"rank\": 99,\n \"score\": 40.383088114974484\n }\n]","isConversational":false}}},{"rowIdx":1389,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/rust/storage/seg/src/ttl_buckets/ttl_bucket.rs"},"repo_name":{"kind":"string","value":"wandaitzuchen/pelikan"},"commit":{"kind":"string","value":"7421cdedbd5cf5c9814d244ae02eef5ec05904bf"},"file_code":{"kind":"string","value":"\n\nuse super::{SEGMENT_CLEAR, SEGMENT_EXPIRE};\nuse crate::*;\nuse core::num::NonZeroU32;\n\npub struct TtlBucket {\n head: Option<NonZeroU32>,\n tail: Option<NonZeroU32>,\n ttl: i32,\n nseg: i32,\n next_to_merge: Option<NonZeroU32>,\n _pad: [u8; 44],\n}\n\nimpl TtlBucket {\n \n pub(super) fn new(ttl: i32) -> Self {\n Self {\n head: None,\n tail: None,\n ttl,\n nseg: 0,\n next_to_merge: None,\n _pad: [0; 44],\n }\n }\n\n \n pub fn head(&self) -> Option<NonZeroU32> {\n self.head\n }\n\n \n pub fn set_head(&mut self, id: Option<NonZeroU32>) {\n self.head = id;\n }\n\n \n \n pub fn next_to_merge(&self) -> Option<NonZeroU32> {\n self.next_to_merge\n }\n\n \n pub fn set_next_to_merge(&mut self, next: Option<NonZeroU32>) {\n self.next_to_merge = next;\n }\n\n \n \n pub(super) fn expire(&mut self, hashtable: &mut HashTable, segments: &mut Segments) -> usize {\n if self.head.is_none() {\n return 0;\n }\n\n let mut expired = 0;\n\n loop {\n let seg_id = self.head;\n if let Some(seg_id) = seg_id {\n let flush_at = segments.flush_at();\n let mut segment = segments.get_mut(seg_id).unwrap();\n if segment.create_at() + segment.ttl() <= Instant::recent()\n || segment.create_at() < flush_at\n {\n if let Some(next) = segment.next_seg() {\n self.head = Some(next);\n } else {\n self.head = None;\n self.tail = None;\n }\n let _ = segment.clear(hashtable, true);\n segments.push_free(seg_id);\n SEGMENT_EXPIRE.increment();\n expired += 1;\n } else {\n return expired;\n }\n } else {\n return expired;\n }\n }\n }\n\n \n \n pub(super) fn clear(&mut self, hashtable: &mut HashTable, segments: &mut Segments) -> usize {\n if self.head.is_none() {\n return 0;\n }\n\n let mut cleared = 0;\n\n loop {\n let seg_id = self.head;\n if let Some(seg_id) = seg_id {\n let mut segment = segments.get_mut(seg_id).unwrap();\n if let Some(next) = segment.next_seg() {\n self.head = Some(next);\n } else {\n self.head = None;\n self.tail = None;\n }\n let _ = segment.clear(hashtable, true);\n segments.push_free(seg_id);\n SEGMENT_CLEAR.increment();\n cleared += 1;\n } else {\n return cleared;\n }\n }\n }\n\n \n \n \n fn try_expand(&mut self, segments: &mut Segments) -> Result<(), TtlBucketsError> {\n if let Some(id) = segments.pop_free() {\n {\n if let Some(tail_id) = self.tail {\n let mut tail = segments.get_mut(tail_id).unwrap();\n tail.set_next_seg(Some(id));\n }\n }\n\n let mut segment = segments.get_mut(id).unwrap();\n segment.set_prev_seg(self.tail);\n segment.set_next_seg(None);\n segment.set_ttl(Duration::from_secs(self.ttl as u32));\n if self.head.is_none() {\n debug_assert!(self.tail.is_none());\n self.head = Some(id);\n }\n self.tail = Some(id);\n self.nseg += 1;\n debug_assert!(!segment.evictable(), \"segment should not be evictable\");\n segment.set_evictable(true);\n segment.set_accessible(true);\n Ok(())\n } else {\n Err(TtlBucketsError::NoFreeSegments)\n }\n }\n\n \n \n \n \n pub(crate) fn reserve(\n &mut self,\n size: usize,\n segments: &mut Segments,\n ) -> Result<ReservedItem, TtlBucketsError> {\n trace!(\"reserving: {} bytes for ttl: {}\", size, self.ttl);\n\n let seg_size = segments.segment_size() as usize;\n\n if size > seg_size {\n debug!(\"item is oversized\");\n return Err(TtlBucketsError::ItemOversized { size });\n }\n\n loop {\n if let Some(id) = self.tail {\n if let Ok(mut segment) = segments.get_mut(id) {\n if !segment.accessible() {\n continue;\n }\n let offset = segment.write_offset() as usize;\n trace!(\"offset: {}\", offset);\n if offset + size <= seg_size {\n let size = size as i32;\n let item = segment.alloc_item(size);\n return Ok(ReservedItem::new(item, segment.id(), offset));\n }\n }\n }\n self.try_expand(segments)?;\n }\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nuse super::{SEGMENT_CLEAR, SEGMENT_EXPIRE};\nuse crate::*;\nuse core::num::NonZeroU32;\n\npub struct TtlBucket {\n head: Option<NonZeroU32>,\n tail: Option<NonZeroU32>,\n ttl: i32,\n nseg: i32,\n next_to_merge: Option<NonZeroU32>,\n _pad: [u8; 44],\n}\n\nimpl TtlBucket {\n \n pub(super) fn new(ttl: i32) -> Self {\n Self {\n head: None,\n tail: None,\n ttl,\n nseg: 0,\n next_to_merge: None,\n _pad: [0; 44],\n }\n }\n\n \n pub fn head(&self) -> Option<NonZeroU32> {\n self.head\n }\n\n \n pub fn set_head(&mut self, id: Option<NonZeroU32>) {\n self.head = id;\n }\n\n \n \n pub fn next_to_merge(&self) -> Option<NonZeroU32> {\n self.next_to_merge\n }\n\n \n pub fn set_next_to_merge(&mut self, next: Option<NonZeroU32>) {\n self.next_to_merge = next;\n }\n\n \n \n pub(super) fn expire(&mut self, hashtable: &mut HashTable, segments: &mut Segments) -> usize {\n if self.head.is_none() {\n return 0;\n }\n\n let mut expired = 0;\n\n loop {\n let seg_id = self.head;\n if let Some(seg_id) = seg_id {\n let flush_at = segments.flush_at();\n let mut segment = segments.get_mut(seg_id).unwrap();\n if segment.create_at() + segment.ttl() <= Instant::recent()\n || segment.create_at() < flush_at\n {\n if let Some(next) = segment.next_seg() {\n self.head = Some(next);\n } else {\n "},"suffix":{"kind":"string","value":"ired += 1;\n } else {\n return expired;\n }\n } else {\n return expired;\n }\n }\n }\n\n \n \n pub(super) fn clear(&mut self, hashtable: &mut HashTable, segments: &mut Segments) -> usize {\n if self.head.is_none() {\n return 0;\n }\n\n let mut cleared = 0;\n\n loop {\n let seg_id = self.head;\n if let Some(seg_id) = seg_id {\n let mut segment = segments.get_mut(seg_id).unwrap();\n if let Some(next) = segment.next_seg() {\n self.head = Some(next);\n } else {\n self.head = None;\n self.tail = None;\n }\n let _ = segment.clear(hashtable, true);\n segments.push_free(seg_id);\n SEGMENT_CLEAR.increment();\n cleared += 1;\n } else {\n return cleared;\n }\n }\n }\n\n \n \n \n fn try_expand(&mut self, segments: &mut Segments) -> Result<(), TtlBucketsError> {\n if let Some(id) = segments.pop_free() {\n {\n if let Some(tail_id) = self.tail {\n let mut tail = segments.get_mut(tail_id).unwrap();\n tail.set_next_seg(Some(id));\n }\n }\n\n let mut segment = segments.get_mut(id).unwrap();\n segment.set_prev_seg(self.tail);\n segment.set_next_seg(None);\n segment.set_ttl(Duration::from_secs(self.ttl as u32));\n if self.head.is_none() {\n debug_assert!(self.tail.is_none());\n self.head = Some(id);\n }\n self.tail = Some(id);\n self.nseg += 1;\n debug_assert!(!segment.evictable(), \"segment should not be evictable\");\n segment.set_evictable(true);\n segment.set_accessible(true);\n Ok(())\n } else {\n Err(TtlBucketsError::NoFreeSegments)\n }\n }\n\n \n \n \n \n pub(crate) fn reserve(\n &mut self,\n size: usize,\n segments: &mut Segments,\n ) -> Result<ReservedItem, TtlBucketsError> {\n trace!(\"reserving: {} bytes for ttl: {}\", size, self.ttl);\n\n let seg_size = segments.segment_size() as usize;\n\n if size > seg_size {\n debug!(\"item is oversized\");\n return Err(TtlBucketsError::ItemOversized { size });\n }\n\n loop {\n if let Some(id) = self.tail {\n if let Ok(mut segment) = segments.get_mut(id) {\n if !segment.accessible() {\n continue;\n }\n let offset = segment.write_offset() as usize;\n trace!(\"offset: {}\", offset);\n if offset + size <= seg_size {\n let size = size as i32;\n let item = segment.alloc_item(size);\n return Ok(ReservedItem::new(item, segment.id(), offset));\n }\n }\n }\n self.try_expand(segments)?;\n }\n }\n}\n"},"middle":{"kind":"string","value":" self.head = None;\n self.tail = None;\n }\n let _ = segment.clear(hashtable, true);\n segments.push_free(seg_id);\n SEGMENT_EXPIRE.increment();\n exp"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"#[inline]\n\nfn copy_slice(dst: &mut [u8], src: &[u8]) -> usize {\n\n let n = cmp::min(dst.len(), src.len());\n\n dst[0..n].copy_from_slice(&src[0..n]);\n\n n\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use tempfile::NamedTempFile;\n\n\n\n fn kvs() -> Vec<(String, String)> {\n\n vec![\n\n (\"abc\", \"def\"),\n\n (\"pink\", \"red\"),\n\n (\"apple\", \"grape\"),\n\n (\"q\", \"burp\"),\n\n ]\n\n .iter()\n\n .map(|(k, v)| (k.to_string(), v.to_string()))\n","file_path":"src/storage/cdb/cdb_rs/src/cdb/mod.rs","rank":0,"score":219008.64793613274},{"content":"/// Trim starting and ending spaces off of a byte slice\n\nfn trim_bytes(mut slice: &[u8]) -> &[u8] {\n\n while is_space(slice.first().copied()) {\n\n slice = slice.split_first().unwrap().1;\n\n }\n\n\n\n while is_space(slice.last().copied()) {\n\n slice = slice.split_last().unwrap().1\n\n }\n\n\n\n slice\n\n}\n\n\n","file_path":"deps/ccommon/rust/ccommon-backend/src/option/parse.rs","rank":1,"score":198625.81972015614},{"content":"fn segment_size() -> i32 {\n\n SEGMENT_SIZE\n\n}\n\n\n","file_path":"src/rust/config/src/seg.rs","rank":2,"score":195359.39650797506},{"content":"pub fn readybuf(size: usize) -> BytesMut {\n\n let mut b = BytesMut::with_capacity(size);\n\n b.resize(size, 0);\n\n b\n\n}\n\n\n\nimpl SliceFactory {\n\n pub fn load(path: &str) -> Result<SliceFactory> {\n\n let mut f = File::open(path)?;\n\n let mut buffer = Vec::new();\n\n f.read_to_end(&mut buffer)?;\n\n Ok(SliceFactory::HeapStorage(HeapWrap(Bytes::from(buffer))))\n\n }\n\n\n\n pub fn make_map(path: &str) -> Result<SliceFactory> {\n\n let f = File::open(path)?;\n\n let mmap: Mmap = unsafe { MmapOptions::new().map(&f)? };\n\n\n\n let mut buf = [0u8; BUF_LEN];\n\n let mut count = 0;\n","file_path":"src/storage/cdb/cdb_rs/src/cdb/storage.rs","rank":3,"score":193967.9182434666},{"content":"// A very fast PRNG which is appropriate for testing\n\npub fn rng() -> impl RngCore {\n\n rand_xoshiro::Xoshiro256PlusPlus::seed_from_u64(0)\n\n}\n\n\n","file_path":"src/rust/storage/seg/benches/benchmark.rs","rank":4,"score":189389.95385749516},{"content":"fn put(buf: &mut Vec<u8>, flags: u32, path: &[u8], mut body: &[u8]) -> Result<(), Error> {\n\n let mut builder = request::put(buf, Uri::new(path))?;\n\n \n\n builder.header(\"Content-Length\", body.len())?;\n\n builder.header(\"Flags\", flags)?;\n\n builder.body(&mut body)?;\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"test/server/twemcache-http/src/lib.rs","rank":5,"score":186537.7713278846},{"content":"pub fn benches(c: &mut Criterion) {\n\n c.bench_function(\"build_req_long\", build_req_long);\n\n c.bench_function(\"build_req_long_unsafe\", build_req_long_unsafe);\n\n c.bench_function(\"build_req_short\", build_req_short);\n\n c.bench_function(\"build_req_short_unsafe\", build_req_short_unsafe);\n\n}\n\n\n\ncriterion_group!(group, benches);\n\ncriterion_main!(group);\n","file_path":"src/rust-util/httpencode/benches/compose.rs","rank":6,"score":185583.18721763755},{"content":"/// Load a single option from a byte string.\n\npub fn option_set<'a>(option: &mut option, value: &'a [u8]) -> Result<(), ParseError<'a>> {\n\n let value = parse_value(value, 0, option.type_)?;\n\n\n\n unsafe { set_option_value(option, value) }\n\n}\n\n\n","file_path":"deps/ccommon/rust/ccommon-backend/src/option/parse.rs","rank":7,"score":179760.63147956354},{"content":"pub fn opt_to_null_mut<T>(o: Option<*mut T>) -> *mut T {\n\n match o {\n\n Some(p) => p,\n\n None => ptr::null_mut(),\n\n }\n\n}\n","file_path":"deps/ccommon/rust/ccommon-rs/src/ptrs.rs","rank":8,"score":178405.1432352485},{"content":"fn get(buf: &mut Vec<u8>, path: &[u8]) -> Result<(), Error> {\n\n let mut builder = request::get(buf, Uri::new(path))?;\n\n\n\n builder.header(\"Content-Length\", \"0\")?;\n\n builder.finish()?;\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"test/server/twemcache-http/src/lib.rs","rank":9,"score":175860.5761091654},{"content":"fn delete(buf: &mut Vec<u8>, path: &[u8]) -> Result<(), Error> {\n\n let mut builder = request::delete(buf, Uri::new(path))?;\n\n\n\n builder.header(\"CoNtEnT-LeNgTh\", \"0\")?;\n\n builder.finish()?;\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"test/server/twemcache-http/src/lib.rs","rank":10,"score":175860.5761091654},{"content":"pub fn lift_to_option<T>(p: *mut T) -> Option<*mut T> {\n\n if p.is_null() {\n\n None\n\n } else {\n\n Some(p)\n\n }\n\n}\n\n\n","file_path":"deps/ccommon/rust/ccommon-rs/src/ptrs.rs","rank":11,"score":173102.08633288948},{"content":"pub fn head<B: BufMut>(buf: B, path: Uri) -> Result<HttpBuilder<B>> {\n\n HttpBuilder::request(buf, Method::Head, Version::Http11, path)\n\n}\n\n\n","file_path":"src/rust-util/httpencode/src/request.rs","rank":12,"score":172010.56767705825},{"content":"pub fn size_of(value: &Value) -> usize {\n\n match value {\n\n Value::Bytes(v) => v.len(),\n\n Value::U64(_) => core::mem::size_of::<u64>(),\n\n }\n\n}\n","file_path":"src/rust/storage/seg/src/item/mod.rs","rank":13,"score":160612.89421086863},{"content":"pub fn null_check<T>(p: *mut T) -> result::Result<*mut T, NullPointerError> {\n\n lift_to_option(p).ok_or_else(|| NullPointerError)\n\n}\n\n\n","file_path":"deps/ccommon/rust/ccommon-rs/src/ptrs.rs","rank":14,"score":157324.77838966792},{"content":"fn parse_digits(buf: &[u8]) -> Result<usize> {\n\n let s = str::from_utf8(&buf)?;\n\n s.parse::<usize>().map_err(|e| e.into())\n\n}\n\n\n\nconst ARROW_BYTES: &[u8; 2] = b\"->\";\n\n\n","file_path":"src/storage/cdb/cdb_rs/src/cdb/input.rs","rank":15,"score":154440.9352335621},{"content":"pub fn load_bytes_at_path(path: &str) -> Result<Box<[u8]>> {\n\n let mut f = File::open(path)?;\n\n let mut buffer = Vec::with_capacity(f.metadata()?.len() as usize);\n\n f.read_to_end(&mut buffer)?;\n\n Ok(buffer.into_boxed_slice())\n\n}\n\n\n\nimpl<'a> Reader<'a> {\n\n pub fn new<T: AsRef<[u8]>>(r: &'a T) -> Reader<'a> {\n\n Reader(r.as_ref())\n\n }\n\n\n\n // TODO: perform basic sanity checks of data (gee i wish there was a checksum\n\n // somwhere in this data format HINT HINT)\n\n //\n\n // * does the secondary index fall safely in the correct index range?\n\n // * do data pointers point at the data segment?\n\n\n\n #[inline]\n\n fn bucket_at(&self, idx: usize) -> Result<Bucket> {\n","file_path":"src/storage/cdb/cdb_rs/src/cdb/mod.rs","rank":16,"score":153787.65156644836},{"content":"pub fn init() {\n\n PID.set(std::process::id().into());\n\n}\n","file_path":"src/rust/metrics/src/lib.rs","rank":17,"score":151529.31409976818},{"content":"// helper functions for default values\n\nfn hash_power() -> u8 {\n\n HASH_POWER\n\n}\n\n\n","file_path":"src/rust/config/src/seg.rs","rank":18,"score":148795.84047733556},{"content":"pub fn tests() {\n\n debug!(\"beginning tests\");\n\n println!();\n\n\n\n test(\n\n \"cas not found (key: 0)\",\n\n &[(\"cas 0 0 0 1 1\\r\\n0\\r\\n\", Some(\"NOT_FOUND\\r\\n\"))],\n\n );\n\n test(\"get empty (key: 0)\", &[(\"get 0\\r\\n\", Some(\"END\\r\\n\"))]);\n\n test(\"gets empty (key: 0)\", &[(\"gets 0\\r\\n\", Some(\"END\\r\\n\"))]);\n\n test(\n\n \"cas not found (key: 0)\",\n\n &[(\"cas 0 0 0 1 0\\r\\n0\\r\\n\", Some(\"NOT_FOUND\\r\\n\"))],\n\n );\n\n test(\n\n \"set value (key: 0)\",\n\n &[(\"set 0 0 0 1\\r\\n1\\r\\n\", Some(\"STORED\\r\\n\"))],\n\n );\n\n test(\n\n \"get value (key: 0)\",\n","file_path":"src/rust/server/segcache/tests/common.rs","rank":19,"score":148720.660028336},{"content":"pub fn main() {\n\n let bindir = match env::args_os().skip(1).next() {\n\n Some(dir) => PathBuf::from(dir),\n\n None => {\n\n eprintln!(\"Usage: test-pingserver-rs <CMAKE_BINARY_DIR>\");\n\n panic!();\n\n }\n\n };\n\n\n\n let mut server = Command::new(bindir.join(\"_bin/pelikan_twemcache_http\"))\n\n .spawn()\n\n .expect(\"Failed to start server process\");\n\n\n\n // Give the server time to start up\n\n std::thread::sleep(Duration::from_millis(1000));\n\n\n\n let res = catch_unwind(|| run_tests());\n\n\n\n // Give the server some time to crash if any of the test\n\n // would cause that to happen.\n\n std::thread::sleep(Duration::from_millis(100));\n\n\n\n server.kill().expect(\"Server died unexpectedly\");\n\n\n\n match res {\n\n Err(e) => resume_unwind(e),\n\n _ => (),\n\n }\n\n}\n\n\n","file_path":"test/server/twemcache-http/src/lib.rs","rank":20,"score":148720.660028336},{"content":"pub fn klog_format(\n\n w: &mut dyn std::io::Write,\n\n now: DateTime,\n\n record: &Record,\n\n) -> Result<(), std::io::Error> {\n\n writeln!(\n\n w,\n\n \"{} {}\",\n\n now.to_rfc3339_opts(SecondsFormat::Millis, false),\n\n record.args()\n\n )\n\n}\n","file_path":"src/rust/logger/src/format.rs","rank":21,"score":148720.660028336},{"content":"pub fn default_format(\n\n w: &mut dyn std::io::Write,\n\n now: DateTime,\n\n record: &Record,\n\n) -> Result<(), std::io::Error> {\n\n writeln!(\n\n w,\n\n \"{} {} [{}] {}\",\n\n now.to_rfc3339_opts(SecondsFormat::Millis, false),\n\n record.level(),\n\n record.module_path().unwrap_or(\"<unnamed>\"),\n\n record.args()\n\n )\n\n}\n\n\n","file_path":"src/rust/logger/src/format.rs","rank":22,"score":148720.660028336},{"content":"fn compare_insensitive(a: &[u8], b: &[u8]) -> bool {\n\n if a.len() != b.len() {\n\n return false;\n\n }\n\n\n\n a.iter().copied().map(|c| c.to_ascii_lowercase())\n\n .zip(b.iter().copied().map(|c| c.to_ascii_lowercase()))\n\n .all(|(a, b)| a == b)\n\n}\n","file_path":"test/server/twemcache-http/src/lib.rs","rank":23,"score":142568.77200953406},{"content":" delta_time_i ttl; /* the min ttl of this bucket */\n","file_path":"src/storage/seg/ttlbucket.h","rank":24,"score":140661.67771209544},{"content":"fn compare_ascii_lowercase(a: &[u8], b: &[u8]) -> bool {\n\n if a.len() != b.len() {\n\n return false;\n\n }\n\n\n\n a.iter()\n\n .copied()\n\n .map(|x| x.to_ascii_lowercase())\n\n .zip(b.iter().copied().map(|x| x.to_ascii_lowercase()))\n\n .all(|(a, b)| a == b)\n\n}\n\n\n","file_path":"src/server/twemcache-http/src/http.rs","rank":25,"score":140441.0313131805},{"content":"/// Set the global panic handler to one which logs the\n\n/// panic at `LOG_CRIT` level before calling the original\n\n/// panic hook.\n\npub fn set_panic_handler() {\n\n use ccommon_sys::LOG_CRIT;\n\n\n\n use std::env;\n\n use std::io::Cursor;\n\n\n\n // After logging the message we want to call whatever existing\n\n // panic hook was in place. In most cases this should be the\n\n // default hook.\n\n let old_hook = panic::take_hook();\n\n\n\n panic::set_hook(Box::new(move |info: &PanicInfo| {\n\n let mut buffer = [0u8; LOG_MAX_LEN as usize + 1];\n\n let ptr = ccommon_dlog().load(Ordering::Relaxed);\n\n\n\n let msg = if let Some(s) = info.payload().downcast_ref::<&str>() {\n\n *s\n\n } else if let Some(s) = info.payload().downcast_ref::<String>() {\n\n &s[..]\n\n } else {\n","file_path":"deps/ccommon/rust/ccommon-rs/src/log/shim.rs","rank":26,"score":138962.47900680924},{"content":"fn ready_buf(size: usize) -> BytesMut {\n\n let mut b = BytesMut::with_capacity(size);\n\n b.reserve(size);\n\n b\n\n}\n\n\n\npub struct Writer<'a, F>\n\nwhere\n\n F: Write + Seek + 'a,\n\n{\n\n file: &'a mut F,\n\n index: Vec<Vec<IndexEntry>>,\n\n}\n\n\n\nimpl<'a, F> Writer<'a, F>\n\nwhere\n\n F: Write + Seek + 'a,\n\n{\n\n pub fn new(file: &'a mut F) -> Result<Writer<'a, F>> {\n\n file.seek(SeekFrom::Start(0))?;\n","file_path":"src/storage/cdb/cdb_rs/src/cdb/mod.rs","rank":27,"score":138821.5199208277},{"content":"fn reverse_in_place<T>(mut slice: &mut [T]) {\n\n while slice.len() > 1 {\n\n let (first, rest) = slice.split_first_mut().unwrap();\n\n let (last, rest) = rest.split_last_mut().unwrap();\n\n slice = rest;\n\n\n\n std::mem::swap(first, last);\n\n }\n\n}\n\n\n\nmacro_rules! impl_unsigned {\n\n ( $( $ty:ident ),* ) => {\n\n $(\n\n impl HeaderValue for $ty {\n\n fn put<B: BufMut>(&self, buf: &mut B) -> Result<(), OutOfBufferError> {\n\n let mut digits = ArrayVec::<[u8; base10_digits::<$ty>(false)]>::new();\n\n let mut value = *self;\n\n\n\n if value == 0 {\n\n digits.push(b'0');\n","file_path":"src/rust-util/httpencode/src/traits.rs","rank":28,"score":138405.05606643154},{"content":"// Write out a string and percent-escape any invalid characters within.\n\nfn write_percent_escaped<B, F>(buf: &mut B, path: &[u8], is_valid: F) -> Result<()>\n\nwhere\n\n B: BufMut,\n\n F: Fn(u8) -> bool,\n\n{\n\n fn next_invalid<F: Fn(u8) -> bool>(bytes: &[u8], is_valid: &F) -> Option<(usize, u8)> {\n\n for i in 0..bytes.len() {\n\n let b = unsafe { *bytes.get_unchecked(i) };\n\n\n\n if !is_valid(b) {\n\n return Some((i, b));\n\n }\n\n }\n\n\n\n None\n\n }\n\n\n\n fn hex_encode(byte: u8) -> u8 {\n\n let byte = byte & 0xF;\n\n match byte {\n","file_path":"src/rust-util/httpencode/src/util.rs","rank":29,"score":136824.2387126423},{"content":"/// Logs GET or GETS\n\nfn klog_get(command: &MemcacheCommand, key: &[u8], response_len: usize) {\n\n if response_len == 0 {\n\n klog!(\"\\\"{} {}\\\" 0 {}\", command, string_key(Ok(key)), response_len);\n\n } else {\n\n klog!(\"\\\"{} {}\\\" 4 {}\", command, string_key(Ok(key)), response_len);\n\n }\n\n}\n\n\n","file_path":"src/rust/protocol/src/memcache/wire/response/mod.rs","rank":30,"score":136758.8596230761},{"content":" proc_time_i next_expiration_sec;\n","file_path":"src/storage/seg/ttlbucket.h","rank":31,"score":135763.611083229},{"content":"fn setup(opts: &mut Options, metrics: &mut Metrics) {\n\n use crate::memcached::sys::process_setup;\n\n use ccommon_sys::*;\n\n use pelikan_sys::{\n\n hotkey::hotkey_setup, protocol::memcache::*, storage::slab::*, time::time_setup,\n\n util::procinfo_setup,\n\n };\n\n use std::ptr::null_mut;\n\n\n\n unsafe {\n\n log_setup(&mut metrics.log);\n\n if debug_setup(&mut opts.debug) < 0 {\n\n panic!(\"debug log setup failed\");\n\n }\n\n\n\n // Setup top-level application options\n\n if opts.server.daemonize.value() {\n\n pelikan_sys::util::daemonize();\n\n }\n\n\n","file_path":"src/server/twemcache-http/src/main.rs","rank":32,"score":134658.94085273566},{"content":"fn set(c: &mut Criterion) {\n\n let parser = MemcacheRequestParser::new(MAX_VALUE_SIZE, TimeType::Memcache);\n\n\n\n let mut group = c.benchmark_group(\"set\");\n\n group.measurement_time(Duration::from_secs(DURATION));\n\n group.throughput(Throughput::Elements(1));\n\n\n\n let mut buffer = Vec::new();\n\n buffer.extend_from_slice(b\"set 0 0 0 1\\r\\n1\\r\\n\");\n\n buffer.resize_with(BUFFER_SIZE, Default::default);\n\n\n\n group.bench_function(\"1b/1b\", |b| {\n\n b.iter(|| {\n\n let _ = parser.parse(&buffer);\n\n })\n\n });\n\n\n\n let mut buffer = Vec::new();\n\n buffer.extend_from_slice(b\"set 0 0 0 10\\r\\n0123456789\\r\\n\");\n\n buffer.resize_with(BUFFER_SIZE, Default::default);\n","file_path":"src/rust/protocol/benches/memcache.rs","rank":33,"score":133642.68979818147},{"content":"fn get(c: &mut Criterion) {\n\n let parser = MemcacheRequestParser::new(MAX_VALUE_SIZE, TimeType::Memcache);\n\n\n\n let mut group = c.benchmark_group(\"get\");\n\n group.measurement_time(Duration::from_secs(DURATION));\n\n group.throughput(Throughput::Elements(1));\n\n\n\n let mut buffer = Vec::new();\n\n buffer.extend_from_slice(b\"get 0\\r\\n\");\n\n buffer.resize_with(BUFFER_SIZE, Default::default);\n\n\n\n group.bench_function(\"1b\", |b| {\n\n b.iter(|| {\n\n let _ = parser.parse(&buffer);\n\n })\n\n });\n\n}\n\n\n","file_path":"src/rust/protocol/benches/memcache.rs","rank":34,"score":133642.68979818147},{"content":"fn validate_key(key: &[u8]) {\n\n if key.is_empty() {\n\n panic!(\"key is zero-length\");\n\n }\n\n if key.len() > MAX_KEY_LEN {\n\n panic!(\"key is too long\");\n\n }\n\n if key.windows(1).any(|w| w == b\" \") {\n\n panic!(\"key contains SPACE: {:?}\", key);\n\n }\n\n if key.windows(2).any(|w| w == b\"\\r\\n\") {\n\n panic!(\"key contains CRLF: {:?}\", key);\n\n }\n\n}\n","file_path":"src/rust/protocol/fuzz/fuzz_targets/memcache.rs","rank":35,"score":132513.55084204755},{"content":"#[test]\n\nfn expiration() {\n\n let segments = 64;\n\n let segment_size = 2 * 1024;\n\n let heap_size = segments * segment_size as usize;\n\n\n\n let mut cache = Seg::builder()\n\n .segment_size(segment_size)\n\n .heap_size(heap_size)\n\n .hash_power(16)\n\n .build();\n\n\n\n assert_eq!(cache.items(), 0);\n\n assert_eq!(cache.segments.free(), segments);\n\n\n\n assert!(cache\n\n .insert(b\"latte\", b\"\", None, Duration::from_secs(5))\n\n .is_ok());\n\n assert!(cache\n\n .insert(b\"espresso\", b\"\", None, Duration::from_secs(15))\n\n .is_ok());\n","file_path":"src/rust/storage/seg/src/tests.rs","rank":36,"score":129887.44349830484},{"content":"fn order_ascii_lowercase(a: &[u8], b: &[u8]) -> std::cmp::Ordering {\n\n use std::cmp::Ordering;\n\n\n\n match a.len().cmp(&b.len()) {\n\n Ordering::Equal => (),\n\n x => return x,\n\n }\n\n\n\n for (a, b) in a.iter().zip(b.iter()) {\n\n let a = a.to_ascii_lowercase();\n\n let b = b.to_ascii_lowercase();\n\n\n\n match a.cmp(&b) {\n\n Ordering::Equal => (),\n\n x => return x,\n\n }\n\n }\n\n\n\n Ordering::Equal\n\n}\n","file_path":"src/server/twemcache-http/src/http.rs","rank":37,"score":129569.31851628289},{"content":"struct EscapedByteString<'b>(&'b [u8]);\n\n\n\nimpl fmt::Display for EscapedByteString<'_> {\n\n fn fmt(&self, fmt: &mut fmt::Formatter) -> fmt::Result {\n\n let iter = self\n\n .0\n\n .iter()\n\n .cloned()\n\n .flat_map(|x| std::ascii::escape_default(x))\n\n .map(|x| x as char);\n\n\n\n fmt.write_str(\"\\\"\")?;\n\n for c in iter {\n\n fmt.write_fmt(format_args!(\"{}\", c))?;\n\n }\n\n fmt.write_str(\"\\\"\")?;\n\n\n\n Ok(())\n\n }\n\n}\n\n\n","file_path":"test/server/twemcache-http/src/lib.rs","rank":38,"score":128952.88048717414},{"content":"fn get_benchmark(c: &mut Criterion) {\n\n // use the default config\n\n let config = SegcacheConfig::default();\n\n\n\n // launch the server\n\n let server = Segcache::new(config);\n\n\n\n // wait for server to startup. duration is chosen to be longer than we'd\n\n // expect startup to take in a slow ci environment.\n\n std::thread::sleep(Duration::from_secs(10));\n\n\n\n // connect and initialize an empty buffer\n\n let mut stream = TcpStream::connect(\"127.0.0.1:12321\").expect(\"failed to connect\");\n\n let mut buffer = vec![0; 1024 * 1024];\n\n\n\n // define a benchmarking group\n\n let mut group = c.benchmark_group(\"request\");\n\n group.throughput(Throughput::Elements(1));\n\n\n\n // benchmark for a few key lengths\n","file_path":"src/rust/server/segcache/benches/benchmark.rs","rank":39,"score":128490.9364147259},{"content":"fn set_benchmark(c: &mut Criterion) {\n\n let ttl = Duration::ZERO;\n\n let mut group = c.benchmark_group(\"set\");\n\n group.measurement_time(Duration::from_secs(30));\n\n group.throughput(Throughput::Elements(1));\n\n\n\n for key_size in [1, 255].iter() {\n\n for value_size in [1, 64, 1024, 16384].iter() {\n\n let (keys, values) = key_values(*key_size, 1_000_000, *value_size, 10_000);\n\n\n\n // launch the server\n\n let mut cache = Seg::builder()\n\n .hash_power(16)\n\n .heap_size(64 * MB)\n\n .segment_size(MB as i32)\n\n .build();\n\n\n\n let mut key = 0;\n\n let mut value = 0;\n\n\n","file_path":"src/rust/storage/seg/benches/benchmark.rs","rank":40,"score":128490.9364147259},{"content":"fn get_benchmark(c: &mut Criterion) {\n\n let mut group = c.benchmark_group(\"get\");\n\n group.measurement_time(Duration::from_secs(30));\n\n group.throughput(Throughput::Elements(1));\n\n\n\n for key_size in [1, 255].iter() {\n\n let (keys, _values) = key_values(*key_size, 1_000_000, 0, 0);\n\n\n\n // launch the server\n\n let mut cache = Seg::builder()\n\n .hash_power(16)\n\n .heap_size(64 * MB)\n\n .segment_size(MB as i32)\n\n .build();\n\n\n\n let mut key = 0;\n\n\n\n group.bench_function(&format!(\"{}b/0b\", key_size), |b| {\n\n b.iter(|| {\n\n cache.get(&keys[key]);\n\n key += 1;\n\n if key >= keys.len() {\n\n key = 0;\n\n }\n\n })\n\n });\n\n }\n\n}\n\n\n","file_path":"src/rust/storage/seg/benches/benchmark.rs","rank":41,"score":128490.9364147259},{"content":"fn ping_benchmark(c: &mut Criterion) {\n\n let config = PingserverConfig::default();\n\n\n\n // launch the server\n\n let server = Pingserver::new(config);\n\n\n\n // wait for server to startup. duration is chosen to be longer than we'd\n\n // expect startup to take in a slow ci environment.\n\n std::thread::sleep(Duration::from_secs(10));\n\n\n\n // connect and initialize an empty buffer\n\n let mut stream = TcpStream::connect(\"127.0.0.1:12321\").expect(\"failed to connect\");\n\n let mut buffer = vec![0; 1024 * 1024];\n\n\n\n // define a benchmarking group\n\n let mut group = c.benchmark_group(\"request\");\n\n group.throughput(Throughput::Elements(1));\n\n\n\n let msg = b\"ping\\r\\n\";\n\n let bench_name = \"ping\";\n","file_path":"src/rust/server/pingserver/benches/benchmark.rs","rank":42,"score":128490.9364147259},{"content":"/// Given an AdminHandler and a DataProcessor start up a server\n\npub fn core_run_tcp<W, H>(\n\n admin_opts: &AdminOptions,\n\n server_opts: &ListenerOptions,\n\n metrics: &'static CoreMetrics,\n\n admin_handler: H,\n\n worker: W,\n\n) -> IOResult<()>\n\nwhere\n\n W: Worker + Unpin + 'static,\n\n H: AdminHandler + Send + 'static,\n\n{\n\n use tokio::sync::mpsc::channel;\n\n\n\n let admin_addr = admin_opts.addr().expect(\"Invalid socket address\");\n\n let server_addr = server_opts.addr().expect(\"Invalid socket address\");\n\n\n\n let dlog_intvl = admin_opts.dlog_intvl();\n\n\n\n let (send, recv) = channel(1024);\n\n\n","file_path":"src/rustcore/src/lib.rs","rank":43,"score":128428.29884310022},{"content":"pub fn delete<B: BufMut>(buf: B, path: Uri) -> Result<HttpBuilder<B>> {\n\n HttpBuilder::request(buf, Method::Delete, Version::Http11, path)\n\n}\n\n\n","file_path":"src/rust-util/httpencode/src/request.rs","rank":44,"score":126265.67839864697},{"content":"pub fn options<B: BufMut>(buf: B, path: Uri) -> Result<HttpBuilder<B>> {\n\n HttpBuilder::request(buf, Method::Options, Version::Http11, path)\n\n}\n\n\n","file_path":"src/rust-util/httpencode/src/request.rs","rank":45,"score":126265.67839864697},{"content":"pub fn patch<B: BufMut>(buf: B, path: Uri) -> Result<HttpBuilder<B>> {\n\n HttpBuilder::request(buf, Method::Patch, Version::Http11, path)\n\n}\n\n\n","file_path":"src/rust-util/httpencode/src/request.rs","rank":46,"score":126265.67839864697},{"content":"pub fn put<B: BufMut>(buf: B, path: Uri) -> Result<HttpBuilder<B>> {\n\n HttpBuilder::request(buf, Method::Put, Version::Http11, path)\n\n}\n\n\n","file_path":"src/rust-util/httpencode/src/request.rs","rank":47,"score":126265.67839864697},{"content":"pub fn trace<B: BufMut>(buf: B, path: Uri) -> Result<HttpBuilder<B>> {\n\n HttpBuilder::request(buf, Method::Trace, Version::Http11, path)\n\n}\n","file_path":"src/rust-util/httpencode/src/request.rs","rank":48,"score":126265.67839864697},{"content":"pub fn post<B: BufMut>(buf: B, path: Uri) -> Result<HttpBuilder<B>> {\n\n HttpBuilder::request(buf, Method::Post, Version::Http11, path)\n\n}\n\n\n","file_path":"src/rust-util/httpencode/src/request.rs","rank":49,"score":126265.67839864697},{"content":"pub fn get<B: BufMut>(buf: B, path: Uri) -> Result<HttpBuilder<B>> {\n\n HttpBuilder::request(buf, Method::Get, Version::Http11, path)\n\n}\n\n\n","file_path":"src/rust-util/httpencode/src/request.rs","rank":50,"score":126265.67839864697},{"content":"fn build_req_long(b: &mut Bencher) {\n\n let mut buf = Vec::new();\n\n buf.reserve(1 << 14);\n\n\n\n b.iter(|| -> Result<_, _> {\n\n buf.clear();\n\n\n\n let mut req = HttpBuilder::request(\n\n &mut buf,\n\n Method::Get,\n\n Version::Http11,\n\n Uri::new(b\"/wp-content/uploads/2010/03/hello-kitty-darth-vader-pink.jpg\")\n\n )?;\n\n\n\n req.header(\"Host\", \"www.kittyhell.com\")?;\n\n req.header(\"User-Agent\", \"Mozilla/5.0 (Macintosh; U; Intel Mac OS X 10.6; ja-JP-mac; rv:1.9.2.3) Gecko/20100401 Firefox/3.6.3 Pathtraq/0.9\")?;\n\n req.header(\"Accept\", \"text/html,application/xhtml+xml,application/xml;q=0.9,*/*;q=0.8\")?;\n\n req.header(\"Accept-Language\", \"ja,en-us;q=0.7,en;q=0.3\")?;\n\n req.header(\"Accept-Encoding\", \"gzip,deflate\")?;\n\n req.header(\"Accept-Charset\", \"Shift_JIS,utf-8;q=0.7,*;q=0.7\")?;\n\n req.header(\"Keep-Alive\", \"115\")?;\n\n req.header(\"Connection\", \"keep-alive\")?;\n\n req.header(\"Cookie\", \"wp_ozh_wsa_visits=2; wp_ozh_wsa_visit_lasttime=xxxxxxxxxx; __utma=xxxxxxxxx.xxxxxxxxxx.xxxxxxxxxx.xxxxxxxxxx.xxxxxxxxxx.x; __utmz=xxxxxxxxx.xxxxxxxxxx.x.x.utmccn=(referral)|utmcsr=reader.livedoor.com|utmcct=/reader/|utmcmd=referral|padding=under256\")?;\n\n\n\n req.finish().map(|_| ())\n\n });\n\n}\n\n\n","file_path":"src/rust-util/httpencode/benches/compose.rs","rank":51,"score":126123.65286996013},{"content":"fn build_req_short(b: &mut Bencher) {\n\n let mut buf = Vec::new();\n\n buf.reserve(1 << 14);\n\n\n\n b.iter(|| -> Result<_, _> {\n\n buf.clear();\n\n\n\n let mut req = HttpBuilder::request(&mut buf, Method::Get, Version::Http11, Uri::new(b\"/\"))?;\n\n\n\n req.header(\"Host\", \"example.com\")?;\n\n req.header(\"Cookie\", \"session=60; user_id=1\")?;\n\n\n\n req.finish().map(|_| ())\n\n });\n\n}\n\n\n","file_path":"src/rust-util/httpencode/benches/compose.rs","rank":52,"score":126123.65286996013},{"content":"/// An `EventLoop` describes the functions which must be implemented for a basic\n\n/// event loop and provides some default implementations and helper functions.\n\npub trait EventLoop {\n\n // the following functions must be implemented\n\n\n\n /// Provides access to the `Poll` structure which allows polling for new\n\n /// readiness events and managing registration for event sources.\n\n fn poll(&mut self) -> &mut Poll;\n\n\n\n /// Handle new data received for the `Session` with the provided `Token`.\n\n /// This will include parsing the incoming data and composing a response.\n\n fn handle_data(&mut self, token: Token) -> Result<(), std::io::Error>;\n\n\n\n /// Handle a read event for the `Session` with the `Token`.\n\n fn do_read(&mut self, token: Token) -> Result<(), ()> {\n\n if let Ok(session) = self.poll().get_mut_session(token) {\n\n // read from session to buffer\n\n match session.fill_buf().map(|b| b.len()) {\n\n Ok(0) => {\n\n trace!(\"hangup for session: {:?}\", session);\n\n let _ = self.poll().close_session(token);\n\n Err(())\n","file_path":"src/rust/core/server/src/threads/traits/event_loop.rs","rank":53,"score":125805.56643444154},{"content":"fn escape(bytes: &[u8]) -> EscapedByteString {\n\n EscapedByteString(bytes)\n\n}\n\n\n","file_path":"test/server/twemcache-http/src/lib.rs","rank":54,"score":123881.24869189886},{"content":"fn build_req_long_unsafe(b: &mut Bencher) {\n\n let mut buf = Vec::new();\n\n buf.reserve(1 << 14);\n\n\n\n b.iter(|| -> Result<_, _> {\n\n unsafe {\n\n buf.clear();\n\n\n\n let mut req = HttpBuilder::request(\n\n &mut buf,\n\n Method::Get,\n\n Version::Http11,\n\n Uri::escaped_unchecked(b\"/wp-content/uploads/2010/03/hello-kitty-darth-vader-pink.jpg\")\n\n )?;\n\n\n\n req.header_unchecked(\"Host\", \"www.kittyhell.com\")?;\n\n req.header_unchecked(\"User-Agent\", \"Mozilla/5.0 (Macintosh; U; Intel Mac OS X 10.6; ja-JP-mac; rv:1.9.2.3) Gecko/20100401 Firefox/3.6.3 Pathtraq/0.9\")?;\n\n req.header_unchecked(\"Accept\", \"text/html,application/xhtml+xml,application/xml;q=0.9,*/*;q=0.8\")?;\n\n req.header_unchecked(\"Accept-Language\", \"ja,en-us;q=0.7,en;q=0.3\")?;\n\n req.header_unchecked(\"Accept-Encoding\", \"gzip,deflate\")?;\n\n req.header_unchecked(\"Accept-Charset\", \"Shift_JIS,utf-8;q=0.7,*;q=0.7\")?;\n\n req.header_unchecked(\"Keep-Alive\", \"115\")?;\n\n req.header_unchecked(\"Connection\", \"keep-alive\")?;\n\n req.header_unchecked(\"Cookie\", \"wp_ozh_wsa_visits=2; wp_ozh_wsa_visit_lasttime=xxxxxxxxxx; __utma=xxxxxxxxx.xxxxxxxxxx.xxxxxxxxxx.xxxxxxxxxx.xxxxxxxxxx.x; __utmz=xxxxxxxxx.xxxxxxxxxx.x.x.utmccn=(referral)|utmcsr=reader.livedoor.com|utmcct=/reader/|utmcmd=referral|padding=under256\")?;\n\n\n\n req.finish().map(|_| ())\n\n }\n\n });\n\n}\n\n\n","file_path":"src/rust-util/httpencode/benches/compose.rs","rank":55,"score":123880.81116875951},{"content":"fn build_req_short_unsafe(b: &mut Bencher) {\n\n let mut buf = Vec::new();\n\n buf.reserve(1 << 14);\n\n\n\n b.iter(|| -> Result<_, _> {\n\n unsafe {\n\n buf.clear();\n\n\n\n let mut req = HttpBuilder::request(\n\n &mut buf,\n\n Method::Get,\n\n Version::Http11,\n\n Uri::escaped_unchecked(b\"/\"),\n\n )?;\n\n\n\n req.header_unchecked(\"Host\", \"example.com\")?;\n\n req.header_unchecked(\"Cookie\", \"session=60; user_id=1\")?;\n\n\n\n req.finish().map(|_| ())\n\n }\n\n });\n\n}\n\n\n","file_path":"src/rust-util/httpencode/benches/compose.rs","rank":56,"score":123880.81116875951},{"content":"/// Creats a new queue pair that can hold up to capacity items in each\n\n/// direction. The optional `Waker`s allow the sender to inform the receiver\n\n/// that a receive operation should return at least one message.\n\npub fn queue_pair_with_capacity<A, B>(\n\n capacity: usize,\n\n waker_a: Option<Arc<Waker>>,\n\n waker_b: Option<Arc<Waker>>,\n\n) -> (QueuePair<A, B>, QueuePair<B, A>) {\n\n let (to_a, from_b) = rtrb::RingBuffer::new(capacity).split();\n\n let (to_b, from_a) = rtrb::RingBuffer::new(capacity).split();\n\n\n\n let queue_a = QueuePair::<A, B> {\n\n send: to_b,\n\n recv: from_b,\n\n waker: waker_b,\n\n };\n\n\n\n let queue_b = QueuePair::<B, A> {\n\n send: to_a,\n\n recv: from_a,\n\n waker: waker_a,\n\n };\n\n\n","file_path":"src/rust/queues/src/queue_pair/mod.rs","rank":57,"score":123823.76848196925},{"content":"fn interval() -> usize {\n\n INTERVAL\n\n}\n\n\n","file_path":"src/rust/config/src/klog.rs","rank":58,"score":123501.32679461688},{"content":"fn sample() -> usize {\n\n SAMPLE\n\n}\n\n\n","file_path":"src/rust/config/src/klog.rs","rank":59,"score":123501.32679461688},{"content":"fn poolsize() -> usize {\n\n BUF_POOLSIZE\n\n}\n\n\n\n// struct definitions\n\n#[derive(Serialize, Deserialize, Debug)]\n\npub struct Buf {\n\n #[serde(default = \"size\")]\n\n size: usize,\n\n #[serde(default = \"poolsize\")]\n\n poolsize: usize,\n\n}\n\n\n\n// implementation\n\nimpl Buf {\n\n pub fn size(&self) -> usize {\n\n self.size\n\n }\n\n\n\n pub fn poolsize(&self) -> usize {\n","file_path":"src/rust/config/src/buf.rs","rank":60,"score":123501.32679461688},{"content":"fn nevent() -> usize {\n\n WORKER_NEVENT\n\n}\n\n\n","file_path":"src/rust/config/src/worker.rs","rank":61,"score":123501.32679461688},{"content":"fn nevent() -> usize {\n\n ADMIN_NEVENT\n\n}\n\n\n","file_path":"src/rust/config/src/admin.rs","rank":62,"score":123501.32679461688},{"content":"fn nevent() -> usize {\n\n SERVER_NEVENT\n\n}\n\n\n\n// definitions\n\n#[derive(Serialize, Deserialize, Debug)]\n\npub struct Server {\n\n #[serde(default = \"host\")]\n\n host: String,\n\n #[serde(default = \"port\")]\n\n port: String,\n\n #[serde(default = \"timeout\")]\n\n timeout: usize,\n\n #[serde(default = \"nevent\")]\n\n nevent: usize,\n\n}\n\n\n\n// implementation\n\nimpl Server {\n\n /// Host address to listen on\n","file_path":"src/rust/config/src/server.rs","rank":63,"score":123501.32679461688},{"content":"// helper functions\n\nfn size() -> usize {\n\n BUF_DEFAULT_SIZE\n\n}\n\n\n","file_path":"src/rust/config/src/buf.rs","rank":64,"score":123501.32679461688},{"content":"// helper functions\n\nfn backlog() -> usize {\n\n TCP_BACKLOG\n\n}\n\n\n","file_path":"src/rust/config/src/tcp.rs","rank":65,"score":123501.32679461688},{"content":"fn poolsize() -> usize {\n\n TCP_POOLSIZE\n\n}\n\n\n\n// definitions\n\n#[derive(Serialize, Deserialize, Debug)]\n\npub struct Tcp {\n\n #[serde(default = \"backlog\")]\n\n backlog: usize,\n\n #[serde(default = \"poolsize\")]\n\n poolsize: usize,\n\n}\n\n\n\n// implementation\n\nimpl Tcp {\n\n pub fn backlog(&self) -> usize {\n\n self.backlog\n\n }\n\n\n\n pub fn poolsize(&self) -> usize {\n","file_path":"src/rust/config/src/tcp.rs","rank":66,"score":123501.32679461688},{"content":"fn timeout() -> usize {\n\n ADMIN_TIMEOUT\n\n}\n\n\n","file_path":"src/rust/config/src/admin.rs","rank":67,"score":123501.32679461688},{"content":"fn timeout() -> usize {\n\n SERVER_TIMEOUT\n\n}\n\n\n","file_path":"src/rust/config/src/server.rs","rank":68,"score":123501.32679461688},{"content":"fn threads() -> usize {\n\n WORKER_THREADS\n\n}\n\n\n\n// definitions\n\n#[derive(Serialize, Deserialize, Debug)]\n\npub struct Worker {\n\n #[serde(default = \"timeout\")]\n\n timeout: usize,\n\n #[serde(default = \"nevent\")]\n\n nevent: usize,\n\n #[serde(default = \"threads\")]\n\n threads: usize,\n\n}\n\n\n\n// implementation\n\nimpl Worker {\n\n pub fn timeout(&self) -> usize {\n\n self.timeout\n\n }\n","file_path":"src/rust/config/src/worker.rs","rank":69,"score":123501.32679461688},{"content":"// helper functions\n\nfn timeout() -> usize {\n\n WORKER_TIMEOUT\n\n}\n\n\n","file_path":"src/rust/config/src/worker.rs","rank":70,"score":123501.32679461688},{"content":"fn print_directives(lib: impl AsRef<str>, subdir: impl AsRef<str>) {\n\n let lib: &str = lib.as_ref();\n\n let subdir: &str = subdir.as_ref();\n\n let bindir = get_cmake_binary_dir().unwrap_or(format!(\"{}/build\", env::var(\"OUT_DIR\").unwrap()));\n\n\n\n println!(\"cargo:rustc-link-search={}/{}/\", bindir, subdir);\n\n println!(\"cargo:rustc-link-lib={}\", lib);\n\n}\n\n\n","file_path":"src/rust-util/pelikan-sys/build.rs","rank":71,"score":123297.46496197395},{"content":"/// Parse a key-value pair separated by `:` then strip the whitespace\n\n/// off of both the key and the value.\n\nfn parse_kv<'a>(input: &'a [u8], line: u32) -> Result<(&'a [u8], &'a [u8]), ParseError<'a>> {\n\n let mut first = true;\n\n\n\n let mut split = input.split(|&x| {\n\n if x == b':' && first {\n\n first = false;\n\n return true;\n\n }\n\n\n\n false\n\n });\n\n\n\n let key = match split.next() {\n\n Some(x) => x,\n\n // There will always be at least one subslice\n\n None => unreachable!(),\n\n };\n\n let value = match split.next() {\n\n Some(x) => x,\n\n None => return Err(ParseError::missing_colon(Span::new(input, line))),\n","file_path":"deps/ccommon/rust/ccommon-backend/src/option/parse.rs","rank":72,"score":123135.18378034768},{"content":"#[test]\n\nfn bucket_index() {\n\n let ttl_buckets = TtlBuckets::new();\n\n\n\n // Zero TTL and max duration both go into the same TtlBucket\n\n assert_eq!(ttl_buckets.get_bucket_index(Duration::from_secs(0)), 1023);\n\n assert_eq!(\n\n ttl_buckets.get_bucket_index(Duration::from_secs(u32::MAX)),\n\n 1023\n\n );\n\n\n\n // first bucket is only 7s wide because 0 is no ttl\n\n assert_eq!(ttl_buckets.get_bucket_index(Duration::from_secs(1)), 0);\n\n assert_eq!(ttl_buckets.get_bucket_index(Duration::from_secs(7)), 0);\n\n\n\n // buckets from 8s - 2048s (0..34 minutes) are all 8s wide\n\n for bucket in 1..256 {\n\n let start = Duration::from_secs(8 * bucket);\n\n let end = Duration::from_secs(8 * bucket + 7);\n\n assert_eq!(\n\n ttl_buckets.get_bucket_index(start) as u32,\n","file_path":"src/rust/storage/seg/src/ttl_buckets/tests.rs","rank":73,"score":121871.4607781822},{"content":"/// Validate a key name.\n\n///\n\n/// A valid key can only contain characters in `[a-zA-Z0-9_]`.\n\nfn is_valid_name(key: &[u8]) -> bool {\n\n key.iter()\n\n .copied()\n\n .all(|x: u8| x.is_ascii_alphanumeric() || x == b'_')\n\n}\n\n\n","file_path":"deps/ccommon/rust/ccommon-backend/src/option/parse.rs","rank":74,"score":121753.19326651416},{"content":"fn escape_string(bytes: &[u8]) -> String {\n\n bytes\n\n .iter()\n\n .flat_map(|x| std::ascii::escape_default(*x))\n\n .map(|c| c as char)\n\n .collect()\n\n}\n\n\n\nimpl fmt::Debug for Value<'_> {\n\n fn fmt(&self, fmt: &mut fmt::Formatter) -> fmt::Result {\n\n match self {\n\n Value::Bool(v) => fmt.debug_tuple(\"Bool\").field(v).finish(),\n\n Value::Float(v) => fmt.debug_tuple(\"Float\").field(v).finish(),\n\n Value::UInt(v) => fmt.debug_tuple(\"UInt\").field(v).finish(),\n\n Value::Str(s) => {\n\n let escaped = &escape_string(s);\n\n fmt.debug_tuple(\"Str\").field(escaped).finish()\n\n }\n\n }\n\n }\n","file_path":"deps/ccommon/rust/ccommon-backend/src/option/parse.rs","rank":75,"score":121753.19326651416},{"content":"struct KVSizes(usize, usize);\n\n\n\nconst PLUS: u8 = 0x2b; // ASCII '+'\n\nconst COMMA: u8 = 0x2c; // ASCII ','\n\nconst COLON: u8 = 0x3a; // ASCII ':'\n\nconst NL: u8 = 0x0a; // ASCII '\\n'\n\n\n","file_path":"src/storage/cdb/cdb_rs/src/cdb/input.rs","rank":76,"score":121445.82509719816},{"content":"fn escaped(bytes: &[u8]) -> Cow<str> {\n\n if bytes.iter().copied().all(|c| c.is_ascii()) {\n\n Cow::Borrowed(std::str::from_utf8(bytes).unwrap())\n\n } else {\n\n let string = bytes\n\n .iter()\n\n .copied()\n\n .flat_map(std::ascii::escape_default)\n\n .map(|c| c as char)\n\n .collect();\n\n\n\n Cow::Owned(string)\n\n }\n\n}\n\n\n","file_path":"src/rust-util/httpencode/src/tests.rs","rank":77,"score":121259.04813092665},{"content":"fn use_tls() -> bool {\n\n ADMIN_USE_TLS\n\n}\n\n\n\n// definitions\n\n#[derive(Serialize, Deserialize, Debug)]\n\npub struct Admin {\n\n #[serde(default = \"host\")]\n\n host: String,\n\n #[serde(default = \"port\")]\n\n port: String,\n\n #[serde(default = \"timeout\")]\n\n timeout: usize,\n\n #[serde(default = \"nevent\")]\n\n nevent: usize,\n\n #[serde(default = \"tw_tick\")]\n\n tw_tick: usize,\n\n #[serde(default = \"tw_cap\")]\n\n tw_cap: usize,\n\n #[serde(default = \"tw_ntick\")]\n","file_path":"src/rust/config/src/admin.rs","rank":78,"score":120736.19815501932},{"content":"fn heap_size() -> usize {\n\n HEAP_SIZE\n\n}\n\n\n","file_path":"src/rust/config/src/seg.rs","rank":79,"score":120691.9207839444},{"content":"fn nbuf() -> usize {\n\n STATS_LOG_NBUF\n\n}\n\n\n\n// definitions\n\n#[derive(Serialize, Deserialize, Debug)]\n\npub struct StatsLog {\n\n #[serde(default = \"file\")]\n\n file: Option<String>,\n\n #[serde(default = \"nbuf\")]\n\n nbuf: usize,\n\n}\n\n\n\n// implementation\n\nimpl StatsLog {\n\n pub fn log_file(&self) -> Option<String> {\n\n self.file.clone()\n\n }\n\n\n\n pub fn log_nbuf(&self) -> usize {\n\n self.nbuf\n\n }\n\n}\n\n\n","file_path":"src/rust/config/src/stats_log.rs","rank":80,"score":120691.9207839444},{"content":"fn queue_depth() -> usize {\n\n QUEUE_DEPTH\n\n}\n\n\n","file_path":"src/rust/config/src/klog.rs","rank":81,"score":120691.9207839444},{"content":"// helper functions\n\nfn nelem_delta() -> usize {\n\n NELEM_DELTA\n\n}\n\n\n\n// definitions\n\n#[derive(Serialize, Deserialize, Debug)]\n\npub struct Array {\n\n #[serde(default = \"nelem_delta\")]\n\n nelem_delta: usize,\n\n}\n\n\n\n// implementation\n\nimpl Array {\n\n pub fn nelem_delta(&self) -> usize {\n\n self.nelem_delta\n\n }\n\n}\n\n\n","file_path":"src/rust/config/src/array.rs","rank":82,"score":120691.9207839444},{"content":"fn compact_target() -> usize {\n\n COMPACT_TARGET\n\n}\n\n\n","file_path":"src/rust/config/src/seg.rs","rank":83,"score":120691.9207839444},{"content":"fn tw_ntick() -> usize {\n\n ADMIN_TW_NTICK\n\n}\n\n\n","file_path":"src/rust/config/src/admin.rs","rank":84,"score":120691.9207839444},{"content":"fn tw_tick() -> usize {\n\n ADMIN_TW_TICK\n\n}\n\n\n","file_path":"src/rust/config/src/admin.rs","rank":85,"score":120691.9207839444},{"content":"fn dlog_interval() -> usize {\n\n DLOG_INTERVAL\n\n}\n\n\n\n// struct definitions\n\n#[derive(Serialize, Deserialize, Debug)]\n\npub struct PingserverConfig {\n\n // top-level\n\n #[serde(default = \"daemonize\")]\n\n daemonize: bool,\n\n #[serde(default = \"pid_filename\")]\n\n pid_filename: Option<String>,\n\n #[serde(default = \"dlog_interval\")]\n\n dlog_interval: usize,\n\n\n\n // application modules\n\n #[serde(default)]\n\n admin: Admin,\n\n #[serde(default)]\n\n server: Server,\n","file_path":"src/rust/config/src/pingserver.rs","rank":86,"score":120691.9207839444},{"content":"fn tw_cap() -> usize {\n\n ADMIN_TW_CAP\n\n}\n\n\n","file_path":"src/rust/config/src/admin.rs","rank":87,"score":120691.9207839444},{"content":"// helper functions\n\nfn max_power() -> usize {\n\n DBUF_DEFAULT_MAX\n\n}\n\n\n\n// struct definitions\n\n#[derive(Serialize, Deserialize, Debug)]\n\npub struct Dbuf {\n\n #[serde(default = \"max_power\")]\n\n max_power: usize,\n\n}\n\n\n\n// implementation\n\nimpl Dbuf {\n\n pub fn max_power(&self) -> usize {\n\n self.max_power\n\n }\n\n}\n\n\n","file_path":"src/rust/config/src/dbuf.rs","rank":88,"score":120691.9207839444},{"content":"fn dlog_interval() -> usize {\n\n DLOG_INTERVAL\n\n}\n\n\n\n// struct definitions\n\n#[derive(Serialize, Deserialize, Debug)]\n\npub struct SegcacheConfig {\n\n // top-level\n\n #[serde(default = \"daemonize\")]\n\n daemonize: bool,\n\n #[serde(default = \"pid_filename\")]\n\n pid_filename: Option<String>,\n\n #[serde(default = \"dlog_interval\")]\n\n dlog_interval: usize,\n\n\n\n // application modules\n\n #[serde(default)]\n\n admin: Admin,\n\n #[serde(default)]\n\n server: Server,\n","file_path":"src/rust/config/src/segcache.rs","rank":89,"score":120691.9207839444},{"content":"fn merge_target() -> usize {\n\n MERGE_TARGET\n\n}\n\n\n","file_path":"src/rust/config/src/seg.rs","rank":90,"score":120691.9207839444},{"content":"fn merge_max() -> usize {\n\n MERGE_MAX\n\n}\n\n\n","file_path":"src/rust/config/src/seg.rs","rank":91,"score":120691.9207839444},{"content":"/// Load options from a type which implements `BufRead`.\n\n///\n\n/// In most cases you'll want to use [`OptionExt::load`][0]\n\n/// instead.\n\n///\n\n/// [0]: crate::option::OptionExt::load\n\npub fn option_load<R: BufRead>(\n\n options: &mut [option],\n\n source: &mut R,\n\n) -> Result<(), ParseError<'static>> {\n\n let mut linebuf = Vec::new();\n\n\n\n let mut lineno = 0;\n\n\n\n while source\n\n .read_until(b'\\n', &mut linebuf)\n\n .map_err(ParseError::ioerror)?\n\n != 0\n\n {\n\n // Strip off any comments before doing parsing\n\n let line = linebuf.split(|&x| x == b'#').next().unwrap();\n\n\n\n if line.iter().copied().all(|x| x.is_ascii_whitespace()) {\n\n linebuf.clear();\n\n continue;\n\n }\n","file_path":"deps/ccommon/rust/ccommon-backend/src/option/parse.rs","rank":92,"score":119679.65903465006},{"content":"/// Initialize the logger. It will automatically use the\n\n/// ccommon debug logger once that is set up.\n\npub fn init() -> Result<(), SetLoggerError> {\n\n use log::LevelFilter;\n\n\n\n // TODO: dynamically set this based on dlog?\n\n log::set_max_level(LevelFilter::Trace);\n\n\n\n log::set_logger(&LOGGER)\n\n}\n\n\n","file_path":"deps/ccommon/rust/ccommon-rs/src/log/shim.rs","rank":93,"score":119676.48728591808},{"content":"fn is_space(c: Option<u8>) -> bool {\n\n c.map(|x| x.is_ascii_whitespace()).unwrap_or(false)\n\n}\n\n\n","file_path":"deps/ccommon/rust/ccommon-backend/src/option/parse.rs","rank":94,"score":119016.10682881856},{"content":"#[proc_macro]\n\npub fn to_lowercase(input: TokenStream) -> TokenStream {\n\n let ident = syn::parse_macro_input!(input as Ident);\n\n let name = ident.to_string().to_ascii_lowercase();\n\n let literal = syn::LitStr::new(&name, ident.span());\n\n let tokens = quote! { #literal };\n\n\n\n tokens.into()\n\n}\n","file_path":"src/rust/macros/src/lib.rs","rank":95,"score":118957.89903571687},{"content":"fn nbuf() -> usize {\n\n STATS_LOG_NBUF\n\n}\n\n\n\n// definitions\n\n#[derive(Debug)]\n\n#[cfg_attr(feature = \"serde\", derive(Serialize, Deserialize))]\n\npub struct StatsLogConfig {\n\n\t#[cfg_attr(feature = \"serde\", serde(default = \"file\"))]\n\n file: Option<String>,\n\n #[cfg_attr(feature = \"serde\", serde(default = \"nbuf\"))]\n\n nbuf: usize,\n\n}\n\n\n\n// implementation\n\nimpl StatsLogConfig {\n\n pub fn log_file(&self) -> Option<String> {\n\n self.file.clone()\n\n }\n\n\n","file_path":"deps/ccommon/rust/ccommon-stats/src/lib.rs","rank":96,"score":118042.839606728},{"content":"fn single_message_size() -> usize {\n\n SINGLE_MESSAGE_SIZE\n\n}\n\n\n\n////////////////////////////////////////////////////////////////////////////////\n\n// struct definitions\n\n////////////////////////////////////////////////////////////////////////////////\n\n\n\n#[derive(Serialize, Deserialize, Debug, Clone)]\n\npub struct Klog {\n\n #[serde(default = \"backup\")]\n\n backup: Option<String>,\n\n #[serde(default = \"file\")]\n\n file: Option<String>,\n\n #[serde(default = \"interval\")]\n\n interval: usize,\n\n #[serde(default = \"max_size\")]\n\n max_size: u64,\n\n #[serde(default = \"queue_depth\")]\n\n queue_depth: usize,\n","file_path":"src/rust/config/src/klog.rs","rank":97,"score":118042.839606728},{"content":"// helper functions\n\nfn buf_sock_poolsize() -> usize {\n\n BUFSOCK_POOLSIZE\n\n}\n\n\n\n// definitions\n\n#[derive(Serialize, Deserialize, Debug)]\n\npub struct Sockio {\n\n #[serde(default = \"buf_sock_poolsize\")]\n\n buf_sock_poolsize: usize,\n\n}\n\n\n\n// implementation\n\nimpl Sockio {\n\n pub fn buf_sock_poolsize(&self) -> usize {\n\n self.buf_sock_poolsize\n\n }\n\n}\n\n\n\n// trait implementations\n\nimpl Default for Sockio {\n\n fn default() -> Self {\n\n Self {\n\n buf_sock_poolsize: buf_sock_poolsize(),\n\n }\n\n }\n\n}\n\n\n","file_path":"src/rust/config/src/sockio.rs","rank":98,"score":118042.839606728},{"content":"fn log_queue_depth() -> usize {\n\n LOG_QUEUE_DEPTH\n\n}\n\n\n","file_path":"src/rust/config/src/debug.rs","rank":99,"score":118042.839606728}],"string":"[\n {\n \"content\": \"#[inline]\\n\\nfn copy_slice(dst: &mut [u8], src: &[u8]) -> usize {\\n\\n let n = cmp::min(dst.len(), src.len());\\n\\n dst[0..n].copy_from_slice(&src[0..n]);\\n\\n n\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use tempfile::NamedTempFile;\\n\\n\\n\\n fn kvs() -> Vec<(String, String)> {\\n\\n vec![\\n\\n (\\\"abc\\\", \\\"def\\\"),\\n\\n (\\\"pink\\\", \\\"red\\\"),\\n\\n (\\\"apple\\\", \\\"grape\\\"),\\n\\n (\\\"q\\\", \\\"burp\\\"),\\n\\n ]\\n\\n .iter()\\n\\n .map(|(k, v)| (k.to_string(), v.to_string()))\\n\",\n \"file_path\": \"src/storage/cdb/cdb_rs/src/cdb/mod.rs\",\n \"rank\": 0,\n \"score\": 219008.64793613274\n },\n {\n \"content\": \"/// Trim starting and ending spaces off of a byte slice\\n\\nfn trim_bytes(mut slice: &[u8]) -> &[u8] {\\n\\n while is_space(slice.first().copied()) {\\n\\n slice = slice.split_first().unwrap().1;\\n\\n }\\n\\n\\n\\n while is_space(slice.last().copied()) {\\n\\n slice = slice.split_last().unwrap().1\\n\\n }\\n\\n\\n\\n slice\\n\\n}\\n\\n\\n\",\n \"file_path\": \"deps/ccommon/rust/ccommon-backend/src/option/parse.rs\",\n \"rank\": 1,\n \"score\": 198625.81972015614\n },\n {\n \"content\": \"fn segment_size() -> i32 {\\n\\n SEGMENT_SIZE\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust/config/src/seg.rs\",\n \"rank\": 2,\n \"score\": 195359.39650797506\n },\n {\n \"content\": \"pub fn readybuf(size: usize) -> BytesMut {\\n\\n let mut b = BytesMut::with_capacity(size);\\n\\n b.resize(size, 0);\\n\\n b\\n\\n}\\n\\n\\n\\nimpl SliceFactory {\\n\\n pub fn load(path: &str) -> Result<SliceFactory> {\\n\\n let mut f = File::open(path)?;\\n\\n let mut buffer = Vec::new();\\n\\n f.read_to_end(&mut buffer)?;\\n\\n Ok(SliceFactory::HeapStorage(HeapWrap(Bytes::from(buffer))))\\n\\n }\\n\\n\\n\\n pub fn make_map(path: &str) -> Result<SliceFactory> {\\n\\n let f = File::open(path)?;\\n\\n let mmap: Mmap = unsafe { MmapOptions::new().map(&f)? };\\n\\n\\n\\n let mut buf = [0u8; BUF_LEN];\\n\\n let mut count = 0;\\n\",\n \"file_path\": \"src/storage/cdb/cdb_rs/src/cdb/storage.rs\",\n \"rank\": 3,\n \"score\": 193967.9182434666\n },\n {\n \"content\": \"// A very fast PRNG which is appropriate for testing\\n\\npub fn rng() -> impl RngCore {\\n\\n rand_xoshiro::Xoshiro256PlusPlus::seed_from_u64(0)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust/storage/seg/benches/benchmark.rs\",\n \"rank\": 4,\n \"score\": 189389.95385749516\n },\n {\n \"content\": \"fn put(buf: &mut Vec<u8>, flags: u32, path: &[u8], mut body: &[u8]) -> Result<(), Error> {\\n\\n let mut builder = request::put(buf, Uri::new(path))?;\\n\\n \\n\\n builder.header(\\\"Content-Length\\\", body.len())?;\\n\\n builder.header(\\\"Flags\\\", flags)?;\\n\\n builder.body(&mut body)?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"test/server/twemcache-http/src/lib.rs\",\n \"rank\": 5,\n \"score\": 186537.7713278846\n },\n {\n \"content\": \"pub fn benches(c: &mut Criterion) {\\n\\n c.bench_function(\\\"build_req_long\\\", build_req_long);\\n\\n c.bench_function(\\\"build_req_long_unsafe\\\", build_req_long_unsafe);\\n\\n c.bench_function(\\\"build_req_short\\\", build_req_short);\\n\\n c.bench_function(\\\"build_req_short_unsafe\\\", build_req_short_unsafe);\\n\\n}\\n\\n\\n\\ncriterion_group!(group, benches);\\n\\ncriterion_main!(group);\\n\",\n \"file_path\": \"src/rust-util/httpencode/benches/compose.rs\",\n \"rank\": 6,\n \"score\": 185583.18721763755\n },\n {\n \"content\": \"/// Load a single option from a byte string.\\n\\npub fn option_set<'a>(option: &mut option, value: &'a [u8]) -> Result<(), ParseError<'a>> {\\n\\n let value = parse_value(value, 0, option.type_)?;\\n\\n\\n\\n unsafe { set_option_value(option, value) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"deps/ccommon/rust/ccommon-backend/src/option/parse.rs\",\n \"rank\": 7,\n \"score\": 179760.63147956354\n },\n {\n \"content\": \"pub fn opt_to_null_mut<T>(o: Option<*mut T>) -> *mut T {\\n\\n match o {\\n\\n Some(p) => p,\\n\\n None => ptr::null_mut(),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"deps/ccommon/rust/ccommon-rs/src/ptrs.rs\",\n \"rank\": 8,\n \"score\": 178405.1432352485\n },\n {\n \"content\": \"fn get(buf: &mut Vec<u8>, path: &[u8]) -> Result<(), Error> {\\n\\n let mut builder = request::get(buf, Uri::new(path))?;\\n\\n\\n\\n builder.header(\\\"Content-Length\\\", \\\"0\\\")?;\\n\\n builder.finish()?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"test/server/twemcache-http/src/lib.rs\",\n \"rank\": 9,\n \"score\": 175860.5761091654\n },\n {\n \"content\": \"fn delete(buf: &mut Vec<u8>, path: &[u8]) -> Result<(), Error> {\\n\\n let mut builder = request::delete(buf, Uri::new(path))?;\\n\\n\\n\\n builder.header(\\\"CoNtEnT-LeNgTh\\\", \\\"0\\\")?;\\n\\n builder.finish()?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"test/server/twemcache-http/src/lib.rs\",\n \"rank\": 10,\n \"score\": 175860.5761091654\n },\n {\n \"content\": \"pub fn lift_to_option<T>(p: *mut T) -> Option<*mut T> {\\n\\n if p.is_null() {\\n\\n None\\n\\n } else {\\n\\n Some(p)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"deps/ccommon/rust/ccommon-rs/src/ptrs.rs\",\n \"rank\": 11,\n \"score\": 173102.08633288948\n },\n {\n \"content\": \"pub fn head<B: BufMut>(buf: B, path: Uri) -> Result<HttpBuilder<B>> {\\n\\n HttpBuilder::request(buf, Method::Head, Version::Http11, path)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust-util/httpencode/src/request.rs\",\n \"rank\": 12,\n \"score\": 172010.56767705825\n },\n {\n \"content\": \"pub fn size_of(value: &Value) -> usize {\\n\\n match value {\\n\\n Value::Bytes(v) => v.len(),\\n\\n Value::U64(_) => core::mem::size_of::<u64>(),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/rust/storage/seg/src/item/mod.rs\",\n \"rank\": 13,\n \"score\": 160612.89421086863\n },\n {\n \"content\": \"pub fn null_check<T>(p: *mut T) -> result::Result<*mut T, NullPointerError> {\\n\\n lift_to_option(p).ok_or_else(|| NullPointerError)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"deps/ccommon/rust/ccommon-rs/src/ptrs.rs\",\n \"rank\": 14,\n \"score\": 157324.77838966792\n },\n {\n \"content\": \"fn parse_digits(buf: &[u8]) -> Result<usize> {\\n\\n let s = str::from_utf8(&buf)?;\\n\\n s.parse::<usize>().map_err(|e| e.into())\\n\\n}\\n\\n\\n\\nconst ARROW_BYTES: &[u8; 2] = b\\\"->\\\";\\n\\n\\n\",\n \"file_path\": \"src/storage/cdb/cdb_rs/src/cdb/input.rs\",\n \"rank\": 15,\n \"score\": 154440.9352335621\n },\n {\n \"content\": \"pub fn load_bytes_at_path(path: &str) -> Result<Box<[u8]>> {\\n\\n let mut f = File::open(path)?;\\n\\n let mut buffer = Vec::with_capacity(f.metadata()?.len() as usize);\\n\\n f.read_to_end(&mut buffer)?;\\n\\n Ok(buffer.into_boxed_slice())\\n\\n}\\n\\n\\n\\nimpl<'a> Reader<'a> {\\n\\n pub fn new<T: AsRef<[u8]>>(r: &'a T) -> Reader<'a> {\\n\\n Reader(r.as_ref())\\n\\n }\\n\\n\\n\\n // TODO: perform basic sanity checks of data (gee i wish there was a checksum\\n\\n // somwhere in this data format HINT HINT)\\n\\n //\\n\\n // * does the secondary index fall safely in the correct index range?\\n\\n // * do data pointers point at the data segment?\\n\\n\\n\\n #[inline]\\n\\n fn bucket_at(&self, idx: usize) -> Result<Bucket> {\\n\",\n \"file_path\": \"src/storage/cdb/cdb_rs/src/cdb/mod.rs\",\n \"rank\": 16,\n \"score\": 153787.65156644836\n },\n {\n \"content\": \"pub fn init() {\\n\\n PID.set(std::process::id().into());\\n\\n}\\n\",\n \"file_path\": \"src/rust/metrics/src/lib.rs\",\n \"rank\": 17,\n \"score\": 151529.31409976818\n },\n {\n \"content\": \"// helper functions for default values\\n\\nfn hash_power() -> u8 {\\n\\n HASH_POWER\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust/config/src/seg.rs\",\n \"rank\": 18,\n \"score\": 148795.84047733556\n },\n {\n \"content\": \"pub fn tests() {\\n\\n debug!(\\\"beginning tests\\\");\\n\\n println!();\\n\\n\\n\\n test(\\n\\n \\\"cas not found (key: 0)\\\",\\n\\n &[(\\\"cas 0 0 0 1 1\\\\r\\\\n0\\\\r\\\\n\\\", Some(\\\"NOT_FOUND\\\\r\\\\n\\\"))],\\n\\n );\\n\\n test(\\\"get empty (key: 0)\\\", &[(\\\"get 0\\\\r\\\\n\\\", Some(\\\"END\\\\r\\\\n\\\"))]);\\n\\n test(\\\"gets empty (key: 0)\\\", &[(\\\"gets 0\\\\r\\\\n\\\", Some(\\\"END\\\\r\\\\n\\\"))]);\\n\\n test(\\n\\n \\\"cas not found (key: 0)\\\",\\n\\n &[(\\\"cas 0 0 0 1 0\\\\r\\\\n0\\\\r\\\\n\\\", Some(\\\"NOT_FOUND\\\\r\\\\n\\\"))],\\n\\n );\\n\\n test(\\n\\n \\\"set value (key: 0)\\\",\\n\\n &[(\\\"set 0 0 0 1\\\\r\\\\n1\\\\r\\\\n\\\", Some(\\\"STORED\\\\r\\\\n\\\"))],\\n\\n );\\n\\n test(\\n\\n \\\"get value (key: 0)\\\",\\n\",\n \"file_path\": \"src/rust/server/segcache/tests/common.rs\",\n \"rank\": 19,\n \"score\": 148720.660028336\n },\n {\n \"content\": \"pub fn main() {\\n\\n let bindir = match env::args_os().skip(1).next() {\\n\\n Some(dir) => PathBuf::from(dir),\\n\\n None => {\\n\\n eprintln!(\\\"Usage: test-pingserver-rs <CMAKE_BINARY_DIR>\\\");\\n\\n panic!();\\n\\n }\\n\\n };\\n\\n\\n\\n let mut server = Command::new(bindir.join(\\\"_bin/pelikan_twemcache_http\\\"))\\n\\n .spawn()\\n\\n .expect(\\\"Failed to start server process\\\");\\n\\n\\n\\n // Give the server time to start up\\n\\n std::thread::sleep(Duration::from_millis(1000));\\n\\n\\n\\n let res = catch_unwind(|| run_tests());\\n\\n\\n\\n // Give the server some time to crash if any of the test\\n\\n // would cause that to happen.\\n\\n std::thread::sleep(Duration::from_millis(100));\\n\\n\\n\\n server.kill().expect(\\\"Server died unexpectedly\\\");\\n\\n\\n\\n match res {\\n\\n Err(e) => resume_unwind(e),\\n\\n _ => (),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"test/server/twemcache-http/src/lib.rs\",\n \"rank\": 20,\n \"score\": 148720.660028336\n },\n {\n \"content\": \"pub fn klog_format(\\n\\n w: &mut dyn std::io::Write,\\n\\n now: DateTime,\\n\\n record: &Record,\\n\\n) -> Result<(), std::io::Error> {\\n\\n writeln!(\\n\\n w,\\n\\n \\\"{} {}\\\",\\n\\n now.to_rfc3339_opts(SecondsFormat::Millis, false),\\n\\n record.args()\\n\\n )\\n\\n}\\n\",\n \"file_path\": \"src/rust/logger/src/format.rs\",\n \"rank\": 21,\n \"score\": 148720.660028336\n },\n {\n \"content\": \"pub fn default_format(\\n\\n w: &mut dyn std::io::Write,\\n\\n now: DateTime,\\n\\n record: &Record,\\n\\n) -> Result<(), std::io::Error> {\\n\\n writeln!(\\n\\n w,\\n\\n \\\"{} {} [{}] {}\\\",\\n\\n now.to_rfc3339_opts(SecondsFormat::Millis, false),\\n\\n record.level(),\\n\\n record.module_path().unwrap_or(\\\"<unnamed>\\\"),\\n\\n record.args()\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust/logger/src/format.rs\",\n \"rank\": 22,\n \"score\": 148720.660028336\n },\n {\n \"content\": \"fn compare_insensitive(a: &[u8], b: &[u8]) -> bool {\\n\\n if a.len() != b.len() {\\n\\n return false;\\n\\n }\\n\\n\\n\\n a.iter().copied().map(|c| c.to_ascii_lowercase())\\n\\n .zip(b.iter().copied().map(|c| c.to_ascii_lowercase()))\\n\\n .all(|(a, b)| a == b)\\n\\n}\\n\",\n \"file_path\": \"test/server/twemcache-http/src/lib.rs\",\n \"rank\": 23,\n \"score\": 142568.77200953406\n },\n {\n \"content\": \" delta_time_i ttl; /* the min ttl of this bucket */\\n\",\n \"file_path\": \"src/storage/seg/ttlbucket.h\",\n \"rank\": 24,\n \"score\": 140661.67771209544\n },\n {\n \"content\": \"fn compare_ascii_lowercase(a: &[u8], b: &[u8]) -> bool {\\n\\n if a.len() != b.len() {\\n\\n return false;\\n\\n }\\n\\n\\n\\n a.iter()\\n\\n .copied()\\n\\n .map(|x| x.to_ascii_lowercase())\\n\\n .zip(b.iter().copied().map(|x| x.to_ascii_lowercase()))\\n\\n .all(|(a, b)| a == b)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/server/twemcache-http/src/http.rs\",\n \"rank\": 25,\n \"score\": 140441.0313131805\n },\n {\n \"content\": \"/// Set the global panic handler to one which logs the\\n\\n/// panic at `LOG_CRIT` level before calling the original\\n\\n/// panic hook.\\n\\npub fn set_panic_handler() {\\n\\n use ccommon_sys::LOG_CRIT;\\n\\n\\n\\n use std::env;\\n\\n use std::io::Cursor;\\n\\n\\n\\n // After logging the message we want to call whatever existing\\n\\n // panic hook was in place. In most cases this should be the\\n\\n // default hook.\\n\\n let old_hook = panic::take_hook();\\n\\n\\n\\n panic::set_hook(Box::new(move |info: &PanicInfo| {\\n\\n let mut buffer = [0u8; LOG_MAX_LEN as usize + 1];\\n\\n let ptr = ccommon_dlog().load(Ordering::Relaxed);\\n\\n\\n\\n let msg = if let Some(s) = info.payload().downcast_ref::<&str>() {\\n\\n *s\\n\\n } else if let Some(s) = info.payload().downcast_ref::<String>() {\\n\\n &s[..]\\n\\n } else {\\n\",\n \"file_path\": \"deps/ccommon/rust/ccommon-rs/src/log/shim.rs\",\n \"rank\": 26,\n \"score\": 138962.47900680924\n },\n {\n \"content\": \"fn ready_buf(size: usize) -> BytesMut {\\n\\n let mut b = BytesMut::with_capacity(size);\\n\\n b.reserve(size);\\n\\n b\\n\\n}\\n\\n\\n\\npub struct Writer<'a, F>\\n\\nwhere\\n\\n F: Write + Seek + 'a,\\n\\n{\\n\\n file: &'a mut F,\\n\\n index: Vec<Vec<IndexEntry>>,\\n\\n}\\n\\n\\n\\nimpl<'a, F> Writer<'a, F>\\n\\nwhere\\n\\n F: Write + Seek + 'a,\\n\\n{\\n\\n pub fn new(file: &'a mut F) -> Result<Writer<'a, F>> {\\n\\n file.seek(SeekFrom::Start(0))?;\\n\",\n \"file_path\": \"src/storage/cdb/cdb_rs/src/cdb/mod.rs\",\n \"rank\": 27,\n \"score\": 138821.5199208277\n },\n {\n \"content\": \"fn reverse_in_place<T>(mut slice: &mut [T]) {\\n\\n while slice.len() > 1 {\\n\\n let (first, rest) = slice.split_first_mut().unwrap();\\n\\n let (last, rest) = rest.split_last_mut().unwrap();\\n\\n slice = rest;\\n\\n\\n\\n std::mem::swap(first, last);\\n\\n }\\n\\n}\\n\\n\\n\\nmacro_rules! impl_unsigned {\\n\\n ( $( $ty:ident ),* ) => {\\n\\n $(\\n\\n impl HeaderValue for $ty {\\n\\n fn put<B: BufMut>(&self, buf: &mut B) -> Result<(), OutOfBufferError> {\\n\\n let mut digits = ArrayVec::<[u8; base10_digits::<$ty>(false)]>::new();\\n\\n let mut value = *self;\\n\\n\\n\\n if value == 0 {\\n\\n digits.push(b'0');\\n\",\n \"file_path\": \"src/rust-util/httpencode/src/traits.rs\",\n \"rank\": 28,\n \"score\": 138405.05606643154\n },\n {\n \"content\": \"// Write out a string and percent-escape any invalid characters within.\\n\\nfn write_percent_escaped<B, F>(buf: &mut B, path: &[u8], is_valid: F) -> Result<()>\\n\\nwhere\\n\\n B: BufMut,\\n\\n F: Fn(u8) -> bool,\\n\\n{\\n\\n fn next_invalid<F: Fn(u8) -> bool>(bytes: &[u8], is_valid: &F) -> Option<(usize, u8)> {\\n\\n for i in 0..bytes.len() {\\n\\n let b = unsafe { *bytes.get_unchecked(i) };\\n\\n\\n\\n if !is_valid(b) {\\n\\n return Some((i, b));\\n\\n }\\n\\n }\\n\\n\\n\\n None\\n\\n }\\n\\n\\n\\n fn hex_encode(byte: u8) -> u8 {\\n\\n let byte = byte & 0xF;\\n\\n match byte {\\n\",\n \"file_path\": \"src/rust-util/httpencode/src/util.rs\",\n \"rank\": 29,\n \"score\": 136824.2387126423\n },\n {\n \"content\": \"/// Logs GET or GETS\\n\\nfn klog_get(command: &MemcacheCommand, key: &[u8], response_len: usize) {\\n\\n if response_len == 0 {\\n\\n klog!(\\\"\\\\\\\"{} {}\\\\\\\" 0 {}\\\", command, string_key(Ok(key)), response_len);\\n\\n } else {\\n\\n klog!(\\\"\\\\\\\"{} {}\\\\\\\" 4 {}\\\", command, string_key(Ok(key)), response_len);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust/protocol/src/memcache/wire/response/mod.rs\",\n \"rank\": 30,\n \"score\": 136758.8596230761\n },\n {\n \"content\": \" proc_time_i next_expiration_sec;\\n\",\n \"file_path\": \"src/storage/seg/ttlbucket.h\",\n \"rank\": 31,\n \"score\": 135763.611083229\n },\n {\n \"content\": \"fn setup(opts: &mut Options, metrics: &mut Metrics) {\\n\\n use crate::memcached::sys::process_setup;\\n\\n use ccommon_sys::*;\\n\\n use pelikan_sys::{\\n\\n hotkey::hotkey_setup, protocol::memcache::*, storage::slab::*, time::time_setup,\\n\\n util::procinfo_setup,\\n\\n };\\n\\n use std::ptr::null_mut;\\n\\n\\n\\n unsafe {\\n\\n log_setup(&mut metrics.log);\\n\\n if debug_setup(&mut opts.debug) < 0 {\\n\\n panic!(\\\"debug log setup failed\\\");\\n\\n }\\n\\n\\n\\n // Setup top-level application options\\n\\n if opts.server.daemonize.value() {\\n\\n pelikan_sys::util::daemonize();\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/server/twemcache-http/src/main.rs\",\n \"rank\": 32,\n \"score\": 134658.94085273566\n },\n {\n \"content\": \"fn set(c: &mut Criterion) {\\n\\n let parser = MemcacheRequestParser::new(MAX_VALUE_SIZE, TimeType::Memcache);\\n\\n\\n\\n let mut group = c.benchmark_group(\\\"set\\\");\\n\\n group.measurement_time(Duration::from_secs(DURATION));\\n\\n group.throughput(Throughput::Elements(1));\\n\\n\\n\\n let mut buffer = Vec::new();\\n\\n buffer.extend_from_slice(b\\\"set 0 0 0 1\\\\r\\\\n1\\\\r\\\\n\\\");\\n\\n buffer.resize_with(BUFFER_SIZE, Default::default);\\n\\n\\n\\n group.bench_function(\\\"1b/1b\\\", |b| {\\n\\n b.iter(|| {\\n\\n let _ = parser.parse(&buffer);\\n\\n })\\n\\n });\\n\\n\\n\\n let mut buffer = Vec::new();\\n\\n buffer.extend_from_slice(b\\\"set 0 0 0 10\\\\r\\\\n0123456789\\\\r\\\\n\\\");\\n\\n buffer.resize_with(BUFFER_SIZE, Default::default);\\n\",\n \"file_path\": \"src/rust/protocol/benches/memcache.rs\",\n \"rank\": 33,\n \"score\": 133642.68979818147\n },\n {\n \"content\": \"fn get(c: &mut Criterion) {\\n\\n let parser = MemcacheRequestParser::new(MAX_VALUE_SIZE, TimeType::Memcache);\\n\\n\\n\\n let mut group = c.benchmark_group(\\\"get\\\");\\n\\n group.measurement_time(Duration::from_secs(DURATION));\\n\\n group.throughput(Throughput::Elements(1));\\n\\n\\n\\n let mut buffer = Vec::new();\\n\\n buffer.extend_from_slice(b\\\"get 0\\\\r\\\\n\\\");\\n\\n buffer.resize_with(BUFFER_SIZE, Default::default);\\n\\n\\n\\n group.bench_function(\\\"1b\\\", |b| {\\n\\n b.iter(|| {\\n\\n let _ = parser.parse(&buffer);\\n\\n })\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust/protocol/benches/memcache.rs\",\n \"rank\": 34,\n \"score\": 133642.68979818147\n },\n {\n \"content\": \"fn validate_key(key: &[u8]) {\\n\\n if key.is_empty() {\\n\\n panic!(\\\"key is zero-length\\\");\\n\\n }\\n\\n if key.len() > MAX_KEY_LEN {\\n\\n panic!(\\\"key is too long\\\");\\n\\n }\\n\\n if key.windows(1).any(|w| w == b\\\" \\\") {\\n\\n panic!(\\\"key contains SPACE: {:?}\\\", key);\\n\\n }\\n\\n if key.windows(2).any(|w| w == b\\\"\\\\r\\\\n\\\") {\\n\\n panic!(\\\"key contains CRLF: {:?}\\\", key);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/rust/protocol/fuzz/fuzz_targets/memcache.rs\",\n \"rank\": 35,\n \"score\": 132513.55084204755\n },\n {\n \"content\": \"#[test]\\n\\nfn expiration() {\\n\\n let segments = 64;\\n\\n let segment_size = 2 * 1024;\\n\\n let heap_size = segments * segment_size as usize;\\n\\n\\n\\n let mut cache = Seg::builder()\\n\\n .segment_size(segment_size)\\n\\n .heap_size(heap_size)\\n\\n .hash_power(16)\\n\\n .build();\\n\\n\\n\\n assert_eq!(cache.items(), 0);\\n\\n assert_eq!(cache.segments.free(), segments);\\n\\n\\n\\n assert!(cache\\n\\n .insert(b\\\"latte\\\", b\\\"\\\", None, Duration::from_secs(5))\\n\\n .is_ok());\\n\\n assert!(cache\\n\\n .insert(b\\\"espresso\\\", b\\\"\\\", None, Duration::from_secs(15))\\n\\n .is_ok());\\n\",\n \"file_path\": \"src/rust/storage/seg/src/tests.rs\",\n \"rank\": 36,\n \"score\": 129887.44349830484\n },\n {\n \"content\": \"fn order_ascii_lowercase(a: &[u8], b: &[u8]) -> std::cmp::Ordering {\\n\\n use std::cmp::Ordering;\\n\\n\\n\\n match a.len().cmp(&b.len()) {\\n\\n Ordering::Equal => (),\\n\\n x => return x,\\n\\n }\\n\\n\\n\\n for (a, b) in a.iter().zip(b.iter()) {\\n\\n let a = a.to_ascii_lowercase();\\n\\n let b = b.to_ascii_lowercase();\\n\\n\\n\\n match a.cmp(&b) {\\n\\n Ordering::Equal => (),\\n\\n x => return x,\\n\\n }\\n\\n }\\n\\n\\n\\n Ordering::Equal\\n\\n}\\n\",\n \"file_path\": \"src/server/twemcache-http/src/http.rs\",\n \"rank\": 37,\n \"score\": 129569.31851628289\n },\n {\n \"content\": \"struct EscapedByteString<'b>(&'b [u8]);\\n\\n\\n\\nimpl fmt::Display for EscapedByteString<'_> {\\n\\n fn fmt(&self, fmt: &mut fmt::Formatter) -> fmt::Result {\\n\\n let iter = self\\n\\n .0\\n\\n .iter()\\n\\n .cloned()\\n\\n .flat_map(|x| std::ascii::escape_default(x))\\n\\n .map(|x| x as char);\\n\\n\\n\\n fmt.write_str(\\\"\\\\\\\"\\\")?;\\n\\n for c in iter {\\n\\n fmt.write_fmt(format_args!(\\\"{}\\\", c))?;\\n\\n }\\n\\n fmt.write_str(\\\"\\\\\\\"\\\")?;\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"test/server/twemcache-http/src/lib.rs\",\n \"rank\": 38,\n \"score\": 128952.88048717414\n },\n {\n \"content\": \"fn get_benchmark(c: &mut Criterion) {\\n\\n // use the default config\\n\\n let config = SegcacheConfig::default();\\n\\n\\n\\n // launch the server\\n\\n let server = Segcache::new(config);\\n\\n\\n\\n // wait for server to startup. duration is chosen to be longer than we'd\\n\\n // expect startup to take in a slow ci environment.\\n\\n std::thread::sleep(Duration::from_secs(10));\\n\\n\\n\\n // connect and initialize an empty buffer\\n\\n let mut stream = TcpStream::connect(\\\"127.0.0.1:12321\\\").expect(\\\"failed to connect\\\");\\n\\n let mut buffer = vec![0; 1024 * 1024];\\n\\n\\n\\n // define a benchmarking group\\n\\n let mut group = c.benchmark_group(\\\"request\\\");\\n\\n group.throughput(Throughput::Elements(1));\\n\\n\\n\\n // benchmark for a few key lengths\\n\",\n \"file_path\": \"src/rust/server/segcache/benches/benchmark.rs\",\n \"rank\": 39,\n \"score\": 128490.9364147259\n },\n {\n \"content\": \"fn set_benchmark(c: &mut Criterion) {\\n\\n let ttl = Duration::ZERO;\\n\\n let mut group = c.benchmark_group(\\\"set\\\");\\n\\n group.measurement_time(Duration::from_secs(30));\\n\\n group.throughput(Throughput::Elements(1));\\n\\n\\n\\n for key_size in [1, 255].iter() {\\n\\n for value_size in [1, 64, 1024, 16384].iter() {\\n\\n let (keys, values) = key_values(*key_size, 1_000_000, *value_size, 10_000);\\n\\n\\n\\n // launch the server\\n\\n let mut cache = Seg::builder()\\n\\n .hash_power(16)\\n\\n .heap_size(64 * MB)\\n\\n .segment_size(MB as i32)\\n\\n .build();\\n\\n\\n\\n let mut key = 0;\\n\\n let mut value = 0;\\n\\n\\n\",\n \"file_path\": \"src/rust/storage/seg/benches/benchmark.rs\",\n \"rank\": 40,\n \"score\": 128490.9364147259\n },\n {\n \"content\": \"fn get_benchmark(c: &mut Criterion) {\\n\\n let mut group = c.benchmark_group(\\\"get\\\");\\n\\n group.measurement_time(Duration::from_secs(30));\\n\\n group.throughput(Throughput::Elements(1));\\n\\n\\n\\n for key_size in [1, 255].iter() {\\n\\n let (keys, _values) = key_values(*key_size, 1_000_000, 0, 0);\\n\\n\\n\\n // launch the server\\n\\n let mut cache = Seg::builder()\\n\\n .hash_power(16)\\n\\n .heap_size(64 * MB)\\n\\n .segment_size(MB as i32)\\n\\n .build();\\n\\n\\n\\n let mut key = 0;\\n\\n\\n\\n group.bench_function(&format!(\\\"{}b/0b\\\", key_size), |b| {\\n\\n b.iter(|| {\\n\\n cache.get(&keys[key]);\\n\\n key += 1;\\n\\n if key >= keys.len() {\\n\\n key = 0;\\n\\n }\\n\\n })\\n\\n });\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust/storage/seg/benches/benchmark.rs\",\n \"rank\": 41,\n \"score\": 128490.9364147259\n },\n {\n \"content\": \"fn ping_benchmark(c: &mut Criterion) {\\n\\n let config = PingserverConfig::default();\\n\\n\\n\\n // launch the server\\n\\n let server = Pingserver::new(config);\\n\\n\\n\\n // wait for server to startup. duration is chosen to be longer than we'd\\n\\n // expect startup to take in a slow ci environment.\\n\\n std::thread::sleep(Duration::from_secs(10));\\n\\n\\n\\n // connect and initialize an empty buffer\\n\\n let mut stream = TcpStream::connect(\\\"127.0.0.1:12321\\\").expect(\\\"failed to connect\\\");\\n\\n let mut buffer = vec![0; 1024 * 1024];\\n\\n\\n\\n // define a benchmarking group\\n\\n let mut group = c.benchmark_group(\\\"request\\\");\\n\\n group.throughput(Throughput::Elements(1));\\n\\n\\n\\n let msg = b\\\"ping\\\\r\\\\n\\\";\\n\\n let bench_name = \\\"ping\\\";\\n\",\n \"file_path\": \"src/rust/server/pingserver/benches/benchmark.rs\",\n \"rank\": 42,\n \"score\": 128490.9364147259\n },\n {\n \"content\": \"/// Given an AdminHandler and a DataProcessor start up a server\\n\\npub fn core_run_tcp<W, H>(\\n\\n admin_opts: &AdminOptions,\\n\\n server_opts: &ListenerOptions,\\n\\n metrics: &'static CoreMetrics,\\n\\n admin_handler: H,\\n\\n worker: W,\\n\\n) -> IOResult<()>\\n\\nwhere\\n\\n W: Worker + Unpin + 'static,\\n\\n H: AdminHandler + Send + 'static,\\n\\n{\\n\\n use tokio::sync::mpsc::channel;\\n\\n\\n\\n let admin_addr = admin_opts.addr().expect(\\\"Invalid socket address\\\");\\n\\n let server_addr = server_opts.addr().expect(\\\"Invalid socket address\\\");\\n\\n\\n\\n let dlog_intvl = admin_opts.dlog_intvl();\\n\\n\\n\\n let (send, recv) = channel(1024);\\n\\n\\n\",\n \"file_path\": \"src/rustcore/src/lib.rs\",\n \"rank\": 43,\n \"score\": 128428.29884310022\n },\n {\n \"content\": \"pub fn delete<B: BufMut>(buf: B, path: Uri) -> Result<HttpBuilder<B>> {\\n\\n HttpBuilder::request(buf, Method::Delete, Version::Http11, path)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust-util/httpencode/src/request.rs\",\n \"rank\": 44,\n \"score\": 126265.67839864697\n },\n {\n \"content\": \"pub fn options<B: BufMut>(buf: B, path: Uri) -> Result<HttpBuilder<B>> {\\n\\n HttpBuilder::request(buf, Method::Options, Version::Http11, path)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust-util/httpencode/src/request.rs\",\n \"rank\": 45,\n \"score\": 126265.67839864697\n },\n {\n \"content\": \"pub fn patch<B: BufMut>(buf: B, path: Uri) -> Result<HttpBuilder<B>> {\\n\\n HttpBuilder::request(buf, Method::Patch, Version::Http11, path)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust-util/httpencode/src/request.rs\",\n \"rank\": 46,\n \"score\": 126265.67839864697\n },\n {\n \"content\": \"pub fn put<B: BufMut>(buf: B, path: Uri) -> Result<HttpBuilder<B>> {\\n\\n HttpBuilder::request(buf, Method::Put, Version::Http11, path)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust-util/httpencode/src/request.rs\",\n \"rank\": 47,\n \"score\": 126265.67839864697\n },\n {\n \"content\": \"pub fn trace<B: BufMut>(buf: B, path: Uri) -> Result<HttpBuilder<B>> {\\n\\n HttpBuilder::request(buf, Method::Trace, Version::Http11, path)\\n\\n}\\n\",\n \"file_path\": \"src/rust-util/httpencode/src/request.rs\",\n \"rank\": 48,\n \"score\": 126265.67839864697\n },\n {\n \"content\": \"pub fn post<B: BufMut>(buf: B, path: Uri) -> Result<HttpBuilder<B>> {\\n\\n HttpBuilder::request(buf, Method::Post, Version::Http11, path)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust-util/httpencode/src/request.rs\",\n \"rank\": 49,\n \"score\": 126265.67839864697\n },\n {\n \"content\": \"pub fn get<B: BufMut>(buf: B, path: Uri) -> Result<HttpBuilder<B>> {\\n\\n HttpBuilder::request(buf, Method::Get, Version::Http11, path)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust-util/httpencode/src/request.rs\",\n \"rank\": 50,\n \"score\": 126265.67839864697\n },\n {\n \"content\": \"fn build_req_long(b: &mut Bencher) {\\n\\n let mut buf = Vec::new();\\n\\n buf.reserve(1 << 14);\\n\\n\\n\\n b.iter(|| -> Result<_, _> {\\n\\n buf.clear();\\n\\n\\n\\n let mut req = HttpBuilder::request(\\n\\n &mut buf,\\n\\n Method::Get,\\n\\n Version::Http11,\\n\\n Uri::new(b\\\"/wp-content/uploads/2010/03/hello-kitty-darth-vader-pink.jpg\\\")\\n\\n )?;\\n\\n\\n\\n req.header(\\\"Host\\\", \\\"www.kittyhell.com\\\")?;\\n\\n req.header(\\\"User-Agent\\\", \\\"Mozilla/5.0 (Macintosh; U; Intel Mac OS X 10.6; ja-JP-mac; rv:1.9.2.3) Gecko/20100401 Firefox/3.6.3 Pathtraq/0.9\\\")?;\\n\\n req.header(\\\"Accept\\\", \\\"text/html,application/xhtml+xml,application/xml;q=0.9,*/*;q=0.8\\\")?;\\n\\n req.header(\\\"Accept-Language\\\", \\\"ja,en-us;q=0.7,en;q=0.3\\\")?;\\n\\n req.header(\\\"Accept-Encoding\\\", \\\"gzip,deflate\\\")?;\\n\\n req.header(\\\"Accept-Charset\\\", \\\"Shift_JIS,utf-8;q=0.7,*;q=0.7\\\")?;\\n\\n req.header(\\\"Keep-Alive\\\", \\\"115\\\")?;\\n\\n req.header(\\\"Connection\\\", \\\"keep-alive\\\")?;\\n\\n req.header(\\\"Cookie\\\", \\\"wp_ozh_wsa_visits=2; wp_ozh_wsa_visit_lasttime=xxxxxxxxxx; __utma=xxxxxxxxx.xxxxxxxxxx.xxxxxxxxxx.xxxxxxxxxx.xxxxxxxxxx.x; __utmz=xxxxxxxxx.xxxxxxxxxx.x.x.utmccn=(referral)|utmcsr=reader.livedoor.com|utmcct=/reader/|utmcmd=referral|padding=under256\\\")?;\\n\\n\\n\\n req.finish().map(|_| ())\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust-util/httpencode/benches/compose.rs\",\n \"rank\": 51,\n \"score\": 126123.65286996013\n },\n {\n \"content\": \"fn build_req_short(b: &mut Bencher) {\\n\\n let mut buf = Vec::new();\\n\\n buf.reserve(1 << 14);\\n\\n\\n\\n b.iter(|| -> Result<_, _> {\\n\\n buf.clear();\\n\\n\\n\\n let mut req = HttpBuilder::request(&mut buf, Method::Get, Version::Http11, Uri::new(b\\\"/\\\"))?;\\n\\n\\n\\n req.header(\\\"Host\\\", \\\"example.com\\\")?;\\n\\n req.header(\\\"Cookie\\\", \\\"session=60; user_id=1\\\")?;\\n\\n\\n\\n req.finish().map(|_| ())\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust-util/httpencode/benches/compose.rs\",\n \"rank\": 52,\n \"score\": 126123.65286996013\n },\n {\n \"content\": \"/// An `EventLoop` describes the functions which must be implemented for a basic\\n\\n/// event loop and provides some default implementations and helper functions.\\n\\npub trait EventLoop {\\n\\n // the following functions must be implemented\\n\\n\\n\\n /// Provides access to the `Poll` structure which allows polling for new\\n\\n /// readiness events and managing registration for event sources.\\n\\n fn poll(&mut self) -> &mut Poll;\\n\\n\\n\\n /// Handle new data received for the `Session` with the provided `Token`.\\n\\n /// This will include parsing the incoming data and composing a response.\\n\\n fn handle_data(&mut self, token: Token) -> Result<(), std::io::Error>;\\n\\n\\n\\n /// Handle a read event for the `Session` with the `Token`.\\n\\n fn do_read(&mut self, token: Token) -> Result<(), ()> {\\n\\n if let Ok(session) = self.poll().get_mut_session(token) {\\n\\n // read from session to buffer\\n\\n match session.fill_buf().map(|b| b.len()) {\\n\\n Ok(0) => {\\n\\n trace!(\\\"hangup for session: {:?}\\\", session);\\n\\n let _ = self.poll().close_session(token);\\n\\n Err(())\\n\",\n \"file_path\": \"src/rust/core/server/src/threads/traits/event_loop.rs\",\n \"rank\": 53,\n \"score\": 125805.56643444154\n },\n {\n \"content\": \"fn escape(bytes: &[u8]) -> EscapedByteString {\\n\\n EscapedByteString(bytes)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"test/server/twemcache-http/src/lib.rs\",\n \"rank\": 54,\n \"score\": 123881.24869189886\n },\n {\n \"content\": \"fn build_req_long_unsafe(b: &mut Bencher) {\\n\\n let mut buf = Vec::new();\\n\\n buf.reserve(1 << 14);\\n\\n\\n\\n b.iter(|| -> Result<_, _> {\\n\\n unsafe {\\n\\n buf.clear();\\n\\n\\n\\n let mut req = HttpBuilder::request(\\n\\n &mut buf,\\n\\n Method::Get,\\n\\n Version::Http11,\\n\\n Uri::escaped_unchecked(b\\\"/wp-content/uploads/2010/03/hello-kitty-darth-vader-pink.jpg\\\")\\n\\n )?;\\n\\n\\n\\n req.header_unchecked(\\\"Host\\\", \\\"www.kittyhell.com\\\")?;\\n\\n req.header_unchecked(\\\"User-Agent\\\", \\\"Mozilla/5.0 (Macintosh; U; Intel Mac OS X 10.6; ja-JP-mac; rv:1.9.2.3) Gecko/20100401 Firefox/3.6.3 Pathtraq/0.9\\\")?;\\n\\n req.header_unchecked(\\\"Accept\\\", \\\"text/html,application/xhtml+xml,application/xml;q=0.9,*/*;q=0.8\\\")?;\\n\\n req.header_unchecked(\\\"Accept-Language\\\", \\\"ja,en-us;q=0.7,en;q=0.3\\\")?;\\n\\n req.header_unchecked(\\\"Accept-Encoding\\\", \\\"gzip,deflate\\\")?;\\n\\n req.header_unchecked(\\\"Accept-Charset\\\", \\\"Shift_JIS,utf-8;q=0.7,*;q=0.7\\\")?;\\n\\n req.header_unchecked(\\\"Keep-Alive\\\", \\\"115\\\")?;\\n\\n req.header_unchecked(\\\"Connection\\\", \\\"keep-alive\\\")?;\\n\\n req.header_unchecked(\\\"Cookie\\\", \\\"wp_ozh_wsa_visits=2; wp_ozh_wsa_visit_lasttime=xxxxxxxxxx; __utma=xxxxxxxxx.xxxxxxxxxx.xxxxxxxxxx.xxxxxxxxxx.xxxxxxxxxx.x; __utmz=xxxxxxxxx.xxxxxxxxxx.x.x.utmccn=(referral)|utmcsr=reader.livedoor.com|utmcct=/reader/|utmcmd=referral|padding=under256\\\")?;\\n\\n\\n\\n req.finish().map(|_| ())\\n\\n }\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust-util/httpencode/benches/compose.rs\",\n \"rank\": 55,\n \"score\": 123880.81116875951\n },\n {\n \"content\": \"fn build_req_short_unsafe(b: &mut Bencher) {\\n\\n let mut buf = Vec::new();\\n\\n buf.reserve(1 << 14);\\n\\n\\n\\n b.iter(|| -> Result<_, _> {\\n\\n unsafe {\\n\\n buf.clear();\\n\\n\\n\\n let mut req = HttpBuilder::request(\\n\\n &mut buf,\\n\\n Method::Get,\\n\\n Version::Http11,\\n\\n Uri::escaped_unchecked(b\\\"/\\\"),\\n\\n )?;\\n\\n\\n\\n req.header_unchecked(\\\"Host\\\", \\\"example.com\\\")?;\\n\\n req.header_unchecked(\\\"Cookie\\\", \\\"session=60; user_id=1\\\")?;\\n\\n\\n\\n req.finish().map(|_| ())\\n\\n }\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust-util/httpencode/benches/compose.rs\",\n \"rank\": 56,\n \"score\": 123880.81116875951\n },\n {\n \"content\": \"/// Creats a new queue pair that can hold up to capacity items in each\\n\\n/// direction. The optional `Waker`s allow the sender to inform the receiver\\n\\n/// that a receive operation should return at least one message.\\n\\npub fn queue_pair_with_capacity<A, B>(\\n\\n capacity: usize,\\n\\n waker_a: Option<Arc<Waker>>,\\n\\n waker_b: Option<Arc<Waker>>,\\n\\n) -> (QueuePair<A, B>, QueuePair<B, A>) {\\n\\n let (to_a, from_b) = rtrb::RingBuffer::new(capacity).split();\\n\\n let (to_b, from_a) = rtrb::RingBuffer::new(capacity).split();\\n\\n\\n\\n let queue_a = QueuePair::<A, B> {\\n\\n send: to_b,\\n\\n recv: from_b,\\n\\n waker: waker_b,\\n\\n };\\n\\n\\n\\n let queue_b = QueuePair::<B, A> {\\n\\n send: to_a,\\n\\n recv: from_a,\\n\\n waker: waker_a,\\n\\n };\\n\\n\\n\",\n \"file_path\": \"src/rust/queues/src/queue_pair/mod.rs\",\n \"rank\": 57,\n \"score\": 123823.76848196925\n },\n {\n \"content\": \"fn interval() -> usize {\\n\\n INTERVAL\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust/config/src/klog.rs\",\n \"rank\": 58,\n \"score\": 123501.32679461688\n },\n {\n \"content\": \"fn sample() -> usize {\\n\\n SAMPLE\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust/config/src/klog.rs\",\n \"rank\": 59,\n \"score\": 123501.32679461688\n },\n {\n \"content\": \"fn poolsize() -> usize {\\n\\n BUF_POOLSIZE\\n\\n}\\n\\n\\n\\n// struct definitions\\n\\n#[derive(Serialize, Deserialize, Debug)]\\n\\npub struct Buf {\\n\\n #[serde(default = \\\"size\\\")]\\n\\n size: usize,\\n\\n #[serde(default = \\\"poolsize\\\")]\\n\\n poolsize: usize,\\n\\n}\\n\\n\\n\\n// implementation\\n\\nimpl Buf {\\n\\n pub fn size(&self) -> usize {\\n\\n self.size\\n\\n }\\n\\n\\n\\n pub fn poolsize(&self) -> usize {\\n\",\n \"file_path\": \"src/rust/config/src/buf.rs\",\n \"rank\": 60,\n \"score\": 123501.32679461688\n },\n {\n \"content\": \"fn nevent() -> usize {\\n\\n WORKER_NEVENT\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust/config/src/worker.rs\",\n \"rank\": 61,\n \"score\": 123501.32679461688\n },\n {\n \"content\": \"fn nevent() -> usize {\\n\\n ADMIN_NEVENT\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust/config/src/admin.rs\",\n \"rank\": 62,\n \"score\": 123501.32679461688\n },\n {\n \"content\": \"fn nevent() -> usize {\\n\\n SERVER_NEVENT\\n\\n}\\n\\n\\n\\n// definitions\\n\\n#[derive(Serialize, Deserialize, Debug)]\\n\\npub struct Server {\\n\\n #[serde(default = \\\"host\\\")]\\n\\n host: String,\\n\\n #[serde(default = \\\"port\\\")]\\n\\n port: String,\\n\\n #[serde(default = \\\"timeout\\\")]\\n\\n timeout: usize,\\n\\n #[serde(default = \\\"nevent\\\")]\\n\\n nevent: usize,\\n\\n}\\n\\n\\n\\n// implementation\\n\\nimpl Server {\\n\\n /// Host address to listen on\\n\",\n \"file_path\": \"src/rust/config/src/server.rs\",\n \"rank\": 63,\n \"score\": 123501.32679461688\n },\n {\n \"content\": \"// helper functions\\n\\nfn size() -> usize {\\n\\n BUF_DEFAULT_SIZE\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust/config/src/buf.rs\",\n \"rank\": 64,\n \"score\": 123501.32679461688\n },\n {\n \"content\": \"// helper functions\\n\\nfn backlog() -> usize {\\n\\n TCP_BACKLOG\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust/config/src/tcp.rs\",\n \"rank\": 65,\n \"score\": 123501.32679461688\n },\n {\n \"content\": \"fn poolsize() -> usize {\\n\\n TCP_POOLSIZE\\n\\n}\\n\\n\\n\\n// definitions\\n\\n#[derive(Serialize, Deserialize, Debug)]\\n\\npub struct Tcp {\\n\\n #[serde(default = \\\"backlog\\\")]\\n\\n backlog: usize,\\n\\n #[serde(default = \\\"poolsize\\\")]\\n\\n poolsize: usize,\\n\\n}\\n\\n\\n\\n// implementation\\n\\nimpl Tcp {\\n\\n pub fn backlog(&self) -> usize {\\n\\n self.backlog\\n\\n }\\n\\n\\n\\n pub fn poolsize(&self) -> usize {\\n\",\n \"file_path\": \"src/rust/config/src/tcp.rs\",\n \"rank\": 66,\n \"score\": 123501.32679461688\n },\n {\n \"content\": \"fn timeout() -> usize {\\n\\n ADMIN_TIMEOUT\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust/config/src/admin.rs\",\n \"rank\": 67,\n \"score\": 123501.32679461688\n },\n {\n \"content\": \"fn timeout() -> usize {\\n\\n SERVER_TIMEOUT\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust/config/src/server.rs\",\n \"rank\": 68,\n \"score\": 123501.32679461688\n },\n {\n \"content\": \"fn threads() -> usize {\\n\\n WORKER_THREADS\\n\\n}\\n\\n\\n\\n// definitions\\n\\n#[derive(Serialize, Deserialize, Debug)]\\n\\npub struct Worker {\\n\\n #[serde(default = \\\"timeout\\\")]\\n\\n timeout: usize,\\n\\n #[serde(default = \\\"nevent\\\")]\\n\\n nevent: usize,\\n\\n #[serde(default = \\\"threads\\\")]\\n\\n threads: usize,\\n\\n}\\n\\n\\n\\n// implementation\\n\\nimpl Worker {\\n\\n pub fn timeout(&self) -> usize {\\n\\n self.timeout\\n\\n }\\n\",\n \"file_path\": \"src/rust/config/src/worker.rs\",\n \"rank\": 69,\n \"score\": 123501.32679461688\n },\n {\n \"content\": \"// helper functions\\n\\nfn timeout() -> usize {\\n\\n WORKER_TIMEOUT\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust/config/src/worker.rs\",\n \"rank\": 70,\n \"score\": 123501.32679461688\n },\n {\n \"content\": \"fn print_directives(lib: impl AsRef<str>, subdir: impl AsRef<str>) {\\n\\n let lib: &str = lib.as_ref();\\n\\n let subdir: &str = subdir.as_ref();\\n\\n let bindir = get_cmake_binary_dir().unwrap_or(format!(\\\"{}/build\\\", env::var(\\\"OUT_DIR\\\").unwrap()));\\n\\n\\n\\n println!(\\\"cargo:rustc-link-search={}/{}/\\\", bindir, subdir);\\n\\n println!(\\\"cargo:rustc-link-lib={}\\\", lib);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust-util/pelikan-sys/build.rs\",\n \"rank\": 71,\n \"score\": 123297.46496197395\n },\n {\n \"content\": \"/// Parse a key-value pair separated by `:` then strip the whitespace\\n\\n/// off of both the key and the value.\\n\\nfn parse_kv<'a>(input: &'a [u8], line: u32) -> Result<(&'a [u8], &'a [u8]), ParseError<'a>> {\\n\\n let mut first = true;\\n\\n\\n\\n let mut split = input.split(|&x| {\\n\\n if x == b':' && first {\\n\\n first = false;\\n\\n return true;\\n\\n }\\n\\n\\n\\n false\\n\\n });\\n\\n\\n\\n let key = match split.next() {\\n\\n Some(x) => x,\\n\\n // There will always be at least one subslice\\n\\n None => unreachable!(),\\n\\n };\\n\\n let value = match split.next() {\\n\\n Some(x) => x,\\n\\n None => return Err(ParseError::missing_colon(Span::new(input, line))),\\n\",\n \"file_path\": \"deps/ccommon/rust/ccommon-backend/src/option/parse.rs\",\n \"rank\": 72,\n \"score\": 123135.18378034768\n },\n {\n \"content\": \"#[test]\\n\\nfn bucket_index() {\\n\\n let ttl_buckets = TtlBuckets::new();\\n\\n\\n\\n // Zero TTL and max duration both go into the same TtlBucket\\n\\n assert_eq!(ttl_buckets.get_bucket_index(Duration::from_secs(0)), 1023);\\n\\n assert_eq!(\\n\\n ttl_buckets.get_bucket_index(Duration::from_secs(u32::MAX)),\\n\\n 1023\\n\\n );\\n\\n\\n\\n // first bucket is only 7s wide because 0 is no ttl\\n\\n assert_eq!(ttl_buckets.get_bucket_index(Duration::from_secs(1)), 0);\\n\\n assert_eq!(ttl_buckets.get_bucket_index(Duration::from_secs(7)), 0);\\n\\n\\n\\n // buckets from 8s - 2048s (0..34 minutes) are all 8s wide\\n\\n for bucket in 1..256 {\\n\\n let start = Duration::from_secs(8 * bucket);\\n\\n let end = Duration::from_secs(8 * bucket + 7);\\n\\n assert_eq!(\\n\\n ttl_buckets.get_bucket_index(start) as u32,\\n\",\n \"file_path\": \"src/rust/storage/seg/src/ttl_buckets/tests.rs\",\n \"rank\": 73,\n \"score\": 121871.4607781822\n },\n {\n \"content\": \"/// Validate a key name.\\n\\n///\\n\\n/// A valid key can only contain characters in `[a-zA-Z0-9_]`.\\n\\nfn is_valid_name(key: &[u8]) -> bool {\\n\\n key.iter()\\n\\n .copied()\\n\\n .all(|x: u8| x.is_ascii_alphanumeric() || x == b'_')\\n\\n}\\n\\n\\n\",\n \"file_path\": \"deps/ccommon/rust/ccommon-backend/src/option/parse.rs\",\n \"rank\": 74,\n \"score\": 121753.19326651416\n },\n {\n \"content\": \"fn escape_string(bytes: &[u8]) -> String {\\n\\n bytes\\n\\n .iter()\\n\\n .flat_map(|x| std::ascii::escape_default(*x))\\n\\n .map(|c| c as char)\\n\\n .collect()\\n\\n}\\n\\n\\n\\nimpl fmt::Debug for Value<'_> {\\n\\n fn fmt(&self, fmt: &mut fmt::Formatter) -> fmt::Result {\\n\\n match self {\\n\\n Value::Bool(v) => fmt.debug_tuple(\\\"Bool\\\").field(v).finish(),\\n\\n Value::Float(v) => fmt.debug_tuple(\\\"Float\\\").field(v).finish(),\\n\\n Value::UInt(v) => fmt.debug_tuple(\\\"UInt\\\").field(v).finish(),\\n\\n Value::Str(s) => {\\n\\n let escaped = &escape_string(s);\\n\\n fmt.debug_tuple(\\\"Str\\\").field(escaped).finish()\\n\\n }\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"deps/ccommon/rust/ccommon-backend/src/option/parse.rs\",\n \"rank\": 75,\n \"score\": 121753.19326651416\n },\n {\n \"content\": \"struct KVSizes(usize, usize);\\n\\n\\n\\nconst PLUS: u8 = 0x2b; // ASCII '+'\\n\\nconst COMMA: u8 = 0x2c; // ASCII ','\\n\\nconst COLON: u8 = 0x3a; // ASCII ':'\\n\\nconst NL: u8 = 0x0a; // ASCII '\\\\n'\\n\\n\\n\",\n \"file_path\": \"src/storage/cdb/cdb_rs/src/cdb/input.rs\",\n \"rank\": 76,\n \"score\": 121445.82509719816\n },\n {\n \"content\": \"fn escaped(bytes: &[u8]) -> Cow<str> {\\n\\n if bytes.iter().copied().all(|c| c.is_ascii()) {\\n\\n Cow::Borrowed(std::str::from_utf8(bytes).unwrap())\\n\\n } else {\\n\\n let string = bytes\\n\\n .iter()\\n\\n .copied()\\n\\n .flat_map(std::ascii::escape_default)\\n\\n .map(|c| c as char)\\n\\n .collect();\\n\\n\\n\\n Cow::Owned(string)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust-util/httpencode/src/tests.rs\",\n \"rank\": 77,\n \"score\": 121259.04813092665\n },\n {\n \"content\": \"fn use_tls() -> bool {\\n\\n ADMIN_USE_TLS\\n\\n}\\n\\n\\n\\n// definitions\\n\\n#[derive(Serialize, Deserialize, Debug)]\\n\\npub struct Admin {\\n\\n #[serde(default = \\\"host\\\")]\\n\\n host: String,\\n\\n #[serde(default = \\\"port\\\")]\\n\\n port: String,\\n\\n #[serde(default = \\\"timeout\\\")]\\n\\n timeout: usize,\\n\\n #[serde(default = \\\"nevent\\\")]\\n\\n nevent: usize,\\n\\n #[serde(default = \\\"tw_tick\\\")]\\n\\n tw_tick: usize,\\n\\n #[serde(default = \\\"tw_cap\\\")]\\n\\n tw_cap: usize,\\n\\n #[serde(default = \\\"tw_ntick\\\")]\\n\",\n \"file_path\": \"src/rust/config/src/admin.rs\",\n \"rank\": 78,\n \"score\": 120736.19815501932\n },\n {\n \"content\": \"fn heap_size() -> usize {\\n\\n HEAP_SIZE\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust/config/src/seg.rs\",\n \"rank\": 79,\n \"score\": 120691.9207839444\n },\n {\n \"content\": \"fn nbuf() -> usize {\\n\\n STATS_LOG_NBUF\\n\\n}\\n\\n\\n\\n// definitions\\n\\n#[derive(Serialize, Deserialize, Debug)]\\n\\npub struct StatsLog {\\n\\n #[serde(default = \\\"file\\\")]\\n\\n file: Option<String>,\\n\\n #[serde(default = \\\"nbuf\\\")]\\n\\n nbuf: usize,\\n\\n}\\n\\n\\n\\n// implementation\\n\\nimpl StatsLog {\\n\\n pub fn log_file(&self) -> Option<String> {\\n\\n self.file.clone()\\n\\n }\\n\\n\\n\\n pub fn log_nbuf(&self) -> usize {\\n\\n self.nbuf\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust/config/src/stats_log.rs\",\n \"rank\": 80,\n \"score\": 120691.9207839444\n },\n {\n \"content\": \"fn queue_depth() -> usize {\\n\\n QUEUE_DEPTH\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust/config/src/klog.rs\",\n \"rank\": 81,\n \"score\": 120691.9207839444\n },\n {\n \"content\": \"// helper functions\\n\\nfn nelem_delta() -> usize {\\n\\n NELEM_DELTA\\n\\n}\\n\\n\\n\\n// definitions\\n\\n#[derive(Serialize, Deserialize, Debug)]\\n\\npub struct Array {\\n\\n #[serde(default = \\\"nelem_delta\\\")]\\n\\n nelem_delta: usize,\\n\\n}\\n\\n\\n\\n// implementation\\n\\nimpl Array {\\n\\n pub fn nelem_delta(&self) -> usize {\\n\\n self.nelem_delta\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust/config/src/array.rs\",\n \"rank\": 82,\n \"score\": 120691.9207839444\n },\n {\n \"content\": \"fn compact_target() -> usize {\\n\\n COMPACT_TARGET\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust/config/src/seg.rs\",\n \"rank\": 83,\n \"score\": 120691.9207839444\n },\n {\n \"content\": \"fn tw_ntick() -> usize {\\n\\n ADMIN_TW_NTICK\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust/config/src/admin.rs\",\n \"rank\": 84,\n \"score\": 120691.9207839444\n },\n {\n \"content\": \"fn tw_tick() -> usize {\\n\\n ADMIN_TW_TICK\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust/config/src/admin.rs\",\n \"rank\": 85,\n \"score\": 120691.9207839444\n },\n {\n \"content\": \"fn dlog_interval() -> usize {\\n\\n DLOG_INTERVAL\\n\\n}\\n\\n\\n\\n// struct definitions\\n\\n#[derive(Serialize, Deserialize, Debug)]\\n\\npub struct PingserverConfig {\\n\\n // top-level\\n\\n #[serde(default = \\\"daemonize\\\")]\\n\\n daemonize: bool,\\n\\n #[serde(default = \\\"pid_filename\\\")]\\n\\n pid_filename: Option<String>,\\n\\n #[serde(default = \\\"dlog_interval\\\")]\\n\\n dlog_interval: usize,\\n\\n\\n\\n // application modules\\n\\n #[serde(default)]\\n\\n admin: Admin,\\n\\n #[serde(default)]\\n\\n server: Server,\\n\",\n \"file_path\": \"src/rust/config/src/pingserver.rs\",\n \"rank\": 86,\n \"score\": 120691.9207839444\n },\n {\n \"content\": \"fn tw_cap() -> usize {\\n\\n ADMIN_TW_CAP\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust/config/src/admin.rs\",\n \"rank\": 87,\n \"score\": 120691.9207839444\n },\n {\n \"content\": \"// helper functions\\n\\nfn max_power() -> usize {\\n\\n DBUF_DEFAULT_MAX\\n\\n}\\n\\n\\n\\n// struct definitions\\n\\n#[derive(Serialize, Deserialize, Debug)]\\n\\npub struct Dbuf {\\n\\n #[serde(default = \\\"max_power\\\")]\\n\\n max_power: usize,\\n\\n}\\n\\n\\n\\n// implementation\\n\\nimpl Dbuf {\\n\\n pub fn max_power(&self) -> usize {\\n\\n self.max_power\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust/config/src/dbuf.rs\",\n \"rank\": 88,\n \"score\": 120691.9207839444\n },\n {\n \"content\": \"fn dlog_interval() -> usize {\\n\\n DLOG_INTERVAL\\n\\n}\\n\\n\\n\\n// struct definitions\\n\\n#[derive(Serialize, Deserialize, Debug)]\\n\\npub struct SegcacheConfig {\\n\\n // top-level\\n\\n #[serde(default = \\\"daemonize\\\")]\\n\\n daemonize: bool,\\n\\n #[serde(default = \\\"pid_filename\\\")]\\n\\n pid_filename: Option<String>,\\n\\n #[serde(default = \\\"dlog_interval\\\")]\\n\\n dlog_interval: usize,\\n\\n\\n\\n // application modules\\n\\n #[serde(default)]\\n\\n admin: Admin,\\n\\n #[serde(default)]\\n\\n server: Server,\\n\",\n \"file_path\": \"src/rust/config/src/segcache.rs\",\n \"rank\": 89,\n \"score\": 120691.9207839444\n },\n {\n \"content\": \"fn merge_target() -> usize {\\n\\n MERGE_TARGET\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust/config/src/seg.rs\",\n \"rank\": 90,\n \"score\": 120691.9207839444\n },\n {\n \"content\": \"fn merge_max() -> usize {\\n\\n MERGE_MAX\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust/config/src/seg.rs\",\n \"rank\": 91,\n \"score\": 120691.9207839444\n },\n {\n \"content\": \"/// Load options from a type which implements `BufRead`.\\n\\n///\\n\\n/// In most cases you'll want to use [`OptionExt::load`][0]\\n\\n/// instead.\\n\\n///\\n\\n/// [0]: crate::option::OptionExt::load\\n\\npub fn option_load<R: BufRead>(\\n\\n options: &mut [option],\\n\\n source: &mut R,\\n\\n) -> Result<(), ParseError<'static>> {\\n\\n let mut linebuf = Vec::new();\\n\\n\\n\\n let mut lineno = 0;\\n\\n\\n\\n while source\\n\\n .read_until(b'\\\\n', &mut linebuf)\\n\\n .map_err(ParseError::ioerror)?\\n\\n != 0\\n\\n {\\n\\n // Strip off any comments before doing parsing\\n\\n let line = linebuf.split(|&x| x == b'#').next().unwrap();\\n\\n\\n\\n if line.iter().copied().all(|x| x.is_ascii_whitespace()) {\\n\\n linebuf.clear();\\n\\n continue;\\n\\n }\\n\",\n \"file_path\": \"deps/ccommon/rust/ccommon-backend/src/option/parse.rs\",\n \"rank\": 92,\n \"score\": 119679.65903465006\n },\n {\n \"content\": \"/// Initialize the logger. It will automatically use the\\n\\n/// ccommon debug logger once that is set up.\\n\\npub fn init() -> Result<(), SetLoggerError> {\\n\\n use log::LevelFilter;\\n\\n\\n\\n // TODO: dynamically set this based on dlog?\\n\\n log::set_max_level(LevelFilter::Trace);\\n\\n\\n\\n log::set_logger(&LOGGER)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"deps/ccommon/rust/ccommon-rs/src/log/shim.rs\",\n \"rank\": 93,\n \"score\": 119676.48728591808\n },\n {\n \"content\": \"fn is_space(c: Option<u8>) -> bool {\\n\\n c.map(|x| x.is_ascii_whitespace()).unwrap_or(false)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"deps/ccommon/rust/ccommon-backend/src/option/parse.rs\",\n \"rank\": 94,\n \"score\": 119016.10682881856\n },\n {\n \"content\": \"#[proc_macro]\\n\\npub fn to_lowercase(input: TokenStream) -> TokenStream {\\n\\n let ident = syn::parse_macro_input!(input as Ident);\\n\\n let name = ident.to_string().to_ascii_lowercase();\\n\\n let literal = syn::LitStr::new(&name, ident.span());\\n\\n let tokens = quote! { #literal };\\n\\n\\n\\n tokens.into()\\n\\n}\\n\",\n \"file_path\": \"src/rust/macros/src/lib.rs\",\n \"rank\": 95,\n \"score\": 118957.89903571687\n },\n {\n \"content\": \"fn nbuf() -> usize {\\n\\n STATS_LOG_NBUF\\n\\n}\\n\\n\\n\\n// definitions\\n\\n#[derive(Debug)]\\n\\n#[cfg_attr(feature = \\\"serde\\\", derive(Serialize, Deserialize))]\\n\\npub struct StatsLogConfig {\\n\\n\\t#[cfg_attr(feature = \\\"serde\\\", serde(default = \\\"file\\\"))]\\n\\n file: Option<String>,\\n\\n #[cfg_attr(feature = \\\"serde\\\", serde(default = \\\"nbuf\\\"))]\\n\\n nbuf: usize,\\n\\n}\\n\\n\\n\\n// implementation\\n\\nimpl StatsLogConfig {\\n\\n pub fn log_file(&self) -> Option<String> {\\n\\n self.file.clone()\\n\\n }\\n\\n\\n\",\n \"file_path\": \"deps/ccommon/rust/ccommon-stats/src/lib.rs\",\n \"rank\": 96,\n \"score\": 118042.839606728\n },\n {\n \"content\": \"fn single_message_size() -> usize {\\n\\n SINGLE_MESSAGE_SIZE\\n\\n}\\n\\n\\n\\n////////////////////////////////////////////////////////////////////////////////\\n\\n// struct definitions\\n\\n////////////////////////////////////////////////////////////////////////////////\\n\\n\\n\\n#[derive(Serialize, Deserialize, Debug, Clone)]\\n\\npub struct Klog {\\n\\n #[serde(default = \\\"backup\\\")]\\n\\n backup: Option<String>,\\n\\n #[serde(default = \\\"file\\\")]\\n\\n file: Option<String>,\\n\\n #[serde(default = \\\"interval\\\")]\\n\\n interval: usize,\\n\\n #[serde(default = \\\"max_size\\\")]\\n\\n max_size: u64,\\n\\n #[serde(default = \\\"queue_depth\\\")]\\n\\n queue_depth: usize,\\n\",\n \"file_path\": \"src/rust/config/src/klog.rs\",\n \"rank\": 97,\n \"score\": 118042.839606728\n },\n {\n \"content\": \"// helper functions\\n\\nfn buf_sock_poolsize() -> usize {\\n\\n BUFSOCK_POOLSIZE\\n\\n}\\n\\n\\n\\n// definitions\\n\\n#[derive(Serialize, Deserialize, Debug)]\\n\\npub struct Sockio {\\n\\n #[serde(default = \\\"buf_sock_poolsize\\\")]\\n\\n buf_sock_poolsize: usize,\\n\\n}\\n\\n\\n\\n// implementation\\n\\nimpl Sockio {\\n\\n pub fn buf_sock_poolsize(&self) -> usize {\\n\\n self.buf_sock_poolsize\\n\\n }\\n\\n}\\n\\n\\n\\n// trait implementations\\n\\nimpl Default for Sockio {\\n\\n fn default() -> Self {\\n\\n Self {\\n\\n buf_sock_poolsize: buf_sock_poolsize(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust/config/src/sockio.rs\",\n \"rank\": 98,\n \"score\": 118042.839606728\n },\n {\n \"content\": \"fn log_queue_depth() -> usize {\\n\\n LOG_QUEUE_DEPTH\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/rust/config/src/debug.rs\",\n \"rank\": 99,\n \"score\": 118042.839606728\n }\n]","isConversational":false}}},{"rowIdx":1390,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"oxide-7/src/video/mod.rs"},"repo_name":{"kind":"string","value":"coopersimon/oxide-7"},"commit":{"kind":"string","value":"538a2946fc32eef922749dcfe86490c1f09ca12e"},"file_code":{"kind":"string","value":"\n\nmod ram;\nmod render;\n\nuse std::sync::{\n Arc,\n Mutex\n};\n\nuse bitflags::bitflags;\n\nuse crate::{\n common::Interrupt,\n constants::{\n timing,\n screen\n },\n};\n\nuse ram::VideoMem;\npub use render::RenderTarget;\n\ntype VRamRef = Arc<Mutex<VideoMem>>;\n\nbitflags! {\n #[derive(Default)]\n struct IntEnable: u8 {\n const ENABLE_NMI = bit!(7);\n const ENABLE_IRQ_Y = bit!(5);\n const ENABLE_IRQ_X = bit!(4);\n const AUTO_JOYPAD = bit!(0);\n }\n}\n\nimpl IntEnable {\n fn all_irq() -> IntEnable {\n IntEnable::ENABLE_IRQ_X | IntEnable::ENABLE_IRQ_Y\n }\n}\n\nbitflags! {\n #[derive(Default)]\n struct PPUStatus: u8 {\n const V_BLANK = bit!(7);\n const H_BLANK = bit!(6);\n }\n}\n\n#[derive(PartialEq)]\npub enum PPUSignal {\n None, \n Int(Interrupt), \n \n \n \n HBlank, \n Delay, \n FrameStart, \n}\n\n#[derive(Debug, PartialEq)]\nenum PPUState {\n HBlankLeft, \n DrawingBeforePause, \n DrawingAfterPause, \n HBlankRight, \n VBlank \n}\n\n#[derive(Clone, Copy)]\npub enum BG {\n _1,\n _2,\n _3,\n _4\n}\n\nimpl BG {\n fn all() -> &'static [BG; 4] {\n const BGS: [BG; 4] = [BG::_1, BG::_2, BG::_3, BG::_4];\n &BGS\n }\n}\n\npub struct PPU {\n state: PPUState,\n\n mem: VRamRef,\n\n cycle_count: usize, \n scanline: usize, \n\n int_enable: IntEnable,\n status: PPUStatus,\n nmi_flag: u8, \n irq_flag: u8, \n h_timer: u16, \n h_cycle: usize, \n v_timer: u16, \n h_irq_latch: bool, \n\n renderer: render::RenderThread,\n}\n\nimpl PPU {\n pub fn new() -> Self {\n let mem = Arc::new(Mutex::new(VideoMem::new()));\n\n PPU {\n state: PPUState::VBlank,\n mem: mem.clone(),\n\n cycle_count: 0,\n scanline: 0,\n\n int_enable: IntEnable::default(),\n status: PPUStatus::default(),\n nmi_flag: 0,\n irq_flag: 0,\n h_timer: 0,\n h_cycle: 0,\n v_timer: 0,\n h_irq_latch: false,\n\n renderer: render::RenderThread::new(mem),\n }\n }\n\n pub fn start_frame(&mut self, frame: RenderTarget) {\n self.renderer.start_frame(frame);\n }\n\n \n pub fn read_mem(&mut self, addr: u8) -> u8 {\n self.mem.lock().unwrap().read(addr)\n }\n\n pub fn write_mem(&mut self, addr: u8, data: u8) {\n self.mem.lock().unwrap().write(addr, data);\n }\n\n \n pub fn get_status(&mut self) -> u8 {\n self.status.bits()\n }\n\n pub fn latch_hv(&mut self) -> u8 {\n self.mem.lock().unwrap().set_latched_hv(\n (self.cycle_count / timing::DOT_TIME) as u16, \n self.scanline as u16 \n );\n 0\n }\n\n \n pub fn clock(&mut self, cycles: usize) -> PPUSignal {\n use PPUState::*;\n self.cycle_count += cycles;\n\n let transition = match self.state {\n VBlank if self.scanline == 0 => Some(PPUTransition::ExitVBlank),\n DrawingBeforePause if self.cycle_count >= timing::PAUSE_START => Some(PPUTransition::CPUPause),\n DrawingAfterPause if self.cycle_count >= timing::H_BLANK_TIME => Some(PPUTransition::EnterHBlank),\n HBlankRight if self.cycle_count >= timing::SCANLINE => Some(PPUTransition::NextLine),\n HBlankLeft if self.scanline > screen::V_RES => Some(PPUTransition::EnterVBlank),\n HBlankLeft if (self.cycle_count >= timing::SCANLINE_OFFSET)\n && (self.scanline <= screen::V_RES) => Some(PPUTransition::ExitHBlank),\n VBlank if self.cycle_count >= timing::SCANLINE => Some(PPUTransition::NextLine),\n _ => None\n };\n\n let signal = if let Some(transition) = transition {\n self.transition_state(transition)\n } else {\n PPUSignal::None\n };\n\n if signal == PPUSignal::None {\n if self.check_x_irq() {\n self.h_irq_latch = true;\n self.trigger_irq()\n } else {\n PPUSignal::None\n }\n } else {\n signal\n }\n }\n\n \n pub fn set_int_enable(&mut self, data: u8) {\n self.int_enable = IntEnable::from_bits_truncate(data);\n }\n\n pub fn set_h_timer_lo(&mut self, data: u8) {\n self.h_timer = set_lo!(self.h_timer, data);\n self.h_cycle = (self.h_timer as usize) * timing::DOT_TIME;\n self.h_irq_latch = false;\n }\n\n pub fn set_h_timer_hi(&mut self, data: u8) {\n self.h_timer = set_hi!(self.h_timer, data);\n self.h_cycle = (self.h_timer as usize) * timing::DOT_TIME;\n self.h_irq_latch = false;\n }\n\n pub fn set_v_timer_lo(&mut self, data: u8) {\n self.v_timer = set_lo!(self.v_timer, data);\n }\n\n pub fn set_v_timer_hi(&mut self, data: u8) {\n self.v_timer = set_hi!(self.v_timer, data);\n }\n\n pub fn get_nmi_flag(&mut self) -> u8 {\n std::mem::replace(&mut self.nmi_flag, 0)\n }\n\n pub fn get_irq_flag(&mut self) -> u8 {\n std::mem::replace(&mut self.irq_flag, 0)\n }\n}\n\nenum PPUTransition {\n ExitVBlank,\n CPUPause,\n EnterHBlank,\n NextLine,\n ExitHBlank,\n EnterVBlank,\n}\n\nimpl PPU {\n \n fn transition_state(&mut self, transition: PPUTransition) -> PPUSignal {\n use PPUTransition::*;\n match transition {\n ExitVBlank => {\n self.nmi_flag = 0;\n self.irq_flag = 0;\n self.toggle_vblank(false);\n self.toggle_hblank(false);\n self.state = PPUState::DrawingBeforePause;\n PPUSignal::FrameStart\n },\n CPUPause => {\n self.state = PPUState::DrawingAfterPause;\n PPUSignal::Delay\n },\n EnterHBlank => {\n self.toggle_hblank(true);\n self.state = PPUState::HBlankRight;\n PPUSignal::HBlank\n },\n NextLine => {\n self.cycle_count -= timing::SCANLINE;\n self.h_irq_latch = false;\n self.scanline += 1;\n\n if self.scanline >= screen::NUM_SCANLINES {\n self.scanline -= screen::NUM_SCANLINES;\n }\n\n if self.state == PPUState::HBlankRight {\n self.state = PPUState::HBlankLeft;\n }\n\n if self.check_y_irq() {\n self.trigger_irq()\n } else {\n PPUSignal::None\n }\n },\n ExitHBlank => {\n self.toggle_hblank(false);\n self.renderer.draw_line((self.scanline - 1) as usize);\n self.state = PPUState::DrawingBeforePause;\n PPUSignal::None\n },\n EnterVBlank => {\n \n self.toggle_vblank(true);\n self.toggle_hblank(false);\n\n {\n let mut mem = self.mem.lock().unwrap();\n mem.oam_reset();\n }\n\n self.state = PPUState::VBlank;\n self.trigger_nmi()\n },\n }\n }\n\n \n \n fn check_y_irq(&self) -> bool {\n let enabled = (self.int_enable & IntEnable::all_irq()) == IntEnable::ENABLE_IRQ_Y;\n enabled && (self.scanline == (self.v_timer as usize))\n }\n\n \n \n \n fn check_x_irq(&self) -> bool {\n let irq = self.int_enable & IntEnable::all_irq();\n\n if !self.h_irq_latch {\n if irq == IntEnable::all_irq() {\n (self.scanline == (self.v_timer as usize)) && (self.cycle_count >= self.h_cycle)\n } else if irq == IntEnable::ENABLE_IRQ_X {\n self.cycle_count >= self.h_cycle\n } else {\n false\n }\n } else {\n false\n }\n }\n\n \n fn trigger_nmi(&mut self) -> PPUSignal {\n self.nmi_flag |= bit!(7);\n if self.int_enable.contains(IntEnable::ENABLE_NMI) {\n PPUSignal::Int(Interrupt::NMI)\n } else {\n PPUSignal::Int(Interrupt::VBLANK)\n }\n }\n\n fn trigger_irq(&mut self) -> PPUSignal {\n self.irq_flag |= bit!(7);\n PPUSignal::Int(Interrupt::IRQ)\n }\n\n \n fn toggle_vblank(&mut self, vblank: bool) {\n self.status.set(PPUStatus::V_BLANK, vblank);\n }\n\n fn toggle_hblank(&mut self, hblank: bool) {\n self.status.set(PPUStatus::H_BLANK, hblank);\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nmod ram;\nmod render;\n\nuse std::sync::{\n Arc,\n Mutex\n};\n\nuse bitflags::bitflags;\n\nuse crate::{\n common::Interrupt,\n constants::{\n timing,\n screen\n },\n};\n\nuse ram::VideoMem;\npub use render::RenderTarget;\n\ntype VRamRef = Arc<Mutex<VideoMem>>;\n\nbitflags! {\n #[derive(Default)]\n struct IntEnable: u8 {\n const ENABLE_NMI = bit!(7);\n const ENABLE_IRQ_Y = bit!(5);\n const ENABLE_IRQ_X = bit!(4);\n const AUTO_JOYPAD = bit!(0);\n }\n}\n\nimpl IntEnable {\n fn all_irq() -> IntEnable {\n IntEnable::ENABLE_IRQ_X | IntEnable::ENABLE_IRQ_Y\n }\n}\n\nbitflags! {\n #[derive(Default)]\n struct PPUStatus: u8 {\n const V_BLANK = bit!(7);\n const H_BLANK = bit!(6);\n }\n}\n\n#[derive(PartialEq)]\npub enum PPUSignal {\n None, \n Int(Interrupt), \n \n \n \n HBlank, \n Delay, \n FrameStart, \n}\n\n#[derive(Debug, PartialEq)]\nenum PPUState {\n HBlankLeft, \n DrawingBeforePause, \n DrawingAfterPause, \n HBlankRight, \n VBlank \n}\n\n#[derive(Clone, Copy)]\npub enum BG {\n _1,\n _2,\n _3,\n _4\n}\n\nimpl BG {\n fn all() -> &'static [BG; 4] {\n const BGS: [BG; 4] = [BG::_1, BG::_2, BG::_3, BG::_4];\n &BGS\n }\n}\n\npub struct PPU {\n state: PPUState,\n\n mem: VRamRef,\n\n cycle_count: usize, \n scanline: usize, \n\n int_enable: IntEnable,\n status: PPUStatus,\n nmi_flag: u8, \n irq_flag: u8, \n h_timer: u16, \n h_cycle: usize, \n v_timer: u16, \n h_irq_latch: bool, \n\n renderer: render::RenderThread,\n}\n\nimpl PPU {\n pub fn new() -> Self {\n let mem = Arc::new(Mut"},"suffix":{"kind":"string","value":" = PPUState::VBlank;\n self.trigger_nmi()\n },\n }\n }\n\n \n \n fn check_y_irq(&self) -> bool {\n let enabled = (self.int_enable & IntEnable::all_irq()) == IntEnable::ENABLE_IRQ_Y;\n enabled && (self.scanline == (self.v_timer as usize))\n }\n\n \n \n \n fn check_x_irq(&self) -> bool {\n let irq = self.int_enable & IntEnable::all_irq();\n\n if !self.h_irq_latch {\n if irq == IntEnable::all_irq() {\n (self.scanline == (self.v_timer as usize)) && (self.cycle_count >= self.h_cycle)\n } else if irq == IntEnable::ENABLE_IRQ_X {\n self.cycle_count >= self.h_cycle\n } else {\n false\n }\n } else {\n false\n }\n }\n\n \n fn trigger_nmi(&mut self) -> PPUSignal {\n self.nmi_flag |= bit!(7);\n if self.int_enable.contains(IntEnable::ENABLE_NMI) {\n PPUSignal::Int(Interrupt::NMI)\n } else {\n PPUSignal::Int(Interrupt::VBLANK)\n }\n }\n\n fn trigger_irq(&mut self) -> PPUSignal {\n self.irq_flag |= bit!(7);\n PPUSignal::Int(Interrupt::IRQ)\n }\n\n \n fn toggle_vblank(&mut self, vblank: bool) {\n self.status.set(PPUStatus::V_BLANK, vblank);\n }\n\n fn toggle_hblank(&mut self, hblank: bool) {\n self.status.set(PPUStatus::H_BLANK, hblank);\n }\n}\n"},"middle":{"kind":"string","value":"ex::new(VideoMem::new()));\n\n PPU {\n state: PPUState::VBlank,\n mem: mem.clone(),\n\n cycle_count: 0,\n scanline: 0,\n\n int_enable: IntEnable::default(),\n status: PPUStatus::default(),\n nmi_flag: 0,\n irq_flag: 0,\n h_timer: 0,\n h_cycle: 0,\n v_timer: 0,\n h_irq_latch: false,\n\n renderer: render::RenderThread::new(mem),\n }\n }\n\n pub fn start_frame(&mut self, frame: RenderTarget) {\n self.renderer.start_frame(frame);\n }\n\n \n pub fn read_mem(&mut self, addr: u8) -> u8 {\n self.mem.lock().unwrap().read(addr)\n }\n\n pub fn write_mem(&mut self, addr: u8, data: u8) {\n self.mem.lock().unwrap().write(addr, data);\n }\n\n \n pub fn get_status(&mut self) -> u8 {\n self.status.bits()\n }\n\n pub fn latch_hv(&mut self) -> u8 {\n self.mem.lock().unwrap().set_latched_hv(\n (self.cycle_count / timing::DOT_TIME) as u16, \n self.scanline as u16 \n );\n 0\n }\n\n \n pub fn clock(&mut self, cycles: usize) -> PPUSignal {\n use PPUState::*;\n self.cycle_count += cycles;\n\n let transition = match self.state {\n VBlank if self.scanline == 0 => Some(PPUTransition::ExitVBlank),\n DrawingBeforePause if self.cycle_count >= timing::PAUSE_START => Some(PPUTransition::CPUPause),\n DrawingAfterPause if self.cycle_count >= timing::H_BLANK_TIME => Some(PPUTransition::EnterHBlank),\n HBlankRight if self.cycle_count >= timing::SCANLINE => Some(PPUTransition::NextLine),\n HBlankLeft if self.scanline > screen::V_RES => Some(PPUTransition::EnterVBlank),\n HBlankLeft if (self.cycle_count >= timing::SCANLINE_OFFSET)\n && (self.scanline <= screen::V_RES) => Some(PPUTransition::ExitHBlank),\n VBlank if self.cycle_count >= timing::SCANLINE => Some(PPUTransition::NextLine),\n _ => None\n };\n\n let signal = if let Some(transition) = transition {\n self.transition_state(transition)\n } else {\n PPUSignal::None\n };\n\n if signal == PPUSignal::None {\n if self.check_x_irq() {\n self.h_irq_latch = true;\n self.trigger_irq()\n } else {\n PPUSignal::None\n }\n } else {\n signal\n }\n }\n\n \n pub fn set_int_enable(&mut self, data: u8) {\n self.int_enable = IntEnable::from_bits_truncate(data);\n }\n\n pub fn set_h_timer_lo(&mut self, data: u8) {\n self.h_timer = set_lo!(self.h_timer, data);\n self.h_cycle = (self.h_timer as usize) * timing::DOT_TIME;\n self.h_irq_latch = false;\n }\n\n pub fn set_h_timer_hi(&mut self, data: u8) {\n self.h_timer = set_hi!(self.h_timer, data);\n self.h_cycle = (self.h_timer as usize) * timing::DOT_TIME;\n self.h_irq_latch = false;\n }\n\n pub fn set_v_timer_lo(&mut self, data: u8) {\n self.v_timer = set_lo!(self.v_timer, data);\n }\n\n pub fn set_v_timer_hi(&mut self, data: u8) {\n self.v_timer = set_hi!(self.v_timer, data);\n }\n\n pub fn get_nmi_flag(&mut self) -> u8 {\n std::mem::replace(&mut self.nmi_flag, 0)\n }\n\n pub fn get_irq_flag(&mut self) -> u8 {\n std::mem::replace(&mut self.irq_flag, 0)\n }\n}\n\nenum PPUTransition {\n ExitVBlank,\n CPUPause,\n EnterHBlank,\n NextLine,\n ExitHBlank,\n EnterVBlank,\n}\n\nimpl PPU {\n \n fn transition_state(&mut self, transition: PPUTransition) -> PPUSignal {\n use PPUTransition::*;\n match transition {\n ExitVBlank => {\n self.nmi_flag = 0;\n self.irq_flag = 0;\n self.toggle_vblank(false);\n self.toggle_hblank(false);\n self.state = PPUState::DrawingBeforePause;\n PPUSignal::FrameStart\n },\n CPUPause => {\n self.state = PPUState::DrawingAfterPause;\n PPUSignal::Delay\n },\n EnterHBlank => {\n self.toggle_hblank(true);\n self.state = PPUState::HBlankRight;\n PPUSignal::HBlank\n },\n NextLine => {\n self.cycle_count -= timing::SCANLINE;\n self.h_irq_latch = false;\n self.scanline += 1;\n\n if self.scanline >= screen::NUM_SCANLINES {\n self.scanline -= screen::NUM_SCANLINES;\n }\n\n if self.state == PPUState::HBlankRight {\n self.state = PPUState::HBlankLeft;\n }\n\n if self.check_y_irq() {\n self.trigger_irq()\n } else {\n PPUSignal::None\n }\n },\n ExitHBlank => {\n self.toggle_hblank(false);\n self.renderer.draw_line((self.scanline - 1) as usize);\n self.state = PPUState::DrawingBeforePause;\n PPUSignal::None\n },\n EnterVBlank => {\n \n self.toggle_vblank(true);\n self.toggle_hblank(false);\n\n {\n let mut mem = self.mem.lock().unwrap();\n mem.oam_reset();\n }\n\n self.state"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"type CartMappingFn = fn(u8, u16) -> CartDevice;\n\n\n","file_path":"oxide-7/src/mem/rom/mod.rs","rank":1,"score":252137.86479187425},{"content":"fn map_hirom_bank(in_bank: u8, mapping: u8, lo_rom: bool, bank_addr: u16) -> u8 {\n\n let mapped_bank = map_bank(in_bank, mapping);\n\n if lo_rom {\n\n if bank_addr >= 0x8000 {\n\n (mapped_bank * 2) + 1\n\n } else {\n\n mapped_bank * 2\n\n }\n\n } else {\n\n mapped_bank\n\n }\n\n}","file_path":"oxide-7/src/expansion/sa1/mem/mod.rs","rank":2,"score":223483.82814469648},{"content":"#[inline]\n\nfn get_mode_7_texel(vram: &[u8], x: usize, y: usize) -> u8 {\n\n // Find tile num.\n\n let tile_x = x / 8;\n\n let tile_y = y / 8;\n\n let tile = (tile_y * 128) + tile_x;\n\n let tile_num = vram[tile * 2] as usize;\n\n\n\n // Find pixel in tile.\n\n let tex_x = x % 8;\n\n let tex_y = y % 8;\n\n let tex_num = (tex_y * 8) + tex_x;\n\n \n\n // Lookup pixel in vram.\n\n let tile_offset = tile_num * 128;\n\n vram[tile_offset + (tex_num * 2) + 1]\n\n}","file_path":"oxide-7/src/video/render/drawing/mod.rs","rank":3,"score":198832.13223468527},{"content":"fn clear_line(target: &mut [u8], y: usize) {\n\n use crate::constants::screen::H_RES;\n\n\n\n for d in target.iter_mut().skip(y * H_RES * 8).take(H_RES * 8) {\n\n *d = 0;\n\n }\n\n}","file_path":"oxide-7/src/video/render/mod.rs","rank":4,"score":185406.74917752366},{"content":"fn map_bank(in_bank: u8, mapping: u8) -> u8 {\n\n let lo = lo_nybble!(in_bank);\n\n let hi = (mapping % 8) << 4;\n\n hi | lo\n\n}\n\n\n","file_path":"oxide-7/src/expansion/sa1/mem/mod.rs","rank":5,"score":172817.41629470972},{"content":"pub fn step_size(param: u8) -> Option<usize> {\n\n match param {\n\n 0x00 => None,\n\n 0x01 => Some(2048),\n\n 0x02 => Some(1536),\n\n 0x03 => Some(1280),\n\n 0x04 => Some(1024),\n\n 0x05 => Some(768),\n\n 0x06 => Some(640),\n\n 0x07 => Some(512),\n\n 0x08 => Some(384),\n\n 0x09 => Some(320),\n\n 0x0A => Some(256),\n\n 0x0B => Some(192),\n\n 0x0C => Some(160),\n\n 0x0D => Some(128),\n\n 0x0E => Some(96),\n\n 0x0F => Some(80),\n\n 0x10 => Some(64),\n\n 0x11 => Some(48),\n","file_path":"oxide-7/src/audio/dsp/envelope/gain.rs","rank":7,"score":164251.98278013268},{"content":"#[inline]\n\nfn sign_extend(val: u16) -> u16 {\n\n if test_bit!(val, 12) {\n\n val | 0xE000\n\n } else {\n\n val & 0x1FFF\n\n }\n\n}","file_path":"oxide-7/src/video/ram/bgregs.rs","rank":8,"score":149375.5359737318},{"content":"// Messages to send to the render thread.\n\nenum RendererMessage {\n\n StartFrame(RenderTarget), // Begin frame, and target the provided byte array.\n\n DrawLine(usize),\n\n}\n\n\n\n// Renderer for video that spawns a thread to render on.\n\npub struct RenderThread {\n\n sender: Sender<RendererMessage>,\n\n receiver: Receiver<()>,\n\n}\n\n\n\nimpl RenderThread {\n\n pub fn new(mem: super::VRamRef) -> Self {\n\n let (send_msg, recv_msg) = bounded(224);\n\n let (send_reply, recv_reply) = bounded(224);\n\n\n\n std::thread::spawn(move || {\n\n use RendererMessage::*;\n\n let mut target = None;\n\n let mut renderer = drawing::Renderer::new();\n","file_path":"oxide-7/src/video/render/mod.rs","rank":9,"score":138092.8393030044},{"content":"// Renderer trait.\n\npub trait Renderable {\n\n fn frame_start(&mut self);\n\n fn draw_line(&mut self, y: u16);\n\n fn frame_end(&mut self);\n\n}\n\n\n\n// Mode\n\n#[derive(Clone, Copy, PartialEq, Debug)]\n\npub enum VideoMode {\n\n _0 = 0,\n\n _1 = 1,\n\n _2 = 2,\n\n _3 = 3,\n\n _4 = 4,\n\n _5 = 5,\n\n _6 = 6,\n\n _7 = 7\n\n}\n\n\n\nimpl From<u8> for VideoMode {\n","file_path":"oxide-7/src/video/render/mod.rs","rank":10,"score":135721.9189237412},{"content":"// Memory Bus to attach to CPU.\n\npub trait MemBus {\n\n fn read(&mut self, addr: u32) -> (u8, usize);\n\n fn write(&mut self, addr: u32, data: u8) -> usize;\n\n fn clock(&mut self, cycles: usize) -> Interrupt;\n\n}\n\n\n\n/// Random access memory.\n\n#[derive(Default)]\n\npub struct RAM {\n\n data: Vec<u8>\n\n}\n\n\n\nimpl RAM {\n\n pub fn new(size: usize) -> Self {\n\n RAM {\n\n data: vec![0; size]\n\n }\n\n }\n\n\n\n pub fn read(&self, addr: u32) -> u8 {\n","file_path":"oxide-7/src/mem/mod.rs","rank":11,"score":135096.11073126216},{"content":"pub trait SPCMem {\n\n fn read(&mut self, addr: u16) -> u8;\n\n fn write(&mut self, addr: u16, data: u8);\n\n fn clock(&mut self, cycles: usize);\n\n}\n\n\n\npub struct SPCBus {\n\n ram: RAM,\n\n\n\n ipl_rom: &'static [u8; 64],\n\n\n\n // Registers\n\n control: SPCControl,\n\n dsp_reg_addr: u8,\n\n dsp: DSP,\n\n\n\n // Port data sent in from CPU.\n\n ports_cpu_to_apu: [u8; 4],\n\n\n\n // Port data sent out from APU.\n","file_path":"oxide-7/src/audio/mem/mod.rs","rank":12,"score":132114.86987482526},{"content":"pub fn create_sram(file_name: &str, size: usize) -> Result<Box<dyn SRAM>, String> {\n\n if size == 0 {\n\n Ok(Box::new(EmptySRAM::new()))\n\n } else {\n\n let sram = SizedSRAM::new(file_name, size)?;\n\n Ok(Box::new(sram))\n\n }\n\n}\n\n\n\n/// Used in cartridges that have SRAM.\n\npub struct SizedSRAM {\n\n save_file: BufWriter<File>,\n\n ram: RAM,\n\n\n\n mask: u32, // Mask when reading/writing\n\n\n\n dirty: bool,\n\n}\n\n\n\nimpl SizedSRAM {\n","file_path":"oxide-7/src/mem/rom/sram.rs","rank":14,"score":128132.19800082978},{"content":"struct CartMapping {\n\n start_bank: u8,\n\n end_bank: u8,\n\n start_addr: u16,\n\n\n\n addr_mapping: CartMappingFn\n\n}\n\n\n\nimpl CartMapping {\n\n fn new(start_bank: u8, end_bank: u8, start_addr: u16, mapping: CartMappingFn) -> Self {\n\n Self {\n\n start_bank: start_bank,\n\n end_bank: end_bank,\n\n start_addr: start_addr,\n\n addr_mapping: mapping,\n\n }\n\n }\n\n}\n\n\n","file_path":"oxide-7/src/mem/rom/mod.rs","rank":15,"score":127178.7721077572},{"content":"struct CartBuilder {\n\n mappings: Vec<CartMapping>,\n\n mapping_mode: CartMappingMode,\n\n\n\n rom: Option<ROM>,\n\n ram: Option<Box<dyn SRAM>>,\n\n expansion: Option<Box<dyn Expansion>>,\n\n\n\n fast_rom: bool,\n\n\n\n name: String\n\n}\n\n\n\nimpl CartBuilder {\n\n fn new(mode: CartMappingMode) -> Self {\n\n CartBuilder {\n\n mappings: Vec::new(),\n\n mapping_mode: mode,\n\n\n\n rom: None,\n","file_path":"oxide-7/src/mem/rom/mod.rs","rank":16,"score":127178.7721077572},{"content":"enum CartDevice {\n\n ROM(u8, u16),\n\n RAM(u32),\n\n Expansion(u8, u16)\n\n}\n\n\n","file_path":"oxide-7/src/mem/rom/mod.rs","rank":17,"score":127178.7721077572},{"content":"enum CartMappingMode {\n\n Lo,\n\n LoLarge,\n\n Hi,\n\n ExHi,\n\n SA,\n\n SuperFX\n\n}\n\n\n","file_path":"oxide-7/src/mem/rom/mod.rs","rank":18,"score":124020.9410867754},{"content":"pub fn debug_mode(snes: &mut SNES) {\n\n // Debug mode.\n\n snes.start_frame();\n\n println!(\"Debug mode.\");\n\n println!(\"Enter 'h' for help.\");\n\n let mut breaks = std::collections::BTreeSet::new();\n\n let mut stack_trace = Vec::new();\n\n loop {\n\n let mut input = String::new();\n\n match std::io::stdin().read_line(&mut input) {\n\n Ok(_) => if input.starts_with(\"b:\") {\n\n // Add breakpoint\n\n match u32::from_str_radix(&input[2..].trim(), 16) {\n\n Ok(num) => {\n\n println!(\"Inserted breakpoint at ${:06X}\", num);\n\n breaks.insert(num);\n\n },\n\n Err(e) => println!(\"Invalid breakpoint: {}\", e),\n\n }\n\n } else if input.starts_with(\"c:\") {\n","file_path":"oxide-7-bin/src/debug/mod.rs","rank":19,"score":122105.68643811112},{"content":"pub fn create_cart(cart_path: &str, save_path: &str, dsp_path: Option<&str>) -> Box<Cart> {\n\n let rom_file = File::open(cart_path).expect(&format!(\"Couldn't open file {}\", cart_path));\n\n //let rom_size = rom_file.metadata().expect(\"Couldn't get metadata for file.\").len();\n\n\n\n let mut reader = BufReader::new(rom_file);\n\n let mut header = ROMHeader::new();\n\n\n\n let cart = if header.try_lo(&mut reader) {\n\n let sram = create_sram(save_path, header.sram_size()).expect(\"Couldn't make save file.\");\n\n let name = header.rom_name();\n\n\n\n if header.rom_size() > LOROM_LARGE_SIZE {\n\n println!(\"LOROM Large {:X}: {}\", header.rom_mapping(), name);\n\n Cart::new_lorom_large(reader, sram)\n\n } else {\n\n println!(\"LOROM {:X}: {}\", header.rom_mapping(), name);\n\n Cart::new_lorom(reader, sram)\n\n }.named(name)\n\n .fast_rom(header.fast_rom())\n\n\n","file_path":"oxide-7/src/mem/rom/mod.rs","rank":20,"score":119856.17552274684},{"content":"// Convert master cycles into SPC cycles.\n\n// SNES clock: 21_442_080 Hz\n\n// SPC clock: 1_024_000 Hz\n\nfn calc_cycles(master_cycles: usize) -> f64 {\n\n (master_cycles as f64) * SPC_RATIO\n\n}","file_path":"oxide-7/src/audio/mod.rs","rank":21,"score":110988.30769056921},{"content":"// Step the CPU, and add the PC to the stack trace if it calls.\n\nfn step_and_trace(snes: &mut SNES, stack_trace: &mut Vec<u32>, print: bool) {\n\n let instr = snes.get_instr();\n\n match instr[0] {\n\n 0x22 | 0x20 | 0xFC => {\n\n stack_trace.push(make24!(snes.get_state().pb, snes.get_state().pc));\n\n },\n\n 0x6B | 0x60 => {\n\n stack_trace.pop();\n\n },\n\n _ => {}\n\n }\n\n\n\n if print {\n\n let state = snes.get_state();\n\n let pc = make24!(state.pb, state.pc);\n\n println!(\"${:06X}: ${:02X} ({:02X} {:02X} {:02X})\", pc, instr[0], instr[1], instr[2], instr[3]);\n\n }\n\n\n\n if snes.step() {\n\n snes.start_frame();\n\n }\n\n}","file_path":"oxide-7-bin/src/debug/mod.rs","rank":22,"score":101156.36477162017},{"content":"#[inline]\n\nfn sign_extend_4(val: u8) -> i8 {\n\n if test_bit!(val, 3, u8) {\n\n (val | 0xF0) as i8\n\n } else {\n\n val as i8\n\n }\n\n}\n\n\n","file_path":"oxide-7/src/audio/dsp/brr.rs","rank":23,"score":97908.31309306914},{"content":"enum ScreenHeight {\n\n _128,\n\n _160,\n\n _192,\n\n Obj\n\n}\n\n\n\nimpl From<ScreenMode> for ScreenHeight {\n\n fn from(val: ScreenMode) -> Self {\n\n if val.contains(ScreenMode::HT0 | ScreenMode::HT1) {\n\n ScreenHeight::Obj\n\n } else if val.contains(ScreenMode::HT0) {\n\n ScreenHeight::_160\n\n } else if val.contains(ScreenMode::HT1) {\n\n ScreenHeight::_192\n\n } else {\n\n ScreenHeight::_128\n\n }\n\n }\n\n}\n\n\n\n// Represents a row of 8 pixels.\n\n// Each pixel is 2, 4, or 8 bits.\n","file_path":"oxide-7/src/expansion/superfx/pixelcache.rs","rank":24,"score":96119.79108523217},{"content":"#[derive(Clone, Copy)]\n\nenum WindowOp {\n\n OR,\n\n AND,\n\n XOR,\n\n XNOR\n\n}\n\n\n\nimpl From<u8> for WindowOp {\n\n // Should be from a 2-bit value.\n\n fn from(val: u8) -> Self {\n\n const MASK_LOGIC_OR: u8 = 0;\n\n const MASK_LOGIC_AND: u8 = 1;\n\n const MASK_LOGIC_XOR: u8 = 2;\n\n const MASK_LOGIC_XNOR: u8 = 3;\n\n\n\n match val {\n\n MASK_LOGIC_OR => Self::OR,\n\n MASK_LOGIC_AND => Self::AND,\n\n MASK_LOGIC_XOR => Self::XOR,\n\n MASK_LOGIC_XNOR => Self::XNOR,\n","file_path":"oxide-7/src/video/ram/windowregs.rs","rank":25,"score":95389.6978125322},{"content":"// Address Bus B, used for hardware registers.\n\nstruct AddrBusB {\n\n ppu: PPU,\n\n apu: APU,\n\n\n\n open_bus: u8\n\n}\n\n\n\nimpl AddrBusB {\n\n fn new() -> Self {\n\n AddrBusB {\n\n ppu: PPU::new(),\n\n apu: APU::new(),\n\n\n\n open_bus: 0,\n\n }\n\n }\n\n\n\n fn read(&mut self, addr: u8) -> u8 {\n\n match addr {\n\n 0x37 => self.ppu.latch_hv(),\n","file_path":"oxide-7/src/mem/bus.rs","rank":26,"score":95017.51355010997},{"content":"enum ArithMode {\n\n Multiply,\n\n Divide,\n\n MultiplySum,\n\n Res\n\n}\n\n\n\nimpl From<u8> for ArithMode {\n\n fn from(val: u8) -> Self {\n\n use ArithMode::*;\n\n match val & 0x3 {\n\n 0 => Multiply,\n\n 1 => Divide,\n\n 2 => MultiplySum,\n\n 3 => Res,\n\n _ => unreachable!()\n\n }\n\n }\n\n}\n\n\n","file_path":"oxide-7/src/expansion/sa1/mem/arith.rs","rank":27,"score":92822.07354881272},{"content":"/// Save RAM.\n\n/// This may or may not exist based on the cartridge.\n\npub trait SRAM {\n\n fn read(&self, addr: u32) -> u8;\n\n fn write(&mut self, addr: u32, data: u8);\n\n\n\n /// Flush the SRAM to the save file specified.\n\n fn flush(&mut self);\n\n}\n\n\n","file_path":"oxide-7/src/mem/rom/sram.rs","rank":28,"score":92646.44013995858},{"content":"pub trait Expansion {\n\n fn read(&mut self, bank: u8, addr: u16) -> u8;\n\n fn write(&mut self, bank: u8, addr: u16, data: u8);\n\n\n\n fn clock(&mut self, cycles: usize) -> Interrupt;\n\n fn flush(&mut self) {}\n\n}\n\n\n\nimpl Expansion for DSP {\n\n fn read(&mut self, bank: u8, _addr: u16) -> u8 {\n\n match bank {\n\n 0 => self.read_dr(),\n\n 1 => self.read_sr(),\n\n _ => unreachable!()\n\n }\n\n }\n\n\n\n fn write(&mut self, bank: u8, _addr: u16, data: u8) {\n\n match bank {\n\n 0 => self.write_dr(data),\n","file_path":"oxide-7/src/expansion/mod.rs","rank":29,"score":91101.52464350309},{"content":"fn help() {\n\n println!(\"b:x: New breakpoint at memory location x (hex).\");\n\n println!(\"c:x: Clear breakpoint at memory location x (hex).\");\n\n println!(\"r: Keep running until a breakpoint is hit.\");\n\n println!(\"s: Step a single instruction.\");\n\n println!(\"s:x: Step multiple instructions (base 10).\");\n\n println!(\"t: Print the stack trace (all the call locations).\");\n\n println!(\"p: Print the current state of the CPU.\");\n\n println!(\"p:x: Print x - if x is a number, print the contents of that address, otherwise print the register.\");\n\n println!(\"p:x-y: Print the memory in the range x -> y.\");\n\n println!(\"q: Quit execution.\");\n\n}\n\n\n","file_path":"oxide-7-bin/src/debug/mod.rs","rank":30,"score":90260.86577094428},{"content":"#[inline]\n\nfn decompress_sample(head: BRRHead, encoded: u8, last1: i16, last2: i16) -> i16 {\n\n let unpacked = sign_extend_4(encoded) as i16;\n\n let base = (unpacked << head.shift()) >> 1;\n\n let samp = base + head.calc_coef_a(last1) + head.calc_coef_b(last2);\n\n sign_extend_15(samp)\n\n}\n\n\n\n// Sign extend a 4-bit signed value to 8 bits.\n","file_path":"oxide-7/src/audio/dsp/brr.rs","rank":31,"score":76208.75943052795},{"content":"// Types to assist with drawing.\n\n\n\nuse crate::video::render::Colour;\n\n\n\n// A sprite colour for final compositing.\n\n#[derive(Clone, Copy)]\n\npub struct SpriteColour {\n\n pub colour: Colour, // The colour of the sprite\n\n pub col_math: bool // Should it participate in colour math\n\n}\n\n\n\n// A sprite pixel.\n\n#[derive(Clone, Copy)]\n\npub enum SpritePixel {\n\n // Colours with respective priorities.\n\n Prio3(SpriteColour),\n\n Prio2(SpriteColour),\n\n Prio1(SpriteColour),\n\n Prio0(SpriteColour),\n\n Masked, // This pixel is masked and no sprites should appear here.\n","file_path":"oxide-7/src/video/render/drawing/types.rs","rank":32,"score":75645.21896253202},{"content":" _ => panic!(\"Don't call this on pixels with no colour value.\")\n\n }\n\n }\n\n}\n\n\n\n// A colour value with source information.\n\npub enum Pixel {\n\n BG1(Colour),\n\n BG2(Colour),\n\n BG3(Colour),\n\n BG4(Colour),\n\n ObjHi(Colour), // Uses object palette 4-7, uses colour math\n\n ObjLo(Colour), // Uses object palette 0-3, doesn't use colmath\n\n None\n\n}\n\n\n\nimpl Pixel {\n\n // Get the colour from if there is one, and discard source information.\n\n pub fn any(self) -> Option<Colour> {\n\n match self {\n","file_path":"oxide-7/src/video/render/drawing/types.rs","rank":33,"score":75637.98090194052},{"content":" None // No sprites found on this pixel.\n\n}\n\n\n\nimpl SpritePixel {\n\n // Test if the pixel is masked.\n\n #[inline]\n\n pub fn is_masked(&self) -> bool {\n\n match self {\n\n SpritePixel::Masked => true,\n\n _ => false\n\n }\n\n }\n\n\n\n // Get the final pixel out, and test it to see if it should participate in colour math.\n\n pub fn pixel(&self) -> Pixel {\n\n match self {\n\n SpritePixel::Prio3(c) => if c.col_math {Pixel::ObjHi(c.colour)} else {Pixel::ObjLo(c.colour)},\n\n SpritePixel::Prio2(c) => if c.col_math {Pixel::ObjHi(c.colour)} else {Pixel::ObjLo(c.colour)},\n\n SpritePixel::Prio1(c) => if c.col_math {Pixel::ObjHi(c.colour)} else {Pixel::ObjLo(c.colour)},\n\n SpritePixel::Prio0(c) => if c.col_math {Pixel::ObjHi(c.colour)} else {Pixel::ObjLo(c.colour)},\n","file_path":"oxide-7/src/video/render/drawing/types.rs","rank":34,"score":75633.25115310909},{"content":" Pixel::BG1(c) => Some(c),\n\n Pixel::BG2(c) => Some(c),\n\n Pixel::BG3(c) => Some(c),\n\n Pixel::BG4(c) => Some(c),\n\n Pixel::ObjHi(c) => Some(c),\n\n Pixel::ObjLo(c) => Some(c),\n\n Pixel::None => None\n\n }\n\n }\n\n}\n","file_path":"oxide-7/src/video/render/drawing/types.rs","rank":35,"score":75628.62835560007},{"content":" self.data[addr as usize]\n\n }\n\n\n\n pub fn write(&mut self, addr: u32, data: u8) {\n\n self.data[addr as usize] = data;\n\n }\n\n\n\n pub fn iter<'a>(&'a self, start: usize) -> RAMIter<'a> {\n\n RAMIter {\n\n ram: self,\n\n read_head: start\n\n }\n\n }\n\n}\n\n\n\n/// An iterator over RAM.\n\n/// Use RAM::iter to construct this.\n\npub struct RAMIter<'a> {\n\n ram: &'a RAM,\n\n read_head: usize\n","file_path":"oxide-7/src/mem/mod.rs","rank":36,"score":75083.28908867968},{"content":"// Memory\n\nmod bus;\n\nmod dma;\n\npub mod rom;\n\n\n\npub use bus::AddrBusA;\n\n\n\nuse crate::common::Interrupt;\n\n\n\n// Memory Bus to attach to CPU.\n","file_path":"oxide-7/src/mem/mod.rs","rank":37,"score":75080.50839670034},{"content":"}\n\n\n\nimpl Iterator for RAMIter<'_> {\n\n type Item = u8;\n\n\n\n fn next(&mut self) -> Option<Self::Item> {\n\n let data = self.ram.data[self.read_head];\n\n self.read_head = (self.read_head + 1) % self.ram.data.len();\n\n Some(data)\n\n }\n\n}\n","file_path":"oxide-7/src/mem/mod.rs","rank":38,"score":75077.90967280431},{"content":"fn print(s: &str, snes: &mut SNES) {\n\n match s {\n\n \"a\" => println!(\"a: ${:04X}\", snes.get_state().a),\n\n \"x\" => println!(\"x: ${:04X}\", snes.get_state().x),\n\n \"y\" => println!(\"y: ${:04X}\", snes.get_state().y),\n\n \"s\" => println!(\"s: ${:04X}\", snes.get_state().s),\n\n \"db\" => println!(\"db: ${:02X}\", snes.get_state().db),\n\n \"dp\" => println!(\"dp: ${:04X}\", snes.get_state().dp),\n\n \"pb\" => println!(\"pb: ${:02X}\", snes.get_state().pb),\n\n \"pc\" => println!(\"pc: ${:04X}\", snes.get_state().pc),\n\n \"p\" => println!(\"p: b{:08b}\", snes.get_state().p),\n\n \"e\" => println!(\"e: {}\", snes.get_state().pe),\n\n s => {\n\n // Memory range\n\n if let Some(x) = s.find('-') {\n\n match u32::from_str_radix(&s[..x], 16) {\n\n Ok(start) => match u32::from_str_radix(&s[(x+1)..], 16) {\n\n Ok(end) => {\n\n println!(\"${:06X} - ${:06X}:\", start, end);\n\n let mems = (start..end).map(|n| format!(\"{:02X}\", snes.get_mem_at(n)))\n","file_path":"oxide-7-bin/src/debug/mod.rs","rank":39,"score":75039.77535309893},{"content":" fn from(val: u8) -> Self {\n\n match val & bits![2, 1, 0] {\n\n 0 => VideoMode::_0,\n\n 1 => VideoMode::_1,\n\n 2 => VideoMode::_2,\n\n 3 => VideoMode::_3,\n\n 4 => VideoMode::_4,\n\n 5 => VideoMode::_5,\n\n 6 => VideoMode::_6,\n\n 7 => VideoMode::_7,\n\n _ => unreachable!()\n\n }\n\n }\n\n}\n\n\n\npub type RenderTarget = Arc<Mutex<Box<[u8]>>>;\n\n\n\n#[derive(Clone, Copy, Debug)]\n\npub struct Colour {\n\n pub r: u8,\n","file_path":"oxide-7/src/video/render/mod.rs","rank":40,"score":73121.54988847628},{"content":" pub g: u8,\n\n pub b: u8\n\n}\n\n\n\nimpl Colour {\n\n pub const fn new(r: u8, g: u8, b: u8) -> Self {\n\n Colour {\n\n r: r,\n\n g: g,\n\n b: b\n\n }\n\n }\n\n\n\n pub const fn zero() -> Colour {\n\n Colour {\n\n r: 0,\n\n g: 0,\n\n b: 0\n\n }\n\n }\n","file_path":"oxide-7/src/video/render/mod.rs","rank":41,"score":73119.15835675334},{"content":"// Tools for communicating with the renderer (and its thread on certain platforms).\n\n\n\n//mod bgcache;\n\nmod patternmem;\n\nmod drawing;\n\nmod palette;\n\n\n\nuse std::sync::{\n\n Arc, Mutex\n\n};\n\n\n\nuse crossbeam_channel::{\n\n bounded,\n\n Sender,\n\n Receiver\n\n};\n\n\n\n// Renderer trait.\n","file_path":"oxide-7/src/video/render/mod.rs","rank":42,"score":73118.29859513511},{"content":"\n\n while let Ok(msg) = recv_msg.recv() {\n\n match msg {\n\n StartFrame(data) => {\n\n target = Some(data);\n\n },\n\n DrawLine(y) => {\n\n let mut mem = mem.lock().unwrap();\n\n send_reply.send(()).unwrap();\n\n if !mem.get_bg_registers().in_fblank() {\n\n renderer.setup_caches(&mut mem);\n\n let mut t = target.as_ref().unwrap().lock().unwrap();\n\n renderer.draw_line(&mem, &mut t, y);\n\n } else {\n\n let mut t = target.as_ref().unwrap().lock().unwrap();\n\n clear_line(&mut t, y);\n\n }\n\n }\n\n }\n\n }\n","file_path":"oxide-7/src/video/render/mod.rs","rank":43,"score":73108.21688629618},{"content":" });\n\n\n\n RenderThread {\n\n sender: send_msg,\n\n receiver: recv_reply,\n\n }\n\n }\n\n\n\n pub fn start_frame(&mut self, target: RenderTarget) {\n\n self.sender\n\n .send(RendererMessage::StartFrame(target))\n\n .expect(\"Couldn't send start frame message!\");\n\n }\n\n\n\n pub fn draw_line(&mut self, y: usize) {\n\n self.sender\n\n .send(RendererMessage::DrawLine(y))\n\n .expect(\"Couldn't send draw line message!\");\n\n\n\n self.receiver\n\n .recv()\n\n .expect(\"Draw line\");\n\n }\n\n}\n\n\n","file_path":"oxide-7/src/video/render/mod.rs","rank":44,"score":73108.02020795905},{"content":"\n\n /*const fn red() -> Colour {\n\n Colour {\n\n r: 255,\n\n g: 0,\n\n b: 0\n\n }\n\n }\n\n const fn blue() -> Colour {\n\n Colour {\n\n r: 0,\n\n g: 0,\n\n b: 255\n\n }\n\n }\n\n const fn green() -> Colour {\n\n Colour {\n\n r: 0,\n\n g: 255,\n\n b: 0\n","file_path":"oxide-7/src/video/render/mod.rs","rank":45,"score":73096.53484012646},{"content":" }\n\n }\n\n const fn yellow() -> Colour {\n\n Colour {\n\n r: 255,\n\n g: 255,\n\n b: 0\n\n }\n\n }*/\n\n}\n\n\n","file_path":"oxide-7/src/video/render/mod.rs","rank":46,"score":73096.53484012646},{"content":" bgregs: Registers,\n\n windowregs: WindowRegisters,\n\n\n\n h_pos: u16,\n\n v_pos: u16,\n\n\n\n h_hi_byte: bool,\n\n v_hi_byte: bool,\n\n\n\n oam: OAM,\n\n cgram: CGRAM,\n\n vram: VRAM\n\n}\n\n\n\nimpl VideoMem {\n\n pub fn new() -> Self {\n\n VideoMem {\n\n bgregs: Registers::new(),\n\n windowregs: WindowRegisters::new(),\n\n\n","file_path":"oxide-7/src/video/ram/mod.rs","rank":47,"score":73005.4342471276},{"content":"// Video memory. Connected to the B bus.\n\n\n\nmod bgregs;\n\nmod cgram;\n\nmod oam;\n\nmod vram;\n\nmod windowregs;\n\n\n\npub use bgregs::*;\n\nuse cgram::CGRAM;\n\nuse oam::OAM;\n\npub use oam::SpritePriority;\n\nuse vram::VRAM;\n\npub use windowregs::{\n\n Screen,\n\n WindowRegisters\n\n};\n\n\n\n// Struct containing OAM, CGRAM and VRAM.\n\npub struct VideoMem {\n","file_path":"oxide-7/src/video/ram/mod.rs","rank":48,"score":73002.62919577655},{"content":"\n\n // Renderer methods to check dirtiness of data.\n\n pub fn is_cgram_bg_dirty(&self) -> bool {\n\n self.cgram.is_bg_dirty()\n\n }\n\n\n\n pub fn is_cgram_obj_dirty(&self) -> bool {\n\n self.cgram.is_obj_dirty()\n\n }\n\n\n\n pub fn cgram_reset_dirty(&mut self) {\n\n self.cgram.reset_dirty()\n\n }\n\n\n\n pub fn vram_is_dirty(&self, start_addr: u16) -> bool {\n\n self.vram.dirty_range(start_addr)\n\n }\n\n\n\n pub fn vram_reset_dirty_range(&mut self, read: &[u16]) {\n\n self.vram.reset_dirty_range(read);\n\n }\n\n\n\n pub fn vram_set_pattern_regions(&mut self, regions: Vec<(u16, u16)>) {\n\n self.vram.set_pattern_regions(regions);\n\n }\n\n}","file_path":"oxide-7/src/video/ram/mod.rs","rank":49,"score":72997.81272144732},{"content":" // Renderer methods to get raw data.\n\n pub fn get_oam<'a>(&'a self) -> &'a [oam::Object] {\n\n self.oam.ref_data()\n\n }\n\n\n\n pub fn get_cgram<'a>(&'a self) -> &'a [u8] {\n\n self.cgram.ref_data()\n\n }\n\n\n\n pub fn get_vram<'a>(&'a self) -> &'a [u8] {\n\n self.vram.ref_data()\n\n }\n\n\n\n pub fn get_bg_registers<'a>(&'a self) -> &'a Registers {\n\n &self.bgregs\n\n }\n\n\n\n pub fn get_window_registers<'a>(&'a self) -> &'a WindowRegisters {\n\n &self.windowregs\n\n }\n","file_path":"oxide-7/src/video/ram/mod.rs","rank":50,"score":72993.63912183336},{"content":" h_pos: 0,\n\n v_pos: 0,\n\n\n\n h_hi_byte: false,\n\n v_hi_byte: false,\n\n\n\n oam: OAM::new(),\n\n cgram: CGRAM::new(),\n\n vram: VRAM::new()\n\n }\n\n }\n\n\n\n pub fn read(&mut self, addr: u8) -> u8 {\n\n match addr {\n\n 0x34 => self.bgregs.read_mult_result_lo(),\n\n 0x35 => self.bgregs.read_mult_result_mid(),\n\n 0x36 => self.bgregs.read_mult_result_hi(),\n\n 0x38 => self.oam.read(),\n\n 0x39 => self.vram.read_lo(),\n\n 0x3A => self.vram.read_hi(),\n","file_path":"oxide-7/src/video/ram/mod.rs","rank":51,"score":72989.04865469942},{"content":" },\n\n _ => unreachable!()\n\n }\n\n }\n\n\n\n pub fn write(&mut self, addr: u8, data: u8) {\n\n match addr {\n\n 0x00 => self.bgregs.set_screen_display(data),\n\n\n\n 0x01 => self.bgregs.set_object_settings(data),\n\n 0x02 => self.oam.set_addr_lo(data),\n\n 0x03 => self.oam.set_addr_hi(data),\n\n 0x04 => self.oam.write(data),\n\n\n\n 0x05 => self.bgregs.set_bg_mode(data),\n\n 0x06 => self.bgregs.set_mosaic(data),\n\n 0x07 => self.bgregs.set_bg1_settings(data),\n\n 0x08 => self.bgregs.set_bg2_settings(data),\n\n 0x09 => self.bgregs.set_bg3_settings(data),\n\n 0x0A => self.bgregs.set_bg4_settings(data),\n","file_path":"oxide-7/src/video/ram/mod.rs","rank":52,"score":72988.58203335338},{"content":" 0x2F => self.windowregs.set_sub_mask_desg(data),\n\n 0x30 => self.windowregs.set_colour_add_select(data),\n\n 0x31 => self.windowregs.set_colour_math_desg(data),\n\n 0x32 => self.windowregs.set_fixed_colour(data),\n\n 0x33 => self.windowregs.set_video_select(data),\n\n _ => unreachable!()\n\n }\n\n }\n\n\n\n // Set latched h or v pos.\n\n pub fn set_latched_hv(&mut self, h: u16, v: u16) {\n\n self.h_pos = h;\n\n self.v_pos = v;\n\n }\n\n\n\n // OAM address reset that happens at V-blank\n\n pub fn oam_reset(&mut self) {\n\n self.oam.reset();\n\n }\n\n\n","file_path":"oxide-7/src/video/ram/mod.rs","rank":53,"score":72985.6189986983},{"content":" 0x1D => self.bgregs.set_mode7_matrix_c(data),\n\n 0x1E => self.bgregs.set_mode7_matrix_d(data),\n\n 0x1F => self.bgregs.set_mode7_centre_x(data),\n\n 0x20 => self.bgregs.set_mode7_centre_y(data),\n\n\n\n 0x21 => self.cgram.set_addr(data),\n\n 0x22 => self.cgram.write(data),\n\n \n\n 0x23 => self.windowregs.set_mask_bg1_2(data), // BG1&2 window\n\n 0x24 => self.windowregs.set_mask_bg3_4(data), // BG3&4 window\n\n 0x25 => self.windowregs.set_mask_obj_col(data), // Obj window\n\n 0x26 => self.windowregs.window_1_left = data,\n\n 0x27 => self.windowregs.window_1_right = data,\n\n 0x28 => self.windowregs.window_2_left = data,\n\n 0x29 => self.windowregs.window_2_right = data,\n\n 0x2A => self.windowregs.set_mask_logic_bg(data),\n\n 0x2B => self.windowregs.set_mask_logic_obj_col(data),\n\n 0x2C => self.windowregs.set_main_screen_desg(data),\n\n 0x2D => self.windowregs.set_sub_screen_desg(data),\n\n 0x2E => self.windowregs.set_main_mask_desg(data),\n","file_path":"oxide-7/src/video/ram/mod.rs","rank":54,"score":72982.92005250842},{"content":" 0x3B => self.cgram.read(),\n\n 0x3C => if !self.h_hi_byte {\n\n self.h_hi_byte = true;\n\n lo!(self.h_pos)\n\n } else {\n\n self.h_hi_byte = false;\n\n hi!(self.h_pos)\n\n },\n\n 0x3D => if !self.v_hi_byte {\n\n self.v_hi_byte = true;\n\n lo!(self.v_pos)\n\n } else {\n\n self.v_hi_byte = false;\n\n hi!(self.v_pos)\n\n },\n\n 0x3E => 1, // PPU Status\n\n 0x3F => { // PPU Status\n\n self.h_hi_byte = false;\n\n self.v_hi_byte = false;\n\n 2\n","file_path":"oxide-7/src/video/ram/mod.rs","rank":55,"score":72982.51736959915},{"content":" 0x0B => self.bgregs.set_bg12_char_addr(data),\n\n 0x0C => self.bgregs.set_bg34_char_addr(data),\n\n 0x0D => self.bgregs.set_bg1_scroll_x(data),\n\n 0x0E => self.bgregs.set_bg1_scroll_y(data),\n\n 0x0F => self.bgregs.set_bg2_scroll_x(data),\n\n 0x10 => self.bgregs.set_bg2_scroll_y(data),\n\n 0x11 => self.bgregs.set_bg3_scroll_x(data),\n\n 0x12 => self.bgregs.set_bg3_scroll_y(data),\n\n 0x13 => self.bgregs.set_bg4_scroll_x(data),\n\n 0x14 => self.bgregs.set_bg4_scroll_y(data),\n\n\n\n 0x15 => self.vram.set_port_control(data),\n\n 0x16 => self.vram.set_addr_lo(data),\n\n 0x17 => self.vram.set_addr_hi(data),\n\n 0x18 => self.vram.write_lo(data),\n\n 0x19 => self.vram.write_hi(data),\n\n\n\n 0x1A => self.bgregs.set_mode7_settings(data),\n\n 0x1B => self.bgregs.set_mode7_matrix_a(data),\n\n 0x1C => self.bgregs.set_mode7_matrix_b(data),\n","file_path":"oxide-7/src/video/ram/mod.rs","rank":56,"score":72978.42922893183},{"content":"\n\n timer_0: Timer::new(128),\n\n timer_1: Timer::new(128),\n\n timer_2: Timer::new(16),\n\n }\n\n }\n\n\n\n pub fn read_port(&self, port_num: usize) -> u8 {\n\n self.ports_apu_to_cpu[port_num]\n\n }\n\n\n\n pub fn write_port(&mut self, port_num: usize, data: u8) {\n\n self.ports_cpu_to_apu[port_num] = data;\n\n }\n\n}\n\n\n\nimpl SPCMem for SPCBus {\n\n fn read(&mut self, addr: u16) -> u8 {\n\n match addr {\n\n 0xF1 => 0,\n","file_path":"oxide-7/src/audio/mem/mod.rs","rank":57,"score":72606.82791011181},{"content":"// Memory for the SPC-700.\n\nmod timer;\n\n\n\nuse bitflags::bitflags;\n\nuse crossbeam_channel::Sender;\n\n\n\nuse crate::mem::RAM;\n\nuse timer::Timer;\n\nuse super::dsp::DSP;\n\n\n\nbitflags! {\n\n struct SPCControl: u8 {\n\n const ROM_ENABLE = bit!(7);\n\n const CLEAR_PORT_32 = bit!(5);\n\n const CLEAR_PORT_10 = bit!(4);\n\n const ENABLE_TIMER_2 = bit!(2);\n\n const ENABLE_TIMER_1 = bit!(1);\n\n const ENABLE_TIMER_0 = bit!(0);\n\n }\n\n}\n","file_path":"oxide-7/src/audio/mem/mod.rs","rank":58,"score":72606.60445167412},{"content":"// ROM.\n\npub struct ROM {\n\n data: Vec<u8>,\n\n bank_size: usize\n\n}\n\n\n\nimpl ROM {\n\n fn new(mut cart_file: BufReader<File>, bank_size: usize) -> Self {\n\n // read and store\n\n let mut buffer = Vec::new();\n\n cart_file.seek(SeekFrom::Start(0)).expect(\"couldn't seek in file\");\n\n cart_file.read_to_end(&mut buffer).expect(\"couldn't read file\");\n\n ROM {\n\n data: buffer,\n\n bank_size: bank_size\n\n }\n\n }\n\n\n\n pub fn read(&mut self, bank: u8, addr: u16) -> u8 {\n\n let bank_offset = (bank as usize) * self.bank_size;\n\n self.data[bank_offset + (addr as usize)]\n\n }\n\n}\n\n\n","file_path":"oxide-7/src/mem/rom/mod.rs","rank":59,"score":72603.91935405244},{"content":" // Write to expansion port slot.\n\n pub fn write_exp(&mut self, addr: u16, data: u8) {\n\n self.expansion.as_mut().map_or((), |e| e.write(0, addr, data));\n\n }\n\n\n\n pub fn flush(&mut self) {\n\n self.ram.flush();\n\n if let Some(e) = self.expansion.as_mut() {\n\n e.flush();\n\n }\n\n }\n\n\n\n pub fn set_rom_speed(&mut self, data: u8) {\n\n self.rom_speed = if self.fast_rom && test_bit!(data, SPEED_BIT, u8) {\n\n timing::FAST_MEM_ACCESS\n\n } else {\n\n timing::SLOW_MEM_ACCESS\n\n }\n\n }\n\n\n","file_path":"oxide-7/src/mem/rom/mod.rs","rank":60,"score":72603.8487112653},{"content":"\n\n builder\n\n }\n\n\n\n fn new_exhirom(cart_file: BufReader<File>, ram: Box<dyn SRAM>) -> CartBuilder {\n\n let mut builder = CartBuilder::new(CartMappingMode::ExHi);\n\n builder.rom = Some(ROM::new(cart_file, 0x10000));\n\n builder.ram = Some(ram);\n\n\n\n builder\n\n }\n\n}\n\n\n\nimpl Cart {\n\n pub fn read(&mut self, bank: u8, addr: u16) -> (u8, usize) {\n\n for mapping in self.mappings.iter() {\n\n if (bank >= mapping.start_bank) &&\n\n (bank <= mapping.end_bank) &&\n\n (addr >= mapping.start_addr) {\n\n return match (mapping.addr_mapping)(bank, addr) {\n","file_path":"oxide-7/src/mem/rom/mod.rs","rank":61,"score":72603.37515622503},{"content":" CartDevice::ROM(bank, addr) => (self.rom.as_mut().map_or(0, |r| r.read(bank, addr)), self.rom_speed),\n\n CartDevice::RAM(addr) => (self.ram.read(addr), timing::SLOW_MEM_ACCESS),\n\n CartDevice::Expansion(bank, addr) => {\n\n let data = self.expansion.as_mut().map_or(0, |e| e.read(bank, addr));\n\n //println!(\"Reading {:X} from {:X}\", data, addr);\n\n (data, timing::SLOW_MEM_ACCESS)\n\n },\n\n };\n\n }\n\n }\n\n\n\n (0, timing::SLOW_MEM_ACCESS)\n\n }\n\n\n\n pub fn write(&mut self, bank: u8, addr: u16, data: u8) -> usize {\n\n let internal_bank = bank % 0x80;\n\n\n\n for mapping in self.mappings.iter() {\n\n if (internal_bank >= mapping.start_bank) &&\n\n (internal_bank <= mapping.end_bank) &&\n","file_path":"oxide-7/src/mem/rom/mod.rs","rank":62,"score":72603.18460936949},{"content":"use header::*;\n\nuse sram::*;\n\npub use sram::SRAM;\n\n\n\nconst LOROM_LARGE_SIZE: usize = 1 << 21;\n\nconst LOROM_RAM_BANK_SIZE: u32 = 0x8000;\n\nconst HIROM_RAM_BANK_SIZE: u32 = 0x2000;\n\n\n\nconst SPEED_BIT: u8 = 0;\n\n\n","file_path":"oxide-7/src/mem/rom/mod.rs","rank":63,"score":72601.73412395381},{"content":" ram: None,\n\n expansion: None,\n\n\n\n fast_rom: false,\n\n\n\n name: String::new()\n\n }\n\n }\n\n\n\n fn named(mut self, name: String) -> Self {\n\n self.name = name;\n\n self\n\n }\n\n\n\n fn fast_rom(mut self, fast: bool) -> Self {\n\n self.fast_rom = fast;\n\n self\n\n }\n\n\n\n fn with_dsp(mut self, dsp: Box<dyn Expansion>) -> Self {\n","file_path":"oxide-7/src/mem/rom/mod.rs","rank":64,"score":72601.26603124241},{"content":" ports_apu_to_cpu: [u8; 4],\n\n\n\n timer_0: Timer,\n\n timer_1: Timer,\n\n timer_2: Timer,\n\n}\n\n\n\nimpl SPCBus {\n\n pub fn new(signal_tx: Sender<super::SamplePacket>) -> Self {\n\n SPCBus {\n\n ram: RAM::new(SPC_RAM_SIZE),\n\n\n\n ipl_rom: &IPL_ROM,\n\n\n\n control: SPCControl::ROM_ENABLE | SPCControl::CLEAR_PORT_32 | SPCControl::CLEAR_PORT_10,\n\n dsp_reg_addr: 0,\n\n dsp: DSP::new(signal_tx),\n\n\n\n ports_cpu_to_apu: [0; 4],\n\n ports_apu_to_cpu: [0; 4],\n","file_path":"oxide-7/src/audio/mem/mod.rs","rank":65,"score":72600.57216474012},{"content":"// ROM types\n\nmod header;\n\nmod sram;\n\n\n\nuse std::{\n\n io::{\n\n BufReader,\n\n Read,\n\n Seek,\n\n SeekFrom\n\n },\n\n fs::File\n\n};\n\n\n\nuse crate::{\n\n common::Interrupt,\n\n constants::timing,\n\n expansion::*\n\n};\n\n\n","file_path":"oxide-7/src/mem/rom/mod.rs","rank":66,"score":72599.0500125306},{"content":"\n\n name: self.name,\n\n })\n\n }\n\n}\n\n\n\npub struct Cart {\n\n mappings: Vec<CartMapping>,\n\n\n\n rom: Option<ROM>,\n\n ram: Box<dyn SRAM>,\n\n expansion: Option<Box<dyn Expansion>>,\n\n\n\n fast_rom: bool,\n\n rom_speed: usize,\n\n\n\n name: String\n\n}\n\n\n\nimpl Cart {\n","file_path":"oxide-7/src/mem/rom/mod.rs","rank":67,"score":72598.79465980532},{"content":" (addr >= mapping.start_addr) {\n\n match (mapping.addr_mapping)(internal_bank, addr) {\n\n CartDevice::ROM(_,_) => {},\n\n CartDevice::RAM(addr) => self.ram.write(addr, data),\n\n CartDevice::Expansion(bank, addr) => {\n\n //println!(\"Writing {:X} to {:X}\", data, addr);\n\n self.expansion.as_mut().map_or((), |e| e.write(bank, addr, data));\n\n },\n\n }\n\n }\n\n }\n\n\n\n timing::SLOW_MEM_ACCESS\n\n }\n\n\n\n // Read from expansion port slot.\n\n pub fn read_exp(&mut self, addr: u16) -> u8 {\n\n self.expansion.as_mut().map_or(0, |e| e.read(0, addr))\n\n }\n\n\n","file_path":"oxide-7/src/mem/rom/mod.rs","rank":68,"score":72598.28422804682},{"content":" self\n\n }\n\n\n\n fn with_sa1(mut self) -> Self {\n\n use CartMappingMode::*;\n\n\n\n let sa1 = Box::new(SA1::new(self.rom.take().unwrap(), true, self.ram.take().unwrap()));\n\n self.expansion = Some(sa1);\n\n\n\n self.mapping_mode = SA;\n\n\n\n self\n\n }\n\n\n\n fn with_superfx(mut self) -> Self {\n\n let super_fx = Box::new(SuperFX::new(self.rom.take().unwrap(), self.ram.take().unwrap()));\n\n self.expansion = Some(super_fx);\n\n\n\n self.mapping_mode = CartMappingMode::SuperFX;\n\n\n","file_path":"oxide-7/src/mem/rom/mod.rs","rank":69,"score":72597.56146432375},{"content":" self.mappings.push(CartMapping::new(0x20, 0x3F, 0x6000, |bank, addr| {\n\n let ram_bank = ((bank % 0x10) as u32) * HIROM_RAM_BANK_SIZE;\n\n CartDevice::RAM(ram_bank + (addr as u32 - 0x6000))\n\n }));\n\n },\n\n SuperFX => {\n\n self.mappings.push(CartMapping::new(0x60, 0x7F, 0, |bank, addr| CartDevice::Expansion(bank, addr)));\n\n self.mappings.push(CartMapping::new(0xE0, 0xEF, 0, |bank, addr| CartDevice::Expansion(bank, addr)));\n\n },\n\n _ => {}\n\n }\n\n\n\n Box::new(Cart {\n\n mappings: self.mappings,\n\n rom: self.rom,\n\n ram: self.ram.unwrap_or(Box::new(EmptySRAM::new())),\n\n expansion: self.expansion,\n\n\n\n fast_rom: self.fast_rom,\n\n rom_speed: timing::SLOW_MEM_ACCESS,\n","file_path":"oxide-7/src/mem/rom/mod.rs","rank":70,"score":72595.98553341202},{"content":" }\n\n }\n\n\n\n fn clock(&mut self, cycles: usize) {\n\n if self.control.contains(SPCControl::ENABLE_TIMER_0) {\n\n self.timer_0.clock(cycles);\n\n }\n\n if self.control.contains(SPCControl::ENABLE_TIMER_1) {\n\n self.timer_1.clock(cycles);\n\n }\n\n if self.control.contains(SPCControl::ENABLE_TIMER_2) {\n\n self.timer_2.clock(cycles);\n\n }\n\n\n\n self.dsp.clock(cycles, &mut self.ram);\n\n }\n\n}\n\n\n\nimpl SPCBus {\n\n fn set_control(&mut self, data: u8) {\n","file_path":"oxide-7/src/audio/mem/mod.rs","rank":71,"score":72593.59229538555},{"content":" fn new_lorom(cart_file: BufReader<File>, ram: Box<dyn SRAM>) -> CartBuilder {\n\n let mut builder = CartBuilder::new(CartMappingMode::Lo);\n\n builder.rom = Some(ROM::new(cart_file, 0x8000));\n\n builder.ram = Some(ram);\n\n\n\n builder\n\n }\n\n\n\n fn new_lorom_large(cart_file: BufReader<File>, ram: Box<dyn SRAM>) -> CartBuilder {\n\n let mut builder = CartBuilder::new(CartMappingMode::LoLarge);\n\n builder.rom = Some(ROM::new(cart_file, 0x8000));\n\n builder.ram = Some(ram);\n\n\n\n builder\n\n }\n\n\n\n fn new_hirom(cart_file: BufReader<File>, ram: Box<dyn SRAM>) -> CartBuilder {\n\n let mut builder = CartBuilder::new(CartMappingMode::Hi);\n\n builder.rom = Some(ROM::new(cart_file, 0x10000));\n\n builder.ram = Some(ram);\n","file_path":"oxide-7/src/mem/rom/mod.rs","rank":72,"score":72592.3441723307},{"content":" self.mappings.push(CartMapping::new(0xC0, 0xFF, 0, |bank, addr| CartDevice::Expansion(bank, addr)));\n\n },\n\n SuperFX => {\n\n self.mappings.push(CartMapping::new(0x00, 0x3F, 0x3000, |bank, addr| CartDevice::Expansion(bank, addr)));\n\n self.mappings.push(CartMapping::new(0x80, 0xBF, 0x3000, |bank, addr| CartDevice::Expansion(bank, addr)));\n\n\n\n self.mappings.push(CartMapping::new(0x40, 0x5F, 0, |bank, addr| CartDevice::Expansion(bank, addr)));\n\n self.mappings.push(CartMapping::new(0xC0, 0xDF, 0, |bank, addr| CartDevice::Expansion(bank, addr)));\n\n },\n\n }\n\n\n\n // SRAM\n\n match self.mapping_mode {\n\n Lo | LoLarge => {\n\n self.mappings.push(CartMapping::new(0x70, 0x7F, 0, |bank, addr| {\n\n let ram_bank = ((bank - 0x70) as u32) * LOROM_RAM_BANK_SIZE;\n\n CartDevice::RAM(ram_bank + addr as u32)\n\n }));\n\n },\n\n Hi | ExHi => {\n","file_path":"oxide-7/src/mem/rom/mod.rs","rank":73,"score":72590.51355827728},{"content":" pub fn name(&self) -> String {\n\n self.name.clone()\n\n }\n\n\n\n pub fn clock(&mut self, cycles: usize) -> Interrupt {\n\n if let Some(ex) = self.expansion.as_mut() {\n\n ex.clock(cycles)\n\n } else {\n\n Interrupt::default()\n\n }\n\n }\n\n}\n","file_path":"oxide-7/src/mem/rom/mod.rs","rank":74,"score":72590.44934526419},{"content":" };\n\n\n\n let cart_with_ext = match header.rom_type().enhancement_chip() {\n\n Some(EnhancementChip::DSP) => {\n\n let dsp_path = dsp_path.expect(\"Must specify DSP ROM path!\");\n\n let dsp_rom_file = File::open(dsp_path).expect(&format!(\"Couldn't open DSP ROM file {}\", dsp_path));\n\n let mut dsp_reader = BufReader::new(dsp_rom_file);\n\n let mut buffer = vec![0; 0x2000];\n\n dsp_reader.read_exact(&mut buffer).expect(\"Couldn't read into DSP ROM\");\n\n cart.with_dsp(Box::new(DSP::new(&buffer)))\n\n },\n\n Some(EnhancementChip::SA1) => cart.with_sa1(),\n\n Some(EnhancementChip::SuperFX) => cart.with_superfx(),\n\n Some(e) => panic!(\"Unsupported enhancement chip {:?}\", e),\n\n None => cart,\n\n };\n\n\n\n cart_with_ext.build()\n\n}\n\n\n","file_path":"oxide-7/src/mem/rom/mod.rs","rank":75,"score":72590.09658548007},{"content":"\n\n fn write(&mut self, addr: u16, data: u8) {\n\n match addr {\n\n 0xF1 => self.set_control(data),\n\n\n\n 0xF2 => self.dsp_reg_addr = data,\n\n 0xF3 => self.dsp.write(self.dsp_reg_addr & 0x7F, data, &self.ram),\n\n\n\n 0xF4 => self.ports_apu_to_cpu[0] = data,\n\n 0xF5 => self.ports_apu_to_cpu[1] = data,\n\n 0xF6 => self.ports_apu_to_cpu[2] = data,\n\n 0xF7 => self.ports_apu_to_cpu[3] = data,\n\n\n\n 0xFA => self.timer_0.write_timer_modulo(data),\n\n 0xFB => self.timer_1.write_timer_modulo(data),\n\n 0xFC => self.timer_2.write_timer_modulo(data),\n\n\n\n 0xFD..=0xFF => {},\n\n\n\n _ => self.ram.write(addr.into(), data)\n","file_path":"oxide-7/src/audio/mem/mod.rs","rank":76,"score":72590.00900285422},{"content":"\n\nconst SPC_RAM_SIZE: usize = 1024 * 64; // 64KB of RAM.\n\n\n\nconst IPL_ROM: [u8; 64] = [\n\n 0xCD, 0xEF, 0xBD, 0xE8, 0x00, 0xC6, 0x1D, 0xD0,\n\n 0xFC, 0x8F, 0xAA, 0xF4, 0x8F, 0xBB, 0xF5, 0x78,\n\n 0xCC, 0xF4, 0xD0, 0xFB, 0x2F, 0x19, 0xEB, 0xF4,\n\n 0xD0, 0xFC, 0x7E, 0xF4, 0xD0, 0x0B, 0xE4, 0xF5,\n\n 0xCB, 0xF4, 0xD7, 0x00, 0xFC, 0xD0, 0xF3, 0xAB,\n\n 0x01, 0x10, 0xEF, 0x7E, 0xF4, 0x10, 0xEB, 0xBA,\n\n 0xF6, 0xDA, 0x00, 0xBA, 0xF4, 0xC4, 0xF4, 0xDD,\n\n 0x5D, 0xD0, 0xDB, 0x1F, 0x00, 0x00, 0xC0, 0xFF\n\n];\n\n\n","file_path":"oxide-7/src/audio/mem/mod.rs","rank":77,"score":72589.49333544503},{"content":" use CartMappingMode::*;\n\n\n\n self.expansion = Some(dsp);\n\n\n\n match self.mapping_mode {\n\n Lo | LoLarge => {\n\n self.mappings.push(CartMapping::new(0x30, 0x3F, 0x8000, |_, addr| {\n\n let out_addr = if addr < 0xC000 {0} else {1};\n\n CartDevice::Expansion(out_addr, 0)\n\n }));\n\n },\n\n Hi => {\n\n self.mappings.push(CartMapping::new(0x00, 0x1F, 0x6000, |_, addr| {\n\n let out_addr = if addr < 0x7000 {0} else {1};\n\n CartDevice::Expansion(out_addr, 0)\n\n }));\n\n }\n\n _ => {}\n\n }\n\n\n","file_path":"oxide-7/src/mem/rom/mod.rs","rank":78,"score":72588.84828000073},{"content":" self\n\n }\n\n\n\n fn build(mut self) -> Box<Cart> {\n\n use CartMappingMode::*;\n\n // Map ROM\n\n match self.mapping_mode {\n\n Lo => {\n\n self.mappings.push(CartMapping::new(0x00, 0x3F, 0x8000, |bank, addr| CartDevice::ROM(bank, addr % 0x8000)));\n\n self.mappings.push(CartMapping::new(0x80, 0xBF, 0x8000, |bank, addr| CartDevice::ROM(bank - 0x80, addr % 0x8000)));\n\n\n\n self.mappings.push(CartMapping::new(0x40, 0x6F, 0, |bank, addr| CartDevice::ROM(bank - 0x40, addr % 0x8000)));\n\n self.mappings.push(CartMapping::new(0xC0, 0xFF, 0, |bank, addr| CartDevice::ROM(bank - 0xC0, addr % 0x8000)));\n\n },\n\n LoLarge => {\n\n self.mappings.push(CartMapping::new(0x00, 0x3F, 0x8000, |bank, addr| CartDevice::ROM(bank, addr % 0x8000)));\n\n self.mappings.push(CartMapping::new(0x80, 0xBF, 0x8000, |bank, addr| CartDevice::ROM(bank - 0x80, addr % 0x8000)));\n\n\n\n self.mappings.push(CartMapping::new(0x40, 0x6F, 0, |bank, addr| CartDevice::ROM(bank, addr % 0x8000)));\n\n self.mappings.push(CartMapping::new(0xC0, 0xFF, 0, |bank, addr| CartDevice::ROM(bank - 0x80, addr % 0x8000)));\n","file_path":"oxide-7/src/mem/rom/mod.rs","rank":79,"score":72588.07677140781},{"content":"\n\n 0xF2 => self.dsp_reg_addr,\n\n 0xF3 => self.dsp.read(self.dsp_reg_addr & 0x7F),\n\n\n\n 0xF4 => self.ports_cpu_to_apu[0],\n\n 0xF5 => self.ports_cpu_to_apu[1],\n\n 0xF6 => self.ports_cpu_to_apu[2],\n\n 0xF7 => self.ports_cpu_to_apu[3],\n\n\n\n 0xFA..=0xFC => 0,\n\n\n\n 0xFD => self.timer_0.read_counter(),\n\n 0xFE => self.timer_1.read_counter(),\n\n 0xFF => self.timer_2.read_counter(),\n\n\n\n 0xFFC0..=0xFFFF if self.control.contains(SPCControl::ROM_ENABLE) => self.ipl_rom[(addr - 0xFFC0) as usize],\n\n\n\n _ => self.ram.read(addr.into())\n\n }\n\n }\n","file_path":"oxide-7/src/audio/mem/mod.rs","rank":80,"score":72587.21129910479},{"content":" },\n\n Hi => {\n\n self.mappings.insert(0, CartMapping::new(0x00, 0x3F, 0x8000, |bank, addr| CartDevice::ROM(bank, addr)));\n\n self.mappings.insert(1, CartMapping::new(0x80, 0xBF, 0x8000, |bank, addr| CartDevice::ROM(bank - 0x80, addr)));\n\n\n\n self.mappings.insert(2, CartMapping::new(0x40, 0x7F, 0, |bank, addr| CartDevice::ROM(bank - 0x40, addr)));\n\n self.mappings.insert(3, CartMapping::new(0xC0, 0xFF, 0, |bank, addr| CartDevice::ROM(bank - 0xC0, addr)));\n\n },\n\n ExHi => {\n\n self.mappings.push(CartMapping::new(0x00, 0x1F, 0x8000, |bank, addr| CartDevice::ROM(bank + 0x40, addr)));\n\n self.mappings.push(CartMapping::new(0x80, 0xBF, 0x8000, |bank, addr| CartDevice::ROM(bank - 0x80, addr)));\n\n\n\n self.mappings.push(CartMapping::new(0x40, 0x5F, 0, |bank, addr| CartDevice::ROM(bank, addr)));\n\n self.mappings.push(CartMapping::new(0xC0, 0xFF, 0, |bank, addr| CartDevice::ROM(bank - 0xC0, addr)));\n\n },\n\n SA => {\n\n self.mappings.push(CartMapping::new(0x00, 0x3F, 0x2200, |bank, addr| CartDevice::Expansion(bank, addr)));\n\n self.mappings.push(CartMapping::new(0x80, 0xBF, 0x2200, |bank, addr| CartDevice::Expansion(bank, addr)));\n\n\n\n self.mappings.push(CartMapping::new(0x40, 0x6F, 0, |bank, addr| CartDevice::Expansion(bank, addr)));\n","file_path":"oxide-7/src/mem/rom/mod.rs","rank":81,"score":72586.80643128601},{"content":" } else if header.try_exhi(&mut reader) {\n\n let sram = create_sram(save_path, header.sram_size()).expect(\"Couldn't make save file.\");\n\n let name = header.rom_name();\n\n\n\n println!(\"EXHIROM {:X}: {}\", header.rom_mapping(), name);\n\n Cart::new_exhirom(reader, sram)\n\n .named(name)\n\n .fast_rom(header.fast_rom())\n\n\n\n } else if header.try_hi(&mut reader) {\n\n let sram = create_sram(save_path, header.sram_size()).expect(\"Couldn't make save file.\");\n\n let name = header.rom_name();\n\n\n\n println!(\"HIROM {:X}: {}\", header.rom_mapping(), name);\n\n Cart::new_hirom(reader, sram)\n\n .named(name)\n\n .fast_rom(header.fast_rom())\n\n\n\n } else {\n\n panic!(\"Unrecognised ROM: {:X}\", header.rom_mapping());\n","file_path":"oxide-7/src/mem/rom/mod.rs","rank":82,"score":72585.22649141017},{"content":" let control = SPCControl::from_bits_truncate(data);\n\n\n\n self.timer_0.reset();\n\n self.timer_1.reset();\n\n self.timer_2.reset();\n\n\n\n if control.contains(SPCControl::CLEAR_PORT_10) {\n\n //println!(\"APU reset ports 0 and 1\");\n\n self.ports_cpu_to_apu[0] = 0;\n\n self.ports_cpu_to_apu[1] = 0;\n\n }\n\n if control.contains(SPCControl::CLEAR_PORT_32) {\n\n //println!(\"APU reset ports 2 and 3\");\n\n self.ports_cpu_to_apu[2] = 0;\n\n self.ports_cpu_to_apu[3] = 0;\n\n }\n\n\n\n self.control = control;\n\n }\n\n}","file_path":"oxide-7/src/audio/mem/mod.rs","rank":83,"score":72582.0002487802},{"content":"// Actually drawing the image!\n\n\n\nmod lines;\n\nmod types;\n\n\n\nuse crate::video::{\n\n BG,\n\n VideoMem,\n\n ram::{\n\n Mode7Extend,\n\n Screen,\n\n SpritePriority,\n\n WindowRegisters\n\n },\n\n render::{\n\n Colour,\n\n VideoMode,\n\n patternmem::{\n\n BitsPerPixel,\n\n PatternMem\n","file_path":"oxide-7/src/video/render/drawing/mod.rs","rank":84,"score":70788.15110998998},{"content":" },\n\n palette::PaletteMem\n\n }\n\n};\n\n\n\nuse types::*;\n\nuse lines::{\n\n BGData,\n\n TileAttributes\n\n};\n\n\n\nuse crate::constants::screen::H_RES;\n\n\n\npub struct Renderer {\n\n mode: VideoMode,\n\n\n\n bg_pattern_mem: [PatternMem; 4],\n\n obj_pattern_mem: [PatternMem; 2],\n\n\n\n palettes: PaletteMem\n","file_path":"oxide-7/src/video/render/drawing/mod.rs","rank":85,"score":70786.43168107572},{"content":"}\n\n\n\nimpl Renderer {\n\n pub fn new() -> Self {\n\n Renderer {\n\n mode: VideoMode::_7,\n\n\n\n bg_pattern_mem: [\n\n PatternMem::new(BitsPerPixel::_2),\n\n PatternMem::new(BitsPerPixel::_2),\n\n PatternMem::new(BitsPerPixel::_2),\n\n PatternMem::new(BitsPerPixel::_2)\n\n ],\n\n\n\n obj_pattern_mem: [\n\n PatternMem::new(BitsPerPixel::_4),\n\n PatternMem::new(BitsPerPixel::_4),\n\n ],\n\n\n\n palettes: PaletteMem::new()\n","file_path":"oxide-7/src/video/render/drawing/mod.rs","rank":86,"score":70784.23607205709},{"content":" fn get_pattern_mem(&self, bg: BG) -> &PatternMem {\n\n match bg {\n\n BG::_1 => &self.bg_pattern_mem[0],\n\n BG::_2 => &self.bg_pattern_mem[1],\n\n BG::_3 => &self.bg_pattern_mem[2],\n\n BG::_4 => &self.bg_pattern_mem[3],\n\n }\n\n }\n\n}\n\n\n\n// Apply brightness to colour component.\n\nmacro_rules! apply_brightness {\n\n ($col:expr, $brightness:expr) => {\n\n (($col as usize) * ($brightness as usize) / 0xF) as u8\n\n };\n\n}\n\n\n\n// Drawing modes\n\nimpl Renderer {\n\n #[inline]\n","file_path":"oxide-7/src/video/render/drawing/mod.rs","rank":87,"score":70782.0928576103},{"content":" let sub = if window_regs.use_subscreen() {\n\n let sprite_pix = sub_sprite_pixels[x];\n\n let bg1_pix = sub_bg1_pixels[x];\n\n let bg2_pix = sub_bg2_pixels[x];\n\n self.eval_mode_7(window_regs.use_direct_colour(), ext_bg, sprite_pix, bg1_pix, bg2_pix).any()\n\n } else {\n\n None\n\n };\n\n\n\n self.write_pixel(window_regs, out, main, sub, brightness, x as u8);\n\n }\n\n }\n\n}\n\n\n\n// Generic drawing utils.\n\nimpl Renderer {\n\n // TODO: lots of cleanup here\n\n fn draw_sprites_to_line(&self, mem: &VideoMem, main_line: &mut [SpritePixel], sub_line: &mut [SpritePixel], y: u8) {\n\n let (small, large) = mem.get_bg_registers().obj_sizes();\n\n\n","file_path":"oxide-7/src/video/render/drawing/mod.rs","rank":88,"score":70779.29420197182},{"content":" if self.bg_pattern_mem[0].get_bits_per_pixel() != BitsPerPixel::_4 {\n\n self.bg_pattern_mem[0] = PatternMem::new(BitsPerPixel::_4);\n\n }\n\n },\n\n _7 => {}\n\n }\n\n }\n\n\n\n // Get the number of backgrounds active\n\n fn num_bgs(&self) -> usize {\n\n use VideoMode::*;\n\n match self.mode {\n\n _0 => 4,\n\n _1 => 3,\n\n _2 | _3 | _4 | _5 => 2,\n\n _6 => 1,\n\n _7 => 0,\n\n }\n\n }\n\n\n","file_path":"oxide-7/src/video/render/drawing/mod.rs","rank":89,"score":70778.0265199156},{"content":" let p_b = (palette_num & bit!(4)) << 1;\n\n let r_i = r | p_r;\n\n let g_i = g | p_g;\n\n let b_i = b | p_b;\n\n Colour::new(r_i | (r_i >> 4), g_i | (g_i >> 4), b_i | (b_i >> 3) | (b_i >> 6))\n\n } else {\n\n self.palettes.get_bg_colour(data.texel as usize)\n\n }\n\n }\n\n #[inline]\n\n fn make_mode7_bg1_pixel(&self, texel: u8, direct_col: bool) -> Colour {\n\n if direct_col {\n\n let r = (texel & bits![2, 1, 0]) << 5;\n\n let g = (texel & bits![5, 4, 3]) << 2;\n\n let b = texel & bits![7, 6];\n\n Colour::new(r | (r >> 3) | (r >> 6), g | (g >> 3) | (g >> 6), b | (b >> 2) | (b >> 4) | (b >> 6))\n\n } else {\n\n self.palettes.get_bg_colour(texel as usize)\n\n }\n\n }\n","file_path":"oxide-7/src/video/render/drawing/mod.rs","rank":90,"score":70777.33937111757},{"content":" let sub = if window_regs.use_subscreen() {\n\n let sprite_pix = sub_sprite_pixels[x];\n\n let bg1_pix = sub_bg1_pixels[x];\n\n let bg2_pix = sub_bg2_pixels[x];\n\n self.eval_mode_3(window_regs.use_direct_colour(), sprite_pix, bg1_pix, bg2_pix).any()\n\n } else {\n\n None\n\n };\n\n\n\n self.write_pixel(window_regs, out, main, sub, brightness, x as u8);\n\n }\n\n }\n\n\n\n fn draw_line_mode_4(&self, mem: &VideoMem, target: &mut [u8], y: usize) {\n\n let brightness = mem.get_bg_registers().get_brightness();\n\n let window_regs = mem.get_window_registers();\n\n let target_start = y * H_RES;\n\n\n\n let mut main_sprite_pixels = [SpritePixel::None; H_RES];\n\n let mut sub_sprite_pixels = [SpritePixel::None; H_RES];\n","file_path":"oxide-7/src/video/render/drawing/mod.rs","rank":91,"score":70777.13625338097},{"content":" } else {\n\n None\n\n };\n\n\n\n self.write_pixel(window_regs, out, main, sub, brightness, x as u8);\n\n }\n\n }\n\n\n\n fn draw_line_mode_5(&self, mem: &VideoMem, target: &mut [u8], y: usize) {\n\n let brightness = mem.get_bg_registers().get_brightness();\n\n let window_regs = mem.get_window_registers();\n\n let target_start = y * H_RES;\n\n\n\n let mut main_sprite_pixels = [SpritePixel::None; H_RES];\n\n let mut sub_sprite_pixels = [SpritePixel::None; H_RES];\n\n self.draw_sprites_to_line(mem, &mut main_sprite_pixels, &mut sub_sprite_pixels, y as u8);\n\n let mut main_bg1_pixels = [BGData::default(); H_RES];\n\n let mut sub_bg1_pixels = [BGData::default(); H_RES];\n\n self.draw_bg_to_line(mem, BG::_1, &mut main_bg1_pixels, &mut sub_bg1_pixels, y, false);\n\n let mut main_bg2_pixels = [BGData::default(); H_RES];\n","file_path":"oxide-7/src/video/render/drawing/mod.rs","rank":92,"score":70776.52231555637},{"content":" }\n\n }\n\n\n\n pub fn draw_line(&mut self, mem: &VideoMem, target: &mut [u8], y: usize) {\n\n match self.mode {\n\n VideoMode::_0 => self.draw_line_mode_0(mem, target, y),\n\n VideoMode::_1 => self.draw_line_mode_1(mem, target, y),\n\n VideoMode::_2 => self.draw_line_mode_2(mem, target, y),\n\n VideoMode::_3 => self.draw_line_mode_3(mem, target, y),\n\n VideoMode::_4 => self.draw_line_mode_4(mem, target, y),\n\n VideoMode::_5 => self.draw_line_mode_5(mem, target, y),\n\n VideoMode::_6 => self.draw_line_mode_6(mem, target, y),\n\n VideoMode::_7 => self.draw_line_mode_7(mem, target, y),\n\n }\n\n }\n\n}\n\n\n\n// Caches\n\nimpl Renderer {\n\n pub fn setup_caches(&mut self, mem: &mut VideoMem) {\n","file_path":"oxide-7/src/video/render/drawing/mod.rs","rank":93,"score":70776.09606568191},{"content":" }\n\n }\n\n }\n\n\n\n fn draw_mode7_bg1_to_line(&self, mem: &VideoMem, main_line: &mut [Option<u8>], sub_line: &mut [Option<u8>], y: usize) {\n\n let vram = mem.get_vram();\n\n let regs = mem.get_bg_registers();\n\n let window_regs = mem.get_window_registers();\n\n\n\n let actual_y = y + 1;\n\n\n\n let mut main_window = [true; H_RES];\n\n window_regs.bg_window(BG::_1, Screen::Main, &mut main_window);\n\n let mut sub_window = [true; H_RES];\n\n window_regs.bg_window(BG::_1, Screen::Sub, &mut sub_window);\n\n\n\n for (x, (main, sub)) in main_line.iter_mut().zip(sub_line.iter_mut()).enumerate() {\n\n let x_in = if regs.mode_7_flip_x() {x ^ 0xFF} else {x};\n\n let y_in = if regs.mode_7_flip_y() {actual_y ^ 0xFF} else {actual_y};\n\n let (bg_x, bg_y) = regs.calc_mode_7(x_in as i16, y_in as i16);\n","file_path":"oxide-7/src/video/render/drawing/mod.rs","rank":94,"score":70775.99877531786},{"content":" let pix = get_mode_7_texel(vram, x_val, y_val);\n\n let pix_out = if pix == 0 {None} else {Some(pix)};\n\n\n\n if main_window[x] { // If pixel shows through main window.\n\n *main = pix_out;\n\n }\n\n if sub_window[x] { // If pixel shows through sub window.\n\n *sub = pix_out;\n\n }\n\n }\n\n }\n\n }\n\n\n\n fn draw_mode7_bg2_to_line(&self, mem: &VideoMem, main_line: &mut [u8], sub_line: &mut [u8], y: usize) {\n\n let vram = mem.get_vram();\n\n let regs = mem.get_bg_registers();\n\n let window_regs = mem.get_window_registers();\n\n\n\n let actual_y = y + 1;\n\n\n","file_path":"oxide-7/src/video/render/drawing/mod.rs","rank":95,"score":70774.86801298782},{"content":" let mut main_sprite_pixels = [SpritePixel::None; H_RES];\n\n let mut sub_sprite_pixels = [SpritePixel::None; H_RES];\n\n self.draw_sprites_to_line(mem, &mut main_sprite_pixels, &mut sub_sprite_pixels, y as u8);\n\n let mut main_bg1_pixels = [None; H_RES];\n\n let mut sub_bg1_pixels = [None; H_RES];\n\n self.draw_mode7_bg1_to_line(mem, &mut main_bg1_pixels, &mut sub_bg1_pixels, y);\n\n let mut main_bg2_pixels = [0_u8; H_RES];\n\n let mut sub_bg2_pixels = [0_u8; H_RES];\n\n let ext_bg = window_regs.use_ext_bg();\n\n if ext_bg {\n\n self.draw_mode7_bg2_to_line(mem, &mut main_bg2_pixels, &mut sub_bg2_pixels, y);\n\n }\n\n\n\n for (x, out) in target.chunks_mut(8).skip(target_start).take(H_RES).enumerate() {\n\n let main = {\n\n let sprite_pix = main_sprite_pixels[x];\n\n let bg1_pix = main_bg1_pixels[x];\n\n let bg2_pix = main_bg2_pixels[x];\n\n self.eval_mode_7(window_regs.use_direct_colour(), ext_bg, sprite_pix, bg1_pix, bg2_pix)\n\n };\n","file_path":"oxide-7/src/video/render/drawing/mod.rs","rank":96,"score":70774.83217556382},{"content":" } // for sprite x pixels\n\n });\n\n }\n\n\n\n fn draw_bg_to_line(&self, mem: &VideoMem, bg: BG, main_line: &mut [BGData], sub_line: &mut [BGData], y: usize, offset_per_tile: bool) {\n\n let regs = mem.get_bg_registers();\n\n let window_regs = mem.get_window_registers();\n\n\n\n let actual_y = y + 1;\n\n\n\n // TODO: separate mosaic stuff?\n\n let mosaic_amount = if regs.bg_mosaic_enabled(bg) {\n\n regs.bg_mosaic_mask()\n\n } else {\n\n 0\n\n } as usize;\n\n let mut x_mosaic_offset = 0;\n\n\n\n let y_mosaic_offset = y % (mosaic_amount + 1);\n\n let line_y = actual_y - y_mosaic_offset;\n","file_path":"oxide-7/src/video/render/drawing/mod.rs","rank":97,"score":70774.81309964026},{"content":" let sprite_pix = main_sprite_pixels[x];\n\n let bg1_pix = main_bg1_pixels[x];\n\n let bg2_pix = main_bg2_pixels[x];\n\n self.eval_mode_2(sprite_pix, bg1_pix, bg2_pix)\n\n };\n\n let sub = if window_regs.use_subscreen() {\n\n let sprite_pix = sub_sprite_pixels[x];\n\n let bg1_pix = sub_bg1_pixels[x];\n\n let bg2_pix = sub_bg2_pixels[x];\n\n self.eval_mode_2(sprite_pix, bg1_pix, bg2_pix).any()\n\n } else {\n\n None\n\n };\n\n\n\n self.write_pixel(window_regs, out, main, sub, brightness, x as u8);\n\n }\n\n }\n\n\n\n fn draw_line_mode_3(&self, mem: &VideoMem, target: &mut [u8], y: usize) {\n\n let brightness = mem.get_bg_registers().get_brightness();\n","file_path":"oxide-7/src/video/render/drawing/mod.rs","rank":98,"score":70774.80512121061},{"content":" self.palettes.make_obj_palette(mem);\n\n }\n\n mem.cgram_reset_dirty();\n\n }\n\n\n\n // Switch mode: setup backgrounds.\n\n fn switch_mode(&mut self, mode: VideoMode) {\n\n use VideoMode::*;\n\n\n\n //println!(\"Switching mode to {:?}\", mode);\n\n\n\n self.mode = mode;\n\n match mode {\n\n _0 => {\n\n self.bg_pattern_mem[0] = PatternMem::new(BitsPerPixel::_2);\n\n if self.bg_pattern_mem[1].get_bits_per_pixel() != BitsPerPixel::_2 {\n\n self.bg_pattern_mem[1] = PatternMem::new(BitsPerPixel::_2);\n\n }\n\n },\n\n _1 => {\n","file_path":"oxide-7/src/video/render/drawing/mod.rs","rank":99,"score":70774.73295727067}],"string":"[\n {\n \"content\": \"type CartMappingFn = fn(u8, u16) -> CartDevice;\\n\\n\\n\",\n \"file_path\": \"oxide-7/src/mem/rom/mod.rs\",\n \"rank\": 1,\n \"score\": 252137.86479187425\n },\n {\n \"content\": \"fn map_hirom_bank(in_bank: u8, mapping: u8, lo_rom: bool, bank_addr: u16) -> u8 {\\n\\n let mapped_bank = map_bank(in_bank, mapping);\\n\\n if lo_rom {\\n\\n if bank_addr >= 0x8000 {\\n\\n (mapped_bank * 2) + 1\\n\\n } else {\\n\\n mapped_bank * 2\\n\\n }\\n\\n } else {\\n\\n mapped_bank\\n\\n }\\n\\n}\",\n \"file_path\": \"oxide-7/src/expansion/sa1/mem/mod.rs\",\n \"rank\": 2,\n \"score\": 223483.82814469648\n },\n {\n \"content\": \"#[inline]\\n\\nfn get_mode_7_texel(vram: &[u8], x: usize, y: usize) -> u8 {\\n\\n // Find tile num.\\n\\n let tile_x = x / 8;\\n\\n let tile_y = y / 8;\\n\\n let tile = (tile_y * 128) + tile_x;\\n\\n let tile_num = vram[tile * 2] as usize;\\n\\n\\n\\n // Find pixel in tile.\\n\\n let tex_x = x % 8;\\n\\n let tex_y = y % 8;\\n\\n let tex_num = (tex_y * 8) + tex_x;\\n\\n \\n\\n // Lookup pixel in vram.\\n\\n let tile_offset = tile_num * 128;\\n\\n vram[tile_offset + (tex_num * 2) + 1]\\n\\n}\",\n \"file_path\": \"oxide-7/src/video/render/drawing/mod.rs\",\n \"rank\": 3,\n \"score\": 198832.13223468527\n },\n {\n \"content\": \"fn clear_line(target: &mut [u8], y: usize) {\\n\\n use crate::constants::screen::H_RES;\\n\\n\\n\\n for d in target.iter_mut().skip(y * H_RES * 8).take(H_RES * 8) {\\n\\n *d = 0;\\n\\n }\\n\\n}\",\n \"file_path\": \"oxide-7/src/video/render/mod.rs\",\n \"rank\": 4,\n \"score\": 185406.74917752366\n },\n {\n \"content\": \"fn map_bank(in_bank: u8, mapping: u8) -> u8 {\\n\\n let lo = lo_nybble!(in_bank);\\n\\n let hi = (mapping % 8) << 4;\\n\\n hi | lo\\n\\n}\\n\\n\\n\",\n \"file_path\": \"oxide-7/src/expansion/sa1/mem/mod.rs\",\n \"rank\": 5,\n \"score\": 172817.41629470972\n },\n {\n \"content\": \"pub fn step_size(param: u8) -> Option<usize> {\\n\\n match param {\\n\\n 0x00 => None,\\n\\n 0x01 => Some(2048),\\n\\n 0x02 => Some(1536),\\n\\n 0x03 => Some(1280),\\n\\n 0x04 => Some(1024),\\n\\n 0x05 => Some(768),\\n\\n 0x06 => Some(640),\\n\\n 0x07 => Some(512),\\n\\n 0x08 => Some(384),\\n\\n 0x09 => Some(320),\\n\\n 0x0A => Some(256),\\n\\n 0x0B => Some(192),\\n\\n 0x0C => Some(160),\\n\\n 0x0D => Some(128),\\n\\n 0x0E => Some(96),\\n\\n 0x0F => Some(80),\\n\\n 0x10 => Some(64),\\n\\n 0x11 => Some(48),\\n\",\n \"file_path\": \"oxide-7/src/audio/dsp/envelope/gain.rs\",\n \"rank\": 7,\n \"score\": 164251.98278013268\n },\n {\n \"content\": \"#[inline]\\n\\nfn sign_extend(val: u16) -> u16 {\\n\\n if test_bit!(val, 12) {\\n\\n val | 0xE000\\n\\n } else {\\n\\n val & 0x1FFF\\n\\n }\\n\\n}\",\n \"file_path\": \"oxide-7/src/video/ram/bgregs.rs\",\n \"rank\": 8,\n \"score\": 149375.5359737318\n },\n {\n \"content\": \"// Messages to send to the render thread.\\n\\nenum RendererMessage {\\n\\n StartFrame(RenderTarget), // Begin frame, and target the provided byte array.\\n\\n DrawLine(usize),\\n\\n}\\n\\n\\n\\n// Renderer for video that spawns a thread to render on.\\n\\npub struct RenderThread {\\n\\n sender: Sender<RendererMessage>,\\n\\n receiver: Receiver<()>,\\n\\n}\\n\\n\\n\\nimpl RenderThread {\\n\\n pub fn new(mem: super::VRamRef) -> Self {\\n\\n let (send_msg, recv_msg) = bounded(224);\\n\\n let (send_reply, recv_reply) = bounded(224);\\n\\n\\n\\n std::thread::spawn(move || {\\n\\n use RendererMessage::*;\\n\\n let mut target = None;\\n\\n let mut renderer = drawing::Renderer::new();\\n\",\n \"file_path\": \"oxide-7/src/video/render/mod.rs\",\n \"rank\": 9,\n \"score\": 138092.8393030044\n },\n {\n \"content\": \"// Renderer trait.\\n\\npub trait Renderable {\\n\\n fn frame_start(&mut self);\\n\\n fn draw_line(&mut self, y: u16);\\n\\n fn frame_end(&mut self);\\n\\n}\\n\\n\\n\\n// Mode\\n\\n#[derive(Clone, Copy, PartialEq, Debug)]\\n\\npub enum VideoMode {\\n\\n _0 = 0,\\n\\n _1 = 1,\\n\\n _2 = 2,\\n\\n _3 = 3,\\n\\n _4 = 4,\\n\\n _5 = 5,\\n\\n _6 = 6,\\n\\n _7 = 7\\n\\n}\\n\\n\\n\\nimpl From<u8> for VideoMode {\\n\",\n \"file_path\": \"oxide-7/src/video/render/mod.rs\",\n \"rank\": 10,\n \"score\": 135721.9189237412\n },\n {\n \"content\": \"// Memory Bus to attach to CPU.\\n\\npub trait MemBus {\\n\\n fn read(&mut self, addr: u32) -> (u8, usize);\\n\\n fn write(&mut self, addr: u32, data: u8) -> usize;\\n\\n fn clock(&mut self, cycles: usize) -> Interrupt;\\n\\n}\\n\\n\\n\\n/// Random access memory.\\n\\n#[derive(Default)]\\n\\npub struct RAM {\\n\\n data: Vec<u8>\\n\\n}\\n\\n\\n\\nimpl RAM {\\n\\n pub fn new(size: usize) -> Self {\\n\\n RAM {\\n\\n data: vec![0; size]\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn read(&self, addr: u32) -> u8 {\\n\",\n \"file_path\": \"oxide-7/src/mem/mod.rs\",\n \"rank\": 11,\n \"score\": 135096.11073126216\n },\n {\n \"content\": \"pub trait SPCMem {\\n\\n fn read(&mut self, addr: u16) -> u8;\\n\\n fn write(&mut self, addr: u16, data: u8);\\n\\n fn clock(&mut self, cycles: usize);\\n\\n}\\n\\n\\n\\npub struct SPCBus {\\n\\n ram: RAM,\\n\\n\\n\\n ipl_rom: &'static [u8; 64],\\n\\n\\n\\n // Registers\\n\\n control: SPCControl,\\n\\n dsp_reg_addr: u8,\\n\\n dsp: DSP,\\n\\n\\n\\n // Port data sent in from CPU.\\n\\n ports_cpu_to_apu: [u8; 4],\\n\\n\\n\\n // Port data sent out from APU.\\n\",\n \"file_path\": \"oxide-7/src/audio/mem/mod.rs\",\n \"rank\": 12,\n \"score\": 132114.86987482526\n },\n {\n \"content\": \"pub fn create_sram(file_name: &str, size: usize) -> Result<Box<dyn SRAM>, String> {\\n\\n if size == 0 {\\n\\n Ok(Box::new(EmptySRAM::new()))\\n\\n } else {\\n\\n let sram = SizedSRAM::new(file_name, size)?;\\n\\n Ok(Box::new(sram))\\n\\n }\\n\\n}\\n\\n\\n\\n/// Used in cartridges that have SRAM.\\n\\npub struct SizedSRAM {\\n\\n save_file: BufWriter<File>,\\n\\n ram: RAM,\\n\\n\\n\\n mask: u32, // Mask when reading/writing\\n\\n\\n\\n dirty: bool,\\n\\n}\\n\\n\\n\\nimpl SizedSRAM {\\n\",\n \"file_path\": \"oxide-7/src/mem/rom/sram.rs\",\n \"rank\": 14,\n \"score\": 128132.19800082978\n },\n {\n \"content\": \"struct CartMapping {\\n\\n start_bank: u8,\\n\\n end_bank: u8,\\n\\n start_addr: u16,\\n\\n\\n\\n addr_mapping: CartMappingFn\\n\\n}\\n\\n\\n\\nimpl CartMapping {\\n\\n fn new(start_bank: u8, end_bank: u8, start_addr: u16, mapping: CartMappingFn) -> Self {\\n\\n Self {\\n\\n start_bank: start_bank,\\n\\n end_bank: end_bank,\\n\\n start_addr: start_addr,\\n\\n addr_mapping: mapping,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"oxide-7/src/mem/rom/mod.rs\",\n \"rank\": 15,\n \"score\": 127178.7721077572\n },\n {\n \"content\": \"struct CartBuilder {\\n\\n mappings: Vec<CartMapping>,\\n\\n mapping_mode: CartMappingMode,\\n\\n\\n\\n rom: Option<ROM>,\\n\\n ram: Option<Box<dyn SRAM>>,\\n\\n expansion: Option<Box<dyn Expansion>>,\\n\\n\\n\\n fast_rom: bool,\\n\\n\\n\\n name: String\\n\\n}\\n\\n\\n\\nimpl CartBuilder {\\n\\n fn new(mode: CartMappingMode) -> Self {\\n\\n CartBuilder {\\n\\n mappings: Vec::new(),\\n\\n mapping_mode: mode,\\n\\n\\n\\n rom: None,\\n\",\n \"file_path\": \"oxide-7/src/mem/rom/mod.rs\",\n \"rank\": 16,\n \"score\": 127178.7721077572\n },\n {\n \"content\": \"enum CartDevice {\\n\\n ROM(u8, u16),\\n\\n RAM(u32),\\n\\n Expansion(u8, u16)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"oxide-7/src/mem/rom/mod.rs\",\n \"rank\": 17,\n \"score\": 127178.7721077572\n },\n {\n \"content\": \"enum CartMappingMode {\\n\\n Lo,\\n\\n LoLarge,\\n\\n Hi,\\n\\n ExHi,\\n\\n SA,\\n\\n SuperFX\\n\\n}\\n\\n\\n\",\n \"file_path\": \"oxide-7/src/mem/rom/mod.rs\",\n \"rank\": 18,\n \"score\": 124020.9410867754\n },\n {\n \"content\": \"pub fn debug_mode(snes: &mut SNES) {\\n\\n // Debug mode.\\n\\n snes.start_frame();\\n\\n println!(\\\"Debug mode.\\\");\\n\\n println!(\\\"Enter 'h' for help.\\\");\\n\\n let mut breaks = std::collections::BTreeSet::new();\\n\\n let mut stack_trace = Vec::new();\\n\\n loop {\\n\\n let mut input = String::new();\\n\\n match std::io::stdin().read_line(&mut input) {\\n\\n Ok(_) => if input.starts_with(\\\"b:\\\") {\\n\\n // Add breakpoint\\n\\n match u32::from_str_radix(&input[2..].trim(), 16) {\\n\\n Ok(num) => {\\n\\n println!(\\\"Inserted breakpoint at ${:06X}\\\", num);\\n\\n breaks.insert(num);\\n\\n },\\n\\n Err(e) => println!(\\\"Invalid breakpoint: {}\\\", e),\\n\\n }\\n\\n } else if input.starts_with(\\\"c:\\\") {\\n\",\n \"file_path\": \"oxide-7-bin/src/debug/mod.rs\",\n \"rank\": 19,\n \"score\": 122105.68643811112\n },\n {\n \"content\": \"pub fn create_cart(cart_path: &str, save_path: &str, dsp_path: Option<&str>) -> Box<Cart> {\\n\\n let rom_file = File::open(cart_path).expect(&format!(\\\"Couldn't open file {}\\\", cart_path));\\n\\n //let rom_size = rom_file.metadata().expect(\\\"Couldn't get metadata for file.\\\").len();\\n\\n\\n\\n let mut reader = BufReader::new(rom_file);\\n\\n let mut header = ROMHeader::new();\\n\\n\\n\\n let cart = if header.try_lo(&mut reader) {\\n\\n let sram = create_sram(save_path, header.sram_size()).expect(\\\"Couldn't make save file.\\\");\\n\\n let name = header.rom_name();\\n\\n\\n\\n if header.rom_size() > LOROM_LARGE_SIZE {\\n\\n println!(\\\"LOROM Large {:X}: {}\\\", header.rom_mapping(), name);\\n\\n Cart::new_lorom_large(reader, sram)\\n\\n } else {\\n\\n println!(\\\"LOROM {:X}: {}\\\", header.rom_mapping(), name);\\n\\n Cart::new_lorom(reader, sram)\\n\\n }.named(name)\\n\\n .fast_rom(header.fast_rom())\\n\\n\\n\",\n \"file_path\": \"oxide-7/src/mem/rom/mod.rs\",\n \"rank\": 20,\n \"score\": 119856.17552274684\n },\n {\n \"content\": \"// Convert master cycles into SPC cycles.\\n\\n// SNES clock: 21_442_080 Hz\\n\\n// SPC clock: 1_024_000 Hz\\n\\nfn calc_cycles(master_cycles: usize) -> f64 {\\n\\n (master_cycles as f64) * SPC_RATIO\\n\\n}\",\n \"file_path\": \"oxide-7/src/audio/mod.rs\",\n \"rank\": 21,\n \"score\": 110988.30769056921\n },\n {\n \"content\": \"// Step the CPU, and add the PC to the stack trace if it calls.\\n\\nfn step_and_trace(snes: &mut SNES, stack_trace: &mut Vec<u32>, print: bool) {\\n\\n let instr = snes.get_instr();\\n\\n match instr[0] {\\n\\n 0x22 | 0x20 | 0xFC => {\\n\\n stack_trace.push(make24!(snes.get_state().pb, snes.get_state().pc));\\n\\n },\\n\\n 0x6B | 0x60 => {\\n\\n stack_trace.pop();\\n\\n },\\n\\n _ => {}\\n\\n }\\n\\n\\n\\n if print {\\n\\n let state = snes.get_state();\\n\\n let pc = make24!(state.pb, state.pc);\\n\\n println!(\\\"${:06X}: ${:02X} ({:02X} {:02X} {:02X})\\\", pc, instr[0], instr[1], instr[2], instr[3]);\\n\\n }\\n\\n\\n\\n if snes.step() {\\n\\n snes.start_frame();\\n\\n }\\n\\n}\",\n \"file_path\": \"oxide-7-bin/src/debug/mod.rs\",\n \"rank\": 22,\n \"score\": 101156.36477162017\n },\n {\n \"content\": \"#[inline]\\n\\nfn sign_extend_4(val: u8) -> i8 {\\n\\n if test_bit!(val, 3, u8) {\\n\\n (val | 0xF0) as i8\\n\\n } else {\\n\\n val as i8\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"oxide-7/src/audio/dsp/brr.rs\",\n \"rank\": 23,\n \"score\": 97908.31309306914\n },\n {\n \"content\": \"enum ScreenHeight {\\n\\n _128,\\n\\n _160,\\n\\n _192,\\n\\n Obj\\n\\n}\\n\\n\\n\\nimpl From<ScreenMode> for ScreenHeight {\\n\\n fn from(val: ScreenMode) -> Self {\\n\\n if val.contains(ScreenMode::HT0 | ScreenMode::HT1) {\\n\\n ScreenHeight::Obj\\n\\n } else if val.contains(ScreenMode::HT0) {\\n\\n ScreenHeight::_160\\n\\n } else if val.contains(ScreenMode::HT1) {\\n\\n ScreenHeight::_192\\n\\n } else {\\n\\n ScreenHeight::_128\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n// Represents a row of 8 pixels.\\n\\n// Each pixel is 2, 4, or 8 bits.\\n\",\n \"file_path\": \"oxide-7/src/expansion/superfx/pixelcache.rs\",\n \"rank\": 24,\n \"score\": 96119.79108523217\n },\n {\n \"content\": \"#[derive(Clone, Copy)]\\n\\nenum WindowOp {\\n\\n OR,\\n\\n AND,\\n\\n XOR,\\n\\n XNOR\\n\\n}\\n\\n\\n\\nimpl From<u8> for WindowOp {\\n\\n // Should be from a 2-bit value.\\n\\n fn from(val: u8) -> Self {\\n\\n const MASK_LOGIC_OR: u8 = 0;\\n\\n const MASK_LOGIC_AND: u8 = 1;\\n\\n const MASK_LOGIC_XOR: u8 = 2;\\n\\n const MASK_LOGIC_XNOR: u8 = 3;\\n\\n\\n\\n match val {\\n\\n MASK_LOGIC_OR => Self::OR,\\n\\n MASK_LOGIC_AND => Self::AND,\\n\\n MASK_LOGIC_XOR => Self::XOR,\\n\\n MASK_LOGIC_XNOR => Self::XNOR,\\n\",\n \"file_path\": \"oxide-7/src/video/ram/windowregs.rs\",\n \"rank\": 25,\n \"score\": 95389.6978125322\n },\n {\n \"content\": \"// Address Bus B, used for hardware registers.\\n\\nstruct AddrBusB {\\n\\n ppu: PPU,\\n\\n apu: APU,\\n\\n\\n\\n open_bus: u8\\n\\n}\\n\\n\\n\\nimpl AddrBusB {\\n\\n fn new() -> Self {\\n\\n AddrBusB {\\n\\n ppu: PPU::new(),\\n\\n apu: APU::new(),\\n\\n\\n\\n open_bus: 0,\\n\\n }\\n\\n }\\n\\n\\n\\n fn read(&mut self, addr: u8) -> u8 {\\n\\n match addr {\\n\\n 0x37 => self.ppu.latch_hv(),\\n\",\n \"file_path\": \"oxide-7/src/mem/bus.rs\",\n \"rank\": 26,\n \"score\": 95017.51355010997\n },\n {\n \"content\": \"enum ArithMode {\\n\\n Multiply,\\n\\n Divide,\\n\\n MultiplySum,\\n\\n Res\\n\\n}\\n\\n\\n\\nimpl From<u8> for ArithMode {\\n\\n fn from(val: u8) -> Self {\\n\\n use ArithMode::*;\\n\\n match val & 0x3 {\\n\\n 0 => Multiply,\\n\\n 1 => Divide,\\n\\n 2 => MultiplySum,\\n\\n 3 => Res,\\n\\n _ => unreachable!()\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"oxide-7/src/expansion/sa1/mem/arith.rs\",\n \"rank\": 27,\n \"score\": 92822.07354881272\n },\n {\n \"content\": \"/// Save RAM.\\n\\n/// This may or may not exist based on the cartridge.\\n\\npub trait SRAM {\\n\\n fn read(&self, addr: u32) -> u8;\\n\\n fn write(&mut self, addr: u32, data: u8);\\n\\n\\n\\n /// Flush the SRAM to the save file specified.\\n\\n fn flush(&mut self);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"oxide-7/src/mem/rom/sram.rs\",\n \"rank\": 28,\n \"score\": 92646.44013995858\n },\n {\n \"content\": \"pub trait Expansion {\\n\\n fn read(&mut self, bank: u8, addr: u16) -> u8;\\n\\n fn write(&mut self, bank: u8, addr: u16, data: u8);\\n\\n\\n\\n fn clock(&mut self, cycles: usize) -> Interrupt;\\n\\n fn flush(&mut self) {}\\n\\n}\\n\\n\\n\\nimpl Expansion for DSP {\\n\\n fn read(&mut self, bank: u8, _addr: u16) -> u8 {\\n\\n match bank {\\n\\n 0 => self.read_dr(),\\n\\n 1 => self.read_sr(),\\n\\n _ => unreachable!()\\n\\n }\\n\\n }\\n\\n\\n\\n fn write(&mut self, bank: u8, _addr: u16, data: u8) {\\n\\n match bank {\\n\\n 0 => self.write_dr(data),\\n\",\n \"file_path\": \"oxide-7/src/expansion/mod.rs\",\n \"rank\": 29,\n \"score\": 91101.52464350309\n },\n {\n \"content\": \"fn help() {\\n\\n println!(\\\"b:x: New breakpoint at memory location x (hex).\\\");\\n\\n println!(\\\"c:x: Clear breakpoint at memory location x (hex).\\\");\\n\\n println!(\\\"r: Keep running until a breakpoint is hit.\\\");\\n\\n println!(\\\"s: Step a single instruction.\\\");\\n\\n println!(\\\"s:x: Step multiple instructions (base 10).\\\");\\n\\n println!(\\\"t: Print the stack trace (all the call locations).\\\");\\n\\n println!(\\\"p: Print the current state of the CPU.\\\");\\n\\n println!(\\\"p:x: Print x - if x is a number, print the contents of that address, otherwise print the register.\\\");\\n\\n println!(\\\"p:x-y: Print the memory in the range x -> y.\\\");\\n\\n println!(\\\"q: Quit execution.\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"oxide-7-bin/src/debug/mod.rs\",\n \"rank\": 30,\n \"score\": 90260.86577094428\n },\n {\n \"content\": \"#[inline]\\n\\nfn decompress_sample(head: BRRHead, encoded: u8, last1: i16, last2: i16) -> i16 {\\n\\n let unpacked = sign_extend_4(encoded) as i16;\\n\\n let base = (unpacked << head.shift()) >> 1;\\n\\n let samp = base + head.calc_coef_a(last1) + head.calc_coef_b(last2);\\n\\n sign_extend_15(samp)\\n\\n}\\n\\n\\n\\n// Sign extend a 4-bit signed value to 8 bits.\\n\",\n \"file_path\": \"oxide-7/src/audio/dsp/brr.rs\",\n \"rank\": 31,\n \"score\": 76208.75943052795\n },\n {\n \"content\": \"// Types to assist with drawing.\\n\\n\\n\\nuse crate::video::render::Colour;\\n\\n\\n\\n// A sprite colour for final compositing.\\n\\n#[derive(Clone, Copy)]\\n\\npub struct SpriteColour {\\n\\n pub colour: Colour, // The colour of the sprite\\n\\n pub col_math: bool // Should it participate in colour math\\n\\n}\\n\\n\\n\\n// A sprite pixel.\\n\\n#[derive(Clone, Copy)]\\n\\npub enum SpritePixel {\\n\\n // Colours with respective priorities.\\n\\n Prio3(SpriteColour),\\n\\n Prio2(SpriteColour),\\n\\n Prio1(SpriteColour),\\n\\n Prio0(SpriteColour),\\n\\n Masked, // This pixel is masked and no sprites should appear here.\\n\",\n \"file_path\": \"oxide-7/src/video/render/drawing/types.rs\",\n \"rank\": 32,\n \"score\": 75645.21896253202\n },\n {\n \"content\": \" _ => panic!(\\\"Don't call this on pixels with no colour value.\\\")\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n// A colour value with source information.\\n\\npub enum Pixel {\\n\\n BG1(Colour),\\n\\n BG2(Colour),\\n\\n BG3(Colour),\\n\\n BG4(Colour),\\n\\n ObjHi(Colour), // Uses object palette 4-7, uses colour math\\n\\n ObjLo(Colour), // Uses object palette 0-3, doesn't use colmath\\n\\n None\\n\\n}\\n\\n\\n\\nimpl Pixel {\\n\\n // Get the colour from if there is one, and discard source information.\\n\\n pub fn any(self) -> Option<Colour> {\\n\\n match self {\\n\",\n \"file_path\": \"oxide-7/src/video/render/drawing/types.rs\",\n \"rank\": 33,\n \"score\": 75637.98090194052\n },\n {\n \"content\": \" None // No sprites found on this pixel.\\n\\n}\\n\\n\\n\\nimpl SpritePixel {\\n\\n // Test if the pixel is masked.\\n\\n #[inline]\\n\\n pub fn is_masked(&self) -> bool {\\n\\n match self {\\n\\n SpritePixel::Masked => true,\\n\\n _ => false\\n\\n }\\n\\n }\\n\\n\\n\\n // Get the final pixel out, and test it to see if it should participate in colour math.\\n\\n pub fn pixel(&self) -> Pixel {\\n\\n match self {\\n\\n SpritePixel::Prio3(c) => if c.col_math {Pixel::ObjHi(c.colour)} else {Pixel::ObjLo(c.colour)},\\n\\n SpritePixel::Prio2(c) => if c.col_math {Pixel::ObjHi(c.colour)} else {Pixel::ObjLo(c.colour)},\\n\\n SpritePixel::Prio1(c) => if c.col_math {Pixel::ObjHi(c.colour)} else {Pixel::ObjLo(c.colour)},\\n\\n SpritePixel::Prio0(c) => if c.col_math {Pixel::ObjHi(c.colour)} else {Pixel::ObjLo(c.colour)},\\n\",\n \"file_path\": \"oxide-7/src/video/render/drawing/types.rs\",\n \"rank\": 34,\n \"score\": 75633.25115310909\n },\n {\n \"content\": \" Pixel::BG1(c) => Some(c),\\n\\n Pixel::BG2(c) => Some(c),\\n\\n Pixel::BG3(c) => Some(c),\\n\\n Pixel::BG4(c) => Some(c),\\n\\n Pixel::ObjHi(c) => Some(c),\\n\\n Pixel::ObjLo(c) => Some(c),\\n\\n Pixel::None => None\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"oxide-7/src/video/render/drawing/types.rs\",\n \"rank\": 35,\n \"score\": 75628.62835560007\n },\n {\n \"content\": \" self.data[addr as usize]\\n\\n }\\n\\n\\n\\n pub fn write(&mut self, addr: u32, data: u8) {\\n\\n self.data[addr as usize] = data;\\n\\n }\\n\\n\\n\\n pub fn iter<'a>(&'a self, start: usize) -> RAMIter<'a> {\\n\\n RAMIter {\\n\\n ram: self,\\n\\n read_head: start\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// An iterator over RAM.\\n\\n/// Use RAM::iter to construct this.\\n\\npub struct RAMIter<'a> {\\n\\n ram: &'a RAM,\\n\\n read_head: usize\\n\",\n \"file_path\": \"oxide-7/src/mem/mod.rs\",\n \"rank\": 36,\n \"score\": 75083.28908867968\n },\n {\n \"content\": \"// Memory\\n\\nmod bus;\\n\\nmod dma;\\n\\npub mod rom;\\n\\n\\n\\npub use bus::AddrBusA;\\n\\n\\n\\nuse crate::common::Interrupt;\\n\\n\\n\\n// Memory Bus to attach to CPU.\\n\",\n \"file_path\": \"oxide-7/src/mem/mod.rs\",\n \"rank\": 37,\n \"score\": 75080.50839670034\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl Iterator for RAMIter<'_> {\\n\\n type Item = u8;\\n\\n\\n\\n fn next(&mut self) -> Option<Self::Item> {\\n\\n let data = self.ram.data[self.read_head];\\n\\n self.read_head = (self.read_head + 1) % self.ram.data.len();\\n\\n Some(data)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"oxide-7/src/mem/mod.rs\",\n \"rank\": 38,\n \"score\": 75077.90967280431\n },\n {\n \"content\": \"fn print(s: &str, snes: &mut SNES) {\\n\\n match s {\\n\\n \\\"a\\\" => println!(\\\"a: ${:04X}\\\", snes.get_state().a),\\n\\n \\\"x\\\" => println!(\\\"x: ${:04X}\\\", snes.get_state().x),\\n\\n \\\"y\\\" => println!(\\\"y: ${:04X}\\\", snes.get_state().y),\\n\\n \\\"s\\\" => println!(\\\"s: ${:04X}\\\", snes.get_state().s),\\n\\n \\\"db\\\" => println!(\\\"db: ${:02X}\\\", snes.get_state().db),\\n\\n \\\"dp\\\" => println!(\\\"dp: ${:04X}\\\", snes.get_state().dp),\\n\\n \\\"pb\\\" => println!(\\\"pb: ${:02X}\\\", snes.get_state().pb),\\n\\n \\\"pc\\\" => println!(\\\"pc: ${:04X}\\\", snes.get_state().pc),\\n\\n \\\"p\\\" => println!(\\\"p: b{:08b}\\\", snes.get_state().p),\\n\\n \\\"e\\\" => println!(\\\"e: {}\\\", snes.get_state().pe),\\n\\n s => {\\n\\n // Memory range\\n\\n if let Some(x) = s.find('-') {\\n\\n match u32::from_str_radix(&s[..x], 16) {\\n\\n Ok(start) => match u32::from_str_radix(&s[(x+1)..], 16) {\\n\\n Ok(end) => {\\n\\n println!(\\\"${:06X} - ${:06X}:\\\", start, end);\\n\\n let mems = (start..end).map(|n| format!(\\\"{:02X}\\\", snes.get_mem_at(n)))\\n\",\n \"file_path\": \"oxide-7-bin/src/debug/mod.rs\",\n \"rank\": 39,\n \"score\": 75039.77535309893\n },\n {\n \"content\": \" fn from(val: u8) -> Self {\\n\\n match val & bits![2, 1, 0] {\\n\\n 0 => VideoMode::_0,\\n\\n 1 => VideoMode::_1,\\n\\n 2 => VideoMode::_2,\\n\\n 3 => VideoMode::_3,\\n\\n 4 => VideoMode::_4,\\n\\n 5 => VideoMode::_5,\\n\\n 6 => VideoMode::_6,\\n\\n 7 => VideoMode::_7,\\n\\n _ => unreachable!()\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\npub type RenderTarget = Arc<Mutex<Box<[u8]>>>;\\n\\n\\n\\n#[derive(Clone, Copy, Debug)]\\n\\npub struct Colour {\\n\\n pub r: u8,\\n\",\n \"file_path\": \"oxide-7/src/video/render/mod.rs\",\n \"rank\": 40,\n \"score\": 73121.54988847628\n },\n {\n \"content\": \" pub g: u8,\\n\\n pub b: u8\\n\\n}\\n\\n\\n\\nimpl Colour {\\n\\n pub const fn new(r: u8, g: u8, b: u8) -> Self {\\n\\n Colour {\\n\\n r: r,\\n\\n g: g,\\n\\n b: b\\n\\n }\\n\\n }\\n\\n\\n\\n pub const fn zero() -> Colour {\\n\\n Colour {\\n\\n r: 0,\\n\\n g: 0,\\n\\n b: 0\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"oxide-7/src/video/render/mod.rs\",\n \"rank\": 41,\n \"score\": 73119.15835675334\n },\n {\n \"content\": \"// Tools for communicating with the renderer (and its thread on certain platforms).\\n\\n\\n\\n//mod bgcache;\\n\\nmod patternmem;\\n\\nmod drawing;\\n\\nmod palette;\\n\\n\\n\\nuse std::sync::{\\n\\n Arc, Mutex\\n\\n};\\n\\n\\n\\nuse crossbeam_channel::{\\n\\n bounded,\\n\\n Sender,\\n\\n Receiver\\n\\n};\\n\\n\\n\\n// Renderer trait.\\n\",\n \"file_path\": \"oxide-7/src/video/render/mod.rs\",\n \"rank\": 42,\n \"score\": 73118.29859513511\n },\n {\n \"content\": \"\\n\\n while let Ok(msg) = recv_msg.recv() {\\n\\n match msg {\\n\\n StartFrame(data) => {\\n\\n target = Some(data);\\n\\n },\\n\\n DrawLine(y) => {\\n\\n let mut mem = mem.lock().unwrap();\\n\\n send_reply.send(()).unwrap();\\n\\n if !mem.get_bg_registers().in_fblank() {\\n\\n renderer.setup_caches(&mut mem);\\n\\n let mut t = target.as_ref().unwrap().lock().unwrap();\\n\\n renderer.draw_line(&mem, &mut t, y);\\n\\n } else {\\n\\n let mut t = target.as_ref().unwrap().lock().unwrap();\\n\\n clear_line(&mut t, y);\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"oxide-7/src/video/render/mod.rs\",\n \"rank\": 43,\n \"score\": 73108.21688629618\n },\n {\n \"content\": \" });\\n\\n\\n\\n RenderThread {\\n\\n sender: send_msg,\\n\\n receiver: recv_reply,\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn start_frame(&mut self, target: RenderTarget) {\\n\\n self.sender\\n\\n .send(RendererMessage::StartFrame(target))\\n\\n .expect(\\\"Couldn't send start frame message!\\\");\\n\\n }\\n\\n\\n\\n pub fn draw_line(&mut self, y: usize) {\\n\\n self.sender\\n\\n .send(RendererMessage::DrawLine(y))\\n\\n .expect(\\\"Couldn't send draw line message!\\\");\\n\\n\\n\\n self.receiver\\n\\n .recv()\\n\\n .expect(\\\"Draw line\\\");\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"oxide-7/src/video/render/mod.rs\",\n \"rank\": 44,\n \"score\": 73108.02020795905\n },\n {\n \"content\": \"\\n\\n /*const fn red() -> Colour {\\n\\n Colour {\\n\\n r: 255,\\n\\n g: 0,\\n\\n b: 0\\n\\n }\\n\\n }\\n\\n const fn blue() -> Colour {\\n\\n Colour {\\n\\n r: 0,\\n\\n g: 0,\\n\\n b: 255\\n\\n }\\n\\n }\\n\\n const fn green() -> Colour {\\n\\n Colour {\\n\\n r: 0,\\n\\n g: 255,\\n\\n b: 0\\n\",\n \"file_path\": \"oxide-7/src/video/render/mod.rs\",\n \"rank\": 45,\n \"score\": 73096.53484012646\n },\n {\n \"content\": \" }\\n\\n }\\n\\n const fn yellow() -> Colour {\\n\\n Colour {\\n\\n r: 255,\\n\\n g: 255,\\n\\n b: 0\\n\\n }\\n\\n }*/\\n\\n}\\n\\n\\n\",\n \"file_path\": \"oxide-7/src/video/render/mod.rs\",\n \"rank\": 46,\n \"score\": 73096.53484012646\n },\n {\n \"content\": \" bgregs: Registers,\\n\\n windowregs: WindowRegisters,\\n\\n\\n\\n h_pos: u16,\\n\\n v_pos: u16,\\n\\n\\n\\n h_hi_byte: bool,\\n\\n v_hi_byte: bool,\\n\\n\\n\\n oam: OAM,\\n\\n cgram: CGRAM,\\n\\n vram: VRAM\\n\\n}\\n\\n\\n\\nimpl VideoMem {\\n\\n pub fn new() -> Self {\\n\\n VideoMem {\\n\\n bgregs: Registers::new(),\\n\\n windowregs: WindowRegisters::new(),\\n\\n\\n\",\n \"file_path\": \"oxide-7/src/video/ram/mod.rs\",\n \"rank\": 47,\n \"score\": 73005.4342471276\n },\n {\n \"content\": \"// Video memory. Connected to the B bus.\\n\\n\\n\\nmod bgregs;\\n\\nmod cgram;\\n\\nmod oam;\\n\\nmod vram;\\n\\nmod windowregs;\\n\\n\\n\\npub use bgregs::*;\\n\\nuse cgram::CGRAM;\\n\\nuse oam::OAM;\\n\\npub use oam::SpritePriority;\\n\\nuse vram::VRAM;\\n\\npub use windowregs::{\\n\\n Screen,\\n\\n WindowRegisters\\n\\n};\\n\\n\\n\\n// Struct containing OAM, CGRAM and VRAM.\\n\\npub struct VideoMem {\\n\",\n \"file_path\": \"oxide-7/src/video/ram/mod.rs\",\n \"rank\": 48,\n \"score\": 73002.62919577655\n },\n {\n \"content\": \"\\n\\n // Renderer methods to check dirtiness of data.\\n\\n pub fn is_cgram_bg_dirty(&self) -> bool {\\n\\n self.cgram.is_bg_dirty()\\n\\n }\\n\\n\\n\\n pub fn is_cgram_obj_dirty(&self) -> bool {\\n\\n self.cgram.is_obj_dirty()\\n\\n }\\n\\n\\n\\n pub fn cgram_reset_dirty(&mut self) {\\n\\n self.cgram.reset_dirty()\\n\\n }\\n\\n\\n\\n pub fn vram_is_dirty(&self, start_addr: u16) -> bool {\\n\\n self.vram.dirty_range(start_addr)\\n\\n }\\n\\n\\n\\n pub fn vram_reset_dirty_range(&mut self, read: &[u16]) {\\n\\n self.vram.reset_dirty_range(read);\\n\\n }\\n\\n\\n\\n pub fn vram_set_pattern_regions(&mut self, regions: Vec<(u16, u16)>) {\\n\\n self.vram.set_pattern_regions(regions);\\n\\n }\\n\\n}\",\n \"file_path\": \"oxide-7/src/video/ram/mod.rs\",\n \"rank\": 49,\n \"score\": 72997.81272144732\n },\n {\n \"content\": \" // Renderer methods to get raw data.\\n\\n pub fn get_oam<'a>(&'a self) -> &'a [oam::Object] {\\n\\n self.oam.ref_data()\\n\\n }\\n\\n\\n\\n pub fn get_cgram<'a>(&'a self) -> &'a [u8] {\\n\\n self.cgram.ref_data()\\n\\n }\\n\\n\\n\\n pub fn get_vram<'a>(&'a self) -> &'a [u8] {\\n\\n self.vram.ref_data()\\n\\n }\\n\\n\\n\\n pub fn get_bg_registers<'a>(&'a self) -> &'a Registers {\\n\\n &self.bgregs\\n\\n }\\n\\n\\n\\n pub fn get_window_registers<'a>(&'a self) -> &'a WindowRegisters {\\n\\n &self.windowregs\\n\\n }\\n\",\n \"file_path\": \"oxide-7/src/video/ram/mod.rs\",\n \"rank\": 50,\n \"score\": 72993.63912183336\n },\n {\n \"content\": \" h_pos: 0,\\n\\n v_pos: 0,\\n\\n\\n\\n h_hi_byte: false,\\n\\n v_hi_byte: false,\\n\\n\\n\\n oam: OAM::new(),\\n\\n cgram: CGRAM::new(),\\n\\n vram: VRAM::new()\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn read(&mut self, addr: u8) -> u8 {\\n\\n match addr {\\n\\n 0x34 => self.bgregs.read_mult_result_lo(),\\n\\n 0x35 => self.bgregs.read_mult_result_mid(),\\n\\n 0x36 => self.bgregs.read_mult_result_hi(),\\n\\n 0x38 => self.oam.read(),\\n\\n 0x39 => self.vram.read_lo(),\\n\\n 0x3A => self.vram.read_hi(),\\n\",\n \"file_path\": \"oxide-7/src/video/ram/mod.rs\",\n \"rank\": 51,\n \"score\": 72989.04865469942\n },\n {\n \"content\": \" },\\n\\n _ => unreachable!()\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn write(&mut self, addr: u8, data: u8) {\\n\\n match addr {\\n\\n 0x00 => self.bgregs.set_screen_display(data),\\n\\n\\n\\n 0x01 => self.bgregs.set_object_settings(data),\\n\\n 0x02 => self.oam.set_addr_lo(data),\\n\\n 0x03 => self.oam.set_addr_hi(data),\\n\\n 0x04 => self.oam.write(data),\\n\\n\\n\\n 0x05 => self.bgregs.set_bg_mode(data),\\n\\n 0x06 => self.bgregs.set_mosaic(data),\\n\\n 0x07 => self.bgregs.set_bg1_settings(data),\\n\\n 0x08 => self.bgregs.set_bg2_settings(data),\\n\\n 0x09 => self.bgregs.set_bg3_settings(data),\\n\\n 0x0A => self.bgregs.set_bg4_settings(data),\\n\",\n \"file_path\": \"oxide-7/src/video/ram/mod.rs\",\n \"rank\": 52,\n \"score\": 72988.58203335338\n },\n {\n \"content\": \" 0x2F => self.windowregs.set_sub_mask_desg(data),\\n\\n 0x30 => self.windowregs.set_colour_add_select(data),\\n\\n 0x31 => self.windowregs.set_colour_math_desg(data),\\n\\n 0x32 => self.windowregs.set_fixed_colour(data),\\n\\n 0x33 => self.windowregs.set_video_select(data),\\n\\n _ => unreachable!()\\n\\n }\\n\\n }\\n\\n\\n\\n // Set latched h or v pos.\\n\\n pub fn set_latched_hv(&mut self, h: u16, v: u16) {\\n\\n self.h_pos = h;\\n\\n self.v_pos = v;\\n\\n }\\n\\n\\n\\n // OAM address reset that happens at V-blank\\n\\n pub fn oam_reset(&mut self) {\\n\\n self.oam.reset();\\n\\n }\\n\\n\\n\",\n \"file_path\": \"oxide-7/src/video/ram/mod.rs\",\n \"rank\": 53,\n \"score\": 72985.6189986983\n },\n {\n \"content\": \" 0x1D => self.bgregs.set_mode7_matrix_c(data),\\n\\n 0x1E => self.bgregs.set_mode7_matrix_d(data),\\n\\n 0x1F => self.bgregs.set_mode7_centre_x(data),\\n\\n 0x20 => self.bgregs.set_mode7_centre_y(data),\\n\\n\\n\\n 0x21 => self.cgram.set_addr(data),\\n\\n 0x22 => self.cgram.write(data),\\n\\n \\n\\n 0x23 => self.windowregs.set_mask_bg1_2(data), // BG1&2 window\\n\\n 0x24 => self.windowregs.set_mask_bg3_4(data), // BG3&4 window\\n\\n 0x25 => self.windowregs.set_mask_obj_col(data), // Obj window\\n\\n 0x26 => self.windowregs.window_1_left = data,\\n\\n 0x27 => self.windowregs.window_1_right = data,\\n\\n 0x28 => self.windowregs.window_2_left = data,\\n\\n 0x29 => self.windowregs.window_2_right = data,\\n\\n 0x2A => self.windowregs.set_mask_logic_bg(data),\\n\\n 0x2B => self.windowregs.set_mask_logic_obj_col(data),\\n\\n 0x2C => self.windowregs.set_main_screen_desg(data),\\n\\n 0x2D => self.windowregs.set_sub_screen_desg(data),\\n\\n 0x2E => self.windowregs.set_main_mask_desg(data),\\n\",\n \"file_path\": \"oxide-7/src/video/ram/mod.rs\",\n \"rank\": 54,\n \"score\": 72982.92005250842\n },\n {\n \"content\": \" 0x3B => self.cgram.read(),\\n\\n 0x3C => if !self.h_hi_byte {\\n\\n self.h_hi_byte = true;\\n\\n lo!(self.h_pos)\\n\\n } else {\\n\\n self.h_hi_byte = false;\\n\\n hi!(self.h_pos)\\n\\n },\\n\\n 0x3D => if !self.v_hi_byte {\\n\\n self.v_hi_byte = true;\\n\\n lo!(self.v_pos)\\n\\n } else {\\n\\n self.v_hi_byte = false;\\n\\n hi!(self.v_pos)\\n\\n },\\n\\n 0x3E => 1, // PPU Status\\n\\n 0x3F => { // PPU Status\\n\\n self.h_hi_byte = false;\\n\\n self.v_hi_byte = false;\\n\\n 2\\n\",\n \"file_path\": \"oxide-7/src/video/ram/mod.rs\",\n \"rank\": 55,\n \"score\": 72982.51736959915\n },\n {\n \"content\": \" 0x0B => self.bgregs.set_bg12_char_addr(data),\\n\\n 0x0C => self.bgregs.set_bg34_char_addr(data),\\n\\n 0x0D => self.bgregs.set_bg1_scroll_x(data),\\n\\n 0x0E => self.bgregs.set_bg1_scroll_y(data),\\n\\n 0x0F => self.bgregs.set_bg2_scroll_x(data),\\n\\n 0x10 => self.bgregs.set_bg2_scroll_y(data),\\n\\n 0x11 => self.bgregs.set_bg3_scroll_x(data),\\n\\n 0x12 => self.bgregs.set_bg3_scroll_y(data),\\n\\n 0x13 => self.bgregs.set_bg4_scroll_x(data),\\n\\n 0x14 => self.bgregs.set_bg4_scroll_y(data),\\n\\n\\n\\n 0x15 => self.vram.set_port_control(data),\\n\\n 0x16 => self.vram.set_addr_lo(data),\\n\\n 0x17 => self.vram.set_addr_hi(data),\\n\\n 0x18 => self.vram.write_lo(data),\\n\\n 0x19 => self.vram.write_hi(data),\\n\\n\\n\\n 0x1A => self.bgregs.set_mode7_settings(data),\\n\\n 0x1B => self.bgregs.set_mode7_matrix_a(data),\\n\\n 0x1C => self.bgregs.set_mode7_matrix_b(data),\\n\",\n \"file_path\": \"oxide-7/src/video/ram/mod.rs\",\n \"rank\": 56,\n \"score\": 72978.42922893183\n },\n {\n \"content\": \"\\n\\n timer_0: Timer::new(128),\\n\\n timer_1: Timer::new(128),\\n\\n timer_2: Timer::new(16),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn read_port(&self, port_num: usize) -> u8 {\\n\\n self.ports_apu_to_cpu[port_num]\\n\\n }\\n\\n\\n\\n pub fn write_port(&mut self, port_num: usize, data: u8) {\\n\\n self.ports_cpu_to_apu[port_num] = data;\\n\\n }\\n\\n}\\n\\n\\n\\nimpl SPCMem for SPCBus {\\n\\n fn read(&mut self, addr: u16) -> u8 {\\n\\n match addr {\\n\\n 0xF1 => 0,\\n\",\n \"file_path\": \"oxide-7/src/audio/mem/mod.rs\",\n \"rank\": 57,\n \"score\": 72606.82791011181\n },\n {\n \"content\": \"// Memory for the SPC-700.\\n\\nmod timer;\\n\\n\\n\\nuse bitflags::bitflags;\\n\\nuse crossbeam_channel::Sender;\\n\\n\\n\\nuse crate::mem::RAM;\\n\\nuse timer::Timer;\\n\\nuse super::dsp::DSP;\\n\\n\\n\\nbitflags! {\\n\\n struct SPCControl: u8 {\\n\\n const ROM_ENABLE = bit!(7);\\n\\n const CLEAR_PORT_32 = bit!(5);\\n\\n const CLEAR_PORT_10 = bit!(4);\\n\\n const ENABLE_TIMER_2 = bit!(2);\\n\\n const ENABLE_TIMER_1 = bit!(1);\\n\\n const ENABLE_TIMER_0 = bit!(0);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"oxide-7/src/audio/mem/mod.rs\",\n \"rank\": 58,\n \"score\": 72606.60445167412\n },\n {\n \"content\": \"// ROM.\\n\\npub struct ROM {\\n\\n data: Vec<u8>,\\n\\n bank_size: usize\\n\\n}\\n\\n\\n\\nimpl ROM {\\n\\n fn new(mut cart_file: BufReader<File>, bank_size: usize) -> Self {\\n\\n // read and store\\n\\n let mut buffer = Vec::new();\\n\\n cart_file.seek(SeekFrom::Start(0)).expect(\\\"couldn't seek in file\\\");\\n\\n cart_file.read_to_end(&mut buffer).expect(\\\"couldn't read file\\\");\\n\\n ROM {\\n\\n data: buffer,\\n\\n bank_size: bank_size\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn read(&mut self, bank: u8, addr: u16) -> u8 {\\n\\n let bank_offset = (bank as usize) * self.bank_size;\\n\\n self.data[bank_offset + (addr as usize)]\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"oxide-7/src/mem/rom/mod.rs\",\n \"rank\": 59,\n \"score\": 72603.91935405244\n },\n {\n \"content\": \" // Write to expansion port slot.\\n\\n pub fn write_exp(&mut self, addr: u16, data: u8) {\\n\\n self.expansion.as_mut().map_or((), |e| e.write(0, addr, data));\\n\\n }\\n\\n\\n\\n pub fn flush(&mut self) {\\n\\n self.ram.flush();\\n\\n if let Some(e) = self.expansion.as_mut() {\\n\\n e.flush();\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn set_rom_speed(&mut self, data: u8) {\\n\\n self.rom_speed = if self.fast_rom && test_bit!(data, SPEED_BIT, u8) {\\n\\n timing::FAST_MEM_ACCESS\\n\\n } else {\\n\\n timing::SLOW_MEM_ACCESS\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"oxide-7/src/mem/rom/mod.rs\",\n \"rank\": 60,\n \"score\": 72603.8487112653\n },\n {\n \"content\": \"\\n\\n builder\\n\\n }\\n\\n\\n\\n fn new_exhirom(cart_file: BufReader<File>, ram: Box<dyn SRAM>) -> CartBuilder {\\n\\n let mut builder = CartBuilder::new(CartMappingMode::ExHi);\\n\\n builder.rom = Some(ROM::new(cart_file, 0x10000));\\n\\n builder.ram = Some(ram);\\n\\n\\n\\n builder\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Cart {\\n\\n pub fn read(&mut self, bank: u8, addr: u16) -> (u8, usize) {\\n\\n for mapping in self.mappings.iter() {\\n\\n if (bank >= mapping.start_bank) &&\\n\\n (bank <= mapping.end_bank) &&\\n\\n (addr >= mapping.start_addr) {\\n\\n return match (mapping.addr_mapping)(bank, addr) {\\n\",\n \"file_path\": \"oxide-7/src/mem/rom/mod.rs\",\n \"rank\": 61,\n \"score\": 72603.37515622503\n },\n {\n \"content\": \" CartDevice::ROM(bank, addr) => (self.rom.as_mut().map_or(0, |r| r.read(bank, addr)), self.rom_speed),\\n\\n CartDevice::RAM(addr) => (self.ram.read(addr), timing::SLOW_MEM_ACCESS),\\n\\n CartDevice::Expansion(bank, addr) => {\\n\\n let data = self.expansion.as_mut().map_or(0, |e| e.read(bank, addr));\\n\\n //println!(\\\"Reading {:X} from {:X}\\\", data, addr);\\n\\n (data, timing::SLOW_MEM_ACCESS)\\n\\n },\\n\\n };\\n\\n }\\n\\n }\\n\\n\\n\\n (0, timing::SLOW_MEM_ACCESS)\\n\\n }\\n\\n\\n\\n pub fn write(&mut self, bank: u8, addr: u16, data: u8) -> usize {\\n\\n let internal_bank = bank % 0x80;\\n\\n\\n\\n for mapping in self.mappings.iter() {\\n\\n if (internal_bank >= mapping.start_bank) &&\\n\\n (internal_bank <= mapping.end_bank) &&\\n\",\n \"file_path\": \"oxide-7/src/mem/rom/mod.rs\",\n \"rank\": 62,\n \"score\": 72603.18460936949\n },\n {\n \"content\": \"use header::*;\\n\\nuse sram::*;\\n\\npub use sram::SRAM;\\n\\n\\n\\nconst LOROM_LARGE_SIZE: usize = 1 << 21;\\n\\nconst LOROM_RAM_BANK_SIZE: u32 = 0x8000;\\n\\nconst HIROM_RAM_BANK_SIZE: u32 = 0x2000;\\n\\n\\n\\nconst SPEED_BIT: u8 = 0;\\n\\n\\n\",\n \"file_path\": \"oxide-7/src/mem/rom/mod.rs\",\n \"rank\": 63,\n \"score\": 72601.73412395381\n },\n {\n \"content\": \" ram: None,\\n\\n expansion: None,\\n\\n\\n\\n fast_rom: false,\\n\\n\\n\\n name: String::new()\\n\\n }\\n\\n }\\n\\n\\n\\n fn named(mut self, name: String) -> Self {\\n\\n self.name = name;\\n\\n self\\n\\n }\\n\\n\\n\\n fn fast_rom(mut self, fast: bool) -> Self {\\n\\n self.fast_rom = fast;\\n\\n self\\n\\n }\\n\\n\\n\\n fn with_dsp(mut self, dsp: Box<dyn Expansion>) -> Self {\\n\",\n \"file_path\": \"oxide-7/src/mem/rom/mod.rs\",\n \"rank\": 64,\n \"score\": 72601.26603124241\n },\n {\n \"content\": \" ports_apu_to_cpu: [u8; 4],\\n\\n\\n\\n timer_0: Timer,\\n\\n timer_1: Timer,\\n\\n timer_2: Timer,\\n\\n}\\n\\n\\n\\nimpl SPCBus {\\n\\n pub fn new(signal_tx: Sender<super::SamplePacket>) -> Self {\\n\\n SPCBus {\\n\\n ram: RAM::new(SPC_RAM_SIZE),\\n\\n\\n\\n ipl_rom: &IPL_ROM,\\n\\n\\n\\n control: SPCControl::ROM_ENABLE | SPCControl::CLEAR_PORT_32 | SPCControl::CLEAR_PORT_10,\\n\\n dsp_reg_addr: 0,\\n\\n dsp: DSP::new(signal_tx),\\n\\n\\n\\n ports_cpu_to_apu: [0; 4],\\n\\n ports_apu_to_cpu: [0; 4],\\n\",\n \"file_path\": \"oxide-7/src/audio/mem/mod.rs\",\n \"rank\": 65,\n \"score\": 72600.57216474012\n },\n {\n \"content\": \"// ROM types\\n\\nmod header;\\n\\nmod sram;\\n\\n\\n\\nuse std::{\\n\\n io::{\\n\\n BufReader,\\n\\n Read,\\n\\n Seek,\\n\\n SeekFrom\\n\\n },\\n\\n fs::File\\n\\n};\\n\\n\\n\\nuse crate::{\\n\\n common::Interrupt,\\n\\n constants::timing,\\n\\n expansion::*\\n\\n};\\n\\n\\n\",\n \"file_path\": \"oxide-7/src/mem/rom/mod.rs\",\n \"rank\": 66,\n \"score\": 72599.0500125306\n },\n {\n \"content\": \"\\n\\n name: self.name,\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\\npub struct Cart {\\n\\n mappings: Vec<CartMapping>,\\n\\n\\n\\n rom: Option<ROM>,\\n\\n ram: Box<dyn SRAM>,\\n\\n expansion: Option<Box<dyn Expansion>>,\\n\\n\\n\\n fast_rom: bool,\\n\\n rom_speed: usize,\\n\\n\\n\\n name: String\\n\\n}\\n\\n\\n\\nimpl Cart {\\n\",\n \"file_path\": \"oxide-7/src/mem/rom/mod.rs\",\n \"rank\": 67,\n \"score\": 72598.79465980532\n },\n {\n \"content\": \" (addr >= mapping.start_addr) {\\n\\n match (mapping.addr_mapping)(internal_bank, addr) {\\n\\n CartDevice::ROM(_,_) => {},\\n\\n CartDevice::RAM(addr) => self.ram.write(addr, data),\\n\\n CartDevice::Expansion(bank, addr) => {\\n\\n //println!(\\\"Writing {:X} to {:X}\\\", data, addr);\\n\\n self.expansion.as_mut().map_or((), |e| e.write(bank, addr, data));\\n\\n },\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n timing::SLOW_MEM_ACCESS\\n\\n }\\n\\n\\n\\n // Read from expansion port slot.\\n\\n pub fn read_exp(&mut self, addr: u16) -> u8 {\\n\\n self.expansion.as_mut().map_or(0, |e| e.read(0, addr))\\n\\n }\\n\\n\\n\",\n \"file_path\": \"oxide-7/src/mem/rom/mod.rs\",\n \"rank\": 68,\n \"score\": 72598.28422804682\n },\n {\n \"content\": \" self\\n\\n }\\n\\n\\n\\n fn with_sa1(mut self) -> Self {\\n\\n use CartMappingMode::*;\\n\\n\\n\\n let sa1 = Box::new(SA1::new(self.rom.take().unwrap(), true, self.ram.take().unwrap()));\\n\\n self.expansion = Some(sa1);\\n\\n\\n\\n self.mapping_mode = SA;\\n\\n\\n\\n self\\n\\n }\\n\\n\\n\\n fn with_superfx(mut self) -> Self {\\n\\n let super_fx = Box::new(SuperFX::new(self.rom.take().unwrap(), self.ram.take().unwrap()));\\n\\n self.expansion = Some(super_fx);\\n\\n\\n\\n self.mapping_mode = CartMappingMode::SuperFX;\\n\\n\\n\",\n \"file_path\": \"oxide-7/src/mem/rom/mod.rs\",\n \"rank\": 69,\n \"score\": 72597.56146432375\n },\n {\n \"content\": \" self.mappings.push(CartMapping::new(0x20, 0x3F, 0x6000, |bank, addr| {\\n\\n let ram_bank = ((bank % 0x10) as u32) * HIROM_RAM_BANK_SIZE;\\n\\n CartDevice::RAM(ram_bank + (addr as u32 - 0x6000))\\n\\n }));\\n\\n },\\n\\n SuperFX => {\\n\\n self.mappings.push(CartMapping::new(0x60, 0x7F, 0, |bank, addr| CartDevice::Expansion(bank, addr)));\\n\\n self.mappings.push(CartMapping::new(0xE0, 0xEF, 0, |bank, addr| CartDevice::Expansion(bank, addr)));\\n\\n },\\n\\n _ => {}\\n\\n }\\n\\n\\n\\n Box::new(Cart {\\n\\n mappings: self.mappings,\\n\\n rom: self.rom,\\n\\n ram: self.ram.unwrap_or(Box::new(EmptySRAM::new())),\\n\\n expansion: self.expansion,\\n\\n\\n\\n fast_rom: self.fast_rom,\\n\\n rom_speed: timing::SLOW_MEM_ACCESS,\\n\",\n \"file_path\": \"oxide-7/src/mem/rom/mod.rs\",\n \"rank\": 70,\n \"score\": 72595.98553341202\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n fn clock(&mut self, cycles: usize) {\\n\\n if self.control.contains(SPCControl::ENABLE_TIMER_0) {\\n\\n self.timer_0.clock(cycles);\\n\\n }\\n\\n if self.control.contains(SPCControl::ENABLE_TIMER_1) {\\n\\n self.timer_1.clock(cycles);\\n\\n }\\n\\n if self.control.contains(SPCControl::ENABLE_TIMER_2) {\\n\\n self.timer_2.clock(cycles);\\n\\n }\\n\\n\\n\\n self.dsp.clock(cycles, &mut self.ram);\\n\\n }\\n\\n}\\n\\n\\n\\nimpl SPCBus {\\n\\n fn set_control(&mut self, data: u8) {\\n\",\n \"file_path\": \"oxide-7/src/audio/mem/mod.rs\",\n \"rank\": 71,\n \"score\": 72593.59229538555\n },\n {\n \"content\": \" fn new_lorom(cart_file: BufReader<File>, ram: Box<dyn SRAM>) -> CartBuilder {\\n\\n let mut builder = CartBuilder::new(CartMappingMode::Lo);\\n\\n builder.rom = Some(ROM::new(cart_file, 0x8000));\\n\\n builder.ram = Some(ram);\\n\\n\\n\\n builder\\n\\n }\\n\\n\\n\\n fn new_lorom_large(cart_file: BufReader<File>, ram: Box<dyn SRAM>) -> CartBuilder {\\n\\n let mut builder = CartBuilder::new(CartMappingMode::LoLarge);\\n\\n builder.rom = Some(ROM::new(cart_file, 0x8000));\\n\\n builder.ram = Some(ram);\\n\\n\\n\\n builder\\n\\n }\\n\\n\\n\\n fn new_hirom(cart_file: BufReader<File>, ram: Box<dyn SRAM>) -> CartBuilder {\\n\\n let mut builder = CartBuilder::new(CartMappingMode::Hi);\\n\\n builder.rom = Some(ROM::new(cart_file, 0x10000));\\n\\n builder.ram = Some(ram);\\n\",\n \"file_path\": \"oxide-7/src/mem/rom/mod.rs\",\n \"rank\": 72,\n \"score\": 72592.3441723307\n },\n {\n \"content\": \" self.mappings.push(CartMapping::new(0xC0, 0xFF, 0, |bank, addr| CartDevice::Expansion(bank, addr)));\\n\\n },\\n\\n SuperFX => {\\n\\n self.mappings.push(CartMapping::new(0x00, 0x3F, 0x3000, |bank, addr| CartDevice::Expansion(bank, addr)));\\n\\n self.mappings.push(CartMapping::new(0x80, 0xBF, 0x3000, |bank, addr| CartDevice::Expansion(bank, addr)));\\n\\n\\n\\n self.mappings.push(CartMapping::new(0x40, 0x5F, 0, |bank, addr| CartDevice::Expansion(bank, addr)));\\n\\n self.mappings.push(CartMapping::new(0xC0, 0xDF, 0, |bank, addr| CartDevice::Expansion(bank, addr)));\\n\\n },\\n\\n }\\n\\n\\n\\n // SRAM\\n\\n match self.mapping_mode {\\n\\n Lo | LoLarge => {\\n\\n self.mappings.push(CartMapping::new(0x70, 0x7F, 0, |bank, addr| {\\n\\n let ram_bank = ((bank - 0x70) as u32) * LOROM_RAM_BANK_SIZE;\\n\\n CartDevice::RAM(ram_bank + addr as u32)\\n\\n }));\\n\\n },\\n\\n Hi | ExHi => {\\n\",\n \"file_path\": \"oxide-7/src/mem/rom/mod.rs\",\n \"rank\": 73,\n \"score\": 72590.51355827728\n },\n {\n \"content\": \" pub fn name(&self) -> String {\\n\\n self.name.clone()\\n\\n }\\n\\n\\n\\n pub fn clock(&mut self, cycles: usize) -> Interrupt {\\n\\n if let Some(ex) = self.expansion.as_mut() {\\n\\n ex.clock(cycles)\\n\\n } else {\\n\\n Interrupt::default()\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"oxide-7/src/mem/rom/mod.rs\",\n \"rank\": 74,\n \"score\": 72590.44934526419\n },\n {\n \"content\": \" };\\n\\n\\n\\n let cart_with_ext = match header.rom_type().enhancement_chip() {\\n\\n Some(EnhancementChip::DSP) => {\\n\\n let dsp_path = dsp_path.expect(\\\"Must specify DSP ROM path!\\\");\\n\\n let dsp_rom_file = File::open(dsp_path).expect(&format!(\\\"Couldn't open DSP ROM file {}\\\", dsp_path));\\n\\n let mut dsp_reader = BufReader::new(dsp_rom_file);\\n\\n let mut buffer = vec![0; 0x2000];\\n\\n dsp_reader.read_exact(&mut buffer).expect(\\\"Couldn't read into DSP ROM\\\");\\n\\n cart.with_dsp(Box::new(DSP::new(&buffer)))\\n\\n },\\n\\n Some(EnhancementChip::SA1) => cart.with_sa1(),\\n\\n Some(EnhancementChip::SuperFX) => cart.with_superfx(),\\n\\n Some(e) => panic!(\\\"Unsupported enhancement chip {:?}\\\", e),\\n\\n None => cart,\\n\\n };\\n\\n\\n\\n cart_with_ext.build()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"oxide-7/src/mem/rom/mod.rs\",\n \"rank\": 75,\n \"score\": 72590.09658548007\n },\n {\n \"content\": \"\\n\\n fn write(&mut self, addr: u16, data: u8) {\\n\\n match addr {\\n\\n 0xF1 => self.set_control(data),\\n\\n\\n\\n 0xF2 => self.dsp_reg_addr = data,\\n\\n 0xF3 => self.dsp.write(self.dsp_reg_addr & 0x7F, data, &self.ram),\\n\\n\\n\\n 0xF4 => self.ports_apu_to_cpu[0] = data,\\n\\n 0xF5 => self.ports_apu_to_cpu[1] = data,\\n\\n 0xF6 => self.ports_apu_to_cpu[2] = data,\\n\\n 0xF7 => self.ports_apu_to_cpu[3] = data,\\n\\n\\n\\n 0xFA => self.timer_0.write_timer_modulo(data),\\n\\n 0xFB => self.timer_1.write_timer_modulo(data),\\n\\n 0xFC => self.timer_2.write_timer_modulo(data),\\n\\n\\n\\n 0xFD..=0xFF => {},\\n\\n\\n\\n _ => self.ram.write(addr.into(), data)\\n\",\n \"file_path\": \"oxide-7/src/audio/mem/mod.rs\",\n \"rank\": 76,\n \"score\": 72590.00900285422\n },\n {\n \"content\": \"\\n\\nconst SPC_RAM_SIZE: usize = 1024 * 64; // 64KB of RAM.\\n\\n\\n\\nconst IPL_ROM: [u8; 64] = [\\n\\n 0xCD, 0xEF, 0xBD, 0xE8, 0x00, 0xC6, 0x1D, 0xD0,\\n\\n 0xFC, 0x8F, 0xAA, 0xF4, 0x8F, 0xBB, 0xF5, 0x78,\\n\\n 0xCC, 0xF4, 0xD0, 0xFB, 0x2F, 0x19, 0xEB, 0xF4,\\n\\n 0xD0, 0xFC, 0x7E, 0xF4, 0xD0, 0x0B, 0xE4, 0xF5,\\n\\n 0xCB, 0xF4, 0xD7, 0x00, 0xFC, 0xD0, 0xF3, 0xAB,\\n\\n 0x01, 0x10, 0xEF, 0x7E, 0xF4, 0x10, 0xEB, 0xBA,\\n\\n 0xF6, 0xDA, 0x00, 0xBA, 0xF4, 0xC4, 0xF4, 0xDD,\\n\\n 0x5D, 0xD0, 0xDB, 0x1F, 0x00, 0x00, 0xC0, 0xFF\\n\\n];\\n\\n\\n\",\n \"file_path\": \"oxide-7/src/audio/mem/mod.rs\",\n \"rank\": 77,\n \"score\": 72589.49333544503\n },\n {\n \"content\": \" use CartMappingMode::*;\\n\\n\\n\\n self.expansion = Some(dsp);\\n\\n\\n\\n match self.mapping_mode {\\n\\n Lo | LoLarge => {\\n\\n self.mappings.push(CartMapping::new(0x30, 0x3F, 0x8000, |_, addr| {\\n\\n let out_addr = if addr < 0xC000 {0} else {1};\\n\\n CartDevice::Expansion(out_addr, 0)\\n\\n }));\\n\\n },\\n\\n Hi => {\\n\\n self.mappings.push(CartMapping::new(0x00, 0x1F, 0x6000, |_, addr| {\\n\\n let out_addr = if addr < 0x7000 {0} else {1};\\n\\n CartDevice::Expansion(out_addr, 0)\\n\\n }));\\n\\n }\\n\\n _ => {}\\n\\n }\\n\\n\\n\",\n \"file_path\": \"oxide-7/src/mem/rom/mod.rs\",\n \"rank\": 78,\n \"score\": 72588.84828000073\n },\n {\n \"content\": \" self\\n\\n }\\n\\n\\n\\n fn build(mut self) -> Box<Cart> {\\n\\n use CartMappingMode::*;\\n\\n // Map ROM\\n\\n match self.mapping_mode {\\n\\n Lo => {\\n\\n self.mappings.push(CartMapping::new(0x00, 0x3F, 0x8000, |bank, addr| CartDevice::ROM(bank, addr % 0x8000)));\\n\\n self.mappings.push(CartMapping::new(0x80, 0xBF, 0x8000, |bank, addr| CartDevice::ROM(bank - 0x80, addr % 0x8000)));\\n\\n\\n\\n self.mappings.push(CartMapping::new(0x40, 0x6F, 0, |bank, addr| CartDevice::ROM(bank - 0x40, addr % 0x8000)));\\n\\n self.mappings.push(CartMapping::new(0xC0, 0xFF, 0, |bank, addr| CartDevice::ROM(bank - 0xC0, addr % 0x8000)));\\n\\n },\\n\\n LoLarge => {\\n\\n self.mappings.push(CartMapping::new(0x00, 0x3F, 0x8000, |bank, addr| CartDevice::ROM(bank, addr % 0x8000)));\\n\\n self.mappings.push(CartMapping::new(0x80, 0xBF, 0x8000, |bank, addr| CartDevice::ROM(bank - 0x80, addr % 0x8000)));\\n\\n\\n\\n self.mappings.push(CartMapping::new(0x40, 0x6F, 0, |bank, addr| CartDevice::ROM(bank, addr % 0x8000)));\\n\\n self.mappings.push(CartMapping::new(0xC0, 0xFF, 0, |bank, addr| CartDevice::ROM(bank - 0x80, addr % 0x8000)));\\n\",\n \"file_path\": \"oxide-7/src/mem/rom/mod.rs\",\n \"rank\": 79,\n \"score\": 72588.07677140781\n },\n {\n \"content\": \"\\n\\n 0xF2 => self.dsp_reg_addr,\\n\\n 0xF3 => self.dsp.read(self.dsp_reg_addr & 0x7F),\\n\\n\\n\\n 0xF4 => self.ports_cpu_to_apu[0],\\n\\n 0xF5 => self.ports_cpu_to_apu[1],\\n\\n 0xF6 => self.ports_cpu_to_apu[2],\\n\\n 0xF7 => self.ports_cpu_to_apu[3],\\n\\n\\n\\n 0xFA..=0xFC => 0,\\n\\n\\n\\n 0xFD => self.timer_0.read_counter(),\\n\\n 0xFE => self.timer_1.read_counter(),\\n\\n 0xFF => self.timer_2.read_counter(),\\n\\n\\n\\n 0xFFC0..=0xFFFF if self.control.contains(SPCControl::ROM_ENABLE) => self.ipl_rom[(addr - 0xFFC0) as usize],\\n\\n\\n\\n _ => self.ram.read(addr.into())\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"oxide-7/src/audio/mem/mod.rs\",\n \"rank\": 80,\n \"score\": 72587.21129910479\n },\n {\n \"content\": \" },\\n\\n Hi => {\\n\\n self.mappings.insert(0, CartMapping::new(0x00, 0x3F, 0x8000, |bank, addr| CartDevice::ROM(bank, addr)));\\n\\n self.mappings.insert(1, CartMapping::new(0x80, 0xBF, 0x8000, |bank, addr| CartDevice::ROM(bank - 0x80, addr)));\\n\\n\\n\\n self.mappings.insert(2, CartMapping::new(0x40, 0x7F, 0, |bank, addr| CartDevice::ROM(bank - 0x40, addr)));\\n\\n self.mappings.insert(3, CartMapping::new(0xC0, 0xFF, 0, |bank, addr| CartDevice::ROM(bank - 0xC0, addr)));\\n\\n },\\n\\n ExHi => {\\n\\n self.mappings.push(CartMapping::new(0x00, 0x1F, 0x8000, |bank, addr| CartDevice::ROM(bank + 0x40, addr)));\\n\\n self.mappings.push(CartMapping::new(0x80, 0xBF, 0x8000, |bank, addr| CartDevice::ROM(bank - 0x80, addr)));\\n\\n\\n\\n self.mappings.push(CartMapping::new(0x40, 0x5F, 0, |bank, addr| CartDevice::ROM(bank, addr)));\\n\\n self.mappings.push(CartMapping::new(0xC0, 0xFF, 0, |bank, addr| CartDevice::ROM(bank - 0xC0, addr)));\\n\\n },\\n\\n SA => {\\n\\n self.mappings.push(CartMapping::new(0x00, 0x3F, 0x2200, |bank, addr| CartDevice::Expansion(bank, addr)));\\n\\n self.mappings.push(CartMapping::new(0x80, 0xBF, 0x2200, |bank, addr| CartDevice::Expansion(bank, addr)));\\n\\n\\n\\n self.mappings.push(CartMapping::new(0x40, 0x6F, 0, |bank, addr| CartDevice::Expansion(bank, addr)));\\n\",\n \"file_path\": \"oxide-7/src/mem/rom/mod.rs\",\n \"rank\": 81,\n \"score\": 72586.80643128601\n },\n {\n \"content\": \" } else if header.try_exhi(&mut reader) {\\n\\n let sram = create_sram(save_path, header.sram_size()).expect(\\\"Couldn't make save file.\\\");\\n\\n let name = header.rom_name();\\n\\n\\n\\n println!(\\\"EXHIROM {:X}: {}\\\", header.rom_mapping(), name);\\n\\n Cart::new_exhirom(reader, sram)\\n\\n .named(name)\\n\\n .fast_rom(header.fast_rom())\\n\\n\\n\\n } else if header.try_hi(&mut reader) {\\n\\n let sram = create_sram(save_path, header.sram_size()).expect(\\\"Couldn't make save file.\\\");\\n\\n let name = header.rom_name();\\n\\n\\n\\n println!(\\\"HIROM {:X}: {}\\\", header.rom_mapping(), name);\\n\\n Cart::new_hirom(reader, sram)\\n\\n .named(name)\\n\\n .fast_rom(header.fast_rom())\\n\\n\\n\\n } else {\\n\\n panic!(\\\"Unrecognised ROM: {:X}\\\", header.rom_mapping());\\n\",\n \"file_path\": \"oxide-7/src/mem/rom/mod.rs\",\n \"rank\": 82,\n \"score\": 72585.22649141017\n },\n {\n \"content\": \" let control = SPCControl::from_bits_truncate(data);\\n\\n\\n\\n self.timer_0.reset();\\n\\n self.timer_1.reset();\\n\\n self.timer_2.reset();\\n\\n\\n\\n if control.contains(SPCControl::CLEAR_PORT_10) {\\n\\n //println!(\\\"APU reset ports 0 and 1\\\");\\n\\n self.ports_cpu_to_apu[0] = 0;\\n\\n self.ports_cpu_to_apu[1] = 0;\\n\\n }\\n\\n if control.contains(SPCControl::CLEAR_PORT_32) {\\n\\n //println!(\\\"APU reset ports 2 and 3\\\");\\n\\n self.ports_cpu_to_apu[2] = 0;\\n\\n self.ports_cpu_to_apu[3] = 0;\\n\\n }\\n\\n\\n\\n self.control = control;\\n\\n }\\n\\n}\",\n \"file_path\": \"oxide-7/src/audio/mem/mod.rs\",\n \"rank\": 83,\n \"score\": 72582.0002487802\n },\n {\n \"content\": \"// Actually drawing the image!\\n\\n\\n\\nmod lines;\\n\\nmod types;\\n\\n\\n\\nuse crate::video::{\\n\\n BG,\\n\\n VideoMem,\\n\\n ram::{\\n\\n Mode7Extend,\\n\\n Screen,\\n\\n SpritePriority,\\n\\n WindowRegisters\\n\\n },\\n\\n render::{\\n\\n Colour,\\n\\n VideoMode,\\n\\n patternmem::{\\n\\n BitsPerPixel,\\n\\n PatternMem\\n\",\n \"file_path\": \"oxide-7/src/video/render/drawing/mod.rs\",\n \"rank\": 84,\n \"score\": 70788.15110998998\n },\n {\n \"content\": \" },\\n\\n palette::PaletteMem\\n\\n }\\n\\n};\\n\\n\\n\\nuse types::*;\\n\\nuse lines::{\\n\\n BGData,\\n\\n TileAttributes\\n\\n};\\n\\n\\n\\nuse crate::constants::screen::H_RES;\\n\\n\\n\\npub struct Renderer {\\n\\n mode: VideoMode,\\n\\n\\n\\n bg_pattern_mem: [PatternMem; 4],\\n\\n obj_pattern_mem: [PatternMem; 2],\\n\\n\\n\\n palettes: PaletteMem\\n\",\n \"file_path\": \"oxide-7/src/video/render/drawing/mod.rs\",\n \"rank\": 85,\n \"score\": 70786.43168107572\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl Renderer {\\n\\n pub fn new() -> Self {\\n\\n Renderer {\\n\\n mode: VideoMode::_7,\\n\\n\\n\\n bg_pattern_mem: [\\n\\n PatternMem::new(BitsPerPixel::_2),\\n\\n PatternMem::new(BitsPerPixel::_2),\\n\\n PatternMem::new(BitsPerPixel::_2),\\n\\n PatternMem::new(BitsPerPixel::_2)\\n\\n ],\\n\\n\\n\\n obj_pattern_mem: [\\n\\n PatternMem::new(BitsPerPixel::_4),\\n\\n PatternMem::new(BitsPerPixel::_4),\\n\\n ],\\n\\n\\n\\n palettes: PaletteMem::new()\\n\",\n \"file_path\": \"oxide-7/src/video/render/drawing/mod.rs\",\n \"rank\": 86,\n \"score\": 70784.23607205709\n },\n {\n \"content\": \" fn get_pattern_mem(&self, bg: BG) -> &PatternMem {\\n\\n match bg {\\n\\n BG::_1 => &self.bg_pattern_mem[0],\\n\\n BG::_2 => &self.bg_pattern_mem[1],\\n\\n BG::_3 => &self.bg_pattern_mem[2],\\n\\n BG::_4 => &self.bg_pattern_mem[3],\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n// Apply brightness to colour component.\\n\\nmacro_rules! apply_brightness {\\n\\n ($col:expr, $brightness:expr) => {\\n\\n (($col as usize) * ($brightness as usize) / 0xF) as u8\\n\\n };\\n\\n}\\n\\n\\n\\n// Drawing modes\\n\\nimpl Renderer {\\n\\n #[inline]\\n\",\n \"file_path\": \"oxide-7/src/video/render/drawing/mod.rs\",\n \"rank\": 87,\n \"score\": 70782.0928576103\n },\n {\n \"content\": \" let sub = if window_regs.use_subscreen() {\\n\\n let sprite_pix = sub_sprite_pixels[x];\\n\\n let bg1_pix = sub_bg1_pixels[x];\\n\\n let bg2_pix = sub_bg2_pixels[x];\\n\\n self.eval_mode_7(window_regs.use_direct_colour(), ext_bg, sprite_pix, bg1_pix, bg2_pix).any()\\n\\n } else {\\n\\n None\\n\\n };\\n\\n\\n\\n self.write_pixel(window_regs, out, main, sub, brightness, x as u8);\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n// Generic drawing utils.\\n\\nimpl Renderer {\\n\\n // TODO: lots of cleanup here\\n\\n fn draw_sprites_to_line(&self, mem: &VideoMem, main_line: &mut [SpritePixel], sub_line: &mut [SpritePixel], y: u8) {\\n\\n let (small, large) = mem.get_bg_registers().obj_sizes();\\n\\n\\n\",\n \"file_path\": \"oxide-7/src/video/render/drawing/mod.rs\",\n \"rank\": 88,\n \"score\": 70779.29420197182\n },\n {\n \"content\": \" if self.bg_pattern_mem[0].get_bits_per_pixel() != BitsPerPixel::_4 {\\n\\n self.bg_pattern_mem[0] = PatternMem::new(BitsPerPixel::_4);\\n\\n }\\n\\n },\\n\\n _7 => {}\\n\\n }\\n\\n }\\n\\n\\n\\n // Get the number of backgrounds active\\n\\n fn num_bgs(&self) -> usize {\\n\\n use VideoMode::*;\\n\\n match self.mode {\\n\\n _0 => 4,\\n\\n _1 => 3,\\n\\n _2 | _3 | _4 | _5 => 2,\\n\\n _6 => 1,\\n\\n _7 => 0,\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"oxide-7/src/video/render/drawing/mod.rs\",\n \"rank\": 89,\n \"score\": 70778.0265199156\n },\n {\n \"content\": \" let p_b = (palette_num & bit!(4)) << 1;\\n\\n let r_i = r | p_r;\\n\\n let g_i = g | p_g;\\n\\n let b_i = b | p_b;\\n\\n Colour::new(r_i | (r_i >> 4), g_i | (g_i >> 4), b_i | (b_i >> 3) | (b_i >> 6))\\n\\n } else {\\n\\n self.palettes.get_bg_colour(data.texel as usize)\\n\\n }\\n\\n }\\n\\n #[inline]\\n\\n fn make_mode7_bg1_pixel(&self, texel: u8, direct_col: bool) -> Colour {\\n\\n if direct_col {\\n\\n let r = (texel & bits![2, 1, 0]) << 5;\\n\\n let g = (texel & bits![5, 4, 3]) << 2;\\n\\n let b = texel & bits![7, 6];\\n\\n Colour::new(r | (r >> 3) | (r >> 6), g | (g >> 3) | (g >> 6), b | (b >> 2) | (b >> 4) | (b >> 6))\\n\\n } else {\\n\\n self.palettes.get_bg_colour(texel as usize)\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"oxide-7/src/video/render/drawing/mod.rs\",\n \"rank\": 90,\n \"score\": 70777.33937111757\n },\n {\n \"content\": \" let sub = if window_regs.use_subscreen() {\\n\\n let sprite_pix = sub_sprite_pixels[x];\\n\\n let bg1_pix = sub_bg1_pixels[x];\\n\\n let bg2_pix = sub_bg2_pixels[x];\\n\\n self.eval_mode_3(window_regs.use_direct_colour(), sprite_pix, bg1_pix, bg2_pix).any()\\n\\n } else {\\n\\n None\\n\\n };\\n\\n\\n\\n self.write_pixel(window_regs, out, main, sub, brightness, x as u8);\\n\\n }\\n\\n }\\n\\n\\n\\n fn draw_line_mode_4(&self, mem: &VideoMem, target: &mut [u8], y: usize) {\\n\\n let brightness = mem.get_bg_registers().get_brightness();\\n\\n let window_regs = mem.get_window_registers();\\n\\n let target_start = y * H_RES;\\n\\n\\n\\n let mut main_sprite_pixels = [SpritePixel::None; H_RES];\\n\\n let mut sub_sprite_pixels = [SpritePixel::None; H_RES];\\n\",\n \"file_path\": \"oxide-7/src/video/render/drawing/mod.rs\",\n \"rank\": 91,\n \"score\": 70777.13625338097\n },\n {\n \"content\": \" } else {\\n\\n None\\n\\n };\\n\\n\\n\\n self.write_pixel(window_regs, out, main, sub, brightness, x as u8);\\n\\n }\\n\\n }\\n\\n\\n\\n fn draw_line_mode_5(&self, mem: &VideoMem, target: &mut [u8], y: usize) {\\n\\n let brightness = mem.get_bg_registers().get_brightness();\\n\\n let window_regs = mem.get_window_registers();\\n\\n let target_start = y * H_RES;\\n\\n\\n\\n let mut main_sprite_pixels = [SpritePixel::None; H_RES];\\n\\n let mut sub_sprite_pixels = [SpritePixel::None; H_RES];\\n\\n self.draw_sprites_to_line(mem, &mut main_sprite_pixels, &mut sub_sprite_pixels, y as u8);\\n\\n let mut main_bg1_pixels = [BGData::default(); H_RES];\\n\\n let mut sub_bg1_pixels = [BGData::default(); H_RES];\\n\\n self.draw_bg_to_line(mem, BG::_1, &mut main_bg1_pixels, &mut sub_bg1_pixels, y, false);\\n\\n let mut main_bg2_pixels = [BGData::default(); H_RES];\\n\",\n \"file_path\": \"oxide-7/src/video/render/drawing/mod.rs\",\n \"rank\": 92,\n \"score\": 70776.52231555637\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n pub fn draw_line(&mut self, mem: &VideoMem, target: &mut [u8], y: usize) {\\n\\n match self.mode {\\n\\n VideoMode::_0 => self.draw_line_mode_0(mem, target, y),\\n\\n VideoMode::_1 => self.draw_line_mode_1(mem, target, y),\\n\\n VideoMode::_2 => self.draw_line_mode_2(mem, target, y),\\n\\n VideoMode::_3 => self.draw_line_mode_3(mem, target, y),\\n\\n VideoMode::_4 => self.draw_line_mode_4(mem, target, y),\\n\\n VideoMode::_5 => self.draw_line_mode_5(mem, target, y),\\n\\n VideoMode::_6 => self.draw_line_mode_6(mem, target, y),\\n\\n VideoMode::_7 => self.draw_line_mode_7(mem, target, y),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n// Caches\\n\\nimpl Renderer {\\n\\n pub fn setup_caches(&mut self, mem: &mut VideoMem) {\\n\",\n \"file_path\": \"oxide-7/src/video/render/drawing/mod.rs\",\n \"rank\": 93,\n \"score\": 70776.09606568191\n },\n {\n \"content\": \" }\\n\\n }\\n\\n }\\n\\n\\n\\n fn draw_mode7_bg1_to_line(&self, mem: &VideoMem, main_line: &mut [Option<u8>], sub_line: &mut [Option<u8>], y: usize) {\\n\\n let vram = mem.get_vram();\\n\\n let regs = mem.get_bg_registers();\\n\\n let window_regs = mem.get_window_registers();\\n\\n\\n\\n let actual_y = y + 1;\\n\\n\\n\\n let mut main_window = [true; H_RES];\\n\\n window_regs.bg_window(BG::_1, Screen::Main, &mut main_window);\\n\\n let mut sub_window = [true; H_RES];\\n\\n window_regs.bg_window(BG::_1, Screen::Sub, &mut sub_window);\\n\\n\\n\\n for (x, (main, sub)) in main_line.iter_mut().zip(sub_line.iter_mut()).enumerate() {\\n\\n let x_in = if regs.mode_7_flip_x() {x ^ 0xFF} else {x};\\n\\n let y_in = if regs.mode_7_flip_y() {actual_y ^ 0xFF} else {actual_y};\\n\\n let (bg_x, bg_y) = regs.calc_mode_7(x_in as i16, y_in as i16);\\n\",\n \"file_path\": \"oxide-7/src/video/render/drawing/mod.rs\",\n \"rank\": 94,\n \"score\": 70775.99877531786\n },\n {\n \"content\": \" let pix = get_mode_7_texel(vram, x_val, y_val);\\n\\n let pix_out = if pix == 0 {None} else {Some(pix)};\\n\\n\\n\\n if main_window[x] { // If pixel shows through main window.\\n\\n *main = pix_out;\\n\\n }\\n\\n if sub_window[x] { // If pixel shows through sub window.\\n\\n *sub = pix_out;\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n fn draw_mode7_bg2_to_line(&self, mem: &VideoMem, main_line: &mut [u8], sub_line: &mut [u8], y: usize) {\\n\\n let vram = mem.get_vram();\\n\\n let regs = mem.get_bg_registers();\\n\\n let window_regs = mem.get_window_registers();\\n\\n\\n\\n let actual_y = y + 1;\\n\\n\\n\",\n \"file_path\": \"oxide-7/src/video/render/drawing/mod.rs\",\n \"rank\": 95,\n \"score\": 70774.86801298782\n },\n {\n \"content\": \" let mut main_sprite_pixels = [SpritePixel::None; H_RES];\\n\\n let mut sub_sprite_pixels = [SpritePixel::None; H_RES];\\n\\n self.draw_sprites_to_line(mem, &mut main_sprite_pixels, &mut sub_sprite_pixels, y as u8);\\n\\n let mut main_bg1_pixels = [None; H_RES];\\n\\n let mut sub_bg1_pixels = [None; H_RES];\\n\\n self.draw_mode7_bg1_to_line(mem, &mut main_bg1_pixels, &mut sub_bg1_pixels, y);\\n\\n let mut main_bg2_pixels = [0_u8; H_RES];\\n\\n let mut sub_bg2_pixels = [0_u8; H_RES];\\n\\n let ext_bg = window_regs.use_ext_bg();\\n\\n if ext_bg {\\n\\n self.draw_mode7_bg2_to_line(mem, &mut main_bg2_pixels, &mut sub_bg2_pixels, y);\\n\\n }\\n\\n\\n\\n for (x, out) in target.chunks_mut(8).skip(target_start).take(H_RES).enumerate() {\\n\\n let main = {\\n\\n let sprite_pix = main_sprite_pixels[x];\\n\\n let bg1_pix = main_bg1_pixels[x];\\n\\n let bg2_pix = main_bg2_pixels[x];\\n\\n self.eval_mode_7(window_regs.use_direct_colour(), ext_bg, sprite_pix, bg1_pix, bg2_pix)\\n\\n };\\n\",\n \"file_path\": \"oxide-7/src/video/render/drawing/mod.rs\",\n \"rank\": 96,\n \"score\": 70774.83217556382\n },\n {\n \"content\": \" } // for sprite x pixels\\n\\n });\\n\\n }\\n\\n\\n\\n fn draw_bg_to_line(&self, mem: &VideoMem, bg: BG, main_line: &mut [BGData], sub_line: &mut [BGData], y: usize, offset_per_tile: bool) {\\n\\n let regs = mem.get_bg_registers();\\n\\n let window_regs = mem.get_window_registers();\\n\\n\\n\\n let actual_y = y + 1;\\n\\n\\n\\n // TODO: separate mosaic stuff?\\n\\n let mosaic_amount = if regs.bg_mosaic_enabled(bg) {\\n\\n regs.bg_mosaic_mask()\\n\\n } else {\\n\\n 0\\n\\n } as usize;\\n\\n let mut x_mosaic_offset = 0;\\n\\n\\n\\n let y_mosaic_offset = y % (mosaic_amount + 1);\\n\\n let line_y = actual_y - y_mosaic_offset;\\n\",\n \"file_path\": \"oxide-7/src/video/render/drawing/mod.rs\",\n \"rank\": 97,\n \"score\": 70774.81309964026\n },\n {\n \"content\": \" let sprite_pix = main_sprite_pixels[x];\\n\\n let bg1_pix = main_bg1_pixels[x];\\n\\n let bg2_pix = main_bg2_pixels[x];\\n\\n self.eval_mode_2(sprite_pix, bg1_pix, bg2_pix)\\n\\n };\\n\\n let sub = if window_regs.use_subscreen() {\\n\\n let sprite_pix = sub_sprite_pixels[x];\\n\\n let bg1_pix = sub_bg1_pixels[x];\\n\\n let bg2_pix = sub_bg2_pixels[x];\\n\\n self.eval_mode_2(sprite_pix, bg1_pix, bg2_pix).any()\\n\\n } else {\\n\\n None\\n\\n };\\n\\n\\n\\n self.write_pixel(window_regs, out, main, sub, brightness, x as u8);\\n\\n }\\n\\n }\\n\\n\\n\\n fn draw_line_mode_3(&self, mem: &VideoMem, target: &mut [u8], y: usize) {\\n\\n let brightness = mem.get_bg_registers().get_brightness();\\n\",\n \"file_path\": \"oxide-7/src/video/render/drawing/mod.rs\",\n \"rank\": 98,\n \"score\": 70774.80512121061\n },\n {\n \"content\": \" self.palettes.make_obj_palette(mem);\\n\\n }\\n\\n mem.cgram_reset_dirty();\\n\\n }\\n\\n\\n\\n // Switch mode: setup backgrounds.\\n\\n fn switch_mode(&mut self, mode: VideoMode) {\\n\\n use VideoMode::*;\\n\\n\\n\\n //println!(\\\"Switching mode to {:?}\\\", mode);\\n\\n\\n\\n self.mode = mode;\\n\\n match mode {\\n\\n _0 => {\\n\\n self.bg_pattern_mem[0] = PatternMem::new(BitsPerPixel::_2);\\n\\n if self.bg_pattern_mem[1].get_bits_per_pixel() != BitsPerPixel::_2 {\\n\\n self.bg_pattern_mem[1] = PatternMem::new(BitsPerPixel::_2);\\n\\n }\\n\\n },\\n\\n _1 => {\\n\",\n \"file_path\": \"oxide-7/src/video/render/drawing/mod.rs\",\n \"rank\": 99,\n \"score\": 70774.73295727067\n }\n]","isConversational":false}}},{"rowIdx":1391,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/limit.rs"},"repo_name":{"kind":"string","value":"phip1611/spectrum-analyzer"},"commit":{"kind":"string","value":"8f8eb2cd91768222a7ede072c2c5353788238256"},"file_code":{"kind":"string","value":"/*\nMIT License\n\nCopyright (c) 2021 Philipp Schuster\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n*/\n\n#[derive(Debug, Copy, Clone)]\npub enum FrequencyLimit {\n \n \n All,\n \n \n Min(f32),\n \n \n Max(f32),\n \n \n \n \n Range(f32, f32),\n}\n\nimpl FrequencyLimit {\n \n #[inline(always)]\n pub const fn maybe_min(&self) -> Option<f32> {\n match self {\n FrequencyLimit::Min(min) => Some(*min),\n FrequencyLimit::Range(min, _) => Some(*min),\n _ => None,\n }\n }\n\n \n #[inline(always)]\n pub const fn maybe_max(&self) -> Option<f32> {\n match self {\n FrequencyLimit::Max(max) => Some(*max),\n FrequencyLimit::Range(_, max) => Some(*max),\n _ => None,\n }\n }\n\n \n \n #[inline(always)]\n pub fn min(&self) -> f32 {\n self.maybe_min().expect(\"Must contain a value!\")\n }\n\n \n \n #[inline(always)]\n pub fn max(&self) -> f32 {\n self.maybe_max().expect(\"Must contain a value!\")\n }\n\n \n \n pub fn verify(&self, max_detectable_frequency: f32) -> Result<(), FrequencyLimitError> {\n match self {\n Self::All => Ok(()),\n Self::Min(x) | Self::Max(x) => {\n if *x < 0.0 {\n Err(FrequencyLimitError::ValueBelowMinimum(*x))\n } else if *x > max_detectable_frequency {\n Err(FrequencyLimitError::ValueAboveNyquist(*x))\n } else {\n Ok(())\n }\n }\n FrequencyLimit::Range(min, max) => {\n let _ = Self::Min(*min).verify(max_detectable_frequency)?;\n let _ = Self::Max(*max).verify(max_detectable_frequency)?;\n if min > max {\n Err(FrequencyLimitError::InvalidRange(*min, *max))\n } else {\n Ok(())\n }\n }\n }\n }\n}\n\n#[derive(Debug)]\npub enum FrequencyLimitError {\n \n ValueBelowMinimum(f32),\n \n \n ValueAboveNyquist(f32),\n \n \n InvalidRange(f32, f32),\n}\n\n#[cfg(test)]\nmod tests {\n use crate::FrequencyLimit;\n\n #[test]\n fn test_panic_min_below_minimum() {\n let _ = FrequencyLimit::Min(-1.0).verify(0.0).unwrap_err();\n }\n\n #[test]\n fn test_panic_min_above_nyquist() {\n let _ = FrequencyLimit::Min(1.0).verify(0.0).unwrap_err();\n }\n\n #[test]\n fn test_panic_max_below_minimum() {\n let _ = FrequencyLimit::Max(-1.0).verify(0.0).unwrap_err();\n }\n\n #[test]\n fn test_panic_max_above_nyquist() {\n let _ = FrequencyLimit::Max(1.0).verify(0.0).unwrap_err();\n }\n\n #[test]\n fn test_panic_range_min() {\n let _ = FrequencyLimit::Range(-1.0, 0.0).verify(0.0).unwrap_err();\n }\n\n #[test]\n fn test_panic_range_max() {\n let _ = FrequencyLimit::Range(0.0, 1.0).verify(0.0).unwrap_err();\n }\n\n #[test]\n fn test_panic_range_order() {\n let _ = FrequencyLimit::Range(0.0, -1.0).verify(0.0).unwrap_err();\n }\n\n #[test]\n fn test_ok() {\n let _ = FrequencyLimit::Min(50.0).verify(100.0).unwrap();\n let _ = FrequencyLimit::Max(50.0).verify(100.0).unwrap();\n \n let _ = FrequencyLimit::Range(50.0, 50.0).verify(100.0).unwrap();\n let _ = FrequencyLimit::Range(50.0, 70.0).verify(100.0).unwrap();\n }\n}\n"},"prefix":{"kind":"string","value":"/*\nMIT License\n\nCopyright (c) 2021 Philipp Schuster\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n*/\n\n#[derive(Debug, Copy, Clone)]\npub enum FrequencyLimit {\n \n \n All,\n \n \n Min(f32),\n \n \n Max(f32),\n \n \n \n \n Range(f32, f32),\n}\n\nimpl FrequencyLimit {\n \n #[inline(always)]\n pub const fn maybe_min(&self) -> Option<f32> {\n match self {\n FrequencyLimit::Min(min) => Some(*min),\n FrequencyLimit::Range(min, _) => Some(*min),\n _ => None,\n }\n }\n\n \n #[inline(always)]\n pub const fn maybe_max(&self) -> Option<f32> {\n match self {\n FrequencyLimit::Max(max) => Some(*max),\n FrequencyLimit::Range(_, max) => Some(*max),\n _ => None,\n }\n }\n\n \n \n #[inline(always)]\n pub fn min(&self) -> f32 {\n self.maybe_min().expect(\"Must contain a value!\")\n }\n\n \n \n #[inline(always)]\n pub fn max(&self) -> f32 {\n self.maybe_max().expect(\"Must contain a value!\")\n }\n\n \n \n pub fn verify(&self, max_detectable_frequency: f32) -> Result<(), FrequencyLimitError> {\n match self {\n Self::All => Ok(()),\n Self::Min(x) | Self::Max(x) => {\n if *x < 0.0 {\n "},"suffix":{"kind":"string","value":"\n}\n\n#[derive(Debug)]\npub enum FrequencyLimitError {\n \n ValueBelowMinimum(f32),\n \n \n ValueAboveNyquist(f32),\n \n \n InvalidRange(f32, f32),\n}\n\n#[cfg(test)]\nmod tests {\n use crate::FrequencyLimit;\n\n #[test]\n fn test_panic_min_below_minimum() {\n let _ = FrequencyLimit::Min(-1.0).verify(0.0).unwrap_err();\n }\n\n #[test]\n fn test_panic_min_above_nyquist() {\n let _ = FrequencyLimit::Min(1.0).verify(0.0).unwrap_err();\n }\n\n #[test]\n fn test_panic_max_below_minimum() {\n let _ = FrequencyLimit::Max(-1.0).verify(0.0).unwrap_err();\n }\n\n #[test]\n fn test_panic_max_above_nyquist() {\n let _ = FrequencyLimit::Max(1.0).verify(0.0).unwrap_err();\n }\n\n #[test]\n fn test_panic_range_min() {\n let _ = FrequencyLimit::Range(-1.0, 0.0).verify(0.0).unwrap_err();\n }\n\n #[test]\n fn test_panic_range_max() {\n let _ = FrequencyLimit::Range(0.0, 1.0).verify(0.0).unwrap_err();\n }\n\n #[test]\n fn test_panic_range_order() {\n let _ = FrequencyLimit::Range(0.0, -1.0).verify(0.0).unwrap_err();\n }\n\n #[test]\n fn test_ok() {\n let _ = FrequencyLimit::Min(50.0).verify(100.0).unwrap();\n let _ = FrequencyLimit::Max(50.0).verify(100.0).unwrap();\n \n let _ = FrequencyLimit::Range(50.0, 50.0).verify(100.0).unwrap();\n let _ = FrequencyLimit::Range(50.0, 70.0).verify(100.0).unwrap();\n }\n}\n"},"middle":{"kind":"string","value":"Err(FrequencyLimitError::ValueBelowMinimum(*x))\n } else if *x > max_detectable_frequency {\n Err(FrequencyLimitError::ValueAboveNyquist(*x))\n } else {\n Ok(())\n }\n }\n FrequencyLimit::Range(min, max) => {\n let _ = Self::Min(*min).verify(max_detectable_frequency)?;\n let _ = Self::Max(*max).verify(max_detectable_frequency)?;\n if min > max {\n Err(FrequencyLimitError::InvalidRange(*min, *max))\n } else {\n Ok(())\n }\n }\n }\n }"},"strategy":{"kind":"string","value":"function_block-function_prefix_line"},"context_items":{"kind":"list like","value":[{"content":"/// Creates a sine (sinus) wave function for a given frequency.\n\n/// Don't forget to scale up the value to the audio resolution.\n\n/// So far, amplitude is in interval `[-1; 1]`. The parameter\n\n/// of the returned function is the point in time in seconds.\n\n///\n\n/// * `frequency` is in Hertz\n\npub fn sine_wave(frequency: f32) -> Box<dyn Fn(f32) -> f32> {\n\n Box::new(move |t| (t * frequency * 2.0 * PI).sin())\n\n}\n\n\n\n/// See [`sine_wave_audio_data_multiple`]\n","file_path":"src/tests/sine.rs","rank":0,"score":114647.95336310664},{"content":"/// Applies a Hamming window (<https://en.wikipedia.org/wiki/Window_function#Hann_and_Hamming_windows>)\n\n/// to an array of samples.\n\n///\n\n/// ## Return value\n\n/// New vector with Hann window applied to the values.\n\npub fn hamming_window(samples: &[f32]) -> Vec<f32> {\n\n let mut windowed_samples = Vec::with_capacity(samples.len());\n\n let samples_len_f32 = samples.len() as f32;\n\n for (i, sample) in samples.iter().enumerate() {\n\n let multiplier = 0.54 - (0.46 * (2.0 * PI * i as f32 / cosf(samples_len_f32 - 1.0)));\n\n windowed_samples.push(multiplier * sample)\n\n }\n\n windowed_samples\n\n}\n\n\n","file_path":"src/windows.rs","rank":1,"score":109039.08952846963},{"content":"/// Applies a Hann window (<https://en.wikipedia.org/wiki/Window_function#Hann_and_Hamming_windows>)\n\n/// to an array of samples.\n\n///\n\n/// ## Return value\n\n/// New vector with Hann window applied to the values.\n\npub fn hann_window(samples: &[f32]) -> Vec<f32> {\n\n let mut windowed_samples = Vec::with_capacity(samples.len());\n\n let samples_len_f32 = samples.len() as f32;\n\n for (i, sample) in samples.iter().enumerate() {\n\n let two_pi_i = 2.0 * PI * i as f32;\n\n let idontknowthename = cosf(two_pi_i / samples_len_f32);\n\n let multiplier = 0.5 * (1.0 - idontknowthename);\n\n windowed_samples.push(multiplier * sample)\n\n }\n\n windowed_samples\n\n}\n\n\n","file_path":"src/windows.rs","rank":2,"score":109039.08952846963},{"content":"/// Applies a Blackman-Harris 7-term window to an array of samples.\n\n///\n\n/// ## More information\n\n/// * <https://en.wikipedia.org/wiki/Window_function#Blackman%E2%80%93Harris_window>\n\n/// * <https://ieeexplore.ieee.org/document/940309>\n\n/// * <https://dsp.stackexchange.com/questions/51095/seven-term-blackman-harris-window>\n\n///\n\n/// ## Return value\n\n/// New vector with Blackman-Harris 7-term window applied to the values.\n\npub fn blackman_harris_7term(samples: &[f32]) -> Vec<f32> {\n\n // constants come from here:\n\n // https://dsp.stackexchange.com/questions/51095/seven-term-blackman-harris-window\n\n const ALPHA: [f32; 7] = [\n\n 0.271_051_4,\n\n -0.433_297_93,\n\n 0.218_123,\n\n -0.065_925_45,\n\n 0.010_811_742,\n\n -0.000_776_584_84,\n\n 0.000_013_887_217,\n\n ];\n\n\n\n blackman_harris_xterm(samples, &ALPHA)\n\n}\n\n\n","file_path":"src/windows.rs","rank":3,"score":106453.67128360705},{"content":"/// Applies a Blackman-Harris 4-term window (<https://en.wikipedia.org/wiki/Window_function#Blackman%E2%80%93Harris_window>)\n\n/// to an array of samples.\n\n///\n\n/// ## Return value\n\n/// New vector with Blackman-Harris 4-term window applied to the values.\n\npub fn blackman_harris_4term(samples: &[f32]) -> Vec<f32> {\n\n // constants come from here:\n\n // https://en.wikipedia.org/wiki/Window_function#Blackman%E2%80%93Harris_window\n\n const ALPHA: [f32; 4] = [0.35875, -0.48829, 0.14128, -0.01168];\n\n\n\n blackman_harris_xterm(samples, &ALPHA)\n\n}\n\n\n","file_path":"src/windows.rs","rank":4,"score":106451.33902769917},{"content":"#[allow(non_snake_case)]\n\npub fn divide_by_N(val: f32, stats: &SpectrumDataStats) -> f32 {\n\n if stats.n == 0.0 {\n\n val\n\n } else {\n\n val / stats.n\n\n }\n\n}\n\n\n","file_path":"src/scaling.rs","rank":5,"score":98678.23400676702},{"content":"/// Scales each frequency value/amplitude in the spectrum to interval `[0.0; 1.0]`.\n\n/// Function is of type [`SpectrumScalingFunction`]. Expects that [`SpectrumDataStats::min`] is\n\n/// not negative.\n\npub fn scale_to_zero_to_one(val: f32, stats: &SpectrumDataStats) -> f32 {\n\n // usually not the case, except you use other scaling functions first,\n\n // that transforms the value to a negative one\n\n /*if stats.min < 0.0 {\n\n val = val + stats.min;\n\n }*/\n\n if stats.max != 0.0 {\n\n val / stats.max\n\n } else {\n\n 0.0\n\n }\n\n}\n\n\n\n/// Divides each value by N. Several resources recommend that the FFT result should be divided\n\n/// by the length of samples, so that values of different samples lengths are comparable.\n","file_path":"src/scaling.rs","rank":6,"score":96601.16845106454},{"content":"/// Calculates the base 10 logarithm of each frequency magnitude and\n\n/// multiplies it with 20. This scaling is quite common, you can\n\n/// find more information for example here:\n\n/// <https://www.sjsu.edu/people/burford.furman/docs/me120/FFT_tutorial_NI.pdf>\n\n///\n\n/// ## Usage\n\n/// ```rust\n\n///use spectrum_analyzer::{samples_fft_to_spectrum, scaling, FrequencyLimit};\n\n///let window = [0.0, 0.1, 0.2, 0.3]; // add real data here\n\n///let spectrum = samples_fft_to_spectrum(\n\n/// &window,\n\n/// 44100,\n\n/// FrequencyLimit::All,\n\n/// Some(&scaling::scale_20_times_log10),\n\n/// );\n\n/// ```\n\n/// Function is of type [`SpectrumScalingFunction`].\n\npub fn scale_20_times_log10(frequency_magnitude: f32, _stats: &SpectrumDataStats) -> f32 {\n\n debug_assert!(!frequency_magnitude.is_infinite());\n\n debug_assert!(!frequency_magnitude.is_nan());\n\n debug_assert!(frequency_magnitude >= 0.0);\n\n if frequency_magnitude == 0.0 {\n\n 0.0\n\n } else {\n\n 20.0 * libm::log10f(frequency_magnitude)\n\n }\n\n}\n\n\n","file_path":"src/scaling.rs","rank":7,"score":94658.93591328897},{"content":"fn bench_without_scaling(samples: Vec<f32>) -> u64 {\n\n let fnc = move || samples_fft_to_spectrum(&samples, 44100, FrequencyLimit::All, None).unwrap();\n\n bench_fnc(Box::new(fnc))\n\n}\n\n\n","file_path":"examples/bench.rs","rank":8,"score":84992.62244623239},{"content":"/// Combines several scaling functions into a new single one.\n\n///\n\n/// # Example\n\n/// ```ignored\n\n/// Some(&combined(&[÷_by_N, &scale_20_times_log10]))\n\n/// ```\n\npub fn combined<'a>(\n\n fncs: &'a [SpectrumScalingFunction<'a>],\n\n) -> Box<dyn Fn(f32, &SpectrumDataStats) -> f32 + 'a> {\n\n Box::new(move |val, stats| {\n\n let mut val = val;\n\n for fnc in fncs {\n\n val = fnc(val, stats);\n\n }\n\n val\n\n })\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use alloc::vec::Vec;\n\n\n\n #[test]\n\n fn test_scale_to_zero_to_one() {\n\n let data = vec![0.0_f32, 1.1, 2.2, 3.3, 4.4, 5.5];\n","file_path":"src/scaling.rs","rank":9,"score":81945.41482523736},{"content":"/// Takes an array of samples (length must be a power of 2),\n\n/// e.g. 2048, applies an FFT (using the specified FFT implementation) on it\n\n/// and returns all frequencies with their volume/magnitude.\n\n///\n\n/// By default, no normalization/scaling is done at all and the results,\n\n/// i.e. the frequency magnitudes/amplitudes/values are the raw result from\n\n/// the FFT algorithm, except that complex numbers are transformed\n\n/// to their magnitude.\n\n///\n\n/// * `samples` raw audio, e.g. 16bit audio data but as f32.\n\n/// You should apply an window function (like Hann) on the data first.\n\n/// The final frequency resolution is `sample_rate / (N / 2)`\n\n/// e.g. `44100/(16384/2) == 5.383Hz`, i.e. more samples =>\n\n/// better accuracy/frequency resolution.\n\n/// * `sampling_rate` sampling_rate, e.g. `44100 [Hz]`\n\n/// * `frequency_limit` Frequency limit. See [`FrequencyLimit´]\n\n/// * `scaling_fn` See [`crate::scaling::SpectrumScalingFunction`] for details.\n\n///\n\n/// ## Returns value\n\n/// New object of type [`FrequencySpectrum`].\n\n///\n\n/// ## Examples\n\n/// ### Scaling via dynamic closure\n\n/// ```rust\n\n/// use spectrum_analyzer::{samples_fft_to_spectrum, FrequencyLimit};\n\n/// // get data from audio source\n\n/// let samples = vec![0.0, 1.1, 5.5, -5.5];\n\n/// let res = samples_fft_to_spectrum(\n\n/// &samples,\n\n/// 44100,\n\n/// FrequencyLimit::All,\n\n/// Some(&|val, info| val - info.min),\n\n/// );\n\n/// ```\n\n/// ### Scaling via static function\n\n/// ```rust\n\n/// use spectrum_analyzer::{samples_fft_to_spectrum, FrequencyLimit};\n\n/// use spectrum_analyzer::scaling::scale_to_zero_to_one;\n\n/// // get data from audio source\n\n/// let samples = vec![0.0, 1.1, 5.5, -5.5];\n\n/// let res = samples_fft_to_spectrum(\n\n/// &samples,\n\n/// 44100,\n\n/// FrequencyLimit::All,\n\n/// Some(&scale_to_zero_to_one),\n\n/// );\n\n/// ```\n\n///\n\n/// ## Panics\n\n/// * When `samples.len() > 4096` and `microfft` is used (restriction by the crate)\n\npub fn samples_fft_to_spectrum(\n\n samples: &[f32],\n\n sampling_rate: u32,\n\n frequency_limit: FrequencyLimit,\n\n scaling_fn: Option<SpectrumScalingFunction>,\n\n) -> Result<FrequencySpectrum, SpectrumAnalyzerError> {\n\n // everything below two samples is unreasonable\n\n if samples.len() < 2 {\n\n return Err(SpectrumAnalyzerError::TooFewSamples);\n\n }\n\n // do several checks on input data\n\n if samples.iter().any(|x| x.is_nan()) {\n\n return Err(SpectrumAnalyzerError::NaNValuesNotSupported);\n\n }\n\n if samples.iter().any(|x| x.is_infinite()) {\n\n return Err(SpectrumAnalyzerError::InfinityValuesNotSupported);\n\n }\n\n if !is_power_of_two(samples.len()) {\n\n return Err(SpectrumAnalyzerError::SamplesLengthNotAPowerOfTwo);\n\n }\n","file_path":"src/lib.rs","rank":10,"score":81447.27723229316},{"content":"/// Applies a Blackman-Harris x-term window\n\n/// (<https://en.wikipedia.org/wiki/Window_function#Blackman%E2%80%93Harris_window>)\n\n/// to an array of samples. The x is specified by `alphas.len()`.\n\n///\n\n/// ## Return value\n\n/// New vector with Blackman-Harris x-term window applied to the values.\n\nfn blackman_harris_xterm(samples: &[f32], alphas: &[f32]) -> Vec<f32> {\n\n let mut windowed_samples = Vec::with_capacity(samples.len());\n\n\n\n let samples_len_f32 = samples.len() as f32;\n\n\n\n for sample in samples.iter() {\n\n // Will result in something like that:\n\n /* ALPHA0\n\n + ALPHA1 * ((2.0 * PI * *samples[i])/samples_len_f32).cos()\n\n + ALPHA2 * ((4.0 * PI * *samples[i])/samples_len_f32).cos()\n\n + ALPHA3 * ((6.0 * PI * *samples[i])/samples_len_f32).cos()\n\n */\n\n\n\n let mut acc = 0.0;\n\n for (alpha_i, alpha) in alphas.iter().enumerate() {\n\n // in 1. iter. 0PI, then 2PI, then 4 PI, then 6 PI\n\n let two_pi_iteration = 2.0 * alpha_i as f32 * PI;\n\n let cos = cosf((two_pi_iteration * sample) / samples_len_f32);\n\n acc += alpha * cos;\n\n }\n\n\n\n windowed_samples.push(acc)\n\n }\n\n\n\n windowed_samples\n\n}\n","file_path":"src/windows.rs","rank":11,"score":81188.12569283105},{"content":"/// Like [`sine_wave_audio_data`] but puts multiple sinus waves on top of each other.\n\n/// Returns a audio signal encoded in 16 bit audio resolution which is the sum of\n\n/// multiple sine waves on top of each other. The amplitudes will be scaled from\n\n/// `[-1; 1]` to `[i16::min_value(); i16::max_value()]`\n\n///\n\n/// * `frequency` frequency in Hz for the sinus wave\n\n/// * `sampling_rate` sampling rate, i.e. 44100Hz\n\n/// * `duration_ms` duration of the audio data in milliseconds\n\npub fn sine_wave_audio_data_multiple(\n\n frequencies: &[f32],\n\n sampling_rate: u32,\n\n duration_ms: u32,\n\n) -> Vec<i16> {\n\n if frequencies.is_empty() {\n\n return vec![];\n\n }\n\n\n\n // Generate all sine wave function\n\n let sine_waves = frequencies\n\n .iter()\n\n .map(|f| sine_wave(*f))\n\n .collect::<Vec<Box<dyn Fn(f32) -> f32>>>();\n\n\n\n // How many samples to generate with each sine wave function\n\n let sample_count = (sampling_rate as f32 * (duration_ms as f32 / 1000.0)) as usize;\n\n\n\n // Calculate the final sine wave\n\n let mut sine_wave = Vec::with_capacity(sample_count);\n","file_path":"src/tests/sine.rs","rank":12,"score":75319.50395307154},{"content":"/// Maps a [`Complex32`] to it's magnitude as `f32`. This is done\n\n/// by calculating `sqrt(re*re + im*im)`. This is required to convert\n\n/// the complex FFT result back to real values.\n\n///\n\n/// ## Parameters\n\n/// * `val` A single value from the FFT output buffer of type [`Complex32`].\n\nfn complex_to_magnitude(val: &Complex32) -> f32 {\n\n // calculates sqrt(re*re + im*im), i.e. magnitude of complex number\n\n let sum = val.re * val.re + val.im * val.im;\n\n let sqrt = libm::sqrtf(sum);\n\n debug_assert!(!sqrt.is_nan(), \"sqrt is NaN!\");\n\n sqrt\n\n}\n\n\n\n// idea from https://stackoverflow.com/questions/600293/how-to-check-if-a-number-is-a-power-of-2\n\nconst fn is_power_of_two(num: usize) -> bool {\n\n num != 0 && ((num & (num - 1)) == 0)\n\n}\n\n\n\n// tests module for small unit tests\n\n\n\n#[cfg(test)]\n\nmod tests2 {\n\n use super::*;\n\n\n\n #[test]\n\n fn test_is_power_of_two() {\n\n assert!(!is_power_of_two(0));\n\n assert!(is_power_of_two(1));\n\n assert!(is_power_of_two(2));\n\n assert!(!is_power_of_two(3));\n\n assert!(is_power_of_two(2));\n\n assert!(is_power_of_two(256));\n\n }\n\n}\n","file_path":"src/lib.rs","rank":13,"score":70796.83113407533},{"content":"#[inline(always)]\n\nfn fft_result_to_spectrum(\n\n samples_len: usize,\n\n fft_result: &[Complex32],\n\n sampling_rate: u32,\n\n frequency_limit: FrequencyLimit,\n\n scaling_fn: Option<SpectrumScalingFunction>,\n\n) -> Result<FrequencySpectrum, SpectrumAnalyzerError> {\n\n let maybe_min = frequency_limit.maybe_min();\n\n let maybe_max = frequency_limit.maybe_max();\n\n\n\n let frequency_resolution = fft_calc_frequency_resolution(sampling_rate, samples_len as u32);\n\n\n\n // collect frequency => frequency value in Vector of Pairs/Tuples\n\n let frequency_vec = fft_result\n\n .iter()\n\n // See https://stackoverflow.com/a/4371627/2891595 for more information as well as\n\n // https://www.gaussianwaves.com/2015/11/interpreting-fft-results-complex-dft-frequency-bins-and-fftshift/\n\n //\n\n // The indices 0 to N/2 (inclusive) are usually the most relevant. Although, index\n\n // N/2-1 is declared as the last useful one on stackoverflow (because in typical applications\n","file_path":"src/lib.rs","rank":14,"score":69216.32133498593},{"content":"#[allow(dead_code)]\n\npub fn sine_wave_audio_data(frequency: f32, sampling_rate: u32, duration_ms: u32) -> Vec<i16> {\n\n sine_wave_audio_data_multiple(&[frequency], sampling_rate, duration_ms)\n\n}\n\n\n","file_path":"src/tests/sine.rs","rank":15,"score":67313.9887495815},{"content":"fn bench_with_scaling(samples: Vec<f32>) -> u64 {\n\n let fnc = move || {\n\n samples_fft_to_spectrum(\n\n &samples,\n\n 44100,\n\n FrequencyLimit::All,\n\n Some(&scaling::divide_by_N),\n\n )\n\n .unwrap()\n\n };\n\n bench_fnc(Box::new(fnc))\n\n}\n\n\n","file_path":"examples/bench.rs","rank":16,"score":65950.57257347179},{"content":"#[test]\n\nfn test_spectrum_frequency_limit_inclusive() {\n\n let sampling_rate = 1024;\n\n let sine_audio = sine_wave_audio_data_multiple(&[512.0], sampling_rate, 1000);\n\n\n\n let sine_audio = sine_audio\n\n .into_iter()\n\n .map(|x| x as f32)\n\n .collect::<Vec<f32>>();\n\n\n\n // frequency resolution will be:\n\n // 1024 / 512 = 2 Hz\n\n // we use even frequency resolution in this example for easy testing\n\n // max detectable frequency here is 512Hz\n\n\n\n let window = hann_window(&sine_audio[0..512]);\n\n\n\n {\n\n let spectrum =\n\n samples_fft_to_spectrum(&window, sampling_rate, FrequencyLimit::Max(400.0), None)\n\n .unwrap();\n","file_path":"src/tests/mod.rs","rank":17,"score":62223.24360777614},{"content":"/// Reads an MP3 and returns the audio data as mono channel + the sample rate in Hertz.\n\nfn read_mp3_to_mono(file: &str) -> (Vec<i16>, u32) {\n\n let mut decoder = Mp3Decoder::new(File::open(file).unwrap());\n\n\n\n let mut sampling_rate = 0;\n\n let mut mono_samples = vec![];\n\n loop {\n\n match decoder.next_frame() {\n\n Ok(Mp3Frame {\n\n data: samples_of_frame,\n\n sample_rate,\n\n channels,\n\n ..\n\n }) => {\n\n // that's a bird weird of the original API. Why should channels or sampling\n\n // rate change from frame to frame?\n\n\n\n // Should be constant throughout the MP3 file.\n\n sampling_rate = sample_rate;\n\n\n\n if channels == 2 {\n","file_path":"examples/mp3-samples.rs","rank":18,"score":59220.22768348776},{"content":"#[inline(always)]\n\nfn fft_calc_frequency_resolution(sampling_rate: u32, samples_len: u32) -> f32 {\n\n sampling_rate as f32 / samples_len as f32\n\n}\n\n\n","file_path":"src/lib.rs","rank":19,"score":55801.511391269836},{"content":"/// Benchmark can be used to check how changes effect the performance.\n\n/// Always execute with release flag!\n\nfn main() {\n\n // create 2048 random samples\n\n let samples = (0..2048)\n\n .map(|_| rand::random::<i16>())\n\n .map(|x| x as f32)\n\n .collect::<Vec<_>>();\n\n let hann_window = windows::hann_window(&samples);\n\n\n\n let bench_res_without_scaling = bench_without_scaling(hann_window.clone());\n\n let bench_res_with_scaling = bench_with_scaling(hann_window);\n\n\n\n println!(\n\n \"Bench without scaling: avg = {}us per Iteration\",\n\n bench_res_without_scaling\n\n );\n\n println!(\n\n \"Bench with scaling: avg = {}us per Iteration\",\n\n bench_res_with_scaling\n\n );\n\n}\n\n\n","file_path":"examples/bench.rs","rank":20,"score":46771.86826274308},{"content":"/// Minimal example.\n\nfn main() {\n\n // YOU need to implement the samples source; get microphone input for example\n\n let samples: &[f32] = &[0.0, 3.1, 2.7, -1.0, -2.0, -4.0, 7.0, 6.0];\n\n // apply hann window for smoothing; length must be a power of 2 for the FFT\n\n // 2048 is a good starting point with 44100 kHz\n\n let hann_window = hann_window(&samples[0..8]);\n\n // calc spectrum\n\n let spectrum_hann_window = samples_fft_to_spectrum(\n\n // (windowed) samples\n\n &hann_window,\n\n // sampling rate\n\n 44100,\n\n // optional frequency limit: e.g. only interested in frequencies 50 <= f <= 150?\n\n FrequencyLimit::All,\n\n // optional scale\n\n Some(÷_by_N),\n\n )\n\n .unwrap();\n\n\n\n for (fr, fr_val) in spectrum_hann_window.data().iter() {\n\n println!(\"{}Hz => {}\", fr, fr_val)\n\n }\n\n}\n","file_path":"examples/minimal.rs","rank":21,"score":46768.6233030683},{"content":"fn main() {\n\n println!(\"bass drum example:\");\n\n example__bass_drum_sample();\n\n println!(\"============================\");\n\n println!(\"clap beat example:\");\n\n example__clap_beat_sample();\n\n println!(\"============================\");\n\n println!(\"high hat example:\");\n\n example__high_hat_sample();\n\n}\n\n\n","file_path":"examples/mp3-samples.rs","rank":22,"score":45257.513624122446},{"content":"/// Example that creates a live visualization of the frequency spectrum of realtime audio data\n\n/// **Execute this with `--release`, otherwise it is very laggy!**.\n\nfn main() {\n\n // Contains the data for the spectrum to be visualized. It contains ordered pairs of\n\n // `(frequency, frequency_value)`. During each iteration, the frequency value gets\n\n // combined with `max(old_value * smoothing_factor, new_value)`.\n\n let visualize_spectrum: RefCell<Vec<(f64, f64)>> = RefCell::new(vec![(0.0, 0.0); 1024]);\n\n\n\n // Closure that captures `visualize_spectrum`.\n\n let to_spectrum_fn = move |audio: &[f32], sampling_rate| {\n\n let skip_elements = audio.len() - 2048;\n\n // spectrum analysis only of the latest 46ms\n\n let relevant_samples = &audio[skip_elements..skip_elements + 2048];\n\n\n\n // do FFT\n\n let hann_window = hann_window(relevant_samples);\n\n let latest_spectrum = samples_fft_to_spectrum(\n\n &hann_window,\n\n sampling_rate as u32,\n\n FrequencyLimit::All,\n\n Some(÷_by_N),\n\n )\n","file_path":"examples/live-visualization.rs","rank":23,"score":45257.513624122446},{"content":"// Calculates spectrum via FFT for a given set of samples and applies\n\n// all window functions + plots all\n\nfn to_spectrum_and_plot(\n\n samples: &[f32],\n\n sampling_rate: u32,\n\n filename: &str,\n\n frequency_limit: FrequencyLimit,\n\n) {\n\n let no_window = samples;\n\n\n\n let now = Instant::now();\n\n let hann_window = hann_window(no_window);\n\n println!(\n\n \"[Measurement]: Hann-Window with {} samples took: {}µs\",\n\n samples.len(),\n\n now.elapsed().as_micros()\n\n );\n\n let now = Instant::now();\n\n let hamming_window = hamming_window(no_window);\n\n println!(\n\n \"[Measurement]: Hamming-Window with {} samples took: {}µs\",\n\n samples.len(),\n","file_path":"examples/mp3-samples.rs","rank":24,"score":43906.119403530225},{"content":"#[inline(always)]\n\nfn calculate_y_coord_between_points(\n\n (x1, y1): (f32, f32),\n\n (x2, y2): (f32, f32),\n\n x_coord: f32,\n\n) -> f32 {\n\n // e.g. Points (100, 1.0) and (200, 0.0)\n\n // y=f(x)=-0.01x + c\n\n // 1.0 = f(100) = -0.01x + c\n\n // c = 1.0 + 0.01*100 = 2.0\n\n // y=f(180)=-0.01*180 + 2.0\n\n\n\n // gradient, anstieg\n\n let slope = (y2 - y1) / (x2 - x1);\n\n // calculate c in y=f(x)=slope * x + c\n\n let c = y1 - slope * x1;\n\n\n\n slope * x_coord + c\n\n}\n\n\n\n#[cfg(test)]\n","file_path":"src/spectrum.rs","rank":25,"score":43906.119403530225},{"content":"#[test]\n\nfn test_invalid_input() {\n\n // should not contain NaN\n\n let samples = vec![0.0, 1.0, 2.0, 3.0, f32::NAN, 4.0, 5.0, 6.0];\n\n let err = samples_fft_to_spectrum(&samples, 44100, FrequencyLimit::All, None).unwrap_err();\n\n assert!(matches!(err, SpectrumAnalyzerError::NaNValuesNotSupported));\n\n\n\n // should not contain Infinity\n\n let samples = vec![0.0, 1.0, 2.0, 3.0, f32::INFINITY, 4.0, 5.0, 6.0];\n\n let err = samples_fft_to_spectrum(&samples, 44100, FrequencyLimit::All, None).unwrap_err();\n\n assert!(matches!(\n\n err,\n\n SpectrumAnalyzerError::InfinityValuesNotSupported\n\n ));\n\n\n\n // needs at least two samples\n\n let samples = vec![0.0];\n\n let err = samples_fft_to_spectrum(&samples, 44100, FrequencyLimit::All, None).unwrap_err();\n\n assert!(matches!(err, SpectrumAnalyzerError::TooFewSamples));\n\n\n\n // test frequency limit gets verified\n","file_path":"src/tests/mod.rs","rank":26,"score":42690.39015398416},{"content":"#[test]\n\nfn test_spectrum_power() {\n\n let interesting_frequency = 2048.0;\n\n let sine_audio = sine_wave_audio_data_multiple(&[interesting_frequency], 44100, 1000);\n\n\n\n let sine_audio = sine_audio\n\n .into_iter()\n\n .map(|x| x as f32)\n\n .collect::<Vec<f32>>();\n\n\n\n // FFT frequency accuracy is: sample_rate / (N / 2)\n\n // 44100/(4096/2) = 21.5Hz\n\n\n\n // get a window that we want to analyze\n\n // 1/44100 * 4096 => 0.0928s\n\n let short_window = &sine_audio[0..2048];\n\n let long_window = &sine_audio[0..4096];\n\n\n\n let spectrum_short_window =\n\n samples_fft_to_spectrum(short_window, 44100, FrequencyLimit::All, Some(÷_by_N))\n\n .unwrap();\n","file_path":"src/tests/mod.rs","rank":27,"score":42690.39015398416},{"content":"#[test]\n\nfn test_divide_by_n_has_effect() {\n\n let audio_data = sine_wave_audio_data_multiple(&[100.0, 200.0, 400.0], 1000, 2000);\n\n let audio_data = audio_data.into_iter().map(|x| x as f32).collect::<Vec<_>>();\n\n let audio_data = hann_window(&audio_data[0..1024]);\n\n let normal_spectrum =\n\n samples_fft_to_spectrum(&audio_data, 1000, FrequencyLimit::All, None).unwrap();\n\n let scaled_spectrum =\n\n samples_fft_to_spectrum(&audio_data, 1000, FrequencyLimit::All, Some(÷_by_N))\n\n .unwrap();\n\n for i in 0..512 {\n\n let actual_no_scaling = normal_spectrum.data()[i].1.val();\n\n let actual_with_scaling = scaled_spectrum.data()[i].1.val();\n\n assert!(\n\n (actual_no_scaling / 1024.0 - actual_with_scaling) < 0.1,\n\n \"[{}] actual_no_scaling={} should be roughly 1024 times bigger than actual_with_scaling={}\", \n\n i,\n\n actual_no_scaling,\n\n actual_with_scaling,\n\n );\n\n }\n","file_path":"src/tests/mod.rs","rank":28,"score":42690.39015398416},{"content":"fn bench_fnc(fnc: Box<dyn Fn() -> FrequencySpectrum>) -> u64 {\n\n // warm-up\n\n for _ in 0..10 {\n\n let _ = fnc();\n\n }\n\n let now = Instant::now();\n\n let runs = 10000;\n\n for _ in 0..runs {\n\n let _ = fnc();\n\n }\n\n let duration = now.elapsed();\n\n (duration.as_micros() / runs) as u64\n\n}\n","file_path":"examples/bench.rs","rank":29,"score":42028.24522250632},{"content":"#[allow(non_snake_case)]\n\nfn example__bass_drum_sample() {\n\n // this sample is exactly 0,628s long\n\n // we have 44100samples/s*0,628s == 28695 samples\n\n // next smaller power of two is: 2^14 == 16384 => FFT needs power of 2\n\n let (samples, sampling_rate) =\n\n read_mp3_to_mono(\"test/samples/bass_drum_with_high-hat_at_end-sample.mp3\");\n\n let samples = samples.into_iter().map(|x| x as f32).collect::<Vec<f32>>();\n\n\n\n to_spectrum_and_plot(\n\n &samples[0..4096],\n\n sampling_rate,\n\n \"example__mp3-samples__bass_drum__spectrum\",\n\n FrequencyLimit::Max(5000.0),\n\n )\n\n}\n\n\n","file_path":"examples/mp3-samples.rs","rank":30,"score":41590.87339728999},{"content":"#[allow(non_snake_case)]\n\nfn example__clap_beat_sample() {\n\n // this sample is exactly 0,379s long\n\n // we have 44100samples/s*0,379s == 16714 samples\n\n // next smaller power of two is: 2^14 == 16384 => FFT needs power of 2\n\n let (samples, sampling_rate) = read_mp3_to_mono(\"test/samples/clap-beat-sample.mp3\");\n\n let samples = samples.into_iter().map(|x| x as f32).collect::<Vec<f32>>();\n\n\n\n to_spectrum_and_plot(\n\n &samples[0..4096],\n\n sampling_rate,\n\n \"example__mp3-samples__clap_beat__spectrum\",\n\n FrequencyLimit::Max(5000.0),\n\n )\n\n}\n\n\n","file_path":"examples/mp3-samples.rs","rank":31,"score":41590.87339728999},{"content":"#[test]\n\nfn test_spectrum_nyquist_theorem2() {\n\n let sine_audio = sine_wave_audio_data_multiple(\n\n // 22050.0 results in aliasing and no good results\n\n &[22049.9],\n\n 44100,\n\n 1000,\n\n )\n\n .into_iter()\n\n .map(|x| x as f32)\n\n .collect::<Vec<f32>>();\n\n let spectrum = samples_fft_to_spectrum(\n\n &sine_audio[0..4096],\n\n 44100,\n\n FrequencyLimit::All,\n\n Some(&scale_to_zero_to_one),\n\n )\n\n .unwrap();\n\n assert_eq!(\n\n 0.0,\n\n spectrum.min_fr().val(),\n","file_path":"src/tests/mod.rs","rank":32,"score":41590.87339728999},{"content":"#[allow(non_snake_case)]\n\nfn example__high_hat_sample() {\n\n // this sample is exactly 0,149s long\n\n // we have 44100samples/s*0,149s == 6571 samples\n\n // next smaller power of two is: 2^12 == 4096 => FFT needs power of 2\n\n let (samples, sampling_rate) = read_mp3_to_mono(\"test/samples/high-hat-sample.mp3\");\n\n let samples = samples.into_iter().map(|x| x as f32).collect::<Vec<f32>>();\n\n\n\n to_spectrum_and_plot(\n\n &samples[0..4096],\n\n sampling_rate,\n\n \"example__mp3-samples__high-hat__spectrum\",\n\n FrequencyLimit::All,\n\n )\n\n}\n\n\n","file_path":"examples/mp3-samples.rs","rank":33,"score":41590.87339728999},{"content":"#[test]\n\nfn test_scaling_produces_error() {\n\n let samples = vec![1.1, 2.2, 3.3, 4.4, 5.5, 6.6, 7.7, 8.8];\n\n let _ = samples_fft_to_spectrum(\n\n &samples,\n\n 44100,\n\n FrequencyLimit::All,\n\n Some(&|_val, _info| f32::NAN),\n\n )\n\n .expect_err(\"Must throw error due to illegal scaling!\");\n\n}\n\n\n\n/// Test that the scaling actually has the effect that we expect it to have.\n","file_path":"src/tests/mod.rs","rank":34,"score":41590.87339728999},{"content":"#[test]\n\nfn test_spectrum_nyquist_theorem() {\n\n let dummy_audio_samples = vec![0.0; 4096];\n\n let spectrum =\n\n samples_fft_to_spectrum(&dummy_audio_samples, 44100, FrequencyLimit::All, None).unwrap();\n\n assert_eq!(\n\n // because indices 0..N/2 (inclusive) of the FFT result are relevant\n\n // => DC component to Nyquist frequency\n\n 4096 / 2 + 1,\n\n spectrum\n\n .data()\n\n .iter()\n\n .map(|x| x.1)\n\n .filter(|x| x.val() == 0.0)\n\n .count(),\n\n \"All frequency values must be exactly zero because the input signal is zero!\"\n\n );\n\n assert_eq!(\n\n 0.0,\n\n spectrum.min_fr().val(),\n\n \"Minimum frequency must be 0 Hz (DS Component/DC bias/Gleichwert)\"\n\n );\n\n assert_eq!(\n\n 44100.0 / 2.0,\n\n spectrum.max_fr().val(),\n\n \"Maximum frequency must be Nyquist frequency\"\n\n );\n\n}\n\n/// Tests that the spectrum contains the Nyquist frequency using a sine wave at almost Nyquist\n\n/// frequency.\n","file_path":"src/tests/mod.rs","rank":35,"score":41590.87339728999},{"content":"#[test]\n\nfn test_only_null_samples_valid() {\n\n let samples = vec![0.0, 0.0];\n\n let _ = samples_fft_to_spectrum(&samples, 44100, FrequencyLimit::All, None).unwrap();\n\n}\n\n\n","file_path":"src/tests/mod.rs","rank":36,"score":41590.87339728999},{"content":"#[test]\n\nfn test_spectrum_and_visualize_sine_waves_50_1000_3777hz() {\n\n let sine_audio = sine_wave_audio_data_multiple(&[50.0, 1000.0, 3777.0], 44100, 1000);\n\n\n\n // visualize waveform\n\n waveform_static_plotters_png_visualize(\n\n &sine_audio,\n\n Channels::Mono,\n\n TEST_OUT_DIR,\n\n \"test_spectrum_and_visualize_sine_waves_50_1000_3777hz--WAVEFORM.png\",\n\n );\n\n\n\n let sine_audio = sine_audio\n\n .into_iter()\n\n .map(|x| x as f32)\n\n .collect::<Vec<f32>>();\n\n\n\n // FFT frequency accuracy is: sample_rate / (N / 2)\n\n // 44100/(4096/2) = 21.5Hz\n\n\n\n // get a window that we want to analyze\n","file_path":"src/tests/mod.rs","rank":37,"score":39679.63982100207},{"content":"/*\n\nMIT License\n\n\n\nCopyright (c) 2021 Philipp Schuster\n\n\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\n\nof this software and associated documentation files (the \"Software\"), to deal\n\nin the Software without restriction, including without limitation the rights\n\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n\ncopies of the Software, and to permit persons to whom the Software is\n\nfurnished to do so, subject to the following conditions:\n\n\n\nThe above copyright notice and this permission notice shall be included in all\n\ncopies or substantial portions of the Software.\n\n\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n","file_path":"src/fft/rustfft_complex.rs","rank":47,"score":119.3797668027025},{"content":"/*\n\nMIT License\n\n\n\nCopyright (c) 2021 Philipp Schuster\n\n\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\n\nof this software and associated documentation files (the \"Software\"), to deal\n\nin the Software without restriction, including without limitation the rights\n\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n\ncopies of the Software, and to permit persons to whom the Software is\n\nfurnished to do so, subject to the following conditions:\n\n\n\nThe above copyright notice and this permission notice shall be included in all\n\ncopies or substantial portions of the Software.\n\n\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n","file_path":"src/fft/mod.rs","rank":48,"score":119.37976680270248},{"content":"/*\n\nMIT License\n\n\n\nCopyright (c) 2021 Philipp Schuster\n\n\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\n\nof this software and associated documentation files (the \"Software\"), to deal\n\nin the Software without restriction, including without limitation the rights\n\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n\ncopies of the Software, and to permit persons to whom the Software is\n\nfurnished to do so, subject to the following conditions:\n\n\n\nThe above copyright notice and this permission notice shall be included in all\n\ncopies or substantial portions of the Software.\n\n\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n","file_path":"src/tests/sine.rs","rank":49,"score":119.37976680270249},{"content":"/*\n\nMIT License\n\n\n\nCopyright (c) 2021 Philipp Schuster\n\n\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\n\nof this software and associated documentation files (the \"Software\"), to deal\n\nin the Software without restriction, including without limitation the rights\n\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n\ncopies of the Software, and to permit persons to whom the Software is\n\nfurnished to do so, subject to the following conditions:\n\n\n\nThe above copyright notice and this permission notice shall be included in all\n\ncopies or substantial portions of the Software.\n\n\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n","file_path":"src/fft/microfft_real.rs","rank":50,"score":119.3797668027025},{"content":"/*\n\nMIT License\n\n\n\nCopyright (c) 2021 Philipp Schuster\n\n\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\n\nof this software and associated documentation files (the \"Software\"), to deal\n\nin the Software without restriction, including without limitation the rights\n\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n\ncopies of the Software, and to permit persons to whom the Software is\n\nfurnished to do so, subject to the following conditions:\n\n\n\nThe above copyright notice and this permission notice shall be included in all\n\ncopies or substantial portions of the Software.\n\n\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n","file_path":"src/frequency.rs","rank":51,"score":119.3797668027025},{"content":"/*\n\nMIT License\n\n\n\nCopyright (c) 2021 Philipp Schuster\n\n\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\n\nof this software and associated documentation files (the \"Software\"), to deal\n\nin the Software without restriction, including without limitation the rights\n\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n\ncopies of the Software, and to permit persons to whom the Software is\n\nfurnished to do so, subject to the following conditions:\n\n\n\nThe above copyright notice and this permission notice shall be included in all\n\ncopies or substantial portions of the Software.\n\n\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n","file_path":"src/scaling.rs","rank":52,"score":119.37976680270249},{"content":"/*\n\nMIT License\n\n\n\nCopyright (c) 2021 Philipp Schuster\n\n\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\n\nof this software and associated documentation files (the \"Software\"), to deal\n\nin the Software without restriction, including without limitation the rights\n\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n\ncopies of the Software, and to permit persons to whom the Software is\n\nfurnished to do so, subject to the following conditions:\n\n\n\nThe above copyright notice and this permission notice shall be included in all\n\ncopies or substantial portions of the Software.\n\n\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n","file_path":"src/lib.rs","rank":53,"score":119.37976680270249},{"content":"/*\n\nMIT License\n\n\n\nCopyright (c) 2021 Philipp Schuster\n\n\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\n\nof this software and associated documentation files (the \"Software\"), to deal\n\nin the Software without restriction, including without limitation the rights\n\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n\ncopies of the Software, and to permit persons to whom the Software is\n\nfurnished to do so, subject to the following conditions:\n\n\n\nThe above copyright notice and this permission notice shall be included in all\n\ncopies or substantial portions of the Software.\n\n\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n","file_path":"src/spectrum.rs","rank":54,"score":119.37976680270249},{"content":"/*\n\nMIT License\n\n\n\nCopyright (c) 2021 Philipp Schuster\n\n\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\n\nof this software and associated documentation files (the \"Software\"), to deal\n\nin the Software without restriction, including without limitation the rights\n\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n\ncopies of the Software, and to permit persons to whom the Software is\n\nfurnished to do so, subject to the following conditions:\n\n\n\nThe above copyright notice and this permission notice shall be included in all\n\ncopies or substantial portions of the Software.\n\n\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n","file_path":"examples/mp3-samples.rs","rank":55,"score":119.37976680270252},{"content":"/*\n\nMIT License\n\n\n\nCopyright (c) 2021 Philipp Schuster\n\n\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\n\nof this software and associated documentation files (the \"Software\"), to deal\n\nin the Software without restriction, including without limitation the rights\n\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n\ncopies of the Software, and to permit persons to whom the Software is\n\nfurnished to do so, subject to the following conditions:\n\n\n\nThe above copyright notice and this permission notice shall be included in all\n\ncopies or substantial portions of the Software.\n\n\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n","file_path":"examples/bench.rs","rank":56,"score":119.37976680270249},{"content":"/*\n\nMIT License\n\n\n\nCopyright (c) 2021 Philipp Schuster\n\n\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\n\nof this software and associated documentation files (the \"Software\"), to deal\n\nin the Software without restriction, including without limitation the rights\n\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n\ncopies of the Software, and to permit persons to whom the Software is\n\nfurnished to do so, subject to the following conditions:\n\n\n\nThe above copyright notice and this permission notice shall be included in all\n\ncopies or substantial portions of the Software.\n\n\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n","file_path":"examples/live-visualization.rs","rank":57,"score":119.37976680270252},{"content":"/*\n\nMIT License\n\n\n\nCopyright (c) 2021 Philipp Schuster\n\n\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\n\nof this software and associated documentation files (the \"Software\"), to deal\n\nin the Software without restriction, including without limitation the rights\n\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n\ncopies of the Software, and to permit persons to whom the Software is\n\nfurnished to do so, subject to the following conditions:\n\n\n\nThe above copyright notice and this permission notice shall be included in all\n\ncopies or substantial portions of the Software.\n\n\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n","file_path":"src/fft/microfft_complex.rs","rank":58,"score":119.37976680270249},{"content":"/*\n\nMIT License\n\n\n\nCopyright (c) 2021 Philipp Schuster\n\n\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\n\nof this software and associated documentation files (the \"Software\"), to deal\n\nin the Software without restriction, including without limitation the rights\n\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n\ncopies of the Software, and to permit persons to whom the Software is\n\nfurnished to do so, subject to the following conditions:\n\n\n\nThe above copyright notice and this permission notice shall be included in all\n\ncopies or substantial portions of the Software.\n\n\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n","file_path":"src/tests/mod.rs","rank":59,"score":119.37976680270248},{"content":"/*\n\nMIT License\n\n\n\nCopyright (c) 2021 Philipp Schuster\n\n\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\n\nof this software and associated documentation files (the \"Software\"), to deal\n\nin the Software without restriction, including without limitation the rights\n\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n\ncopies of the Software, and to permit persons to whom the Software is\n\nfurnished to do so, subject to the following conditions:\n\n\n\nThe above copyright notice and this permission notice shall be included in all\n\ncopies or substantial portions of the Software.\n\n\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n","file_path":"src/error.rs","rank":60,"score":119.37976680270249},{"content":"/*\n\nMIT License\n\n\n\nCopyright (c) 2021 Philipp Schuster\n\n\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\n\nof this software and associated documentation files (the \"Software\"), to deal\n\nin the Software without restriction, including without limitation the rights\n\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n\ncopies of the Software, and to permit persons to whom the Software is\n\nfurnished to do so, subject to the following conditions:\n\n\n\nThe above copyright notice and this permission notice shall be included in all\n\ncopies or substantial portions of the Software.\n\n\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n","file_path":"src/windows.rs","rank":61,"score":119.3797668027025},{"content":"/*\n\nMIT License\n\n\n\nCopyright (c) 2021 Philipp Schuster\n\n\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\n\nof this software and associated documentation files (the \"Software\"), to deal\n\nin the Software without restriction, including without limitation the rights\n\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n\ncopies of the Software, and to permit persons to whom the Software is\n\nfurnished to do so, subject to the following conditions:\n\n\n\nThe above copyright notice and this permission notice shall be included in all\n\ncopies or substantial portions of the Software.\n\n\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\nSOFTWARE.\n\n*/\n\n\n\nuse spectrum_analyzer::scaling::divide_by_N;\n\nuse spectrum_analyzer::windows::hann_window;\n\nuse spectrum_analyzer::{samples_fft_to_spectrum, FrequencyLimit};\n\n\n\n/// Minimal example.\n","file_path":"examples/minimal.rs","rank":62,"score":109.57560305233866},{"content":"OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\nSOFTWARE.\n\n*/\n\n//! This module contains convenient public transform functions that you can use\n\n//! as parameters in [`crate::samples_fft_to_spectrum`] for scaling the\n\n//! frequency value (the FFT result). They act as \"idea/inspiration\". Feel free\n\n//! to either compose them or create your own derivation from them.\n\n\n\nuse alloc::boxed::Box;\n\n\n\n/// Helper struct for [`SpectrumScalingFunction`], that gets passed into the\n\n/// function together with the actual value. This structure can be used to scale\n\n/// each value. All properties reference the current data of a\n\n/// [`crate::spectrum::FrequencySpectrum`].\n\n///\n\n/// This uses `f32` in favor of [`crate::FrequencyValue`] because the latter led to\n\n/// some implementation problems.\n\n#[derive(Debug)]\n\npub struct SpectrumDataStats {\n\n /// Minimal frequency value in spectrum.\n","file_path":"src/scaling.rs","rank":63,"score":24.29572081115358},{"content":"#[derive(Debug, Copy, Clone, Default)]\n\npub struct OrderableF32(f32);\n\n\n\nimpl OrderableF32 {\n\n #[inline(always)]\n\n pub const fn val(&self) -> f32 {\n\n self.0\n\n }\n\n}\n\n\n\nimpl From<f32> for OrderableF32 {\n\n #[inline(always)]\n\n fn from(val: f32) -> Self {\n\n debug_assert!(!val.is_nan(), \"NaN-values are not supported!\");\n\n debug_assert!(!val.is_infinite(), \"Infinite-values are not supported!\");\n\n Self(val)\n\n }\n\n}\n\n\n\nimpl Display for OrderableF32 {\n","file_path":"src/frequency.rs","rank":64,"score":22.92442762340749},{"content":"OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\nSOFTWARE.\n\n*/\n\n//! Module for the struct [`OrderableF32`] and the two\n\n//! convenient type definitions [`Frequency`] and [`FrequencyValue`].\n\n\n\nuse core::cmp::Ordering;\n\nuse core::fmt::{Display, Formatter, Result};\n\nuse core::ops::{Add, Div, Mul, Sub};\n\n\n\n/// A frequency. A convenient wrapper type around `f32`.\n\npub type Frequency = OrderableF32;\n\n/// The value of a frequency in a frequency spectrum. Convenient wrapper around `f32`.\n\n/// Not necessarily the magnitude of the complex numbers because scaling/normalization\n\n/// functions could have been applied.\n\npub type FrequencyValue = OrderableF32;\n\n\n\n/// Small convenient wrapper around `f32`.\n\n/// Mainly required to make `f32` operable in a sorted tree map.\n\n/// You should only use the type aliases `Frequency` and `FrequencyValue`.\n","file_path":"src/frequency.rs","rank":65,"score":22.7741969515162},{"content":"OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\nSOFTWARE.\n\n*/\n\nuse audio_visualizer::dynamic::live_input::AudioDevAndCfg;\n\nuse audio_visualizer::dynamic::window_top_btm::{open_window_connect_audio, TransformFn};\n\nuse spectrum_analyzer::scaling::divide_by_N;\n\nuse spectrum_analyzer::windows::hann_window;\n\nuse spectrum_analyzer::{samples_fft_to_spectrum, FrequencyLimit, FrequencyValue};\n\nuse std::cell::RefCell;\n\nuse std::cmp::max;\n\n\n\n/// Example that creates a live visualization of the frequency spectrum of realtime audio data\n\n/// **Execute this with `--release`, otherwise it is very laggy!**.\n","file_path":"examples/live-visualization.rs","rank":66,"score":20.27360077212534},{"content":"OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\nSOFTWARE.\n\n*/\n\n//! Errors related to the spectrum analysis via FFT. Most probably, the errors will\n\n//! result in wrong input data, before the actual calculation has begun.\n\n//!\n\n//! This module focuses on the \"overall\" errors. More specific errors might be\n\n//! located in submodules.\n\n\n\nuse crate::limit::FrequencyLimitError;\n\n\n\n/// Describes main errors of the library. Almost all errors\n\n/// are caused by wrong input.\n\n#[derive(Debug)]\n\npub enum SpectrumAnalyzerError {\n\n /// There must be at least two samples.\n\n TooFewSamples,\n\n /// NaN values in samples are not supported!\n\n NaNValuesNotSupported,\n\n /// Infinity-values (regarding floating point representation) in samples are not supported!\n","file_path":"src/error.rs","rank":67,"score":20.08583312332127},{"content":"OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\nSOFTWARE.\n\n*/\n\n\n\n#![deny(\n\n clippy::all,\n\n clippy::cargo,\n\n clippy::nursery,\n\n // clippy::restriction,\n\n // clippy::pedantic\n\n)]\n\n// now allow a few rules which are denied by the above statement\n\n// --> they are ridiculous and not necessary\n\n#![allow(\n\n clippy::suboptimal_flops,\n\n clippy::redundant_pub_crate,\n\n clippy::fallible_impl_from\n\n)]\n\n#![deny(missing_debug_implementations)]\n\n#![deny(rustdoc::all)]\n","file_path":"examples/mp3-samples.rs","rank":68,"score":19.222418633593453},{"content":"OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\nSOFTWARE.\n\n*/\n\n\n\n#![deny(\n\n clippy::all,\n\n clippy::cargo,\n\n clippy::nursery,\n\n // clippy::restriction,\n\n // clippy::pedantic\n\n)]\n\n// now allow a few rules which are denied by the above statement\n\n// --> they are ridiculous and not necessary\n\n#![allow(\n\n clippy::suboptimal_flops,\n\n clippy::redundant_pub_crate,\n\n clippy::fallible_impl_from\n\n)]\n\n#![deny(missing_debug_implementations)]\n\n#![deny(rustdoc::all)]\n\n\n\nuse std::time::Instant;\n\n\n\nuse spectrum_analyzer::*;\n\n\n\n/// Benchmark can be used to check how changes effect the performance.\n\n/// Always execute with release flag!\n","file_path":"examples/bench.rs","rank":69,"score":18.40319923657838},{"content":"OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\nSOFTWARE.\n\n*/\n\n//! Complex FFT using `microfft::complex`. Results should be equal to the ones from `rustfft`.\n\n//! The difference is that this implementation works in `no_std`-environments but it is\n\n//! limited to a maximum sample length of 4096 (with microfft version 0.4.0)\n\n\n\nuse alloc::vec::Vec;\n\n\n\nuse crate::fft::Fft;\n\nuse core::convert::TryInto;\n\nuse microfft::complex;\n\n\n\n/// The result of a FFT is always complex but because different FFT crates might\n\n/// use different versions of \"num-complex\", each implementation exports\n\n/// it's own version that gets used in lib.rs for binary compatibility.\n\npub use microfft::Complex32;\n\n\n\n/// Dummy struct with no properties but used as a type\n\n/// to implement a concrete FFT strategy using (`microfft::complex`).\n","file_path":"src/fft/microfft_complex.rs","rank":70,"score":18.052543683653944},{"content":"OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\nSOFTWARE.\n\n*/\n\n//! Module for the struct [`FrequencySpectrum`].\n\n\n\nuse crate::error::SpectrumAnalyzerError;\n\nuse crate::frequency::{Frequency, FrequencyValue};\n\nuse crate::scaling::{SpectrumDataStats, SpectrumScalingFunction};\n\nuse alloc::collections::BTreeMap;\n\nuse alloc::vec::Vec;\n\nuse core::cell::{Cell, Ref, RefCell};\n\n\n\n/// Convenient wrapper around the processed FFT result which describes each frequency and\n\n/// its value/amplitude in the analyzed slice of samples. It only consists of the frequencies\n\n/// which were desired, e.g. specified via\n\n/// [`crate::limit::FrequencyLimit`] when [`crate::samples_fft_to_spectrum`] was called.\n\n///\n\n/// This means, the spectrum can cover all data from the DC component (0Hz) to the\n\n/// Nyquist frequency.\n\n///\n","file_path":"src/spectrum.rs","rank":71,"score":17.85281639187906},{"content":"OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\nSOFTWARE.\n\n*/\n\n//! Several window functions which you can apply before doing the FFT.\n\n//! For more information:\n\n//! - <https://en.wikipedia.org/wiki/Window_function>\n\n//! - <https://www.youtube.com/watch?v=dCeHOf4cJE0> (FFT and windowing by Texas Instruments)\n\n\n\nuse alloc::vec::Vec;\n\nuse core::f32::consts::PI;\n\n// replacement for std functions like sin and cos in no_std-environments\n\nuse libm::cosf;\n\n\n\n/*/// Describes what window function should be applied to\n\n/// the `samples` parameter of [`crate::samples_fft_to_spectrum`]\n\n/// should be applied before the FFT starts. See\n\n/// https://en.wikipedia.org/wiki/Window_function for more\n\n/// resources.\n\npub enum WindowFn {\n\n\n\n}*/\n\n\n\n/// Applies a Hann window (<https://en.wikipedia.org/wiki/Window_function#Hann_and_Hamming_windows>)\n\n/// to an array of samples.\n\n///\n\n/// ## Return value\n\n/// New vector with Hann window applied to the values.\n","file_path":"src/windows.rs","rank":72,"score":17.12078600896075},{"content":"/// All results are related to the sampling rate provided to the library function which\n\n/// creates objects of this struct!\n\n#[derive(Debug, Default)]\n\npub struct FrequencySpectrum {\n\n /// Raw data. Vector is sorted from lowest\n\n /// frequency to highest and data is normalized/scaled\n\n /// according to all applied scaling functions.\n\n data: RefCell<Vec<(Frequency, FrequencyValue)>>,\n\n /// Frequency resolution of the examined samples in Hertz,\n\n /// i.e the frequency steps between elements in the vector\n\n /// inside field [`Self::data`].\n\n frequency_resolution: f32,\n\n /// Number of samples. This property must be kept separately, because\n\n /// `data.borrow().len()` might contain less than N elements, if the\n\n /// spectrum was created with a [`crate::limit::FrequencyLimit`] .\n\n samples_len: u32,\n\n /// Average value of frequency value/magnitude/amplitude\n\n /// corresponding to data in [`FrequencySpectrum::data`].\n\n average: Cell<FrequencyValue>,\n\n /// Median value of frequency value/magnitude/amplitude\n","file_path":"src/spectrum.rs","rank":73,"score":17.08804900828108},{"content":" let max_detectable_frequency = sampling_rate as f32 / 2.0;\n\n // verify frequency limit: unwrap error or else ok\n\n let _ = frequency_limit\n\n .verify(max_detectable_frequency)\n\n .map_err(SpectrumAnalyzerError::InvalidFrequencyLimit)?;\n\n\n\n // With FFT we transform an array of time-domain waveform samples\n\n // into an array of frequency-domain spectrum samples\n\n // https://www.youtube.com/watch?v=z7X6jgFnB6Y\n\n\n\n // FFT result has same length as input\n\n // (but when we interpret the result, we don't need all indices)\n\n\n\n // applies the f32 samples onto the FFT algorithm implementation\n\n // chosen at compile time (via Cargo feature).\n\n // If a complex FFT implementation was chosen, this will internally\n\n // transform all data to Complex numbers.\n\n let buffer = FftImpl::fft_apply(samples);\n\n\n\n // This function:\n","file_path":"src/lib.rs","rank":74,"score":17.043152895653368},{"content":"OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\nSOFTWARE.\n\n*/\n\n//! Module for generating synthetic sine waves.\n\n\n\nuse alloc::boxed::Box;\n\nuse alloc::vec::Vec;\n\nuse core::f32::consts::PI;\n\n\n\n/// Creates a sine (sinus) wave function for a given frequency.\n\n/// Don't forget to scale up the value to the audio resolution.\n\n/// So far, amplitude is in interval `[-1; 1]`. The parameter\n\n/// of the returned function is the point in time in seconds.\n\n///\n\n/// * `frequency` is in Hertz\n","file_path":"src/tests/sine.rs","rank":75,"score":16.904379108458027},{"content":" #[inline(always)]\n\n pub fn range(&self) -> FrequencyValue {\n\n self.max().1 - self.min().1\n\n }\n\n\n\n /// Returns the underlying data.\n\n #[inline(always)]\n\n pub fn data(&self) -> Ref<Vec<(Frequency, FrequencyValue)>> {\n\n self.data.borrow()\n\n }\n\n\n\n /// Returns the frequency resolution of this spectrum.\n\n #[inline(always)]\n\n pub const fn frequency_resolution(&self) -> f32 {\n\n self.frequency_resolution\n\n }\n\n\n\n /// Returns the number of samples used to obtain this spectrum.\n\n #[inline(always)]\n\n pub const fn samples_len(&self) -> u32 {\n","file_path":"src/spectrum.rs","rank":76,"score":16.878767880314125},{"content":" fn fmt(&self, f: &mut Formatter<'_>) -> Result {\n\n write!(f, \"{}\", self.0)\n\n }\n\n}\n\n\n\nimpl Ord for OrderableF32 {\n\n #[inline(always)]\n\n fn cmp(&self, other: &Self) -> Ordering {\n\n self.partial_cmp(other).unwrap()\n\n }\n\n}\n\n\n\nimpl Eq for OrderableF32 {}\n\n\n\nimpl PartialEq for OrderableF32 {\n\n #[inline(always)]\n\n fn eq(&self, other: &Self) -> bool {\n\n matches!(self.cmp(other), Ordering::Equal)\n\n }\n\n}\n","file_path":"src/frequency.rs","rank":77,"score":16.79715204873362},{"content":" /// then `get_frequency_value_closest(320)` will return `(300.0, 0.5)`.\n\n ///\n\n /// ## Panics\n\n /// If parameter `search_fre` (frequency) is below the lowest or the maximum\n\n /// frequency, this function panics!\n\n ///\n\n /// ## Parameters\n\n /// - `search_fr` The frequency of that you want the amplitude/value in the spectrum.\n\n ///\n\n /// ## Return\n\n /// Closest matching point in spectrum, determined by [`Self::frequency_resolution`].\n\n #[inline(always)]\n\n pub fn freq_val_closest(&self, search_fr: f32) -> (Frequency, FrequencyValue) {\n\n let data = self.data.borrow();\n\n\n\n // lowest frequency in the spectrum\n\n // TODO use minFrequency() and maxFrequency()\n\n let (min_fr, min_fr_val) = data[0];\n\n // highest frequency in the spectrum\n\n let (max_fr, max_fr_val) = data[data.len() - 1];\n","file_path":"src/spectrum.rs","rank":78,"score":16.779183296853173},{"content":" /// frequency, this function panics! This is because the user provide\n\n /// the min/max frequency when the spectrum is created and knows about it.\n\n /// This is similar to an intended \"out of bounds\"-access.\n\n ///\n\n /// ## Parameters\n\n /// - `search_fr` The frequency of that you want the amplitude/value in the spectrum.\n\n ///\n\n /// ## Return\n\n /// Either exact value of approximated value, determined by [`Self::frequency_resolution`].\n\n #[inline(always)]\n\n pub fn freq_val_exact(&self, search_fr: f32) -> FrequencyValue {\n\n let data = self.data.borrow();\n\n\n\n // lowest frequency in the spectrum\n\n // TODO use minFrequency() and maxFrequency()\n\n let (min_fr, min_fr_val) = data[0];\n\n // highest frequency in the spectrum\n\n let (max_fr, max_fr_val) = data[data.len() - 1];\n\n\n\n // https://docs.rs/float-cmp/0.8.0/float_cmp/\n","file_path":"src/spectrum.rs","rank":79,"score":16.756987078292457},{"content":"\n\nuse alloc::vec::Vec;\n\n\n\nuse crate::error::SpectrumAnalyzerError;\n\nuse crate::fft::{Complex32, Fft, FftImpl};\n\npub use crate::frequency::{Frequency, FrequencyValue};\n\npub use crate::limit::FrequencyLimit;\n\npub use crate::limit::FrequencyLimitError;\n\nuse crate::scaling::SpectrumScalingFunction;\n\npub use crate::spectrum::FrequencySpectrum;\n\n\n\npub mod error;\n\nmod fft;\n\nmod frequency;\n\nmod limit;\n\npub mod scaling;\n\nmod spectrum;\n\npub mod windows;\n\n\n\n// test module for large \"integration\"-like tests\n","file_path":"src/lib.rs","rank":80,"score":16.081331840669133},{"content":"/// You must take care of, that you don't have division by zero in your function or\n\n/// that the result is NaN or Infinity (regarding IEEE-754). If the result is NaN or Infinity,\n\n/// the library will return `Err`.\n\n///\n\n/// This uses `f32` in favor of [`crate::FrequencyValue`] because the latter led to\n\n/// some implementation problems.\n\npub type SpectrumScalingFunction<'a> = &'a dyn Fn(f32, &SpectrumDataStats) -> f32;\n\n\n\n/// Calculates the base 10 logarithm of each frequency magnitude and\n\n/// multiplies it with 20. This scaling is quite common, you can\n\n/// find more information for example here:\n\n/// <https://www.sjsu.edu/people/burford.furman/docs/me120/FFT_tutorial_NI.pdf>\n\n///\n\n/// ## Usage\n\n/// ```rust\n\n///use spectrum_analyzer::{samples_fft_to_spectrum, scaling, FrequencyLimit};\n\n///let window = [0.0, 0.1, 0.2, 0.3]; // add real data here\n\n///let spectrum = samples_fft_to_spectrum(\n\n/// &window,\n\n/// 44100,\n\n/// FrequencyLimit::All,\n\n/// Some(&scaling::scale_20_times_log10),\n\n/// );\n\n/// ```\n\n/// Function is of type [`SpectrumScalingFunction`].\n","file_path":"src/scaling.rs","rank":81,"score":16.015905445211438},{"content":" pub min: f32,\n\n /// Maximum frequency value in spectrum.\n\n pub max: f32,\n\n /// Average frequency value in spectrum.\n\n pub average: f32,\n\n /// Median frequency value in spectrum.\n\n pub median: f32,\n\n /// Number of samples (`samples.len()`). Already\n\n /// casted to f32, to avoid repeatedly casting in a loop for each value.\n\n pub n: f32,\n\n}\n\n\n\n/// Describes the type for a function that scales/normalizes the data inside [`crate::FrequencySpectrum`].\n\n/// The scaling only affects the value/amplitude of the frequency, but not the frequency itself.\n\n/// It gets applied to every single element.\n\n/// ///\n\n/// A scaling function can be used for example to subtract the minimum (`min`) from each value.\n\n/// It is optional to use the second parameter [`SpectrumDataStats`].\n\n/// and the type works with static functions as well as dynamically created closures.\n\n///\n","file_path":"src/scaling.rs","rank":82,"score":16.012947366781145},{"content":"OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\nSOFTWARE.\n\n*/\n\n//! Complex FFT using `rustfft`. Results should be equal to the ones from `microfft`.\n\n//! The difference is that this implementation works only in `std`-environments\n\n//! and can handle sample lengths of more than 4096.\n\n\n\nuse alloc::vec::Vec;\n\n\n\nuse crate::fft::Fft as FftAbstraction;\n\nuse rustfft::algorithm::Radix4;\n\nuse rustfft::{Fft, FftDirection};\n\n\n\n/// The result of a FFT is always complex but because different FFT crates might\n\n/// use different versions of \"num-complex\", each implementation exports\n\n/// it's own version that gets used in lib.rs for binary compatibility.\n\npub use rustfft::num_complex::Complex32;\n\n\n\n/// Dummy struct with no properties but used as a type\n\n/// to implement a concrete FFT strategy using (`rustfft::algorithm::Radix4`).\n","file_path":"src/fft/rustfft_complex.rs","rank":83,"score":15.827613933257087},{"content":"OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\nSOFTWARE.\n\n*/\n\n//! Test module for \"integration\"-like tests. No small unit tests of simple functions.\n\n\n\nuse crate::error::SpectrumAnalyzerError;\n\nuse crate::scaling::{divide_by_N, scale_to_zero_to_one};\n\nuse crate::tests::sine::sine_wave_audio_data_multiple;\n\nuse crate::windows::{hamming_window, hann_window};\n\nuse crate::{samples_fft_to_spectrum, FrequencyLimit};\n\nuse alloc::vec::Vec;\n\nuse audio_visualizer::spectrum::plotters_png_file::spectrum_static_plotters_png_visualize;\n\nuse audio_visualizer::waveform::plotters_png_file::waveform_static_plotters_png_visualize;\n\nuse audio_visualizer::Channels;\n\nuse core::cmp::max;\n\n\n\n// /// Directory with test samples (e.g. mp3) can be found here.\n\n// const TEST_SAMPLES_DIR: &str = \"test/samples\";\n\n/// If tests create files, they should be stored here.\n\nconst TEST_OUT_DIR: &str = \"test/out\";\n\n\n\nmod sine;\n\n\n\n#[test]\n","file_path":"src/tests/mod.rs","rank":84,"score":15.73368956470836},{"content":" /// * `samples_len` Number of samples. Might be bigger than `data.len()`\n\n /// if the spectrum is obtained with a frequency limit.\n\n #[inline(always)]\n\n pub fn new(\n\n data: Vec<(Frequency, FrequencyValue)>,\n\n frequency_resolution: f32,\n\n samples_len: u32,\n\n ) -> Self {\n\n debug_assert!(\n\n data.len() >= 2,\n\n \"Input data of length={} for spectrum makes no sense!\",\n\n data.len()\n\n );\n\n\n\n let obj = Self {\n\n data: RefCell::new(data),\n\n frequency_resolution,\n\n samples_len,\n\n // default/placeholder values\n\n average: Cell::new(FrequencyValue::from(-1.0)),\n","file_path":"src/spectrum.rs","rank":85,"score":15.551846033777903},{"content":"OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\nSOFTWARE.\n\n*/\n\n//! Real FFT using `microfft::real`.\n\n//! Works in `no_std`-environments, maximum sample length is 4096 (with microfft version 0.4.0)\n\n//! and it's faster than a \"typical\" complex FFT.\n\n\n\nuse alloc::vec::Vec;\n\n\n\nuse crate::fft::Fft;\n\nuse core::convert::TryInto;\n\nuse microfft::real;\n\n\n\n/// The result of a FFT is always complex but because different FFT crates might\n\n/// use different versions of \"num-complex\", each implementation exports\n\n/// it's own version that gets used in lib.rs for binary compatibility.\n\npub use microfft::Complex32;\n\n\n\n/// Dummy struct with no properties but used as a type\n\n/// to implement a concrete FFT strategy using (`microfft::real`).\n","file_path":"src/fft/microfft_real.rs","rank":86,"score":15.461666059017839},{"content":"## How to use FFT to get a frequency spectrum?\n\n\n\nThis library is full of additional and useful links and comments about how an FFT result \n\ncan be used to get a frequency spectrum. In this document I want to give a short introduction \n\nwhere inside the code you can find specific things.\n\n\n\n**TL;DR:** Although this crate has 1400 lines of code, **the part which gets the frequency and\n\ntheir values from the FFT is small and simple**. Most of the code is related to my convenient \n\nabstraction over the FFT result including several getters, transform/scaling functions, and\n\ntests.\n\n\n\n**I don't explain how FFT works but how you use the result!**\n\nIf you want to understand that too:\n\n\n\n- check out all links provided [at the end of README.md](/README.md)\n\n- look into `lib.rs` (**probalby gives you 90 percent of the things you want to know**) \n\n and the comments over the FFT abstraction in `src/fft/mod.rs` and \n\n `src/fft/rustfft-complex/mod.rs`.\n\n \n\n\n\nThis is everything important you need. Everything inside \n\n `spectrum.rs` and the other files is just convenient stuff + tests for when you \n\nwant to use this crate in your program.\n","file_path":"EDUCATIONAL.md","rank":87,"score":14.86226090239834},{"content":" median: Cell::new(FrequencyValue::from(-1.0)),\n\n min: Cell::new((Frequency::from(-1.0), FrequencyValue::from(-1.0))),\n\n max: Cell::new((Frequency::from(-1.0), FrequencyValue::from(-1.0))),\n\n };\n\n // IMPORTANT!!\n\n obj.calc_statistics();\n\n obj\n\n }\n\n\n\n /// Applies the function `scaling_fn` to each element and updates\n\n /// `min`, `max`, etc. afterwards accordingly. It ensures that no value\n\n /// is `NaN` or `Infinity` afterwards (regarding IEEE-754).\n\n ///\n\n /// ## Parameters\n\n /// * `scaling_fn` See [`crate::scaling::SpectrumScalingFunction`].\n\n #[inline(always)]\n\n pub fn apply_scaling_fn(\n\n &self,\n\n scaling_fn: SpectrumScalingFunction,\n\n ) -> Result<(), SpectrumAnalyzerError> {\n","file_path":"src/spectrum.rs","rank":88,"score":14.74697196284392},{"content":"OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\nSOFTWARE.\n\n*/\n\n//! A simple and fast `no_std` library to get the frequency spectrum of a digital signal\n\n//! (e.g. audio) using FFT. It follows the KISS principle and consists of simple building\n\n//! blocks/optional features.\n\n//!\n\n//! In short, this is a convenient wrapper around a FFT implementation. You choose the\n\n//! implementation at compile time via Cargo features. This crate uses\n\n//! \"microfft\" by default for FFT. See README for more advise.\n\n//!\n\n//! ## Examples\n\n//! ### Scaling via dynamic closure\n\n//! ```rust\n\n//! use spectrum_analyzer::{samples_fft_to_spectrum, FrequencyLimit};\n\n//! // get data from audio source\n\n//! let samples = vec![0.0, 1.1, 5.5, -5.5];\n\n//! let res = samples_fft_to_spectrum(\n\n//! &samples,\n\n//! 44100,\n","file_path":"src/lib.rs","rank":89,"score":14.736695211046367},{"content":" let avg = sum / data_sorted.len() as f32;\n\n let average: FrequencyValue = avg.into();\n\n\n\n let median = {\n\n // we assume that data_sorted.length() is always even, because\n\n // it must be a power of 2 (for FFT)\n\n let a = data_sorted[data_sorted.len() / 2 - 1].1;\n\n let b = data_sorted[data_sorted.len() / 2].1;\n\n (a + b) / 2.0.into()\n\n };\n\n\n\n // because we sorted the vector a few lines above\n\n // by the value, the following lines are correct\n\n // i.e. we get min/max value with corresponding frequency\n\n let min = data_sorted[0];\n\n let max = data_sorted[data_sorted.len() - 1];\n\n\n\n // check that I get the comparison right (and not from max to min)\n\n debug_assert!(min.1 <= max.1, \"min must be <= max\");\n\n\n","file_path":"src/spectrum.rs","rank":90,"score":13.728834428644713},{"content":"pub struct FftImpl;\n\n\n\nimpl FftImpl {\n\n /// Converts all samples to a complex number (imaginary part is set to zero)\n\n /// as preparation for the FFT.\n\n ///\n\n /// ## Parameters\n\n /// `samples` Input samples.\n\n ///\n\n /// ## Return value\n\n /// New vector with elements of FFT output/result.\n\n #[inline(always)]\n\n fn samples_to_complex(samples: &[f32]) -> Vec<Complex32> {\n\n samples\n\n .iter()\n\n .map(|x| Complex32::new(*x, 0.0))\n\n .collect::<Vec<Complex32>>()\n\n }\n\n}\n\n\n","file_path":"src/fft/microfft_complex.rs","rank":91,"score":13.682238367962356},{"content":"pub struct FftImpl;\n\n\n\nimpl FftImpl {\n\n /// Converts all samples to a complex number (imaginary part is set to zero)\n\n /// as preparation for the FFT.\n\n ///\n\n /// ## Parameters\n\n /// `samples` Input samples.\n\n ///\n\n /// ## Return value\n\n /// New vector with elements of FFT output/result.\n\n #[inline(always)]\n\n fn samples_to_complex(samples: &[f32]) -> Vec<Complex32> {\n\n samples\n\n .iter()\n\n .map(|x| Complex32::new(*x, 0.0))\n\n .collect::<Vec<Complex32>>()\n\n }\n\n}\n\n\n","file_path":"src/fft/rustfft_complex.rs","rank":92,"score":13.682238367962354},{"content":"#[cfg(test)]\n\nmod tests;\n\n\n\n/// Takes an array of samples (length must be a power of 2),\n\n/// e.g. 2048, applies an FFT (using the specified FFT implementation) on it\n\n/// and returns all frequencies with their volume/magnitude.\n\n///\n\n/// By default, no normalization/scaling is done at all and the results,\n\n/// i.e. the frequency magnitudes/amplitudes/values are the raw result from\n\n/// the FFT algorithm, except that complex numbers are transformed\n\n/// to their magnitude.\n\n///\n\n/// * `samples` raw audio, e.g. 16bit audio data but as f32.\n\n/// You should apply an window function (like Hann) on the data first.\n\n/// The final frequency resolution is `sample_rate / (N / 2)`\n\n/// e.g. `44100/(16384/2) == 5.383Hz`, i.e. more samples =>\n\n/// better accuracy/frequency resolution.\n\n/// * `sampling_rate` sampling_rate, e.g. `44100 [Hz]`\n\n/// * `frequency_limit` Frequency limit. See [`FrequencyLimit´]\n\n/// * `scaling_fn` See [`crate::scaling::SpectrumScalingFunction`] for details.\n","file_path":"src/lib.rs","rank":93,"score":13.36493236885485},{"content":" self.min.replace(min);\n\n self.max.replace(max);\n\n self.average.replace(average);\n\n self.median.replace(median);\n\n }\n\n}\n\n\n\n/*impl FromIterator<(Frequency, FrequencyValue)> for FrequencySpectrum {\n\n\n\n #[inline(always)]\n\n fn from_iter<T: IntoIterator<Item=(Frequency, FrequencyValue)>>(iter: T) -> Self {\n\n // 1024 is just a guess: most likely 2048 is a common FFT length,\n\n // i.e. 1024 results for the frequency spectrum.\n\n let mut vec = Vec::with_capacity(1024);\n\n for (fr, val) in iter {\n\n vec.push((fr, val))\n\n }\n\n\n\n FrequencySpectrum::new(vec)\n\n }\n","file_path":"src/spectrum.rs","rank":94,"score":13.206055849199664},{"content":" self.samples_len\n\n }\n\n\n\n /// Getter for the highest frequency that is captured inside this spectrum.\n\n /// Shortcut for `spectrum.data()[spectrum.data().len() - 1].0`.\n\n /// This corresponds to the [`crate::limit::FrequencyLimit`] of the spectrum.\n\n ///\n\n /// This method could return the Nyquist frequency, if there was no Frequency\n\n /// limit while obtaining the spectrum.\n\n #[inline(always)]\n\n pub fn max_fr(&self) -> Frequency {\n\n let data = self.data.borrow();\n\n data[data.len() - 1].0\n\n }\n\n\n\n /// Getter for the lowest frequency that is captured inside this spectrum.\n\n /// Shortcut for `spectrum.data()[0].0`.\n\n /// This corresponds to the [`crate::limit::FrequencyLimit`] of the spectrum.\n\n ///\n\n /// This method could return the DC component, see [`Self::dc_component`].\n","file_path":"src/spectrum.rs","rank":95,"score":12.8102564697159},{"content":" // 1) calculates the corresponding frequency of each index in the FFT result\n\n // 2) filters out unwanted frequencies\n\n // 3) calculates the magnitude (absolute value) at each frequency index for each complex value\n\n // 4) optionally scales the magnitudes\n\n // 5) collects everything into the struct \"FrequencySpectrum\"\n\n fft_result_to_spectrum(\n\n samples.len(),\n\n &buffer,\n\n sampling_rate,\n\n frequency_limit,\n\n scaling_fn,\n\n )\n\n}\n\n\n\n/// Transforms the FFT result into the spectrum by calculating the corresponding frequency of each\n\n/// FFT result index and optionally calculating the magnitudes of the complex numbers if a complex\n\n/// FFT implementation is chosen.\n\n///\n\n/// ## Parameters\n\n/// * `samples_len` Length of samples. This is a dedicated field because it can't always be\n\n/// derived from `fft_result.len()`. There are for example differences for\n\n/// `fft_result.len()` in real and complex FFT.\n\n/// * `fft_result` Result buffer from FFT. Has the same length as the samples array.\n\n/// * `sampling_rate` sampling_rate, e.g. `44100 [Hz]`\n\n/// * `frequency_limit` Frequency limit. See [`FrequencyLimit´]\n\n/// * `scaling_fn` See [`crate::scaling::SpectrumScalingFunction`].\n\n///\n\n/// ## Return value\n\n/// New object of type [`FrequencySpectrum`].\n","file_path":"src/lib.rs","rank":96,"score":12.614851541276277},{"content":"\n\n/// Abstraction over different FFT implementations. This is necessary because this crate\n\n/// uses different compile time features to exchange the FFT implementation, i.e. real or complex.\n\n/// Each of them operates on possibly different \"num-complex\"-versions for example.\n\npub(crate) trait Fft<ComplexType> {\n\n /// Applies the FFT on the given implementation. If necessary, the data is converted to a\n\n /// complex number first. The resulting vector contains complex numbers without any\n\n /// normalization/scaling. Usually you calc the magnitude of each complex number on the\n\n /// resulting vector to get the amplitudes of the frequencies in the next step.\n\n ///\n\n /// ## Parameters\n\n /// * `samples` samples for FFT. Length MUST be a power of 2 for FFT, e.g. 1024 or 4096!\n\n ///\n\n /// ## Return\n\n /// Vector of FFT results.\n\n fn fft_apply(samples: &[f32]) -> Vec<ComplexType>;\n\n\n\n /// Returns the relevant results of the FFT result. For complex FFT this is\n\n /// `N/2 + 1`, i.e. indices `0..=N/2` (inclusive end) are relevant. Real FFT\n\n /// implementations might be different here, because they may only have\n","file_path":"src/fft/mod.rs","rank":97,"score":12.5473572658559},{"content":" assert_eq!(\n\n spectrum.max_fr().val(),\n\n sampling_rate as f32 / 2.0,\n\n \"Upper bound frequency must be inclusive!\"\n\n );\n\n }\n\n {\n\n let spectrum = samples_fft_to_spectrum(\n\n &window,\n\n sampling_rate,\n\n FrequencyLimit::Range(412.0, 510.0),\n\n None,\n\n )\n\n .unwrap();\n\n assert_eq!(\n\n spectrum.min_fr().val(),\n\n 412.0,\n\n \"Lower bound frequency must be inclusive!\"\n\n );\n\n assert_eq!(\n\n spectrum.max_fr().val(),\n\n 510.0,\n\n \"Upper bound frequency must be inclusive!\"\n\n );\n\n }\n\n}\n\n\n\n/// Tests that the spectrum contains the Nyquist frequency.\n","file_path":"src/tests/mod.rs","rank":98,"score":12.532412260433738},{"content":" #[inline(always)]\n\n pub fn dc_component(&self) -> Option<FrequencyValue> {\n\n let data = self.data.borrow();\n\n let (maybe_dc_component, dc_value) = &data[0];\n\n if maybe_dc_component.val() == 0.0 {\n\n Some(*dc_value)\n\n } else {\n\n None\n\n }\n\n }\n\n\n\n /// Returns the value of the given frequency from the spectrum either exactly or approximated.\n\n /// If `search_fr` is not exactly given in the spectrum, i.e. due to the\n\n /// [`Self::frequency_resolution`], this function takes the two closest\n\n /// neighbors/points (A, B), put a linear function through them and calculates\n\n /// the point C in the middle. This is done by the private function\n\n /// `calculate_y_coord_between_points`.\n\n ///\n\n /// ## Panics\n\n /// If parameter `search_fr` (frequency) is below the lowest or the maximum\n","file_path":"src/spectrum.rs","rank":99,"score":12.30702806528617}],"string":"[\n {\n \"content\": \"/// Creates a sine (sinus) wave function for a given frequency.\\n\\n/// Don't forget to scale up the value to the audio resolution.\\n\\n/// So far, amplitude is in interval `[-1; 1]`. The parameter\\n\\n/// of the returned function is the point in time in seconds.\\n\\n///\\n\\n/// * `frequency` is in Hertz\\n\\npub fn sine_wave(frequency: f32) -> Box<dyn Fn(f32) -> f32> {\\n\\n Box::new(move |t| (t * frequency * 2.0 * PI).sin())\\n\\n}\\n\\n\\n\\n/// See [`sine_wave_audio_data_multiple`]\\n\",\n \"file_path\": \"src/tests/sine.rs\",\n \"rank\": 0,\n \"score\": 114647.95336310664\n },\n {\n \"content\": \"/// Applies a Hamming window (<https://en.wikipedia.org/wiki/Window_function#Hann_and_Hamming_windows>)\\n\\n/// to an array of samples.\\n\\n///\\n\\n/// ## Return value\\n\\n/// New vector with Hann window applied to the values.\\n\\npub fn hamming_window(samples: &[f32]) -> Vec<f32> {\\n\\n let mut windowed_samples = Vec::with_capacity(samples.len());\\n\\n let samples_len_f32 = samples.len() as f32;\\n\\n for (i, sample) in samples.iter().enumerate() {\\n\\n let multiplier = 0.54 - (0.46 * (2.0 * PI * i as f32 / cosf(samples_len_f32 - 1.0)));\\n\\n windowed_samples.push(multiplier * sample)\\n\\n }\\n\\n windowed_samples\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/windows.rs\",\n \"rank\": 1,\n \"score\": 109039.08952846963\n },\n {\n \"content\": \"/// Applies a Hann window (<https://en.wikipedia.org/wiki/Window_function#Hann_and_Hamming_windows>)\\n\\n/// to an array of samples.\\n\\n///\\n\\n/// ## Return value\\n\\n/// New vector with Hann window applied to the values.\\n\\npub fn hann_window(samples: &[f32]) -> Vec<f32> {\\n\\n let mut windowed_samples = Vec::with_capacity(samples.len());\\n\\n let samples_len_f32 = samples.len() as f32;\\n\\n for (i, sample) in samples.iter().enumerate() {\\n\\n let two_pi_i = 2.0 * PI * i as f32;\\n\\n let idontknowthename = cosf(two_pi_i / samples_len_f32);\\n\\n let multiplier = 0.5 * (1.0 - idontknowthename);\\n\\n windowed_samples.push(multiplier * sample)\\n\\n }\\n\\n windowed_samples\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/windows.rs\",\n \"rank\": 2,\n \"score\": 109039.08952846963\n },\n {\n \"content\": \"/// Applies a Blackman-Harris 7-term window to an array of samples.\\n\\n///\\n\\n/// ## More information\\n\\n/// * <https://en.wikipedia.org/wiki/Window_function#Blackman%E2%80%93Harris_window>\\n\\n/// * <https://ieeexplore.ieee.org/document/940309>\\n\\n/// * <https://dsp.stackexchange.com/questions/51095/seven-term-blackman-harris-window>\\n\\n///\\n\\n/// ## Return value\\n\\n/// New vector with Blackman-Harris 7-term window applied to the values.\\n\\npub fn blackman_harris_7term(samples: &[f32]) -> Vec<f32> {\\n\\n // constants come from here:\\n\\n // https://dsp.stackexchange.com/questions/51095/seven-term-blackman-harris-window\\n\\n const ALPHA: [f32; 7] = [\\n\\n 0.271_051_4,\\n\\n -0.433_297_93,\\n\\n 0.218_123,\\n\\n -0.065_925_45,\\n\\n 0.010_811_742,\\n\\n -0.000_776_584_84,\\n\\n 0.000_013_887_217,\\n\\n ];\\n\\n\\n\\n blackman_harris_xterm(samples, &ALPHA)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/windows.rs\",\n \"rank\": 3,\n \"score\": 106453.67128360705\n },\n {\n \"content\": \"/// Applies a Blackman-Harris 4-term window (<https://en.wikipedia.org/wiki/Window_function#Blackman%E2%80%93Harris_window>)\\n\\n/// to an array of samples.\\n\\n///\\n\\n/// ## Return value\\n\\n/// New vector with Blackman-Harris 4-term window applied to the values.\\n\\npub fn blackman_harris_4term(samples: &[f32]) -> Vec<f32> {\\n\\n // constants come from here:\\n\\n // https://en.wikipedia.org/wiki/Window_function#Blackman%E2%80%93Harris_window\\n\\n const ALPHA: [f32; 4] = [0.35875, -0.48829, 0.14128, -0.01168];\\n\\n\\n\\n blackman_harris_xterm(samples, &ALPHA)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/windows.rs\",\n \"rank\": 4,\n \"score\": 106451.33902769917\n },\n {\n \"content\": \"#[allow(non_snake_case)]\\n\\npub fn divide_by_N(val: f32, stats: &SpectrumDataStats) -> f32 {\\n\\n if stats.n == 0.0 {\\n\\n val\\n\\n } else {\\n\\n val / stats.n\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/scaling.rs\",\n \"rank\": 5,\n \"score\": 98678.23400676702\n },\n {\n \"content\": \"/// Scales each frequency value/amplitude in the spectrum to interval `[0.0; 1.0]`.\\n\\n/// Function is of type [`SpectrumScalingFunction`]. Expects that [`SpectrumDataStats::min`] is\\n\\n/// not negative.\\n\\npub fn scale_to_zero_to_one(val: f32, stats: &SpectrumDataStats) -> f32 {\\n\\n // usually not the case, except you use other scaling functions first,\\n\\n // that transforms the value to a negative one\\n\\n /*if stats.min < 0.0 {\\n\\n val = val + stats.min;\\n\\n }*/\\n\\n if stats.max != 0.0 {\\n\\n val / stats.max\\n\\n } else {\\n\\n 0.0\\n\\n }\\n\\n}\\n\\n\\n\\n/// Divides each value by N. Several resources recommend that the FFT result should be divided\\n\\n/// by the length of samples, so that values of different samples lengths are comparable.\\n\",\n \"file_path\": \"src/scaling.rs\",\n \"rank\": 6,\n \"score\": 96601.16845106454\n },\n {\n \"content\": \"/// Calculates the base 10 logarithm of each frequency magnitude and\\n\\n/// multiplies it with 20. This scaling is quite common, you can\\n\\n/// find more information for example here:\\n\\n/// <https://www.sjsu.edu/people/burford.furman/docs/me120/FFT_tutorial_NI.pdf>\\n\\n///\\n\\n/// ## Usage\\n\\n/// ```rust\\n\\n///use spectrum_analyzer::{samples_fft_to_spectrum, scaling, FrequencyLimit};\\n\\n///let window = [0.0, 0.1, 0.2, 0.3]; // add real data here\\n\\n///let spectrum = samples_fft_to_spectrum(\\n\\n/// &window,\\n\\n/// 44100,\\n\\n/// FrequencyLimit::All,\\n\\n/// Some(&scaling::scale_20_times_log10),\\n\\n/// );\\n\\n/// ```\\n\\n/// Function is of type [`SpectrumScalingFunction`].\\n\\npub fn scale_20_times_log10(frequency_magnitude: f32, _stats: &SpectrumDataStats) -> f32 {\\n\\n debug_assert!(!frequency_magnitude.is_infinite());\\n\\n debug_assert!(!frequency_magnitude.is_nan());\\n\\n debug_assert!(frequency_magnitude >= 0.0);\\n\\n if frequency_magnitude == 0.0 {\\n\\n 0.0\\n\\n } else {\\n\\n 20.0 * libm::log10f(frequency_magnitude)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/scaling.rs\",\n \"rank\": 7,\n \"score\": 94658.93591328897\n },\n {\n \"content\": \"fn bench_without_scaling(samples: Vec<f32>) -> u64 {\\n\\n let fnc = move || samples_fft_to_spectrum(&samples, 44100, FrequencyLimit::All, None).unwrap();\\n\\n bench_fnc(Box::new(fnc))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/bench.rs\",\n \"rank\": 8,\n \"score\": 84992.62244623239\n },\n {\n \"content\": \"/// Combines several scaling functions into a new single one.\\n\\n///\\n\\n/// # Example\\n\\n/// ```ignored\\n\\n/// Some(&combined(&[÷_by_N, &scale_20_times_log10]))\\n\\n/// ```\\n\\npub fn combined<'a>(\\n\\n fncs: &'a [SpectrumScalingFunction<'a>],\\n\\n) -> Box<dyn Fn(f32, &SpectrumDataStats) -> f32 + 'a> {\\n\\n Box::new(move |val, stats| {\\n\\n let mut val = val;\\n\\n for fnc in fncs {\\n\\n val = fnc(val, stats);\\n\\n }\\n\\n val\\n\\n })\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use alloc::vec::Vec;\\n\\n\\n\\n #[test]\\n\\n fn test_scale_to_zero_to_one() {\\n\\n let data = vec![0.0_f32, 1.1, 2.2, 3.3, 4.4, 5.5];\\n\",\n \"file_path\": \"src/scaling.rs\",\n \"rank\": 9,\n \"score\": 81945.41482523736\n },\n {\n \"content\": \"/// Takes an array of samples (length must be a power of 2),\\n\\n/// e.g. 2048, applies an FFT (using the specified FFT implementation) on it\\n\\n/// and returns all frequencies with their volume/magnitude.\\n\\n///\\n\\n/// By default, no normalization/scaling is done at all and the results,\\n\\n/// i.e. the frequency magnitudes/amplitudes/values are the raw result from\\n\\n/// the FFT algorithm, except that complex numbers are transformed\\n\\n/// to their magnitude.\\n\\n///\\n\\n/// * `samples` raw audio, e.g. 16bit audio data but as f32.\\n\\n/// You should apply an window function (like Hann) on the data first.\\n\\n/// The final frequency resolution is `sample_rate / (N / 2)`\\n\\n/// e.g. `44100/(16384/2) == 5.383Hz`, i.e. more samples =>\\n\\n/// better accuracy/frequency resolution.\\n\\n/// * `sampling_rate` sampling_rate, e.g. `44100 [Hz]`\\n\\n/// * `frequency_limit` Frequency limit. See [`FrequencyLimit´]\\n\\n/// * `scaling_fn` See [`crate::scaling::SpectrumScalingFunction`] for details.\\n\\n///\\n\\n/// ## Returns value\\n\\n/// New object of type [`FrequencySpectrum`].\\n\\n///\\n\\n/// ## Examples\\n\\n/// ### Scaling via dynamic closure\\n\\n/// ```rust\\n\\n/// use spectrum_analyzer::{samples_fft_to_spectrum, FrequencyLimit};\\n\\n/// // get data from audio source\\n\\n/// let samples = vec![0.0, 1.1, 5.5, -5.5];\\n\\n/// let res = samples_fft_to_spectrum(\\n\\n/// &samples,\\n\\n/// 44100,\\n\\n/// FrequencyLimit::All,\\n\\n/// Some(&|val, info| val - info.min),\\n\\n/// );\\n\\n/// ```\\n\\n/// ### Scaling via static function\\n\\n/// ```rust\\n\\n/// use spectrum_analyzer::{samples_fft_to_spectrum, FrequencyLimit};\\n\\n/// use spectrum_analyzer::scaling::scale_to_zero_to_one;\\n\\n/// // get data from audio source\\n\\n/// let samples = vec![0.0, 1.1, 5.5, -5.5];\\n\\n/// let res = samples_fft_to_spectrum(\\n\\n/// &samples,\\n\\n/// 44100,\\n\\n/// FrequencyLimit::All,\\n\\n/// Some(&scale_to_zero_to_one),\\n\\n/// );\\n\\n/// ```\\n\\n///\\n\\n/// ## Panics\\n\\n/// * When `samples.len() > 4096` and `microfft` is used (restriction by the crate)\\n\\npub fn samples_fft_to_spectrum(\\n\\n samples: &[f32],\\n\\n sampling_rate: u32,\\n\\n frequency_limit: FrequencyLimit,\\n\\n scaling_fn: Option<SpectrumScalingFunction>,\\n\\n) -> Result<FrequencySpectrum, SpectrumAnalyzerError> {\\n\\n // everything below two samples is unreasonable\\n\\n if samples.len() < 2 {\\n\\n return Err(SpectrumAnalyzerError::TooFewSamples);\\n\\n }\\n\\n // do several checks on input data\\n\\n if samples.iter().any(|x| x.is_nan()) {\\n\\n return Err(SpectrumAnalyzerError::NaNValuesNotSupported);\\n\\n }\\n\\n if samples.iter().any(|x| x.is_infinite()) {\\n\\n return Err(SpectrumAnalyzerError::InfinityValuesNotSupported);\\n\\n }\\n\\n if !is_power_of_two(samples.len()) {\\n\\n return Err(SpectrumAnalyzerError::SamplesLengthNotAPowerOfTwo);\\n\\n }\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 10,\n \"score\": 81447.27723229316\n },\n {\n \"content\": \"/// Applies a Blackman-Harris x-term window\\n\\n/// (<https://en.wikipedia.org/wiki/Window_function#Blackman%E2%80%93Harris_window>)\\n\\n/// to an array of samples. The x is specified by `alphas.len()`.\\n\\n///\\n\\n/// ## Return value\\n\\n/// New vector with Blackman-Harris x-term window applied to the values.\\n\\nfn blackman_harris_xterm(samples: &[f32], alphas: &[f32]) -> Vec<f32> {\\n\\n let mut windowed_samples = Vec::with_capacity(samples.len());\\n\\n\\n\\n let samples_len_f32 = samples.len() as f32;\\n\\n\\n\\n for sample in samples.iter() {\\n\\n // Will result in something like that:\\n\\n /* ALPHA0\\n\\n + ALPHA1 * ((2.0 * PI * *samples[i])/samples_len_f32).cos()\\n\\n + ALPHA2 * ((4.0 * PI * *samples[i])/samples_len_f32).cos()\\n\\n + ALPHA3 * ((6.0 * PI * *samples[i])/samples_len_f32).cos()\\n\\n */\\n\\n\\n\\n let mut acc = 0.0;\\n\\n for (alpha_i, alpha) in alphas.iter().enumerate() {\\n\\n // in 1. iter. 0PI, then 2PI, then 4 PI, then 6 PI\\n\\n let two_pi_iteration = 2.0 * alpha_i as f32 * PI;\\n\\n let cos = cosf((two_pi_iteration * sample) / samples_len_f32);\\n\\n acc += alpha * cos;\\n\\n }\\n\\n\\n\\n windowed_samples.push(acc)\\n\\n }\\n\\n\\n\\n windowed_samples\\n\\n}\\n\",\n \"file_path\": \"src/windows.rs\",\n \"rank\": 11,\n \"score\": 81188.12569283105\n },\n {\n \"content\": \"/// Like [`sine_wave_audio_data`] but puts multiple sinus waves on top of each other.\\n\\n/// Returns a audio signal encoded in 16 bit audio resolution which is the sum of\\n\\n/// multiple sine waves on top of each other. The amplitudes will be scaled from\\n\\n/// `[-1; 1]` to `[i16::min_value(); i16::max_value()]`\\n\\n///\\n\\n/// * `frequency` frequency in Hz for the sinus wave\\n\\n/// * `sampling_rate` sampling rate, i.e. 44100Hz\\n\\n/// * `duration_ms` duration of the audio data in milliseconds\\n\\npub fn sine_wave_audio_data_multiple(\\n\\n frequencies: &[f32],\\n\\n sampling_rate: u32,\\n\\n duration_ms: u32,\\n\\n) -> Vec<i16> {\\n\\n if frequencies.is_empty() {\\n\\n return vec![];\\n\\n }\\n\\n\\n\\n // Generate all sine wave function\\n\\n let sine_waves = frequencies\\n\\n .iter()\\n\\n .map(|f| sine_wave(*f))\\n\\n .collect::<Vec<Box<dyn Fn(f32) -> f32>>>();\\n\\n\\n\\n // How many samples to generate with each sine wave function\\n\\n let sample_count = (sampling_rate as f32 * (duration_ms as f32 / 1000.0)) as usize;\\n\\n\\n\\n // Calculate the final sine wave\\n\\n let mut sine_wave = Vec::with_capacity(sample_count);\\n\",\n \"file_path\": \"src/tests/sine.rs\",\n \"rank\": 12,\n \"score\": 75319.50395307154\n },\n {\n \"content\": \"/// Maps a [`Complex32`] to it's magnitude as `f32`. This is done\\n\\n/// by calculating `sqrt(re*re + im*im)`. This is required to convert\\n\\n/// the complex FFT result back to real values.\\n\\n///\\n\\n/// ## Parameters\\n\\n/// * `val` A single value from the FFT output buffer of type [`Complex32`].\\n\\nfn complex_to_magnitude(val: &Complex32) -> f32 {\\n\\n // calculates sqrt(re*re + im*im), i.e. magnitude of complex number\\n\\n let sum = val.re * val.re + val.im * val.im;\\n\\n let sqrt = libm::sqrtf(sum);\\n\\n debug_assert!(!sqrt.is_nan(), \\\"sqrt is NaN!\\\");\\n\\n sqrt\\n\\n}\\n\\n\\n\\n// idea from https://stackoverflow.com/questions/600293/how-to-check-if-a-number-is-a-power-of-2\\n\\nconst fn is_power_of_two(num: usize) -> bool {\\n\\n num != 0 && ((num & (num - 1)) == 0)\\n\\n}\\n\\n\\n\\n// tests module for small unit tests\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests2 {\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\\n fn test_is_power_of_two() {\\n\\n assert!(!is_power_of_two(0));\\n\\n assert!(is_power_of_two(1));\\n\\n assert!(is_power_of_two(2));\\n\\n assert!(!is_power_of_two(3));\\n\\n assert!(is_power_of_two(2));\\n\\n assert!(is_power_of_two(256));\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 13,\n \"score\": 70796.83113407533\n },\n {\n \"content\": \"#[inline(always)]\\n\\nfn fft_result_to_spectrum(\\n\\n samples_len: usize,\\n\\n fft_result: &[Complex32],\\n\\n sampling_rate: u32,\\n\\n frequency_limit: FrequencyLimit,\\n\\n scaling_fn: Option<SpectrumScalingFunction>,\\n\\n) -> Result<FrequencySpectrum, SpectrumAnalyzerError> {\\n\\n let maybe_min = frequency_limit.maybe_min();\\n\\n let maybe_max = frequency_limit.maybe_max();\\n\\n\\n\\n let frequency_resolution = fft_calc_frequency_resolution(sampling_rate, samples_len as u32);\\n\\n\\n\\n // collect frequency => frequency value in Vector of Pairs/Tuples\\n\\n let frequency_vec = fft_result\\n\\n .iter()\\n\\n // See https://stackoverflow.com/a/4371627/2891595 for more information as well as\\n\\n // https://www.gaussianwaves.com/2015/11/interpreting-fft-results-complex-dft-frequency-bins-and-fftshift/\\n\\n //\\n\\n // The indices 0 to N/2 (inclusive) are usually the most relevant. Although, index\\n\\n // N/2-1 is declared as the last useful one on stackoverflow (because in typical applications\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 14,\n \"score\": 69216.32133498593\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\npub fn sine_wave_audio_data(frequency: f32, sampling_rate: u32, duration_ms: u32) -> Vec<i16> {\\n\\n sine_wave_audio_data_multiple(&[frequency], sampling_rate, duration_ms)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/sine.rs\",\n \"rank\": 15,\n \"score\": 67313.9887495815\n },\n {\n \"content\": \"fn bench_with_scaling(samples: Vec<f32>) -> u64 {\\n\\n let fnc = move || {\\n\\n samples_fft_to_spectrum(\\n\\n &samples,\\n\\n 44100,\\n\\n FrequencyLimit::All,\\n\\n Some(&scaling::divide_by_N),\\n\\n )\\n\\n .unwrap()\\n\\n };\\n\\n bench_fnc(Box::new(fnc))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/bench.rs\",\n \"rank\": 16,\n \"score\": 65950.57257347179\n },\n {\n \"content\": \"#[test]\\n\\nfn test_spectrum_frequency_limit_inclusive() {\\n\\n let sampling_rate = 1024;\\n\\n let sine_audio = sine_wave_audio_data_multiple(&[512.0], sampling_rate, 1000);\\n\\n\\n\\n let sine_audio = sine_audio\\n\\n .into_iter()\\n\\n .map(|x| x as f32)\\n\\n .collect::<Vec<f32>>();\\n\\n\\n\\n // frequency resolution will be:\\n\\n // 1024 / 512 = 2 Hz\\n\\n // we use even frequency resolution in this example for easy testing\\n\\n // max detectable frequency here is 512Hz\\n\\n\\n\\n let window = hann_window(&sine_audio[0..512]);\\n\\n\\n\\n {\\n\\n let spectrum =\\n\\n samples_fft_to_spectrum(&window, sampling_rate, FrequencyLimit::Max(400.0), None)\\n\\n .unwrap();\\n\",\n \"file_path\": \"src/tests/mod.rs\",\n \"rank\": 17,\n \"score\": 62223.24360777614\n },\n {\n \"content\": \"/// Reads an MP3 and returns the audio data as mono channel + the sample rate in Hertz.\\n\\nfn read_mp3_to_mono(file: &str) -> (Vec<i16>, u32) {\\n\\n let mut decoder = Mp3Decoder::new(File::open(file).unwrap());\\n\\n\\n\\n let mut sampling_rate = 0;\\n\\n let mut mono_samples = vec![];\\n\\n loop {\\n\\n match decoder.next_frame() {\\n\\n Ok(Mp3Frame {\\n\\n data: samples_of_frame,\\n\\n sample_rate,\\n\\n channels,\\n\\n ..\\n\\n }) => {\\n\\n // that's a bird weird of the original API. Why should channels or sampling\\n\\n // rate change from frame to frame?\\n\\n\\n\\n // Should be constant throughout the MP3 file.\\n\\n sampling_rate = sample_rate;\\n\\n\\n\\n if channels == 2 {\\n\",\n \"file_path\": \"examples/mp3-samples.rs\",\n \"rank\": 18,\n \"score\": 59220.22768348776\n },\n {\n \"content\": \"#[inline(always)]\\n\\nfn fft_calc_frequency_resolution(sampling_rate: u32, samples_len: u32) -> f32 {\\n\\n sampling_rate as f32 / samples_len as f32\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 19,\n \"score\": 55801.511391269836\n },\n {\n \"content\": \"/// Benchmark can be used to check how changes effect the performance.\\n\\n/// Always execute with release flag!\\n\\nfn main() {\\n\\n // create 2048 random samples\\n\\n let samples = (0..2048)\\n\\n .map(|_| rand::random::<i16>())\\n\\n .map(|x| x as f32)\\n\\n .collect::<Vec<_>>();\\n\\n let hann_window = windows::hann_window(&samples);\\n\\n\\n\\n let bench_res_without_scaling = bench_without_scaling(hann_window.clone());\\n\\n let bench_res_with_scaling = bench_with_scaling(hann_window);\\n\\n\\n\\n println!(\\n\\n \\\"Bench without scaling: avg = {}us per Iteration\\\",\\n\\n bench_res_without_scaling\\n\\n );\\n\\n println!(\\n\\n \\\"Bench with scaling: avg = {}us per Iteration\\\",\\n\\n bench_res_with_scaling\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/bench.rs\",\n \"rank\": 20,\n \"score\": 46771.86826274308\n },\n {\n \"content\": \"/// Minimal example.\\n\\nfn main() {\\n\\n // YOU need to implement the samples source; get microphone input for example\\n\\n let samples: &[f32] = &[0.0, 3.1, 2.7, -1.0, -2.0, -4.0, 7.0, 6.0];\\n\\n // apply hann window for smoothing; length must be a power of 2 for the FFT\\n\\n // 2048 is a good starting point with 44100 kHz\\n\\n let hann_window = hann_window(&samples[0..8]);\\n\\n // calc spectrum\\n\\n let spectrum_hann_window = samples_fft_to_spectrum(\\n\\n // (windowed) samples\\n\\n &hann_window,\\n\\n // sampling rate\\n\\n 44100,\\n\\n // optional frequency limit: e.g. only interested in frequencies 50 <= f <= 150?\\n\\n FrequencyLimit::All,\\n\\n // optional scale\\n\\n Some(÷_by_N),\\n\\n )\\n\\n .unwrap();\\n\\n\\n\\n for (fr, fr_val) in spectrum_hann_window.data().iter() {\\n\\n println!(\\\"{}Hz => {}\\\", fr, fr_val)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"examples/minimal.rs\",\n \"rank\": 21,\n \"score\": 46768.6233030683\n },\n {\n \"content\": \"fn main() {\\n\\n println!(\\\"bass drum example:\\\");\\n\\n example__bass_drum_sample();\\n\\n println!(\\\"============================\\\");\\n\\n println!(\\\"clap beat example:\\\");\\n\\n example__clap_beat_sample();\\n\\n println!(\\\"============================\\\");\\n\\n println!(\\\"high hat example:\\\");\\n\\n example__high_hat_sample();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/mp3-samples.rs\",\n \"rank\": 22,\n \"score\": 45257.513624122446\n },\n {\n \"content\": \"/// Example that creates a live visualization of the frequency spectrum of realtime audio data\\n\\n/// **Execute this with `--release`, otherwise it is very laggy!**.\\n\\nfn main() {\\n\\n // Contains the data for the spectrum to be visualized. It contains ordered pairs of\\n\\n // `(frequency, frequency_value)`. During each iteration, the frequency value gets\\n\\n // combined with `max(old_value * smoothing_factor, new_value)`.\\n\\n let visualize_spectrum: RefCell<Vec<(f64, f64)>> = RefCell::new(vec![(0.0, 0.0); 1024]);\\n\\n\\n\\n // Closure that captures `visualize_spectrum`.\\n\\n let to_spectrum_fn = move |audio: &[f32], sampling_rate| {\\n\\n let skip_elements = audio.len() - 2048;\\n\\n // spectrum analysis only of the latest 46ms\\n\\n let relevant_samples = &audio[skip_elements..skip_elements + 2048];\\n\\n\\n\\n // do FFT\\n\\n let hann_window = hann_window(relevant_samples);\\n\\n let latest_spectrum = samples_fft_to_spectrum(\\n\\n &hann_window,\\n\\n sampling_rate as u32,\\n\\n FrequencyLimit::All,\\n\\n Some(÷_by_N),\\n\\n )\\n\",\n \"file_path\": \"examples/live-visualization.rs\",\n \"rank\": 23,\n \"score\": 45257.513624122446\n },\n {\n \"content\": \"// Calculates spectrum via FFT for a given set of samples and applies\\n\\n// all window functions + plots all\\n\\nfn to_spectrum_and_plot(\\n\\n samples: &[f32],\\n\\n sampling_rate: u32,\\n\\n filename: &str,\\n\\n frequency_limit: FrequencyLimit,\\n\\n) {\\n\\n let no_window = samples;\\n\\n\\n\\n let now = Instant::now();\\n\\n let hann_window = hann_window(no_window);\\n\\n println!(\\n\\n \\\"[Measurement]: Hann-Window with {} samples took: {}µs\\\",\\n\\n samples.len(),\\n\\n now.elapsed().as_micros()\\n\\n );\\n\\n let now = Instant::now();\\n\\n let hamming_window = hamming_window(no_window);\\n\\n println!(\\n\\n \\\"[Measurement]: Hamming-Window with {} samples took: {}µs\\\",\\n\\n samples.len(),\\n\",\n \"file_path\": \"examples/mp3-samples.rs\",\n \"rank\": 24,\n \"score\": 43906.119403530225\n },\n {\n \"content\": \"#[inline(always)]\\n\\nfn calculate_y_coord_between_points(\\n\\n (x1, y1): (f32, f32),\\n\\n (x2, y2): (f32, f32),\\n\\n x_coord: f32,\\n\\n) -> f32 {\\n\\n // e.g. Points (100, 1.0) and (200, 0.0)\\n\\n // y=f(x)=-0.01x + c\\n\\n // 1.0 = f(100) = -0.01x + c\\n\\n // c = 1.0 + 0.01*100 = 2.0\\n\\n // y=f(180)=-0.01*180 + 2.0\\n\\n\\n\\n // gradient, anstieg\\n\\n let slope = (y2 - y1) / (x2 - x1);\\n\\n // calculate c in y=f(x)=slope * x + c\\n\\n let c = y1 - slope * x1;\\n\\n\\n\\n slope * x_coord + c\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\",\n \"file_path\": \"src/spectrum.rs\",\n \"rank\": 25,\n \"score\": 43906.119403530225\n },\n {\n \"content\": \"#[test]\\n\\nfn test_invalid_input() {\\n\\n // should not contain NaN\\n\\n let samples = vec![0.0, 1.0, 2.0, 3.0, f32::NAN, 4.0, 5.0, 6.0];\\n\\n let err = samples_fft_to_spectrum(&samples, 44100, FrequencyLimit::All, None).unwrap_err();\\n\\n assert!(matches!(err, SpectrumAnalyzerError::NaNValuesNotSupported));\\n\\n\\n\\n // should not contain Infinity\\n\\n let samples = vec![0.0, 1.0, 2.0, 3.0, f32::INFINITY, 4.0, 5.0, 6.0];\\n\\n let err = samples_fft_to_spectrum(&samples, 44100, FrequencyLimit::All, None).unwrap_err();\\n\\n assert!(matches!(\\n\\n err,\\n\\n SpectrumAnalyzerError::InfinityValuesNotSupported\\n\\n ));\\n\\n\\n\\n // needs at least two samples\\n\\n let samples = vec![0.0];\\n\\n let err = samples_fft_to_spectrum(&samples, 44100, FrequencyLimit::All, None).unwrap_err();\\n\\n assert!(matches!(err, SpectrumAnalyzerError::TooFewSamples));\\n\\n\\n\\n // test frequency limit gets verified\\n\",\n \"file_path\": \"src/tests/mod.rs\",\n \"rank\": 26,\n \"score\": 42690.39015398416\n },\n {\n \"content\": \"#[test]\\n\\nfn test_spectrum_power() {\\n\\n let interesting_frequency = 2048.0;\\n\\n let sine_audio = sine_wave_audio_data_multiple(&[interesting_frequency], 44100, 1000);\\n\\n\\n\\n let sine_audio = sine_audio\\n\\n .into_iter()\\n\\n .map(|x| x as f32)\\n\\n .collect::<Vec<f32>>();\\n\\n\\n\\n // FFT frequency accuracy is: sample_rate / (N / 2)\\n\\n // 44100/(4096/2) = 21.5Hz\\n\\n\\n\\n // get a window that we want to analyze\\n\\n // 1/44100 * 4096 => 0.0928s\\n\\n let short_window = &sine_audio[0..2048];\\n\\n let long_window = &sine_audio[0..4096];\\n\\n\\n\\n let spectrum_short_window =\\n\\n samples_fft_to_spectrum(short_window, 44100, FrequencyLimit::All, Some(÷_by_N))\\n\\n .unwrap();\\n\",\n \"file_path\": \"src/tests/mod.rs\",\n \"rank\": 27,\n \"score\": 42690.39015398416\n },\n {\n \"content\": \"#[test]\\n\\nfn test_divide_by_n_has_effect() {\\n\\n let audio_data = sine_wave_audio_data_multiple(&[100.0, 200.0, 400.0], 1000, 2000);\\n\\n let audio_data = audio_data.into_iter().map(|x| x as f32).collect::<Vec<_>>();\\n\\n let audio_data = hann_window(&audio_data[0..1024]);\\n\\n let normal_spectrum =\\n\\n samples_fft_to_spectrum(&audio_data, 1000, FrequencyLimit::All, None).unwrap();\\n\\n let scaled_spectrum =\\n\\n samples_fft_to_spectrum(&audio_data, 1000, FrequencyLimit::All, Some(÷_by_N))\\n\\n .unwrap();\\n\\n for i in 0..512 {\\n\\n let actual_no_scaling = normal_spectrum.data()[i].1.val();\\n\\n let actual_with_scaling = scaled_spectrum.data()[i].1.val();\\n\\n assert!(\\n\\n (actual_no_scaling / 1024.0 - actual_with_scaling) < 0.1,\\n\\n \\\"[{}] actual_no_scaling={} should be roughly 1024 times bigger than actual_with_scaling={}\\\", \\n\\n i,\\n\\n actual_no_scaling,\\n\\n actual_with_scaling,\\n\\n );\\n\\n }\\n\",\n \"file_path\": \"src/tests/mod.rs\",\n \"rank\": 28,\n \"score\": 42690.39015398416\n },\n {\n \"content\": \"fn bench_fnc(fnc: Box<dyn Fn() -> FrequencySpectrum>) -> u64 {\\n\\n // warm-up\\n\\n for _ in 0..10 {\\n\\n let _ = fnc();\\n\\n }\\n\\n let now = Instant::now();\\n\\n let runs = 10000;\\n\\n for _ in 0..runs {\\n\\n let _ = fnc();\\n\\n }\\n\\n let duration = now.elapsed();\\n\\n (duration.as_micros() / runs) as u64\\n\\n}\\n\",\n \"file_path\": \"examples/bench.rs\",\n \"rank\": 29,\n \"score\": 42028.24522250632\n },\n {\n \"content\": \"#[allow(non_snake_case)]\\n\\nfn example__bass_drum_sample() {\\n\\n // this sample is exactly 0,628s long\\n\\n // we have 44100samples/s*0,628s == 28695 samples\\n\\n // next smaller power of two is: 2^14 == 16384 => FFT needs power of 2\\n\\n let (samples, sampling_rate) =\\n\\n read_mp3_to_mono(\\\"test/samples/bass_drum_with_high-hat_at_end-sample.mp3\\\");\\n\\n let samples = samples.into_iter().map(|x| x as f32).collect::<Vec<f32>>();\\n\\n\\n\\n to_spectrum_and_plot(\\n\\n &samples[0..4096],\\n\\n sampling_rate,\\n\\n \\\"example__mp3-samples__bass_drum__spectrum\\\",\\n\\n FrequencyLimit::Max(5000.0),\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/mp3-samples.rs\",\n \"rank\": 30,\n \"score\": 41590.87339728999\n },\n {\n \"content\": \"#[allow(non_snake_case)]\\n\\nfn example__clap_beat_sample() {\\n\\n // this sample is exactly 0,379s long\\n\\n // we have 44100samples/s*0,379s == 16714 samples\\n\\n // next smaller power of two is: 2^14 == 16384 => FFT needs power of 2\\n\\n let (samples, sampling_rate) = read_mp3_to_mono(\\\"test/samples/clap-beat-sample.mp3\\\");\\n\\n let samples = samples.into_iter().map(|x| x as f32).collect::<Vec<f32>>();\\n\\n\\n\\n to_spectrum_and_plot(\\n\\n &samples[0..4096],\\n\\n sampling_rate,\\n\\n \\\"example__mp3-samples__clap_beat__spectrum\\\",\\n\\n FrequencyLimit::Max(5000.0),\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/mp3-samples.rs\",\n \"rank\": 31,\n \"score\": 41590.87339728999\n },\n {\n \"content\": \"#[test]\\n\\nfn test_spectrum_nyquist_theorem2() {\\n\\n let sine_audio = sine_wave_audio_data_multiple(\\n\\n // 22050.0 results in aliasing and no good results\\n\\n &[22049.9],\\n\\n 44100,\\n\\n 1000,\\n\\n )\\n\\n .into_iter()\\n\\n .map(|x| x as f32)\\n\\n .collect::<Vec<f32>>();\\n\\n let spectrum = samples_fft_to_spectrum(\\n\\n &sine_audio[0..4096],\\n\\n 44100,\\n\\n FrequencyLimit::All,\\n\\n Some(&scale_to_zero_to_one),\\n\\n )\\n\\n .unwrap();\\n\\n assert_eq!(\\n\\n 0.0,\\n\\n spectrum.min_fr().val(),\\n\",\n \"file_path\": \"src/tests/mod.rs\",\n \"rank\": 32,\n \"score\": 41590.87339728999\n },\n {\n \"content\": \"#[allow(non_snake_case)]\\n\\nfn example__high_hat_sample() {\\n\\n // this sample is exactly 0,149s long\\n\\n // we have 44100samples/s*0,149s == 6571 samples\\n\\n // next smaller power of two is: 2^12 == 4096 => FFT needs power of 2\\n\\n let (samples, sampling_rate) = read_mp3_to_mono(\\\"test/samples/high-hat-sample.mp3\\\");\\n\\n let samples = samples.into_iter().map(|x| x as f32).collect::<Vec<f32>>();\\n\\n\\n\\n to_spectrum_and_plot(\\n\\n &samples[0..4096],\\n\\n sampling_rate,\\n\\n \\\"example__mp3-samples__high-hat__spectrum\\\",\\n\\n FrequencyLimit::All,\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/mp3-samples.rs\",\n \"rank\": 33,\n \"score\": 41590.87339728999\n },\n {\n \"content\": \"#[test]\\n\\nfn test_scaling_produces_error() {\\n\\n let samples = vec![1.1, 2.2, 3.3, 4.4, 5.5, 6.6, 7.7, 8.8];\\n\\n let _ = samples_fft_to_spectrum(\\n\\n &samples,\\n\\n 44100,\\n\\n FrequencyLimit::All,\\n\\n Some(&|_val, _info| f32::NAN),\\n\\n )\\n\\n .expect_err(\\\"Must throw error due to illegal scaling!\\\");\\n\\n}\\n\\n\\n\\n/// Test that the scaling actually has the effect that we expect it to have.\\n\",\n \"file_path\": \"src/tests/mod.rs\",\n \"rank\": 34,\n \"score\": 41590.87339728999\n },\n {\n \"content\": \"#[test]\\n\\nfn test_spectrum_nyquist_theorem() {\\n\\n let dummy_audio_samples = vec![0.0; 4096];\\n\\n let spectrum =\\n\\n samples_fft_to_spectrum(&dummy_audio_samples, 44100, FrequencyLimit::All, None).unwrap();\\n\\n assert_eq!(\\n\\n // because indices 0..N/2 (inclusive) of the FFT result are relevant\\n\\n // => DC component to Nyquist frequency\\n\\n 4096 / 2 + 1,\\n\\n spectrum\\n\\n .data()\\n\\n .iter()\\n\\n .map(|x| x.1)\\n\\n .filter(|x| x.val() == 0.0)\\n\\n .count(),\\n\\n \\\"All frequency values must be exactly zero because the input signal is zero!\\\"\\n\\n );\\n\\n assert_eq!(\\n\\n 0.0,\\n\\n spectrum.min_fr().val(),\\n\\n \\\"Minimum frequency must be 0 Hz (DS Component/DC bias/Gleichwert)\\\"\\n\\n );\\n\\n assert_eq!(\\n\\n 44100.0 / 2.0,\\n\\n spectrum.max_fr().val(),\\n\\n \\\"Maximum frequency must be Nyquist frequency\\\"\\n\\n );\\n\\n}\\n\\n/// Tests that the spectrum contains the Nyquist frequency using a sine wave at almost Nyquist\\n\\n/// frequency.\\n\",\n \"file_path\": \"src/tests/mod.rs\",\n \"rank\": 35,\n \"score\": 41590.87339728999\n },\n {\n \"content\": \"#[test]\\n\\nfn test_only_null_samples_valid() {\\n\\n let samples = vec![0.0, 0.0];\\n\\n let _ = samples_fft_to_spectrum(&samples, 44100, FrequencyLimit::All, None).unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/mod.rs\",\n \"rank\": 36,\n \"score\": 41590.87339728999\n },\n {\n \"content\": \"#[test]\\n\\nfn test_spectrum_and_visualize_sine_waves_50_1000_3777hz() {\\n\\n let sine_audio = sine_wave_audio_data_multiple(&[50.0, 1000.0, 3777.0], 44100, 1000);\\n\\n\\n\\n // visualize waveform\\n\\n waveform_static_plotters_png_visualize(\\n\\n &sine_audio,\\n\\n Channels::Mono,\\n\\n TEST_OUT_DIR,\\n\\n \\\"test_spectrum_and_visualize_sine_waves_50_1000_3777hz--WAVEFORM.png\\\",\\n\\n );\\n\\n\\n\\n let sine_audio = sine_audio\\n\\n .into_iter()\\n\\n .map(|x| x as f32)\\n\\n .collect::<Vec<f32>>();\\n\\n\\n\\n // FFT frequency accuracy is: sample_rate / (N / 2)\\n\\n // 44100/(4096/2) = 21.5Hz\\n\\n\\n\\n // get a window that we want to analyze\\n\",\n \"file_path\": \"src/tests/mod.rs\",\n \"rank\": 37,\n \"score\": 39679.63982100207\n },\n {\n \"content\": \"/*\\n\\nMIT License\\n\\n\\n\\nCopyright (c) 2021 Philipp Schuster\\n\\n\\n\\nPermission is hereby granted, free of charge, to any person obtaining a copy\\n\\nof this software and associated documentation files (the \\\"Software\\\"), to deal\\n\\nin the Software without restriction, including without limitation the rights\\n\\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\\n\\ncopies of the Software, and to permit persons to whom the Software is\\n\\nfurnished to do so, subject to the following conditions:\\n\\n\\n\\nThe above copyright notice and this permission notice shall be included in all\\n\\ncopies or substantial portions of the Software.\\n\\n\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\\n\\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\\n\\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\\n\\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\\n\\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\\n\",\n \"file_path\": \"src/fft/rustfft_complex.rs\",\n \"rank\": 47,\n \"score\": 119.3797668027025\n },\n {\n \"content\": \"/*\\n\\nMIT License\\n\\n\\n\\nCopyright (c) 2021 Philipp Schuster\\n\\n\\n\\nPermission is hereby granted, free of charge, to any person obtaining a copy\\n\\nof this software and associated documentation files (the \\\"Software\\\"), to deal\\n\\nin the Software without restriction, including without limitation the rights\\n\\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\\n\\ncopies of the Software, and to permit persons to whom the Software is\\n\\nfurnished to do so, subject to the following conditions:\\n\\n\\n\\nThe above copyright notice and this permission notice shall be included in all\\n\\ncopies or substantial portions of the Software.\\n\\n\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\\n\\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\\n\\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\\n\\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\\n\\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\\n\",\n \"file_path\": \"src/fft/mod.rs\",\n \"rank\": 48,\n \"score\": 119.37976680270248\n },\n {\n \"content\": \"/*\\n\\nMIT License\\n\\n\\n\\nCopyright (c) 2021 Philipp Schuster\\n\\n\\n\\nPermission is hereby granted, free of charge, to any person obtaining a copy\\n\\nof this software and associated documentation files (the \\\"Software\\\"), to deal\\n\\nin the Software without restriction, including without limitation the rights\\n\\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\\n\\ncopies of the Software, and to permit persons to whom the Software is\\n\\nfurnished to do so, subject to the following conditions:\\n\\n\\n\\nThe above copyright notice and this permission notice shall be included in all\\n\\ncopies or substantial portions of the Software.\\n\\n\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\\n\\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\\n\\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\\n\\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\\n\\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\\n\",\n \"file_path\": \"src/tests/sine.rs\",\n \"rank\": 49,\n \"score\": 119.37976680270249\n },\n {\n \"content\": \"/*\\n\\nMIT License\\n\\n\\n\\nCopyright (c) 2021 Philipp Schuster\\n\\n\\n\\nPermission is hereby granted, free of charge, to any person obtaining a copy\\n\\nof this software and associated documentation files (the \\\"Software\\\"), to deal\\n\\nin the Software without restriction, including without limitation the rights\\n\\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\\n\\ncopies of the Software, and to permit persons to whom the Software is\\n\\nfurnished to do so, subject to the following conditions:\\n\\n\\n\\nThe above copyright notice and this permission notice shall be included in all\\n\\ncopies or substantial portions of the Software.\\n\\n\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\\n\\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\\n\\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\\n\\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\\n\\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\\n\",\n \"file_path\": \"src/fft/microfft_real.rs\",\n \"rank\": 50,\n \"score\": 119.3797668027025\n },\n {\n \"content\": \"/*\\n\\nMIT License\\n\\n\\n\\nCopyright (c) 2021 Philipp Schuster\\n\\n\\n\\nPermission is hereby granted, free of charge, to any person obtaining a copy\\n\\nof this software and associated documentation files (the \\\"Software\\\"), to deal\\n\\nin the Software without restriction, including without limitation the rights\\n\\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\\n\\ncopies of the Software, and to permit persons to whom the Software is\\n\\nfurnished to do so, subject to the following conditions:\\n\\n\\n\\nThe above copyright notice and this permission notice shall be included in all\\n\\ncopies or substantial portions of the Software.\\n\\n\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\\n\\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\\n\\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\\n\\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\\n\\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\\n\",\n \"file_path\": \"src/frequency.rs\",\n \"rank\": 51,\n \"score\": 119.3797668027025\n },\n {\n \"content\": \"/*\\n\\nMIT License\\n\\n\\n\\nCopyright (c) 2021 Philipp Schuster\\n\\n\\n\\nPermission is hereby granted, free of charge, to any person obtaining a copy\\n\\nof this software and associated documentation files (the \\\"Software\\\"), to deal\\n\\nin the Software without restriction, including without limitation the rights\\n\\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\\n\\ncopies of the Software, and to permit persons to whom the Software is\\n\\nfurnished to do so, subject to the following conditions:\\n\\n\\n\\nThe above copyright notice and this permission notice shall be included in all\\n\\ncopies or substantial portions of the Software.\\n\\n\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\\n\\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\\n\\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\\n\\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\\n\\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\\n\",\n \"file_path\": \"src/scaling.rs\",\n \"rank\": 52,\n \"score\": 119.37976680270249\n },\n {\n \"content\": \"/*\\n\\nMIT License\\n\\n\\n\\nCopyright (c) 2021 Philipp Schuster\\n\\n\\n\\nPermission is hereby granted, free of charge, to any person obtaining a copy\\n\\nof this software and associated documentation files (the \\\"Software\\\"), to deal\\n\\nin the Software without restriction, including without limitation the rights\\n\\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\\n\\ncopies of the Software, and to permit persons to whom the Software is\\n\\nfurnished to do so, subject to the following conditions:\\n\\n\\n\\nThe above copyright notice and this permission notice shall be included in all\\n\\ncopies or substantial portions of the Software.\\n\\n\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\\n\\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\\n\\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\\n\\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\\n\\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 53,\n \"score\": 119.37976680270249\n },\n {\n \"content\": \"/*\\n\\nMIT License\\n\\n\\n\\nCopyright (c) 2021 Philipp Schuster\\n\\n\\n\\nPermission is hereby granted, free of charge, to any person obtaining a copy\\n\\nof this software and associated documentation files (the \\\"Software\\\"), to deal\\n\\nin the Software without restriction, including without limitation the rights\\n\\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\\n\\ncopies of the Software, and to permit persons to whom the Software is\\n\\nfurnished to do so, subject to the following conditions:\\n\\n\\n\\nThe above copyright notice and this permission notice shall be included in all\\n\\ncopies or substantial portions of the Software.\\n\\n\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\\n\\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\\n\\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\\n\\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\\n\\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\\n\",\n \"file_path\": \"src/spectrum.rs\",\n \"rank\": 54,\n \"score\": 119.37976680270249\n },\n {\n \"content\": \"/*\\n\\nMIT License\\n\\n\\n\\nCopyright (c) 2021 Philipp Schuster\\n\\n\\n\\nPermission is hereby granted, free of charge, to any person obtaining a copy\\n\\nof this software and associated documentation files (the \\\"Software\\\"), to deal\\n\\nin the Software without restriction, including without limitation the rights\\n\\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\\n\\ncopies of the Software, and to permit persons to whom the Software is\\n\\nfurnished to do so, subject to the following conditions:\\n\\n\\n\\nThe above copyright notice and this permission notice shall be included in all\\n\\ncopies or substantial portions of the Software.\\n\\n\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\\n\\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\\n\\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\\n\\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\\n\\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\\n\",\n \"file_path\": \"examples/mp3-samples.rs\",\n \"rank\": 55,\n \"score\": 119.37976680270252\n },\n {\n \"content\": \"/*\\n\\nMIT License\\n\\n\\n\\nCopyright (c) 2021 Philipp Schuster\\n\\n\\n\\nPermission is hereby granted, free of charge, to any person obtaining a copy\\n\\nof this software and associated documentation files (the \\\"Software\\\"), to deal\\n\\nin the Software without restriction, including without limitation the rights\\n\\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\\n\\ncopies of the Software, and to permit persons to whom the Software is\\n\\nfurnished to do so, subject to the following conditions:\\n\\n\\n\\nThe above copyright notice and this permission notice shall be included in all\\n\\ncopies or substantial portions of the Software.\\n\\n\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\\n\\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\\n\\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\\n\\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\\n\\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\\n\",\n \"file_path\": \"examples/bench.rs\",\n \"rank\": 56,\n \"score\": 119.37976680270249\n },\n {\n \"content\": \"/*\\n\\nMIT License\\n\\n\\n\\nCopyright (c) 2021 Philipp Schuster\\n\\n\\n\\nPermission is hereby granted, free of charge, to any person obtaining a copy\\n\\nof this software and associated documentation files (the \\\"Software\\\"), to deal\\n\\nin the Software without restriction, including without limitation the rights\\n\\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\\n\\ncopies of the Software, and to permit persons to whom the Software is\\n\\nfurnished to do so, subject to the following conditions:\\n\\n\\n\\nThe above copyright notice and this permission notice shall be included in all\\n\\ncopies or substantial portions of the Software.\\n\\n\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\\n\\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\\n\\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\\n\\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\\n\\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\\n\",\n \"file_path\": \"examples/live-visualization.rs\",\n \"rank\": 57,\n \"score\": 119.37976680270252\n },\n {\n \"content\": \"/*\\n\\nMIT License\\n\\n\\n\\nCopyright (c) 2021 Philipp Schuster\\n\\n\\n\\nPermission is hereby granted, free of charge, to any person obtaining a copy\\n\\nof this software and associated documentation files (the \\\"Software\\\"), to deal\\n\\nin the Software without restriction, including without limitation the rights\\n\\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\\n\\ncopies of the Software, and to permit persons to whom the Software is\\n\\nfurnished to do so, subject to the following conditions:\\n\\n\\n\\nThe above copyright notice and this permission notice shall be included in all\\n\\ncopies or substantial portions of the Software.\\n\\n\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\\n\\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\\n\\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\\n\\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\\n\\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\\n\",\n \"file_path\": \"src/fft/microfft_complex.rs\",\n \"rank\": 58,\n \"score\": 119.37976680270249\n },\n {\n \"content\": \"/*\\n\\nMIT License\\n\\n\\n\\nCopyright (c) 2021 Philipp Schuster\\n\\n\\n\\nPermission is hereby granted, free of charge, to any person obtaining a copy\\n\\nof this software and associated documentation files (the \\\"Software\\\"), to deal\\n\\nin the Software without restriction, including without limitation the rights\\n\\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\\n\\ncopies of the Software, and to permit persons to whom the Software is\\n\\nfurnished to do so, subject to the following conditions:\\n\\n\\n\\nThe above copyright notice and this permission notice shall be included in all\\n\\ncopies or substantial portions of the Software.\\n\\n\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\\n\\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\\n\\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\\n\\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\\n\\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\\n\",\n \"file_path\": \"src/tests/mod.rs\",\n \"rank\": 59,\n \"score\": 119.37976680270248\n },\n {\n \"content\": \"/*\\n\\nMIT License\\n\\n\\n\\nCopyright (c) 2021 Philipp Schuster\\n\\n\\n\\nPermission is hereby granted, free of charge, to any person obtaining a copy\\n\\nof this software and associated documentation files (the \\\"Software\\\"), to deal\\n\\nin the Software without restriction, including without limitation the rights\\n\\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\\n\\ncopies of the Software, and to permit persons to whom the Software is\\n\\nfurnished to do so, subject to the following conditions:\\n\\n\\n\\nThe above copyright notice and this permission notice shall be included in all\\n\\ncopies or substantial portions of the Software.\\n\\n\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\\n\\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\\n\\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\\n\\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\\n\\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\\n\",\n \"file_path\": \"src/error.rs\",\n \"rank\": 60,\n \"score\": 119.37976680270249\n },\n {\n \"content\": \"/*\\n\\nMIT License\\n\\n\\n\\nCopyright (c) 2021 Philipp Schuster\\n\\n\\n\\nPermission is hereby granted, free of charge, to any person obtaining a copy\\n\\nof this software and associated documentation files (the \\\"Software\\\"), to deal\\n\\nin the Software without restriction, including without limitation the rights\\n\\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\\n\\ncopies of the Software, and to permit persons to whom the Software is\\n\\nfurnished to do so, subject to the following conditions:\\n\\n\\n\\nThe above copyright notice and this permission notice shall be included in all\\n\\ncopies or substantial portions of the Software.\\n\\n\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\\n\\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\\n\\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\\n\\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\\n\\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\\n\",\n \"file_path\": \"src/windows.rs\",\n \"rank\": 61,\n \"score\": 119.3797668027025\n },\n {\n \"content\": \"/*\\n\\nMIT License\\n\\n\\n\\nCopyright (c) 2021 Philipp Schuster\\n\\n\\n\\nPermission is hereby granted, free of charge, to any person obtaining a copy\\n\\nof this software and associated documentation files (the \\\"Software\\\"), to deal\\n\\nin the Software without restriction, including without limitation the rights\\n\\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\\n\\ncopies of the Software, and to permit persons to whom the Software is\\n\\nfurnished to do so, subject to the following conditions:\\n\\n\\n\\nThe above copyright notice and this permission notice shall be included in all\\n\\ncopies or substantial portions of the Software.\\n\\n\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\\n\\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\\n\\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\\n\\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\\n\\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\\n\\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\\n\\nSOFTWARE.\\n\\n*/\\n\\n\\n\\nuse spectrum_analyzer::scaling::divide_by_N;\\n\\nuse spectrum_analyzer::windows::hann_window;\\n\\nuse spectrum_analyzer::{samples_fft_to_spectrum, FrequencyLimit};\\n\\n\\n\\n/// Minimal example.\\n\",\n \"file_path\": \"examples/minimal.rs\",\n \"rank\": 62,\n \"score\": 109.57560305233866\n },\n {\n \"content\": \"OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\\n\\nSOFTWARE.\\n\\n*/\\n\\n//! This module contains convenient public transform functions that you can use\\n\\n//! as parameters in [`crate::samples_fft_to_spectrum`] for scaling the\\n\\n//! frequency value (the FFT result). They act as \\\"idea/inspiration\\\". Feel free\\n\\n//! to either compose them or create your own derivation from them.\\n\\n\\n\\nuse alloc::boxed::Box;\\n\\n\\n\\n/// Helper struct for [`SpectrumScalingFunction`], that gets passed into the\\n\\n/// function together with the actual value. This structure can be used to scale\\n\\n/// each value. All properties reference the current data of a\\n\\n/// [`crate::spectrum::FrequencySpectrum`].\\n\\n///\\n\\n/// This uses `f32` in favor of [`crate::FrequencyValue`] because the latter led to\\n\\n/// some implementation problems.\\n\\n#[derive(Debug)]\\n\\npub struct SpectrumDataStats {\\n\\n /// Minimal frequency value in spectrum.\\n\",\n \"file_path\": \"src/scaling.rs\",\n \"rank\": 63,\n \"score\": 24.29572081115358\n },\n {\n \"content\": \"#[derive(Debug, Copy, Clone, Default)]\\n\\npub struct OrderableF32(f32);\\n\\n\\n\\nimpl OrderableF32 {\\n\\n #[inline(always)]\\n\\n pub const fn val(&self) -> f32 {\\n\\n self.0\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<f32> for OrderableF32 {\\n\\n #[inline(always)]\\n\\n fn from(val: f32) -> Self {\\n\\n debug_assert!(!val.is_nan(), \\\"NaN-values are not supported!\\\");\\n\\n debug_assert!(!val.is_infinite(), \\\"Infinite-values are not supported!\\\");\\n\\n Self(val)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Display for OrderableF32 {\\n\",\n \"file_path\": \"src/frequency.rs\",\n \"rank\": 64,\n \"score\": 22.92442762340749\n },\n {\n \"content\": \"OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\\n\\nSOFTWARE.\\n\\n*/\\n\\n//! Module for the struct [`OrderableF32`] and the two\\n\\n//! convenient type definitions [`Frequency`] and [`FrequencyValue`].\\n\\n\\n\\nuse core::cmp::Ordering;\\n\\nuse core::fmt::{Display, Formatter, Result};\\n\\nuse core::ops::{Add, Div, Mul, Sub};\\n\\n\\n\\n/// A frequency. A convenient wrapper type around `f32`.\\n\\npub type Frequency = OrderableF32;\\n\\n/// The value of a frequency in a frequency spectrum. Convenient wrapper around `f32`.\\n\\n/// Not necessarily the magnitude of the complex numbers because scaling/normalization\\n\\n/// functions could have been applied.\\n\\npub type FrequencyValue = OrderableF32;\\n\\n\\n\\n/// Small convenient wrapper around `f32`.\\n\\n/// Mainly required to make `f32` operable in a sorted tree map.\\n\\n/// You should only use the type aliases `Frequency` and `FrequencyValue`.\\n\",\n \"file_path\": \"src/frequency.rs\",\n \"rank\": 65,\n \"score\": 22.7741969515162\n },\n {\n \"content\": \"OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\\n\\nSOFTWARE.\\n\\n*/\\n\\nuse audio_visualizer::dynamic::live_input::AudioDevAndCfg;\\n\\nuse audio_visualizer::dynamic::window_top_btm::{open_window_connect_audio, TransformFn};\\n\\nuse spectrum_analyzer::scaling::divide_by_N;\\n\\nuse spectrum_analyzer::windows::hann_window;\\n\\nuse spectrum_analyzer::{samples_fft_to_spectrum, FrequencyLimit, FrequencyValue};\\n\\nuse std::cell::RefCell;\\n\\nuse std::cmp::max;\\n\\n\\n\\n/// Example that creates a live visualization of the frequency spectrum of realtime audio data\\n\\n/// **Execute this with `--release`, otherwise it is very laggy!**.\\n\",\n \"file_path\": \"examples/live-visualization.rs\",\n \"rank\": 66,\n \"score\": 20.27360077212534\n },\n {\n \"content\": \"OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\\n\\nSOFTWARE.\\n\\n*/\\n\\n//! Errors related to the spectrum analysis via FFT. Most probably, the errors will\\n\\n//! result in wrong input data, before the actual calculation has begun.\\n\\n//!\\n\\n//! This module focuses on the \\\"overall\\\" errors. More specific errors might be\\n\\n//! located in submodules.\\n\\n\\n\\nuse crate::limit::FrequencyLimitError;\\n\\n\\n\\n/// Describes main errors of the library. Almost all errors\\n\\n/// are caused by wrong input.\\n\\n#[derive(Debug)]\\n\\npub enum SpectrumAnalyzerError {\\n\\n /// There must be at least two samples.\\n\\n TooFewSamples,\\n\\n /// NaN values in samples are not supported!\\n\\n NaNValuesNotSupported,\\n\\n /// Infinity-values (regarding floating point representation) in samples are not supported!\\n\",\n \"file_path\": \"src/error.rs\",\n \"rank\": 67,\n \"score\": 20.08583312332127\n },\n {\n \"content\": \"OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\\n\\nSOFTWARE.\\n\\n*/\\n\\n\\n\\n#![deny(\\n\\n clippy::all,\\n\\n clippy::cargo,\\n\\n clippy::nursery,\\n\\n // clippy::restriction,\\n\\n // clippy::pedantic\\n\\n)]\\n\\n// now allow a few rules which are denied by the above statement\\n\\n// --> they are ridiculous and not necessary\\n\\n#![allow(\\n\\n clippy::suboptimal_flops,\\n\\n clippy::redundant_pub_crate,\\n\\n clippy::fallible_impl_from\\n\\n)]\\n\\n#![deny(missing_debug_implementations)]\\n\\n#![deny(rustdoc::all)]\\n\",\n \"file_path\": \"examples/mp3-samples.rs\",\n \"rank\": 68,\n \"score\": 19.222418633593453\n },\n {\n \"content\": \"OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\\n\\nSOFTWARE.\\n\\n*/\\n\\n\\n\\n#![deny(\\n\\n clippy::all,\\n\\n clippy::cargo,\\n\\n clippy::nursery,\\n\\n // clippy::restriction,\\n\\n // clippy::pedantic\\n\\n)]\\n\\n// now allow a few rules which are denied by the above statement\\n\\n// --> they are ridiculous and not necessary\\n\\n#![allow(\\n\\n clippy::suboptimal_flops,\\n\\n clippy::redundant_pub_crate,\\n\\n clippy::fallible_impl_from\\n\\n)]\\n\\n#![deny(missing_debug_implementations)]\\n\\n#![deny(rustdoc::all)]\\n\\n\\n\\nuse std::time::Instant;\\n\\n\\n\\nuse spectrum_analyzer::*;\\n\\n\\n\\n/// Benchmark can be used to check how changes effect the performance.\\n\\n/// Always execute with release flag!\\n\",\n \"file_path\": \"examples/bench.rs\",\n \"rank\": 69,\n \"score\": 18.40319923657838\n },\n {\n \"content\": \"OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\\n\\nSOFTWARE.\\n\\n*/\\n\\n//! Complex FFT using `microfft::complex`. Results should be equal to the ones from `rustfft`.\\n\\n//! The difference is that this implementation works in `no_std`-environments but it is\\n\\n//! limited to a maximum sample length of 4096 (with microfft version 0.4.0)\\n\\n\\n\\nuse alloc::vec::Vec;\\n\\n\\n\\nuse crate::fft::Fft;\\n\\nuse core::convert::TryInto;\\n\\nuse microfft::complex;\\n\\n\\n\\n/// The result of a FFT is always complex but because different FFT crates might\\n\\n/// use different versions of \\\"num-complex\\\", each implementation exports\\n\\n/// it's own version that gets used in lib.rs for binary compatibility.\\n\\npub use microfft::Complex32;\\n\\n\\n\\n/// Dummy struct with no properties but used as a type\\n\\n/// to implement a concrete FFT strategy using (`microfft::complex`).\\n\",\n \"file_path\": \"src/fft/microfft_complex.rs\",\n \"rank\": 70,\n \"score\": 18.052543683653944\n },\n {\n \"content\": \"OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\\n\\nSOFTWARE.\\n\\n*/\\n\\n//! Module for the struct [`FrequencySpectrum`].\\n\\n\\n\\nuse crate::error::SpectrumAnalyzerError;\\n\\nuse crate::frequency::{Frequency, FrequencyValue};\\n\\nuse crate::scaling::{SpectrumDataStats, SpectrumScalingFunction};\\n\\nuse alloc::collections::BTreeMap;\\n\\nuse alloc::vec::Vec;\\n\\nuse core::cell::{Cell, Ref, RefCell};\\n\\n\\n\\n/// Convenient wrapper around the processed FFT result which describes each frequency and\\n\\n/// its value/amplitude in the analyzed slice of samples. It only consists of the frequencies\\n\\n/// which were desired, e.g. specified via\\n\\n/// [`crate::limit::FrequencyLimit`] when [`crate::samples_fft_to_spectrum`] was called.\\n\\n///\\n\\n/// This means, the spectrum can cover all data from the DC component (0Hz) to the\\n\\n/// Nyquist frequency.\\n\\n///\\n\",\n \"file_path\": \"src/spectrum.rs\",\n \"rank\": 71,\n \"score\": 17.85281639187906\n },\n {\n \"content\": \"OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\\n\\nSOFTWARE.\\n\\n*/\\n\\n//! Several window functions which you can apply before doing the FFT.\\n\\n//! For more information:\\n\\n//! - <https://en.wikipedia.org/wiki/Window_function>\\n\\n//! - <https://www.youtube.com/watch?v=dCeHOf4cJE0> (FFT and windowing by Texas Instruments)\\n\\n\\n\\nuse alloc::vec::Vec;\\n\\nuse core::f32::consts::PI;\\n\\n// replacement for std functions like sin and cos in no_std-environments\\n\\nuse libm::cosf;\\n\\n\\n\\n/*/// Describes what window function should be applied to\\n\\n/// the `samples` parameter of [`crate::samples_fft_to_spectrum`]\\n\\n/// should be applied before the FFT starts. See\\n\\n/// https://en.wikipedia.org/wiki/Window_function for more\\n\\n/// resources.\\n\\npub enum WindowFn {\\n\\n\\n\\n}*/\\n\\n\\n\\n/// Applies a Hann window (<https://en.wikipedia.org/wiki/Window_function#Hann_and_Hamming_windows>)\\n\\n/// to an array of samples.\\n\\n///\\n\\n/// ## Return value\\n\\n/// New vector with Hann window applied to the values.\\n\",\n \"file_path\": \"src/windows.rs\",\n \"rank\": 72,\n \"score\": 17.12078600896075\n },\n {\n \"content\": \"/// All results are related to the sampling rate provided to the library function which\\n\\n/// creates objects of this struct!\\n\\n#[derive(Debug, Default)]\\n\\npub struct FrequencySpectrum {\\n\\n /// Raw data. Vector is sorted from lowest\\n\\n /// frequency to highest and data is normalized/scaled\\n\\n /// according to all applied scaling functions.\\n\\n data: RefCell<Vec<(Frequency, FrequencyValue)>>,\\n\\n /// Frequency resolution of the examined samples in Hertz,\\n\\n /// i.e the frequency steps between elements in the vector\\n\\n /// inside field [`Self::data`].\\n\\n frequency_resolution: f32,\\n\\n /// Number of samples. This property must be kept separately, because\\n\\n /// `data.borrow().len()` might contain less than N elements, if the\\n\\n /// spectrum was created with a [`crate::limit::FrequencyLimit`] .\\n\\n samples_len: u32,\\n\\n /// Average value of frequency value/magnitude/amplitude\\n\\n /// corresponding to data in [`FrequencySpectrum::data`].\\n\\n average: Cell<FrequencyValue>,\\n\\n /// Median value of frequency value/magnitude/amplitude\\n\",\n \"file_path\": \"src/spectrum.rs\",\n \"rank\": 73,\n \"score\": 17.08804900828108\n },\n {\n \"content\": \" let max_detectable_frequency = sampling_rate as f32 / 2.0;\\n\\n // verify frequency limit: unwrap error or else ok\\n\\n let _ = frequency_limit\\n\\n .verify(max_detectable_frequency)\\n\\n .map_err(SpectrumAnalyzerError::InvalidFrequencyLimit)?;\\n\\n\\n\\n // With FFT we transform an array of time-domain waveform samples\\n\\n // into an array of frequency-domain spectrum samples\\n\\n // https://www.youtube.com/watch?v=z7X6jgFnB6Y\\n\\n\\n\\n // FFT result has same length as input\\n\\n // (but when we interpret the result, we don't need all indices)\\n\\n\\n\\n // applies the f32 samples onto the FFT algorithm implementation\\n\\n // chosen at compile time (via Cargo feature).\\n\\n // If a complex FFT implementation was chosen, this will internally\\n\\n // transform all data to Complex numbers.\\n\\n let buffer = FftImpl::fft_apply(samples);\\n\\n\\n\\n // This function:\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 74,\n \"score\": 17.043152895653368\n },\n {\n \"content\": \"OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\\n\\nSOFTWARE.\\n\\n*/\\n\\n//! Module for generating synthetic sine waves.\\n\\n\\n\\nuse alloc::boxed::Box;\\n\\nuse alloc::vec::Vec;\\n\\nuse core::f32::consts::PI;\\n\\n\\n\\n/// Creates a sine (sinus) wave function for a given frequency.\\n\\n/// Don't forget to scale up the value to the audio resolution.\\n\\n/// So far, amplitude is in interval `[-1; 1]`. The parameter\\n\\n/// of the returned function is the point in time in seconds.\\n\\n///\\n\\n/// * `frequency` is in Hertz\\n\",\n \"file_path\": \"src/tests/sine.rs\",\n \"rank\": 75,\n \"score\": 16.904379108458027\n },\n {\n \"content\": \" #[inline(always)]\\n\\n pub fn range(&self) -> FrequencyValue {\\n\\n self.max().1 - self.min().1\\n\\n }\\n\\n\\n\\n /// Returns the underlying data.\\n\\n #[inline(always)]\\n\\n pub fn data(&self) -> Ref<Vec<(Frequency, FrequencyValue)>> {\\n\\n self.data.borrow()\\n\\n }\\n\\n\\n\\n /// Returns the frequency resolution of this spectrum.\\n\\n #[inline(always)]\\n\\n pub const fn frequency_resolution(&self) -> f32 {\\n\\n self.frequency_resolution\\n\\n }\\n\\n\\n\\n /// Returns the number of samples used to obtain this spectrum.\\n\\n #[inline(always)]\\n\\n pub const fn samples_len(&self) -> u32 {\\n\",\n \"file_path\": \"src/spectrum.rs\",\n \"rank\": 76,\n \"score\": 16.878767880314125\n },\n {\n \"content\": \" fn fmt(&self, f: &mut Formatter<'_>) -> Result {\\n\\n write!(f, \\\"{}\\\", self.0)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Ord for OrderableF32 {\\n\\n #[inline(always)]\\n\\n fn cmp(&self, other: &Self) -> Ordering {\\n\\n self.partial_cmp(other).unwrap()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Eq for OrderableF32 {}\\n\\n\\n\\nimpl PartialEq for OrderableF32 {\\n\\n #[inline(always)]\\n\\n fn eq(&self, other: &Self) -> bool {\\n\\n matches!(self.cmp(other), Ordering::Equal)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/frequency.rs\",\n \"rank\": 77,\n \"score\": 16.79715204873362\n },\n {\n \"content\": \" /// then `get_frequency_value_closest(320)` will return `(300.0, 0.5)`.\\n\\n ///\\n\\n /// ## Panics\\n\\n /// If parameter `search_fre` (frequency) is below the lowest or the maximum\\n\\n /// frequency, this function panics!\\n\\n ///\\n\\n /// ## Parameters\\n\\n /// - `search_fr` The frequency of that you want the amplitude/value in the spectrum.\\n\\n ///\\n\\n /// ## Return\\n\\n /// Closest matching point in spectrum, determined by [`Self::frequency_resolution`].\\n\\n #[inline(always)]\\n\\n pub fn freq_val_closest(&self, search_fr: f32) -> (Frequency, FrequencyValue) {\\n\\n let data = self.data.borrow();\\n\\n\\n\\n // lowest frequency in the spectrum\\n\\n // TODO use minFrequency() and maxFrequency()\\n\\n let (min_fr, min_fr_val) = data[0];\\n\\n // highest frequency in the spectrum\\n\\n let (max_fr, max_fr_val) = data[data.len() - 1];\\n\",\n \"file_path\": \"src/spectrum.rs\",\n \"rank\": 78,\n \"score\": 16.779183296853173\n },\n {\n \"content\": \" /// frequency, this function panics! This is because the user provide\\n\\n /// the min/max frequency when the spectrum is created and knows about it.\\n\\n /// This is similar to an intended \\\"out of bounds\\\"-access.\\n\\n ///\\n\\n /// ## Parameters\\n\\n /// - `search_fr` The frequency of that you want the amplitude/value in the spectrum.\\n\\n ///\\n\\n /// ## Return\\n\\n /// Either exact value of approximated value, determined by [`Self::frequency_resolution`].\\n\\n #[inline(always)]\\n\\n pub fn freq_val_exact(&self, search_fr: f32) -> FrequencyValue {\\n\\n let data = self.data.borrow();\\n\\n\\n\\n // lowest frequency in the spectrum\\n\\n // TODO use minFrequency() and maxFrequency()\\n\\n let (min_fr, min_fr_val) = data[0];\\n\\n // highest frequency in the spectrum\\n\\n let (max_fr, max_fr_val) = data[data.len() - 1];\\n\\n\\n\\n // https://docs.rs/float-cmp/0.8.0/float_cmp/\\n\",\n \"file_path\": \"src/spectrum.rs\",\n \"rank\": 79,\n \"score\": 16.756987078292457\n },\n {\n \"content\": \"\\n\\nuse alloc::vec::Vec;\\n\\n\\n\\nuse crate::error::SpectrumAnalyzerError;\\n\\nuse crate::fft::{Complex32, Fft, FftImpl};\\n\\npub use crate::frequency::{Frequency, FrequencyValue};\\n\\npub use crate::limit::FrequencyLimit;\\n\\npub use crate::limit::FrequencyLimitError;\\n\\nuse crate::scaling::SpectrumScalingFunction;\\n\\npub use crate::spectrum::FrequencySpectrum;\\n\\n\\n\\npub mod error;\\n\\nmod fft;\\n\\nmod frequency;\\n\\nmod limit;\\n\\npub mod scaling;\\n\\nmod spectrum;\\n\\npub mod windows;\\n\\n\\n\\n// test module for large \\\"integration\\\"-like tests\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 80,\n \"score\": 16.081331840669133\n },\n {\n \"content\": \"/// You must take care of, that you don't have division by zero in your function or\\n\\n/// that the result is NaN or Infinity (regarding IEEE-754). If the result is NaN or Infinity,\\n\\n/// the library will return `Err`.\\n\\n///\\n\\n/// This uses `f32` in favor of [`crate::FrequencyValue`] because the latter led to\\n\\n/// some implementation problems.\\n\\npub type SpectrumScalingFunction<'a> = &'a dyn Fn(f32, &SpectrumDataStats) -> f32;\\n\\n\\n\\n/// Calculates the base 10 logarithm of each frequency magnitude and\\n\\n/// multiplies it with 20. This scaling is quite common, you can\\n\\n/// find more information for example here:\\n\\n/// <https://www.sjsu.edu/people/burford.furman/docs/me120/FFT_tutorial_NI.pdf>\\n\\n///\\n\\n/// ## Usage\\n\\n/// ```rust\\n\\n///use spectrum_analyzer::{samples_fft_to_spectrum, scaling, FrequencyLimit};\\n\\n///let window = [0.0, 0.1, 0.2, 0.3]; // add real data here\\n\\n///let spectrum = samples_fft_to_spectrum(\\n\\n/// &window,\\n\\n/// 44100,\\n\\n/// FrequencyLimit::All,\\n\\n/// Some(&scaling::scale_20_times_log10),\\n\\n/// );\\n\\n/// ```\\n\\n/// Function is of type [`SpectrumScalingFunction`].\\n\",\n \"file_path\": \"src/scaling.rs\",\n \"rank\": 81,\n \"score\": 16.015905445211438\n },\n {\n \"content\": \" pub min: f32,\\n\\n /// Maximum frequency value in spectrum.\\n\\n pub max: f32,\\n\\n /// Average frequency value in spectrum.\\n\\n pub average: f32,\\n\\n /// Median frequency value in spectrum.\\n\\n pub median: f32,\\n\\n /// Number of samples (`samples.len()`). Already\\n\\n /// casted to f32, to avoid repeatedly casting in a loop for each value.\\n\\n pub n: f32,\\n\\n}\\n\\n\\n\\n/// Describes the type for a function that scales/normalizes the data inside [`crate::FrequencySpectrum`].\\n\\n/// The scaling only affects the value/amplitude of the frequency, but not the frequency itself.\\n\\n/// It gets applied to every single element.\\n\\n/// ///\\n\\n/// A scaling function can be used for example to subtract the minimum (`min`) from each value.\\n\\n/// It is optional to use the second parameter [`SpectrumDataStats`].\\n\\n/// and the type works with static functions as well as dynamically created closures.\\n\\n///\\n\",\n \"file_path\": \"src/scaling.rs\",\n \"rank\": 82,\n \"score\": 16.012947366781145\n },\n {\n \"content\": \"OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\\n\\nSOFTWARE.\\n\\n*/\\n\\n//! Complex FFT using `rustfft`. Results should be equal to the ones from `microfft`.\\n\\n//! The difference is that this implementation works only in `std`-environments\\n\\n//! and can handle sample lengths of more than 4096.\\n\\n\\n\\nuse alloc::vec::Vec;\\n\\n\\n\\nuse crate::fft::Fft as FftAbstraction;\\n\\nuse rustfft::algorithm::Radix4;\\n\\nuse rustfft::{Fft, FftDirection};\\n\\n\\n\\n/// The result of a FFT is always complex but because different FFT crates might\\n\\n/// use different versions of \\\"num-complex\\\", each implementation exports\\n\\n/// it's own version that gets used in lib.rs for binary compatibility.\\n\\npub use rustfft::num_complex::Complex32;\\n\\n\\n\\n/// Dummy struct with no properties but used as a type\\n\\n/// to implement a concrete FFT strategy using (`rustfft::algorithm::Radix4`).\\n\",\n \"file_path\": \"src/fft/rustfft_complex.rs\",\n \"rank\": 83,\n \"score\": 15.827613933257087\n },\n {\n \"content\": \"OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\\n\\nSOFTWARE.\\n\\n*/\\n\\n//! Test module for \\\"integration\\\"-like tests. No small unit tests of simple functions.\\n\\n\\n\\nuse crate::error::SpectrumAnalyzerError;\\n\\nuse crate::scaling::{divide_by_N, scale_to_zero_to_one};\\n\\nuse crate::tests::sine::sine_wave_audio_data_multiple;\\n\\nuse crate::windows::{hamming_window, hann_window};\\n\\nuse crate::{samples_fft_to_spectrum, FrequencyLimit};\\n\\nuse alloc::vec::Vec;\\n\\nuse audio_visualizer::spectrum::plotters_png_file::spectrum_static_plotters_png_visualize;\\n\\nuse audio_visualizer::waveform::plotters_png_file::waveform_static_plotters_png_visualize;\\n\\nuse audio_visualizer::Channels;\\n\\nuse core::cmp::max;\\n\\n\\n\\n// /// Directory with test samples (e.g. mp3) can be found here.\\n\\n// const TEST_SAMPLES_DIR: &str = \\\"test/samples\\\";\\n\\n/// If tests create files, they should be stored here.\\n\\nconst TEST_OUT_DIR: &str = \\\"test/out\\\";\\n\\n\\n\\nmod sine;\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"src/tests/mod.rs\",\n \"rank\": 84,\n \"score\": 15.73368956470836\n },\n {\n \"content\": \" /// * `samples_len` Number of samples. Might be bigger than `data.len()`\\n\\n /// if the spectrum is obtained with a frequency limit.\\n\\n #[inline(always)]\\n\\n pub fn new(\\n\\n data: Vec<(Frequency, FrequencyValue)>,\\n\\n frequency_resolution: f32,\\n\\n samples_len: u32,\\n\\n ) -> Self {\\n\\n debug_assert!(\\n\\n data.len() >= 2,\\n\\n \\\"Input data of length={} for spectrum makes no sense!\\\",\\n\\n data.len()\\n\\n );\\n\\n\\n\\n let obj = Self {\\n\\n data: RefCell::new(data),\\n\\n frequency_resolution,\\n\\n samples_len,\\n\\n // default/placeholder values\\n\\n average: Cell::new(FrequencyValue::from(-1.0)),\\n\",\n \"file_path\": \"src/spectrum.rs\",\n \"rank\": 85,\n \"score\": 15.551846033777903\n },\n {\n \"content\": \"OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\\n\\nSOFTWARE.\\n\\n*/\\n\\n//! Real FFT using `microfft::real`.\\n\\n//! Works in `no_std`-environments, maximum sample length is 4096 (with microfft version 0.4.0)\\n\\n//! and it's faster than a \\\"typical\\\" complex FFT.\\n\\n\\n\\nuse alloc::vec::Vec;\\n\\n\\n\\nuse crate::fft::Fft;\\n\\nuse core::convert::TryInto;\\n\\nuse microfft::real;\\n\\n\\n\\n/// The result of a FFT is always complex but because different FFT crates might\\n\\n/// use different versions of \\\"num-complex\\\", each implementation exports\\n\\n/// it's own version that gets used in lib.rs for binary compatibility.\\n\\npub use microfft::Complex32;\\n\\n\\n\\n/// Dummy struct with no properties but used as a type\\n\\n/// to implement a concrete FFT strategy using (`microfft::real`).\\n\",\n \"file_path\": \"src/fft/microfft_real.rs\",\n \"rank\": 86,\n \"score\": 15.461666059017839\n },\n {\n \"content\": \"## How to use FFT to get a frequency spectrum?\\n\\n\\n\\nThis library is full of additional and useful links and comments about how an FFT result \\n\\ncan be used to get a frequency spectrum. In this document I want to give a short introduction \\n\\nwhere inside the code you can find specific things.\\n\\n\\n\\n**TL;DR:** Although this crate has 1400 lines of code, **the part which gets the frequency and\\n\\ntheir values from the FFT is small and simple**. Most of the code is related to my convenient \\n\\nabstraction over the FFT result including several getters, transform/scaling functions, and\\n\\ntests.\\n\\n\\n\\n**I don't explain how FFT works but how you use the result!**\\n\\nIf you want to understand that too:\\n\\n\\n\\n- check out all links provided [at the end of README.md](/README.md)\\n\\n- look into `lib.rs` (**probalby gives you 90 percent of the things you want to know**) \\n\\n and the comments over the FFT abstraction in `src/fft/mod.rs` and \\n\\n `src/fft/rustfft-complex/mod.rs`.\\n\\n \\n\\n\\n\\nThis is everything important you need. Everything inside \\n\\n `spectrum.rs` and the other files is just convenient stuff + tests for when you \\n\\nwant to use this crate in your program.\\n\",\n \"file_path\": \"EDUCATIONAL.md\",\n \"rank\": 87,\n \"score\": 14.86226090239834\n },\n {\n \"content\": \" median: Cell::new(FrequencyValue::from(-1.0)),\\n\\n min: Cell::new((Frequency::from(-1.0), FrequencyValue::from(-1.0))),\\n\\n max: Cell::new((Frequency::from(-1.0), FrequencyValue::from(-1.0))),\\n\\n };\\n\\n // IMPORTANT!!\\n\\n obj.calc_statistics();\\n\\n obj\\n\\n }\\n\\n\\n\\n /// Applies the function `scaling_fn` to each element and updates\\n\\n /// `min`, `max`, etc. afterwards accordingly. It ensures that no value\\n\\n /// is `NaN` or `Infinity` afterwards (regarding IEEE-754).\\n\\n ///\\n\\n /// ## Parameters\\n\\n /// * `scaling_fn` See [`crate::scaling::SpectrumScalingFunction`].\\n\\n #[inline(always)]\\n\\n pub fn apply_scaling_fn(\\n\\n &self,\\n\\n scaling_fn: SpectrumScalingFunction,\\n\\n ) -> Result<(), SpectrumAnalyzerError> {\\n\",\n \"file_path\": \"src/spectrum.rs\",\n \"rank\": 88,\n \"score\": 14.74697196284392\n },\n {\n \"content\": \"OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\\n\\nSOFTWARE.\\n\\n*/\\n\\n//! A simple and fast `no_std` library to get the frequency spectrum of a digital signal\\n\\n//! (e.g. audio) using FFT. It follows the KISS principle and consists of simple building\\n\\n//! blocks/optional features.\\n\\n//!\\n\\n//! In short, this is a convenient wrapper around a FFT implementation. You choose the\\n\\n//! implementation at compile time via Cargo features. This crate uses\\n\\n//! \\\"microfft\\\" by default for FFT. See README for more advise.\\n\\n//!\\n\\n//! ## Examples\\n\\n//! ### Scaling via dynamic closure\\n\\n//! ```rust\\n\\n//! use spectrum_analyzer::{samples_fft_to_spectrum, FrequencyLimit};\\n\\n//! // get data from audio source\\n\\n//! let samples = vec![0.0, 1.1, 5.5, -5.5];\\n\\n//! let res = samples_fft_to_spectrum(\\n\\n//! &samples,\\n\\n//! 44100,\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 89,\n \"score\": 14.736695211046367\n },\n {\n \"content\": \" let avg = sum / data_sorted.len() as f32;\\n\\n let average: FrequencyValue = avg.into();\\n\\n\\n\\n let median = {\\n\\n // we assume that data_sorted.length() is always even, because\\n\\n // it must be a power of 2 (for FFT)\\n\\n let a = data_sorted[data_sorted.len() / 2 - 1].1;\\n\\n let b = data_sorted[data_sorted.len() / 2].1;\\n\\n (a + b) / 2.0.into()\\n\\n };\\n\\n\\n\\n // because we sorted the vector a few lines above\\n\\n // by the value, the following lines are correct\\n\\n // i.e. we get min/max value with corresponding frequency\\n\\n let min = data_sorted[0];\\n\\n let max = data_sorted[data_sorted.len() - 1];\\n\\n\\n\\n // check that I get the comparison right (and not from max to min)\\n\\n debug_assert!(min.1 <= max.1, \\\"min must be <= max\\\");\\n\\n\\n\",\n \"file_path\": \"src/spectrum.rs\",\n \"rank\": 90,\n \"score\": 13.728834428644713\n },\n {\n \"content\": \"pub struct FftImpl;\\n\\n\\n\\nimpl FftImpl {\\n\\n /// Converts all samples to a complex number (imaginary part is set to zero)\\n\\n /// as preparation for the FFT.\\n\\n ///\\n\\n /// ## Parameters\\n\\n /// `samples` Input samples.\\n\\n ///\\n\\n /// ## Return value\\n\\n /// New vector with elements of FFT output/result.\\n\\n #[inline(always)]\\n\\n fn samples_to_complex(samples: &[f32]) -> Vec<Complex32> {\\n\\n samples\\n\\n .iter()\\n\\n .map(|x| Complex32::new(*x, 0.0))\\n\\n .collect::<Vec<Complex32>>()\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/fft/microfft_complex.rs\",\n \"rank\": 91,\n \"score\": 13.682238367962356\n },\n {\n \"content\": \"pub struct FftImpl;\\n\\n\\n\\nimpl FftImpl {\\n\\n /// Converts all samples to a complex number (imaginary part is set to zero)\\n\\n /// as preparation for the FFT.\\n\\n ///\\n\\n /// ## Parameters\\n\\n /// `samples` Input samples.\\n\\n ///\\n\\n /// ## Return value\\n\\n /// New vector with elements of FFT output/result.\\n\\n #[inline(always)]\\n\\n fn samples_to_complex(samples: &[f32]) -> Vec<Complex32> {\\n\\n samples\\n\\n .iter()\\n\\n .map(|x| Complex32::new(*x, 0.0))\\n\\n .collect::<Vec<Complex32>>()\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/fft/rustfft_complex.rs\",\n \"rank\": 92,\n \"score\": 13.682238367962354\n },\n {\n \"content\": \"#[cfg(test)]\\n\\nmod tests;\\n\\n\\n\\n/// Takes an array of samples (length must be a power of 2),\\n\\n/// e.g. 2048, applies an FFT (using the specified FFT implementation) on it\\n\\n/// and returns all frequencies with their volume/magnitude.\\n\\n///\\n\\n/// By default, no normalization/scaling is done at all and the results,\\n\\n/// i.e. the frequency magnitudes/amplitudes/values are the raw result from\\n\\n/// the FFT algorithm, except that complex numbers are transformed\\n\\n/// to their magnitude.\\n\\n///\\n\\n/// * `samples` raw audio, e.g. 16bit audio data but as f32.\\n\\n/// You should apply an window function (like Hann) on the data first.\\n\\n/// The final frequency resolution is `sample_rate / (N / 2)`\\n\\n/// e.g. `44100/(16384/2) == 5.383Hz`, i.e. more samples =>\\n\\n/// better accuracy/frequency resolution.\\n\\n/// * `sampling_rate` sampling_rate, e.g. `44100 [Hz]`\\n\\n/// * `frequency_limit` Frequency limit. See [`FrequencyLimit´]\\n\\n/// * `scaling_fn` See [`crate::scaling::SpectrumScalingFunction`] for details.\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 93,\n \"score\": 13.36493236885485\n },\n {\n \"content\": \" self.min.replace(min);\\n\\n self.max.replace(max);\\n\\n self.average.replace(average);\\n\\n self.median.replace(median);\\n\\n }\\n\\n}\\n\\n\\n\\n/*impl FromIterator<(Frequency, FrequencyValue)> for FrequencySpectrum {\\n\\n\\n\\n #[inline(always)]\\n\\n fn from_iter<T: IntoIterator<Item=(Frequency, FrequencyValue)>>(iter: T) -> Self {\\n\\n // 1024 is just a guess: most likely 2048 is a common FFT length,\\n\\n // i.e. 1024 results for the frequency spectrum.\\n\\n let mut vec = Vec::with_capacity(1024);\\n\\n for (fr, val) in iter {\\n\\n vec.push((fr, val))\\n\\n }\\n\\n\\n\\n FrequencySpectrum::new(vec)\\n\\n }\\n\",\n \"file_path\": \"src/spectrum.rs\",\n \"rank\": 94,\n \"score\": 13.206055849199664\n },\n {\n \"content\": \" self.samples_len\\n\\n }\\n\\n\\n\\n /// Getter for the highest frequency that is captured inside this spectrum.\\n\\n /// Shortcut for `spectrum.data()[spectrum.data().len() - 1].0`.\\n\\n /// This corresponds to the [`crate::limit::FrequencyLimit`] of the spectrum.\\n\\n ///\\n\\n /// This method could return the Nyquist frequency, if there was no Frequency\\n\\n /// limit while obtaining the spectrum.\\n\\n #[inline(always)]\\n\\n pub fn max_fr(&self) -> Frequency {\\n\\n let data = self.data.borrow();\\n\\n data[data.len() - 1].0\\n\\n }\\n\\n\\n\\n /// Getter for the lowest frequency that is captured inside this spectrum.\\n\\n /// Shortcut for `spectrum.data()[0].0`.\\n\\n /// This corresponds to the [`crate::limit::FrequencyLimit`] of the spectrum.\\n\\n ///\\n\\n /// This method could return the DC component, see [`Self::dc_component`].\\n\",\n \"file_path\": \"src/spectrum.rs\",\n \"rank\": 95,\n \"score\": 12.8102564697159\n },\n {\n \"content\": \" // 1) calculates the corresponding frequency of each index in the FFT result\\n\\n // 2) filters out unwanted frequencies\\n\\n // 3) calculates the magnitude (absolute value) at each frequency index for each complex value\\n\\n // 4) optionally scales the magnitudes\\n\\n // 5) collects everything into the struct \\\"FrequencySpectrum\\\"\\n\\n fft_result_to_spectrum(\\n\\n samples.len(),\\n\\n &buffer,\\n\\n sampling_rate,\\n\\n frequency_limit,\\n\\n scaling_fn,\\n\\n )\\n\\n}\\n\\n\\n\\n/// Transforms the FFT result into the spectrum by calculating the corresponding frequency of each\\n\\n/// FFT result index and optionally calculating the magnitudes of the complex numbers if a complex\\n\\n/// FFT implementation is chosen.\\n\\n///\\n\\n/// ## Parameters\\n\\n/// * `samples_len` Length of samples. This is a dedicated field because it can't always be\\n\\n/// derived from `fft_result.len()`. There are for example differences for\\n\\n/// `fft_result.len()` in real and complex FFT.\\n\\n/// * `fft_result` Result buffer from FFT. Has the same length as the samples array.\\n\\n/// * `sampling_rate` sampling_rate, e.g. `44100 [Hz]`\\n\\n/// * `frequency_limit` Frequency limit. See [`FrequencyLimit´]\\n\\n/// * `scaling_fn` See [`crate::scaling::SpectrumScalingFunction`].\\n\\n///\\n\\n/// ## Return value\\n\\n/// New object of type [`FrequencySpectrum`].\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 96,\n \"score\": 12.614851541276277\n },\n {\n \"content\": \"\\n\\n/// Abstraction over different FFT implementations. This is necessary because this crate\\n\\n/// uses different compile time features to exchange the FFT implementation, i.e. real or complex.\\n\\n/// Each of them operates on possibly different \\\"num-complex\\\"-versions for example.\\n\\npub(crate) trait Fft<ComplexType> {\\n\\n /// Applies the FFT on the given implementation. If necessary, the data is converted to a\\n\\n /// complex number first. The resulting vector contains complex numbers without any\\n\\n /// normalization/scaling. Usually you calc the magnitude of each complex number on the\\n\\n /// resulting vector to get the amplitudes of the frequencies in the next step.\\n\\n ///\\n\\n /// ## Parameters\\n\\n /// * `samples` samples for FFT. Length MUST be a power of 2 for FFT, e.g. 1024 or 4096!\\n\\n ///\\n\\n /// ## Return\\n\\n /// Vector of FFT results.\\n\\n fn fft_apply(samples: &[f32]) -> Vec<ComplexType>;\\n\\n\\n\\n /// Returns the relevant results of the FFT result. For complex FFT this is\\n\\n /// `N/2 + 1`, i.e. indices `0..=N/2` (inclusive end) are relevant. Real FFT\\n\\n /// implementations might be different here, because they may only have\\n\",\n \"file_path\": \"src/fft/mod.rs\",\n \"rank\": 97,\n \"score\": 12.5473572658559\n },\n {\n \"content\": \" assert_eq!(\\n\\n spectrum.max_fr().val(),\\n\\n sampling_rate as f32 / 2.0,\\n\\n \\\"Upper bound frequency must be inclusive!\\\"\\n\\n );\\n\\n }\\n\\n {\\n\\n let spectrum = samples_fft_to_spectrum(\\n\\n &window,\\n\\n sampling_rate,\\n\\n FrequencyLimit::Range(412.0, 510.0),\\n\\n None,\\n\\n )\\n\\n .unwrap();\\n\\n assert_eq!(\\n\\n spectrum.min_fr().val(),\\n\\n 412.0,\\n\\n \\\"Lower bound frequency must be inclusive!\\\"\\n\\n );\\n\\n assert_eq!(\\n\\n spectrum.max_fr().val(),\\n\\n 510.0,\\n\\n \\\"Upper bound frequency must be inclusive!\\\"\\n\\n );\\n\\n }\\n\\n}\\n\\n\\n\\n/// Tests that the spectrum contains the Nyquist frequency.\\n\",\n \"file_path\": \"src/tests/mod.rs\",\n \"rank\": 98,\n \"score\": 12.532412260433738\n },\n {\n \"content\": \" #[inline(always)]\\n\\n pub fn dc_component(&self) -> Option<FrequencyValue> {\\n\\n let data = self.data.borrow();\\n\\n let (maybe_dc_component, dc_value) = &data[0];\\n\\n if maybe_dc_component.val() == 0.0 {\\n\\n Some(*dc_value)\\n\\n } else {\\n\\n None\\n\\n }\\n\\n }\\n\\n\\n\\n /// Returns the value of the given frequency from the spectrum either exactly or approximated.\\n\\n /// If `search_fr` is not exactly given in the spectrum, i.e. due to the\\n\\n /// [`Self::frequency_resolution`], this function takes the two closest\\n\\n /// neighbors/points (A, B), put a linear function through them and calculates\\n\\n /// the point C in the middle. This is done by the private function\\n\\n /// `calculate_y_coord_between_points`.\\n\\n ///\\n\\n /// ## Panics\\n\\n /// If parameter `search_fr` (frequency) is below the lowest or the maximum\\n\",\n \"file_path\": \"src/spectrum.rs\",\n \"rank\": 99,\n \"score\": 12.30702806528617\n }\n]","isConversational":false}}},{"rowIdx":1392,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"predict/src/bin/build_driving_model.rs"},"repo_name":{"kind":"string","value":"ehsanul/brick"},"commit":{"kind":"string","value":"291c0783f3b062cf73887cb3581dd92342891165"},"file_code":{"kind":"string","value":"extern crate bincode;\nextern crate flate2;\nextern crate predict;\nextern crate state;\n\nuse bincode::serialize_into;\nuse flate2::write::GzEncoder;\nuse flate2::Compression;\nuse predict::driving_model::{DrivingModel, PlayerTransformation, TransformationMap};\nuse predict::sample;\nuse state::*;\nuse std::collections::hash_map::Entry::{Occupied, Vacant};\nuse std::error::Error;\nuse std::fs::{create_dir_all, File};\nuse std::io::BufWriter;\nuse std::path::Path;\n\nfn build_model_for(control_branch: &str) -> DrivingModel {\n let all_samples = sample::load_all_samples(&format!(\"./data/samples/flat_ground/{}/\", control_branch));\n let mut model = DrivingModel::default();\n index_all_samples(&mut model.tick2, &all_samples, 2);\n index_all_samples(&mut model.tick16, &all_samples, 16);\n \n model\n}\n\nfn write_model(path: &Path, model: DrivingModel) -> Result<(), Box<dyn Error>> {\n let f = BufWriter::new(File::create(path)?);\n let mut e = GzEncoder::new(f, Compression::default());\n Ok(serialize_into(&mut e, &model)?)\n}\n\nfn index_all_samples(indexed: &mut TransformationMap, all_samples: &[Vec<PlayerState>], num_ticks: usize) {\n for sample in all_samples {\n if sample.len() < sample::MIN_SAMPLE_LENGTH {\n println!(\"bad sample: {:?}\", sample[0]);\n }\n\n let mut j = 0;\n\n let ratio = FPS as usize / sample::RECORD_FPS; \n while sample[j..].len() > num_ticks / ratio {\n let key = sample::normalized_player_rounded(&sample[j]);\n\n match indexed.entry(key) {\n Vacant(e) => {\n e.insert(PlayerTransformation::from_samples(&sample[j..], num_ticks));\n }\n Occupied(mut e) => {\n \n \n let should_replace = {\n let existing_transformation = e.get();\n\n let existing_delta_x = (existing_transformation.start_local_vx as f32\n - sample::GROUND_SPEED_GRID_FACTOR * e.key().local_vx as f32)\n .abs();\n let existing_delta_y = (existing_transformation.start_local_vy as f32\n - sample::GROUND_SPEED_GRID_FACTOR * e.key().local_vy as f32)\n .abs();\n let existing_delta = (existing_delta_x.powf(2.0) + existing_delta_y.powf(2.0)).sqrt();\n\n let new_lv = sample[j].local_velocity();\n let new_delta_x = (new_lv.x - sample::GROUND_SPEED_GRID_FACTOR * e.key().local_vx as f32).abs();\n let new_delta_y = (new_lv.y - sample::GROUND_SPEED_GRID_FACTOR * e.key().local_vy as f32).abs();\n let new_delta = (new_delta_x.powf(2.0) + new_delta_y.powf(2.0)).sqrt();\n\n new_delta < existing_delta\n };\n\n if should_replace {\n e.insert(PlayerTransformation::from_samples(&sample[j..], num_ticks));\n }\n }\n };\n j += 1;\n }\n }\n}\n\nfn main() -> Result<(), Box<dyn Error>> {\n let control_branches = [\n \"throttle_straight\",\n \"throttle_right\",\n \"throttle_left\",\n \n \n \n \"boost_straight\",\n \"boost_right\",\n \"boost_left\",\n \n \n \n\n \n \n \n \n \n \n\n \n \n \n \n \n \n ];\n\n let base_path = Path::new(\"./models/flat_ground\");\n create_dir_all(&base_path)?;\n for control_branch in control_branches.iter() {\n let model = build_model_for(control_branch);\n let filename = format!(\"{}.bincode.gz\", control_branch);\n write_model(&base_path.join(filename), model)?;\n }\n\n Ok(())\n}\n"},"prefix":{"kind":"string","value":"extern crate bincode;\nextern crate flate2;\nextern crate predict;\nextern crate state;\n\nuse bincode::serialize_into;\nuse flate2::write::GzEncoder;\nuse flate2::Compression;\nuse predict::driving_model::{DrivingModel, PlayerTransformation, TransformationMap};\nuse predict::sample;\nuse state::*;\nuse std::collections::hash_map::Entry::{Occupied, Vacant};\nuse std::error::Error;\nuse std::fs::{create_dir_all, File};\nuse std::io::BufWriter;\nuse std::path::Path;\n\nfn build_model_for(control_branch: &str) -> DrivingModel {\n let all_samples = sample::load_all_samples(&format!(\"./data/samples/flat_ground/{}/\", control_branch));\n let mut model = DrivingModel::default();\n index_all_samples(&mut model.tick2, &all_samples, 2);\n index_all_samples(&mut model.tick16, &all_samples, 16);\n \n model\n}\n\nfn write_model(path: &Path, model: DrivingModel) -> Result<(), Box<dyn Error>> {\n let f = BufWriter::new(File::create(path)?);\n let mut e = GzEncoder::new(f, Compression::default());\n Ok(serialize_into(&mut e, &model)?)\n}\n\nfn index_all_samples(indexed: &mut TransformationMap, all_samples: &[Vec<PlayerState>], num_ticks: usize) {\n for sample in all_samples {\n if sample.len() < sample::MIN_SAMPLE_LENGTH {\n println!(\"bad sample: {:?}\", sample[0]);\n }\n\n let mut j = 0;\n\n let ratio = FPS as usize / sample::RECORD_FPS; \n while sample[j..].len() > num_ticks / ratio {\n let key = sample::normalized_player_rounded(&sample[j]);\n\n match indexed.entry(key) {\n Vacant(e) => {\n e.insert(PlayerTransformation::from_samples(&sample[j..], num_ticks));\n }\n Occupied(mut e) => {\n \n \n let should_replace = {\n let existing_transformation = e.get();\n\n let existing_delta_x = (existing_transformation.start_local_vx as f32\n - sample::GROUND_SPEED_GRID_FACTOR * e.key().local_vx as f32)\n .abs();\n "},"suffix":{"kind":"string","value":"\n let existing_delta = (existing_delta_x.powf(2.0) + existing_delta_y.powf(2.0)).sqrt();\n\n let new_lv = sample[j].local_velocity();\n let new_delta_x = (new_lv.x - sample::GROUND_SPEED_GRID_FACTOR * e.key().local_vx as f32).abs();\n let new_delta_y = (new_lv.y - sample::GROUND_SPEED_GRID_FACTOR * e.key().local_vy as f32).abs();\n let new_delta = (new_delta_x.powf(2.0) + new_delta_y.powf(2.0)).sqrt();\n\n new_delta < existing_delta\n };\n\n if should_replace {\n e.insert(PlayerTransformation::from_samples(&sample[j..], num_ticks));\n }\n }\n };\n j += 1;\n }\n }\n}\n\nfn main() -> Result<(), Box<dyn Error>> {\n let control_branches = [\n \"throttle_straight\",\n \"throttle_right\",\n \"throttle_left\",\n \n \n \n \"boost_straight\",\n \"boost_right\",\n \"boost_left\",\n \n \n \n\n \n \n \n \n \n \n\n \n \n \n \n \n \n ];\n\n let base_path = Path::new(\"./models/flat_ground\");\n create_dir_all(&base_path)?;\n for control_branch in control_branches.iter() {\n let model = build_model_for(control_branch);\n let filename = format!(\"{}.bincode.gz\", control_branch);\n write_model(&base_path.join(filename), model)?;\n }\n\n Ok(())\n}\n"},"middle":{"kind":"string","value":"let existing_delta_y = (existing_transformation.start_local_vy as f32\n - sample::GROUND_SPEED_GRID_FACTOR * e.key().local_vy as f32)\n .abs();"},"strategy":{"kind":"string","value":"assignment_statement"},"context_items":{"kind":"list like","value":[{"content":"fn percentile_value(numbers: &mut Vec<f32>, percentile: f32) -> f32 {\n\n numbers.sort_by(|a, b| a.partial_cmp(b).unwrap_or(Ordering::Less));\n\n let i = (percentile * numbers.len() as f32) as usize / 100;\n\n numbers[i]\n\n}\n\n\n","file_path":"predict/tests/compare_with_sample_files.rs","rank":0,"score":211561.96753803157},{"content":"fn write_data(path: &str, plan: Plan) -> Result<(), Box<dyn Error>> {\n\n let serializable_plan = SerializablePlan(plan);\n\n create_dir_all(&path)?;\n\n let file_path = Path::new(path).join(\"plan.bincode\");\n\n let f = BufWriter::new(File::create(file_path)?);\n\n let mut e = GzEncoder::new(f, Compression::default());\n\n Ok(serialize_into(&mut e, &serializable_plan)?)\n\n}\n\n\n","file_path":"generate-data/src/main.rs","rank":1,"score":198817.00637231107},{"content":"pub fn load_sample_file(path: &PathBuf) -> Vec<PlayerState> {\n\n let mut rdr = csv::ReaderBuilder::new()\n\n .has_headers(false)\n\n .from_reader(fs::File::open(path).unwrap_or_else(|_| panic!(\"File doesn't exist: {}\", path.to_string_lossy())));\n\n let data: Vec<PlayerState> = rdr\n\n .records()\n\n .map(|record| {\n\n let record = record.expect(\"CSV parse failed?\");\n\n let _frame: f32 = record\n\n .get(0)\n\n .expect(\"Invalid row?\")\n\n .parse()\n\n .expect(\"Can't convert time to f32\");\n\n PlayerState {\n\n position: Vector3::new(\n\n record.get(1).expect(\"Invalid row?\").parse().expect(\"Can't convert x to f32\"),\n\n record.get(2).expect(\"Invalid row?\").parse().expect(\"Can't convert y to f32\"),\n\n record.get(3).expect(\"Invalid row?\").parse().expect(\"Can't convert z to f32\"),\n\n ),\n\n velocity: Vector3::new(\n","file_path":"predict/src/sample.rs","rank":2,"score":190793.92016337195},{"content":"fn rms(numbers: &[f32]) -> f32 {\n\n let total_error_squared: f32 = numbers.iter().map(|x| x * x).sum();\n\n (total_error_squared / (numbers.len() as f32)).sqrt()\n\n}\n\n\n","file_path":"predict/tests/compare_with_sample_files.rs","rank":3,"score":187791.54601372126},{"content":"#[allow(dead_code)]\n\nfn restore_snapshot(rlbot: &rlbot::RLBot, bot: &mut BotState, frame: &mut u32, name: &str) -> Result<(), Box<dyn Error>> {\n\n let dir = \"data/snapshots\";\n\n let path = Path::new(dir).join(name.to_owned() + \".bincode.gz\");\n\n let f = BufReader::new(File::open(path)?);\n\n let mut decoder = GzDecoder::new(f);\n\n let (historical_game, historical_bot): (GameState, BotState) = bincode::deserialize_from(&mut decoder)?;\n\n\n\n // replace our bot data with the historical bot\n\n *bot = historical_bot;\n\n\n\n // update RL game state with historical game state\n\n *frame = historical_game.frame;\n\n let player = historical_game.player;\n\n let ball = historical_game.ball;\n\n let car_state = get_desired_car_state(&player);\n\n let ball_state = get_desired_ball_state(&ball);\n\n let desired_game_state = rlbot::DesiredGameState::new().car_state(0, car_state).ball_state(ball_state);\n\n Ok(rlbot.set_game_state(&desired_game_state)?)\n\n}\n\n\n","file_path":"brick/src/main.rs","rank":4,"score":187116.28041781217},{"content":"#[allow(non_snake_case)]\n\npub fn calculate_hit(ball: &BallState, player: &PlayerState, collision: &Vector3<f32>) -> Result<BallState, Box<dyn Error>> {\n\n let n1 = (collision - ball.position).normalize();\n\n\n\n let L_b = (collision - ball.position).cross_matrix();\n\n let L_c = (collision - player.position).cross_matrix();\n\n\n\n let player_rotation = player.rotation.to_rotation_matrix();\n\n let invI_c = player_rotation * (*CAR_INVERSE_INERTIA * player_rotation.transpose());\n\n\n\n let invM = ((1.0 / BALL_MASS) + (1.0 / CAR_MASS)) * na::Matrix3::identity()\n\n - ((L_b * L_b) / BALL_INERTIA)\n\n - (L_c * (invI_c * L_c));\n\n let M = invM.try_inverse().ok_or(\"M matrix inversion failed\")?;\n\n\n\n let delta_v = (player.velocity - (L_c * player.angular_velocity)) - (ball.velocity - (L_b * ball.angular_velocity));\n\n\n\n // compute the impulse that is consistent with an inelastic collision\n\n let J1 = M * delta_v;\n\n\n\n let J1_perp = J1.dot(&n1).min(-1.0f32) * n1;\n","file_path":"predict/src/ball.rs","rank":5,"score":175373.2154631068},{"content":"fn shoot<H: HeuristicModel>(model: &mut H, game: &GameState, bot: &mut BotState) -> PlanResult {\n\n let desired_ball_position: Vector3<f32> = opponent_goal_shoot_at(&game);\n\n let last_plan = None;\n\n // FIXME check if last plan is still valid before using this\n\n // let last_plan\n\n // if bot.last_action.is_some() && bot.last_action.as_ref().unwrap() == &Action::Shoot {\n\n // bot.plan.as_ref()\n\n // } else {\n\n // None\n\n // };\n\n let result = hit_ball(model, game, bot, &desired_ball_position, last_plan);\n\n bot.last_action = Some(Action::Shoot);\n\n result\n\n}\n\n\n","file_path":"brain/src/play.rs","rank":6,"score":174329.64113795568},{"content":"fn files<'a>(dir: &'a str) -> impl Iterator<Item = PathBuf> + 'a {\n\n WalkDir::new(dir)\n\n .into_iter()\n\n .filter_entry(|e| !is_hidden(e))\n\n .filter_map(|entry| {\n\n let entry = entry.unwrap();\n\n if entry.file_type().is_file() {\n\n Some(entry.path().to_owned())\n\n } else {\n\n None\n\n }\n\n })\n\n}\n\n\n","file_path":"predict/src/sample.rs","rank":7,"score":174212.58094068783},{"content":"fn non_admissable_estimated_time<H: HeuristicModel>(model: &mut H, current: &PlayerState, ball: &BallState) -> f32 {\n\n // unreachable, we can't fly\n\n if ball.position.z - BALL_COLLISION_RADIUS > CAR_DIMENSIONS.z + CAR_OFFSET.z {\n\n return std::f32::MAX;\n\n }\n\n\n\n let mut single_heuristic_cost = [0.0];\n\n model\n\n .unscaled_heuristic(&[current.clone()], &mut single_heuristic_cost[0..1])\n\n .expect(\"Heuristic failed initial!\");\n\n unsafe { *single_heuristic_cost.get_unchecked(0) }\n\n}\n\n\n\n// TODO\n\n//fn shadow(game: &GameState) -> PlayerState {\n\n//}\n\n\n","file_path":"brain/src/play.rs","rank":8,"score":172663.29007675778},{"content":"#[allow(dead_code)]\n\nfn turn_plan(current: &PlayerState, angle: f32) -> Result<Plan, Box<dyn Error>> {\n\n let mut plan = vec![];\n\n let current_heading = current.rotation.to_rotation_matrix() * Vector3::new(-1.0, 0.0, 0.0);\n\n let desired_heading = Rotation3::from_euler_angles(0.0, 0.0, angle) * current_heading;\n\n let mut turn_controller = BrickControllerState::default();\n\n turn_controller.throttle = Throttle::Forward;\n\n turn_controller.steer = if angle < 0.0 { Steer::Right } else { Steer::Left };\n\n\n\n let mut straight_controller = BrickControllerState::default();\n\n straight_controller.throttle = Throttle::Forward;\n\n\n\n const TURN_DURATION: f32 = 16.0 * TICK;\n\n // straighten out for zero angular velocity at end, hopefully 16 ticks is enough?\n\n const STRAIGHT_DURATION: f32 = 16.0 * TICK;\n\n\n\n // iterate till dot product is maximized (ie we match the desired heading)\n\n let mut last_dot = std::f32::MIN;\n\n let mut player = current.clone();\n\n loop {\n\n let turn_player = predict::player::next_player_state(&player, &turn_controller, TURN_DURATION)?;\n","file_path":"brick/src/main.rs","rank":9,"score":170263.80498751812},{"content":"#[allow(dead_code)]\n\nfn forward_plan(current: &PlayerState, time: f32) -> Result<Plan, Box<dyn Error>> {\n\n let mut plan = vec![];\n\n\n\n let mut controller = BrickControllerState::default();\n\n controller.throttle = Throttle::Forward;\n\n\n\n let mut player = current.clone();\n\n let mut time_so_far = 0.0;\n\n while time_so_far < time {\n\n let step_duration = 16.0 * TICK;\n\n player = predict::player::next_player_state(&player, &controller, step_duration)?;\n\n plan.push((player.clone(), controller.clone(), step_duration));\n\n time_so_far += step_duration;\n\n }\n\n\n\n Ok(plan)\n\n}\n\n\n","file_path":"brick/src/main.rs","rank":10,"score":170263.80498751812},{"content":"/// main entrypoint for bot to figure out what to do given the current state\n\n// TODO we need to also include our current (ie previously used) strategy state as an input here,\n\n// and logic for expiring it if it's no longer applicable.\n\npub fn play<H: HeuristicModel>(model: &mut H, game: &GameState, bot: &mut BotState) -> PlanResult {\n\n match what_do(game) {\n\n Action::Shoot => shoot(model, game, bot),\n\n }\n\n}\n\n\n","file_path":"brain/src/play.rs","rank":11,"score":169660.26353005215},{"content":"fn bot_test_plan<H: brain::HeuristicModel>(model: &mut H, game: &GameState, bot: &mut BotState) -> PlanResult {\n\n // canned plans\n\n //\n\n // // let player = &game.player.lag_compensated_player(&bot.controller_history, LAG_FRAMES);\n\n // let player = PlayerState::default();\n\n //\n\n // let mut plan_result = if let Ok(plan) = snek_plan(&player) {\n\n // //for (i, (_next_player, controller, cost)) in plan.iter().enumerate() {\n\n // // println!(\"i: {}, steer: {:?}, steps: {}\", i, controller.steer, (cost / TICK).round() as i32);\n\n // //}\n\n // PlanResult {\n\n // plan: Some(plan),\n\n // cost_diff: 0.0,\n\n // visualization_lines: vec![],\n\n // visualization_points: vec![],\n\n // }\n\n // } else {\n\n // PlanResult {\n\n // plan: None,\n\n // cost_diff: 0.0,\n","file_path":"brick/src/main.rs","rank":12,"score":164581.71772103396},{"content":"pub fn csv_files<'a>(dir: &'a str) -> impl Iterator<Item = PathBuf> + 'a {\n\n files(dir).filter(|path| path.extension() == Some(OsStr::new(\"csv\")))\n\n}\n\n\n","file_path":"predict/src/sample.rs","rank":13,"score":163306.19112659086},{"content":"fn pd_adjust(input: &mut rlbot::ControllerState, errors: &VecDeque<f32>) {\n\n // build up some errors before we do anything\n\n if errors.len() <= DIFFERENTIAL_STEPS {\n\n return;\n\n }\n\n let last_error = errors[errors.len() - 1];\n\n let error_slope = (last_error - errors[errors.len() - 1 - DIFFERENTIAL_STEPS]) / DIFFERENTIAL_STEPS as f32;\n\n //println!(\n\n // \"last_error: {:?}, error_slope: {:?}\",\n\n // last_error, error_slope\n\n //); // TODO normalize slope to speed!\n\n let proportional_signal = PROPORTIONAL_DIST_GAIN * last_error;\n\n let differential_signal = DIFFERENTIAL_GAIN * error_slope;\n\n let signal = proportional_signal + differential_signal;\n\n //println!(\n\n // \"signal: {}, p: {}, d: {}\",\n\n // signal, proportional_signal, differential_signal\n\n //);\n\n input.steer += signal;\n\n\n","file_path":"brain/src/play.rs","rank":14,"score":160683.25878978104},{"content":"pub fn load_all_samples(dir: &str) -> Vec<Vec<PlayerState>> {\n\n csv_files(dir).map(|f| load_sample_file(&f)).collect()\n\n}\n\n\n","file_path":"predict/src/sample.rs","rank":15,"score":159547.10458973018},{"content":"fn main() -> Result<(), Box<dyn Error>> {\n\n let args = Docopt::new(USAGE).and_then(|dopt| dopt.parse()).unwrap_or_else(|e| e.exit());\n\n\n\n let test_bot = args.get_bool(\"--bot-test\");\n\n if args.get_bool(\"--bot\") || test_bot {\n\n thread::spawn(move || loop {\n\n let t = thread::spawn(move || {\n\n if test_bot {\n\n panic::catch_unwind(run_bot_test).expect(\"Panic catch unwind failed\");\n\n } else {\n\n panic::catch_unwind(run_bot).expect(\"Panic catch unwind failed\");\n\n }\n\n });\n\n t.join()\n\n .expect_err(\"The bot thread should only end if panic, but it didn't panic.\");\n\n println!(\"XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX\");\n\n println!(\"XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX\");\n\n println!(\"XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX\");\n\n println!(\"XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX\");\n\n println!(\"XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX\");\n","file_path":"brick/src/main.rs","rank":16,"score":143380.21652448294},{"content":"fn main() -> Result<(), Box<dyn Error>> {\n\n let rlbot = rlbot::init()?;\n\n\n\n let _batmobile = rlbot::PlayerLoadout::new().car_id(803);\n\n let fennec = rlbot::PlayerLoadout::new().car_id(4284);\n\n let mut settings = rlbot::MatchSettings::new().player_configurations(vec![rlbot::PlayerConfiguration::new(\n\n rlbot::PlayerClass::RLBotPlayer,\n\n \"Recorder\",\n\n 0,\n\n )\n\n .loadout(fennec)]);\n\n\n\n settings.mutator_settings = rlbot::MutatorSettings::new()\n\n .match_length(rlbot::MatchLength::Unlimited)\n\n .boost_option(rlbot::BoostOption::Unlimited_Boost);\n\n\n\n rlbot.start_match(&settings)?;\n\n rlbot.wait_for_match_start()?;\n\n\n\n // set initial state\n","file_path":"record/src/main.rs","rank":17,"score":143380.21652448288},{"content":"#[allow(dead_code)]\n\nfn record_snapshot(game: &GameState, bot: &BotState) -> Result<(), Box<dyn Error>> {\n\n let dir = \"data/snapshots\";\n\n create_dir_all(dir)?;\n\n\n\n let file_path = SNAPSHOT_NUMBER.with(|num| {\n\n let mut path;\n\n loop {\n\n path = Path::new(dir).join(format!(\"snapshot{}.bincode.gz\", *num.borrow()));\n\n if !path.exists() {\n\n break;\n\n }\n\n (*num.borrow_mut()) += 1;\n\n }\n\n path\n\n });\n\n let f = BufWriter::new(File::create(file_path)?);\n\n let mut e = GzEncoder::new(f, Compression::default());\n\n Ok(bincode::serialize_into(&mut e, &(game, bot))?)\n\n}\n\n\n","file_path":"brick/src/main.rs","rank":18,"score":143040.5615297909},{"content":"#[allow(dead_code)]\n\nfn square_plan(player: &PlayerState) -> Result<Plan, Box<dyn Error>> {\n\n let mut plan = vec![];\n\n plan.push((player.clone(), BrickControllerState::default(), 0.0));\n\n for _ in 0..4 {\n\n let mut plan_part = forward_plan(&plan[plan.len() - 1].0, 1000.0)?;\n\n plan.append(&mut plan_part);\n\n let mut plan_part = turn_plan(&plan[plan.len() - 1].0, -PI / 2.0)?;\n\n plan.append(&mut plan_part);\n\n }\n\n\n\n Ok(plan)\n\n}\n\n\n","file_path":"brick/src/main.rs","rank":19,"score":141725.95846020436},{"content":"#[allow(dead_code)]\n\nfn snek_plan(player: &PlayerState) -> Result<Plan, Box<dyn Error>> {\n\n let mut plan = vec![];\n\n plan.push((player.clone(), BrickControllerState::default(), 0.0));\n\n\n\n let mut plan_part = forward_plan(&plan[plan.len() - 1].0, 500.0)?;\n\n plan.append(&mut plan_part);\n\n for _ in 0..2 {\n\n let mut plan_part = turn_plan(&plan[plan.len() - 1].0, PI / 6.0)?;\n\n plan.append(&mut plan_part);\n\n let mut plan_part = turn_plan(&plan[plan.len() - 1].0, -PI / 6.0)?;\n\n plan.append(&mut plan_part);\n\n }\n\n\n\n Ok(plan)\n\n}\n\n\n","file_path":"brick/src/main.rs","rank":20,"score":141725.95846020436},{"content":"#[allow(dead_code, clippy::same_item_push)]\n\nfn snek_plan2(current: &PlayerState) -> Result<Plan, Box<dyn Error>> {\n\n let mut plan = vec![];\n\n let mut player = current.clone();\n\n plan.push((player.clone(), BrickControllerState::default(), 0.0));\n\n\n\n let mut controller = BrickControllerState::default();\n\n controller.throttle = Throttle::Forward;\n\n for _ in 0..4 {\n\n player = predict::player::next_player_state(&player, &controller, 16.0 * TICK)?;\n\n plan.push((player.clone(), controller.clone(), 16.0 * TICK));\n\n }\n\n\n\n for _ in 0..2 {\n\n controller.steer = Steer::Left;\n\n for _ in 0..4 {\n\n player = predict::player::next_player_state(&player, &controller, 16.0 * TICK)?;\n\n plan.push((player.clone(), controller.clone(), 16.0 * TICK));\n\n }\n\n\n\n controller.steer = Steer::Right;\n\n for _ in 0..4 {\n\n player = predict::player::next_player_state(&player, &controller, 16.0 * TICK)?;\n\n plan.push((player.clone(), controller.clone(), 16.0 * TICK));\n\n }\n\n }\n\n\n\n Ok(plan)\n\n}\n\n\n","file_path":"brick/src/main.rs","rank":21,"score":141725.95846020436},{"content":"#[allow(dead_code)]\n\nfn snek_plan3(current: &PlayerState) -> Result<Plan, Box<dyn Error>> {\n\n let mut plan = vec![];\n\n let mut player = current.clone();\n\n plan.push((player.clone(), BrickControllerState::default(), 0.0));\n\n\n\n let mut controller = BrickControllerState::default();\n\n controller.throttle = Throttle::Forward;\n\n\n\n let get_steer = |y| -> Steer {\n\n if y < 400.0 {\n\n Steer::Straight\n\n } else if y < 800.0 {\n\n Steer::Left\n\n } else if y < 1200.0 {\n\n Steer::Right\n\n } else if y < 1600.0 {\n\n Steer::Left\n\n } else if y < 2000.0 {\n\n Steer::Right\n\n } else {\n","file_path":"brick/src/main.rs","rank":22,"score":141725.95846020436},{"content":"fn main() -> Result<(), Box<dyn Error>> {\n\n // fewer than normal threads, so some cores are left free for the computer user...\n\n rayon::ThreadPoolBuilder::new().num_threads(10).build_global().unwrap();\n\n\n\n let desired_ball_position: Vector3<f32> = brain::play::opponent_goal_shoot_at(&GameState::default());\n\n let ball = BallState::default();\n\n let desired_contact = brain::play::simple_desired_contact(&ball, &desired_ball_position);\n\n\n\n let config = SearchConfig {\n\n step_duration: 16.0 * TICK,\n\n slop: 40.0,\n\n max_cost: 10.0,\n\n max_iterations: 10_000_000, // allow more iterations before giving up\n\n scale_heuristic: 1.0,\n\n custom_filter: Some(|_| true), // ignore bounds\n\n };\n\n\n\n let max_speed_r = (MAX_BOOST_SPEED / SPEED_FACTOR).round() as i32;\n\n // TODO negative vy\n\n //(-max_speed_r..=max_speed_r).into_par_iter().for_each(|speed_r| {\n","file_path":"generate-data/src/main.rs","rank":23,"score":140338.8565583713},{"content":"#[allow(dead_code)]\n\nfn offset_forward_plan(current: &PlayerState) -> Result<Plan, Box<dyn Error>> {\n\n let mut offset_player = current.clone();\n\n let heading = offset_player.rotation.to_rotation_matrix() * Vector3::new(-1.0, 0.0, 0.0);\n\n let clockwise_90_rotation = Rotation3::from_euler_angles(0.0, 0.0, -PI / 2.0);\n\n let right = clockwise_90_rotation * heading;\n\n offset_player.position += 200.0 * right;\n\n\n\n forward_plan(&offset_player, 4000.0)\n\n}\n\n\n","file_path":"brick/src/main.rs","rank":24,"score":138902.14923979476},{"content":"fn update_bot_state(game: &GameState, bot: &mut BotState, plan_result: &PlanResult) {\n\n if let Some(ref new_plan) = plan_result.plan {\n\n if let Some(ref existing_plan) = bot.plan {\n\n let new_plan_cost = new_plan.iter().map(|(_, _, cost)| cost).sum::<f32>();\n\n\n\n let closest_index = brain::play::closest_plan_index(&game.player, &existing_plan);\n\n let existing_plan_cost = existing_plan\n\n .iter()\n\n .enumerate()\n\n .filter(|(index, _val)| *index > closest_index)\n\n .map(|(_index, (_, _, cost))| cost)\n\n .sum::<f32>();\n\n\n\n // bail, we got a worse plan!\n\n if new_plan_cost >= existing_plan_cost && plan_is_valid(&game, &existing_plan) {\n\n //println!(\"bailing longer plan! existing_plan_cost: {}, new_plan_cost: {}\", existing_plan_cost, new_plan_cost);\n\n return;\n\n }\n\n\n\n //let existing_diff = bot.cost_diff.abs();\n","file_path":"brick/src/main.rs","rank":25,"score":136144.51328504024},{"content":"fn interpolate_scalar(start: f32, end: f32, factor: f32) -> f32 {\n\n (1.0 - factor) * start + factor * end\n\n}\n\n\n","file_path":"predict/src/player.rs","rank":26,"score":135997.99627517667},{"content":"// source: https://github.com/samuelpmish/RLUtilities/blob/master/src/simulation/ball.cc#L90\n\nfn psyonix_scale_impulse(val: f32) -> f32 {\n\n if val <= 500.0 {\n\n 0.65\n\n } else if val <= 2300.0 {\n\n 0.65 - 0.1 * (val - 500.0) / (2300.0 - 500.0)\n\n } else {\n\n 0.55 - 0.25 * (val - 2300.0) / (4600.0 - 2300.0)\n\n }\n\n}\n\n\n\n/// calculates ball state after collision with player. caller of this function must ensure there\n\n/// actually *is* a collision between the ball and player, otherwise the result of this is\n\n/// unpredictable\n","file_path":"predict/src/ball.rs","rank":27,"score":135555.98017042995},{"content":"// source: https://www.youtube.com/watch?v=9uh8-nBlufM\n\nfn next_ball_state_rolling(ball: &BallState, time_step: f32) -> BallState {\n\n let mut next = ball.clone();\n\n\n\n let acceleration;\n\n if ball.velocity.norm() > SLIDING_SPEED {\n\n let heading = ball.velocity / ball.velocity.norm();\n\n acceleration = -SLIDING_DECELERATION * heading - AIR_RESISTANCE * next.velocity;\n\n } else {\n\n acceleration = -ROLLING_RESISTANCE * next.velocity\n\n }\n\n\n\n next.position += time_step * next.velocity;\n\n next.velocity += time_step * acceleration;\n\n\n\n // hard-coding certain values\n\n next.velocity.z = 0.0;\n\n next.position.z = BALL_COLLISION_RADIUS;\n\n\n\n next\n\n}\n\n\n","file_path":"predict/src/ball.rs","rank":28,"score":133684.07069944148},{"content":"fn next_ball_state_soaring(ball: &BallState, time_step: f32) -> BallState {\n\n let mut next;\n\n\n\n if let Some(normal) = arena_contact_normal(&ball) {\n\n if na::Matrix::dot(&ball.velocity, &normal) < 0.0 {\n\n // we're going towards the arena contact, so let's bounce\n\n next = calculate_bounce(&ball, &normal);\n\n } else {\n\n // already bounced\n\n next = ball.clone();\n\n }\n\n } else {\n\n next = ball.clone();\n\n }\n\n\n\n // FIXME rl utils uses prev velocity instead of next velocity, we should too?\n\n let acceleration = Vector3::new(0.0, 0.0, -GRAVITY) - AIR_RESISTANCE * next.velocity;\n\n\n\n if next.velocity.norm() > BALL_MAX_SPEED {\n\n next.velocity = next.velocity.normalize() * BALL_MAX_SPEED;\n","file_path":"predict/src/ball.rs","rank":29,"score":133684.07069944148},{"content":"fn draw_lines(rlbot: &rlbot::RLBot, lines: &[Line], chunk_num: &mut i32) -> Result<(), Box<dyn Error>> {\n\n for chunk in lines.chunks(200) {\n\n // TODO in case of multiple bricks, add player index * 1000 to the group id\n\n let mut group = rlbot.begin_render_group(VISUALIZATION_GROUP_ID + *chunk_num);\n\n\n\n for &l in chunk.iter() {\n\n let p1 = l.0;\n\n let p2 = l.1;\n\n let p3 = l.2;\n\n let color = group.color_rgb((255.0 * p3.x) as u8, (255.0 * p3.y) as u8, (255.0 * p3.z) as u8);\n\n group.draw_line_3d((-p1.x, p1.y, p1.z), (-p2.x, p2.y, p2.z), color);\n\n }\n\n\n\n group.render()?;\n\n\n\n *chunk_num += 1;\n\n }\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"brick/src/main.rs","rank":30,"score":133070.9461525139},{"content":"pub fn next_ball_state(ball: &BallState, time_step: f32) -> BallState {\n\n match find_prediction_category(&ball) {\n\n PredictionCategory::Soaring => next_ball_state_soaring(&ball, time_step),\n\n PredictionCategory::Rolling => next_ball_state_rolling(&ball, time_step),\n\n }\n\n}\n\n\n","file_path":"predict/src/ball.rs","rank":31,"score":131631.0769737587},{"content":"// using the current player state as a starting point, apply the plan\n\n// FIXME unexplode plan first and calculate using those longer durations for more accurate\n\n// values, then explode again\n\n// TODO for even more accuracy:\n\n// - simulate following the plan while not exactly on it\n\n// - simulate turn error correction\n\nfn adjusted_plan(player: &PlayerState, plan: Plan) -> Result<Plan, Box<dyn Error>> {\n\n let mut adjusted = Vec::with_capacity(plan.len());\n\n adjusted.push((player.clone(), BrickControllerState::default(), 0.0));\n\n let mut last_player: PlayerState = player.clone();\n\n plan.iter().filter(|(_, _, cost)| *cost > 0.0).map(|(_, controller, cost): &(PlayerState, BrickControllerState, f32)| -> Result<(PlayerState, BrickControllerState, f32), Box<dyn Error>> {\n\n let next_player = predict::player::next_player_state(&last_player, &controller, *cost);\n\n if next_player.is_err() {\n\n // print to stderr now since we're swallowing these errors right after this\n\n eprintln!(\"Warning: failed to adjust plan: {}\", next_player.as_ref().unwrap_err());\n\n }\n\n last_player = next_player?;\n\n Ok((last_player.clone(), controller.clone(), *cost))\n\n }).filter_map(Result::ok).for_each(|plan_val| {\n\n adjusted.push(plan_val);\n\n });\n\n\n\n Ok(adjusted)\n\n}\n\n\n","file_path":"brick/src/main.rs","rank":32,"score":131146.91554685327},{"content":"fn stitch_with_current_plan(game: &GameState, bot: &BotState, plan_result: &mut PlanResult) {\n\n if let Some(last_plan) = adjusted_plan_or_fallback(&game, bot) {\n\n if let Some(plan) = &plan_result.plan {\n\n let closest_index_now = brain::play::closest_plan_index(&game.player, &last_plan);\n\n let closest_index_plan = brain::play::closest_plan_index(&plan[0].0, &last_plan);\n\n\n\n if closest_index_plan < closest_index_now {\n\n // we had NOT compensated enough for the logic lag\n\n eprintln!(\"Aborting plan stitching due to inadequate logic lag compensation\");\n\n return;\n\n }\n\n\n\n // we had compensated enough for the logic lag, now adjust the plan\n\n let mut stitched_plan = last_plan\n\n .iter()\n\n .cloned()\n\n .skip(closest_index_now)\n\n .take(closest_index_plan - closest_index_now)\n\n .collect::<Vec<_>>();\n\n stitched_plan.extend(plan.clone());\n","file_path":"brick/src/main.rs","rank":33,"score":130584.05703337654},{"content":"/// factor: number from 0.0 to 1.0 for interpolation between start and end, 0.0 being 100% at\n\n/// start, 1.0 being 100% at end. Note that this actually also handles factors outside the 0.0 to\n\n/// 1.0 range, in which case it's a linear extrapolation\n\nfn interpolate(start: Vector3<f32>, end: Vector3<f32>, factor: f32) -> Vector3<f32> {\n\n (1.0 - factor) * start + factor * end\n\n}\n\n\n","file_path":"predict/src/player.rs","rank":34,"score":127672.58337431183},{"content":"fn compare<'a>(controller: BrickControllerState, all_samples: impl Iterator<Item = &'a Vec<PlayerState>>) {\n\n let mut position_errors = vec![];\n\n let mut velocity_errors = vec![];\n\n let mut avz_errors = vec![];\n\n let mut max_position_error = 0.0;\n\n let mut max_velocity_error = 0.0;\n\n let mut max_avz_error = 0.0;\n\n\n\n for full_sample in all_samples {\n\n let mut i = 0;\n\n // offset by 32 frames to ensure minimum 32 frames of simulation ahead in the slice\n\n while full_sample[i..].len() > NUM_TICKS {\n\n let sample = &full_sample[i..];\n\n i += 1;\n\n\n\n let player_start = &sample[0];\n\n let player_end = &sample[NUM_TICKS];\n\n\n\n // we can miss data at the edges, or not be able to extrapolate at the edges. ignore for now\n\n // TODO remove all these checks\n","file_path":"predict/tests/compare_with_sample_files.rs","rank":35,"score":127625.76234056253},{"content":"pub fn ball_trajectory(ball: &BallState, duration: f32) -> Vec<BallState> {\n\n let mut t = 0.0;\n\n let mut trajectory = Vec::with_capacity((duration / TICK).ceil() as usize);\n\n let mut ball_now = ball.clone();\n\n trajectory.push(ball_now);\n\n while t < duration {\n\n t += TICK;\n\n ball_now = next_ball_state(trajectory.last().unwrap(), TICK);\n\n trajectory.push(ball_now);\n\n }\n\n trajectory\n\n}\n\n\n","file_path":"predict/src/ball.rs","rank":36,"score":126973.54273017513},{"content":"// FIXME lot more going in the rl utils now, probably helps handle more types of bounces:\n\n// https://github.com/samuelpmish/RLUtilities/blob/master/src/simulation/ball.cc#L36\n\nfn calculate_bounce(ball: &BallState, normal: &Unit<Vector3<f32>>) -> BallState {\n\n let mut bounced = (*ball).clone();\n\n\n\n let v_perp = na::Matrix::dot(&ball.velocity, &normal.into_inner()) * normal.into_inner();\n\n let v_para = ball.velocity - v_perp;\n\n let v_spin = BALL_COLLISION_RADIUS * normal.cross(&ball.angular_velocity); // velocity of edge of ball, relative to ball center\n\n let s = v_para + v_spin; // this is the velocity at point of impact (edge of ball) in global coords\n\n\n\n let ratio = v_perp.norm() / s.norm();\n\n\n\n let delta_v_perp = -(1.0 + RESTITUTION) * v_perp;\n\n let delta_v_para = -f32::min(1.0, Y * ratio) * MU * s;\n\n\n\n bounced.velocity += delta_v_perp + delta_v_para;\n\n bounced.angular_velocity += A * BALL_COLLISION_RADIUS * delta_v_para.cross(&normal);\n\n\n\n bounced\n\n}\n\n\n","file_path":"predict/src/ball.rs","rank":37,"score":126973.54273017513},{"content":"#[test]\n\nfn test_throttle_straight() {\n\n let mut controller = BrickControllerState::default();\n\n controller.throttle = Throttle::Forward;\n\n let all_samples = predict::sample::THROTTLE_STRAIGHT_ALL.iter();\n\n compare(controller, all_samples);\n\n}\n\n\n","file_path":"predict/tests/compare_with_sample_files.rs","rank":38,"score":126776.07604328476},{"content":"#[test]\n\nfn test_boost_left() {\n\n let mut controller = BrickControllerState::default();\n\n controller.steer = Steer::Left;\n\n controller.boost = true;\n\n let all_samples = predict::sample::BOOST_LEFT_ALL.iter();\n\n compare(controller, all_samples);\n\n}\n\n\n","file_path":"predict/tests/compare_with_sample_files.rs","rank":39,"score":126776.07604328476},{"content":"#[test]\n\nfn test_throttle_right() {\n\n let mut controller = BrickControllerState::default();\n\n controller.steer = Steer::Right;\n\n controller.throttle = Throttle::Forward;\n\n let all_samples = predict::sample::THROTTLE_RIGHT_ALL.iter();\n\n compare(controller, all_samples);\n\n}\n\n\n","file_path":"predict/tests/compare_with_sample_files.rs","rank":40,"score":126776.07604328476},{"content":"#[test]\n\nfn test_boost_straight() {\n\n let mut controller = BrickControllerState::default();\n\n controller.boost = true;\n\n let all_samples = predict::sample::BOOST_STRAIGHT_ALL.iter();\n\n compare(controller, all_samples);\n\n}\n\n\n","file_path":"predict/tests/compare_with_sample_files.rs","rank":41,"score":126776.07604328476},{"content":"#[test]\n\nfn test_boost_right() {\n\n let mut controller = BrickControllerState::default();\n\n controller.steer = Steer::Right;\n\n controller.boost = true;\n\n let all_samples = predict::sample::BOOST_RIGHT_ALL.iter();\n\n compare(controller, all_samples);\n\n}\n","file_path":"predict/tests/compare_with_sample_files.rs","rank":42,"score":126776.07604328476},{"content":"#[test]\n\nfn test_throttle_left() {\n\n let mut controller = BrickControllerState::default();\n\n controller.steer = Steer::Left;\n\n controller.throttle = Throttle::Forward;\n\n let all_samples = predict::sample::THROTTLE_LEFT_ALL.iter();\n\n compare(controller, all_samples);\n\n}\n\n\n","file_path":"predict/tests/compare_with_sample_files.rs","rank":43,"score":126776.07604328476},{"content":"// rip-off of: https://github.com/samuelpmish/RLUtilities/blob/master/src/simulation/ball.cc#L82\n\npub fn closest_point_for_collision(ball: &BallState, player: &PlayerState) -> Vector3<f32> {\n\n let mut local_pos = player.rotation.to_rotation_matrix().inverse() * (ball.position - player.hitbox_center());\n\n local_pos.x = na::clamp(local_pos.x, -CAR_DIMENSIONS.x / 2.0, CAR_DIMENSIONS.x / 2.0);\n\n local_pos.y = na::clamp(local_pos.y, -CAR_DIMENSIONS.y / 2.0, CAR_DIMENSIONS.y / 2.0);\n\n local_pos.z = na::clamp(local_pos.z, -CAR_DIMENSIONS.z / 2.0, CAR_DIMENSIONS.z / 2.0);\n\n player.hitbox_center() + player.rotation.to_rotation_matrix() * local_pos\n\n}\n\n\n","file_path":"predict/src/player.rs","rank":44,"score":124306.60083388686},{"content":"fn round_player_state(player: &PlayerState, step_duration: f32, speed: f32) -> RoundedPlayerState {\n\n // we're using the rounded speed to determine the grid size. we want a good bit of tolerance for\n\n // this, if we relax the rounded velocity equality check. or some other logic that will ensure\n\n // same grid for different player states that we want to match\n\n let rounding_factor = 1.0; // TODO tune. for both correctness AND speed!\n\n let mut rounded_speed = (speed / rounding_factor).round();\n\n if rounded_speed == 0.0 {\n\n rounded_speed = 0.5;\n\n }\n\n let rounded_speed = rounded_speed * rounding_factor;\n\n\n\n let grid_size = step_duration * rounded_speed;\n\n //let velocity_margin = 250.0; // TODO tune\n\n let (_roll, _pitch, yaw) = player.rotation.euler_angles();\n\n\n\n RoundedPlayerState {\n\n // TODO we could have individual grid sizes for x/y/z based on vx/vy/vz. not sure it's\n\n // worth it.\n\n x: (grid_size * (player.position.x / grid_size).round()) as i16,\n\n y: (grid_size * (player.position.y / grid_size).round()) as i16,\n","file_path":"brain/src/plan.rs","rank":45,"score":123786.24154692181},{"content":"pub fn index_all_samples<'a>(all_samples: &'a [Vec<PlayerState>]) -> SampleMap<'a> {\n\n let mut indexed = SampleMap::default();\n\n\n\n for sample in all_samples {\n\n if sample.len() < MIN_SAMPLE_LENGTH {\n\n println!(\"bad sample: {:?}\", sample[0]);\n\n }\n\n\n\n let mut j = 0;\n\n\n\n while sample[j..].len() >= MIN_SAMPLE_LENGTH {\n\n let key = normalized_player_rounded(&sample[j]);\n\n\n\n match indexed.entry(key) {\n\n Vacant(e) => {\n\n e.insert(&sample[j..]);\n\n }\n\n Occupied(mut e) => {\n\n // replace the sample in case we have one closer to the intended normalized\n\n // velocity value\n","file_path":"predict/src/sample.rs","rank":46,"score":121820.00587066825},{"content":"fn move_ball_out_of_the_way(rlbot: &rlbot::RLBot) -> Result<(), Box<dyn Error>> {\n\n let position = rlbot::Vector3Partial::new().x(3800.0).y(4800.0).z(98.0);\n\n\n\n let physics = rlbot::DesiredPhysics::new().location(position);\n\n\n\n let ball_state = rlbot::DesiredBallState::new().physics(physics);\n\n\n\n let desired_game_state = rlbot::DesiredGameState::new().ball_state(ball_state);\n\n\n\n rlbot.set_game_state(&desired_game_state)?;\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"record/src/main.rs","rank":47,"score":117982.18694526449},{"content":"#[allow(dead_code)]\n\nfn move_ball_out_of_the_way(rlbot: &rlbot::RLBot) -> Result<(), Box<dyn Error>> {\n\n let position = rlbot::Vector3Partial::new().x(3800.0).y(4800.0).z(98.0);\n\n let physics = rlbot::DesiredPhysics::new().location(position);\n\n let ball_state = rlbot::DesiredBallState::new().physics(physics);\n\n let desired_game_state = rlbot::DesiredGameState::new().ball_state(ball_state);\n\n rlbot.set_game_state(&desired_game_state)?;\n\n Ok(())\n\n}\n\n\n","file_path":"brick/src/main.rs","rank":48,"score":117982.18694526449},{"content":"/// returns normal at contact point if ball is currently colliding with the arena\n\npub fn arena_contact_normal(ball: &BallState) -> Option<Unit<Vector3<f32>>> {\n\n let sphere = ncollide::shape::Ball::new(BALL_COLLISION_RADIUS);\n\n let ball_pos = Isometry3::new(ball.position, na::zero()); // TODO if we want to handle cube ball, track and pass on the rotation\n\n let arena_pos = Isometry3::new(na::zero(), na::zero());\n\n\n\n let margin = 0.0;\n\n let contact = ncollide::query::contact(&arena_pos, &(*ARENA), &ball_pos, &sphere, margin);\n\n\n\n contact.map(|c| c.normal)\n\n}\n\n\n","file_path":"predict/src/ball.rs","rank":49,"score":117457.24844638104},{"content":"fn squared_distance(a: f32, b: f32) -> f32 {\n\n (b - a).powf(2.0)\n\n}\n\n\n\npub(crate) fn knn_distance(a: &[f32], b: &[f32]) -> f32 {\n\n squared_distance(a[0], b[0]) // x\n\n + squared_distance(a[1], b[1]) // y\n\n // FIXME we don't set these in generate-data // + SCALE_VELOCITY_DISTANCE * squared_distance(a[2], b[2]) // vx\n\n + SCALE_VELOCITY_DISTANCE * squared_distance(a[3], b[3]) // vy\n\n + scaled_circular_distance(a[4], b[4]).powf(2.0) // yaw\n\n}\n\n\n\nimpl KnnHeuristic {\n\n pub fn try_new(path: &str) -> Result<Self, Box<dyn Error>> {\n\n let mut tree = KdTree::new(KNN_DIMENSIONS);\n\n\n\n let mut rdr = csv::ReaderBuilder::new().has_headers(false).from_reader(File::open(path)?);\n\n\n\n for record in rdr.records() {\n\n let record = record?;\n","file_path":"heuristic/src/knn.rs","rank":50,"score":117071.44103866865},{"content":"// +PI and -PI are the same angle, so the distance needs to take that into account!\n\nfn scaled_circular_distance(a: f32, b: f32) -> f32 {\n\n SCALE_CIRCULAR_DISTANCE * (a - b).abs().min(2.0 * PI + a - b).min(2.0 * PI + b - a)\n\n}\n\n\n","file_path":"heuristic/src/knn.rs","rank":51,"score":115256.24647769672},{"content":"// scale to [0, 1]\n\nfn scale(val: f32, min: f32, max: f32) -> f32 {\n\n (val - min) / (max - min)\n\n}\n\n\n","file_path":"heuristic/src/neural.rs","rank":52,"score":114744.14763777424},{"content":"/// updates our game state, which is a representation of the packet/ticket, but with our own data\n\n/// types etc\n\npub fn update_game_state(game_state: &mut GameState, tick: &rlbot::GameTickPacket, player_index: usize, frame: u32) {\n\n let ball = tick.ball.as_ref().expect(\"Missing ball\");\n\n let players = &tick.players;\n\n let player = players.get(player_index).expect(\"Missing player\");\n\n\n\n let bp = &ball.physics;\n\n let bl = &bp.location;\n\n let bv = &bp.velocity;\n\n let bav = &bp.angular_velocity;\n\n game_state.ball.position = Vector3::new(-bl.x, bl.y, bl.z); // x should be positive towards right, it only makes sense\n\n game_state.ball.velocity = Vector3::new(-bv.x, bv.y, bv.z); // x should be positive towards right, it only makes sense\n\n game_state.ball.angular_velocity = Vector3::new(-bav.x, bav.y, bav.z); // x should be positive towards right, it only makes sense\n\n\n\n let pp = &player.physics;\n\n let pl = &pp.location;\n\n let pv = &pp.velocity;\n\n let pav = &pp.angular_velocity;\n\n let pr = &pp.rotation;\n\n game_state.player.position = Vector3::new(-pl.x, pl.y, pl.z); // x should be positive towards right, it only makes sense\n\n game_state.player.velocity = Vector3::new(-pv.x, pv.y, pv.z); // x should be positive towards right, it only makes sense\n","file_path":"state/src/lib.rs","rank":53,"score":114361.92730102448},{"content":"pub fn normalized_player_rounded(player: &PlayerState) -> NormalizedPlayerState {\n\n let lv = player.local_velocity();\n\n NormalizedPlayerState {\n\n local_vx: (lv.x / GROUND_SPEED_GRID_FACTOR).round() as i16,\n\n local_vy: (lv.y / GROUND_SPEED_GRID_FACTOR).round() as i16,\n\n avz: (player.angular_velocity.z / GROUND_AVZ_GRID_FACTOR).round() as i16,\n\n }\n\n}\n\n\n","file_path":"predict/src/sample.rs","rank":54,"score":112433.1908980073},{"content":"// NOTE min/max values must match those used when scaling training data!\n\nfn scale_pos(val: f32) -> f32 {\n\n scale(val, -10_000.0, 10_000.0)\n\n}\n","file_path":"heuristic/src/neural.rs","rank":55,"score":112205.81032495532},{"content":"fn scale_avel(val: f32) -> f32 {\n\n scale(val, -6.0, 6.0)\n\n}\n","file_path":"heuristic/src/neural.rs","rank":56,"score":112198.88311425704},{"content":"fn scale_rot(val: f32) -> f32 {\n\n scale(val, -3.2, 3.2)\n\n}\n\n\n\nimpl HeuristicModel for NeuralHeuristic {\n\n fn unscaled_heuristic(&mut self, players: &[PlayerState], costs: &mut [f32]) -> Result<(), Box<dyn Error>> {\n\n let mut players_tensor = Tensor::new(&[players.len() as u64, 12u64]);\n\n for (i, player) in players.iter().enumerate() {\n\n let offset = i * 12;\n\n // FIXME use normalization rotation\n\n let pos = player.position; //self.normalization_rotation * (player.position - self.ball_position);\n\n players_tensor[offset + 0] = scale_pos(pos.x);\n\n players_tensor[offset + 1] = scale_pos(pos.y);\n\n players_tensor[offset + 2] = scale_pos(pos.z);\n\n\n\n // FIXME use normalization rotation\n\n let vel = player.velocity; //self.normalization_rotation * player.velocity;\n\n players_tensor[offset + 3] = scale_vel(vel.x);\n\n players_tensor[offset + 4] = scale_vel(vel.y);\n\n players_tensor[offset + 5] = scale_vel(vel.z);\n","file_path":"heuristic/src/neural.rs","rank":57,"score":112198.88311425704},{"content":"fn scale_vel(val: f32) -> f32 {\n\n scale(val, -2300.0, 2300.0)\n\n}\n","file_path":"heuristic/src/neural.rs","rank":58,"score":112198.88311425704},{"content":"/// modifies the plan to use finer-grained steps\n\npub fn explode_plan(plan: &Option<Plan>) -> Result<Option<Plan>, Box<dyn Error>> {\n\n if let Some(ref plan) = plan {\n\n if plan.get(0).is_none() {\n\n return Ok(None);\n\n }\n\n let mut exploded_plan = Vec::with_capacity(plan.len()); // will be at least this long\n\n exploded_plan.push(plan[0].clone());\n\n\n\n // for every plan segment, we expand within that segment. using small ticks repeated causes\n\n // the errors to accumulate rapidly, so we start over with each plan segment starting with\n\n // a more accurate base value\n\n for i in 1..plan.len() {\n\n let num_ticks = (plan[i].2 / TICK).round() as i32;\n\n let num_steps = num_ticks / TICKS_PER_STEP;\n\n #[allow(clippy::modulo_one)]\n\n let remaining_ticks = num_ticks % TICKS_PER_STEP;\n\n\n\n // NOTE since the controller value in each plan tuple is the controller that needs to\n\n // be applied to the *previous* player state in order to reach the player state in the\n\n // current tuple, we get the player from the period index and apply the controller from\n","file_path":"brain/src/plan.rs","rank":59,"score":108663.535782413},{"content":"/// tuple of (translation, acceleration, angular_acceleration, rotation)\n\ntype PlayerPrediction = (Vector3<f32>, Vector3<f32>, Vector3<f32>, Rotation3<f32>);\n\n\n","file_path":"predict/src/player.rs","rank":60,"score":108462.61216926313},{"content":"pub fn next_input(player: &PlayerState, bot: &mut BotState) -> rlbot::ControllerState {\n\n if let Some(ref plan) = bot.plan {\n\n // we need to take into account the inputs previously sent that will be processed\n\n // prior to finding where we are. instead of passing the current player, apply\n\n // LAG_FRAMES inputs that are not yet applied\n\n let player = player.lag_compensated_player(&bot.controller_history, LAG_FRAMES);\n\n let index = closest_plan_index(&player, &plan);\n\n\n\n // we need to look one past closest index to see the controller to reach next position\n\n if index < plan.len() - 1 {\n\n let current_heading = player.rotation.to_rotation_matrix() * Vector3::new(-1.0, 0.0, 0.0);\n\n let (closest_player, _, _) = &plan[index];\n\n let (_next_player, controller, _) = &plan[index + 1];\n\n //println!(\"index: {}, controller.steer: {:?}\", index, controller.steer);\n\n\n\n // FIXME we should account for differences in the tick and interpolate between the two\n\n // closest indices to get the real closet delta/distance\n\n let closest_delta = player.position - closest_player.position;\n\n let closest_distance = closest_delta.norm();\n\n let clockwise_90_rotation = Rotation3::from_euler_angles(0.0, 0.0, PI / 2.0);\n","file_path":"brain/src/play.rs","rank":61,"score":106432.37558073991},{"content":"pub fn opponent_goal_shoot_at(game: &GameState) -> Vector3<f32> {\n\n // TODO calculate which part of the goal is hardest for the opponent to reach\n\n match game.player.team {\n\n // FIXME check if we have this right...\n\n Team::Blue => Vector3::new(0.0, BACK_WALL_DISTANCE, GOAL_Z / 2.0),\n\n Team::Orange => Vector3::new(0.0, -BACK_WALL_DISTANCE, GOAL_Z / 2.0),\n\n }\n\n}\n\n\n","file_path":"brain/src/play.rs","rank":62,"score":104433.25081872902},{"content":"fn ground_turn_matching_transformation(\n\n normalized: sample::NormalizedPlayerState,\n\n controller: &BrickControllerState,\n\n time_step: f32,\n\n xrange: i16,\n\n yrange: i16,\n\n skipx: Option<i16>,\n\n skipy: Option<i16>,\n\n) -> Option<&'static driving_model::PlayerTransformation> {\n\n // based on current player state, and steer, throttle and boost, gets the right transformation,\n\n // with some wiggle room based on xrange/yrange\n\n let mut local_normalized = normalized;\n\n let mut transformation: Option<&'static driving_model::PlayerTransformation> = None;\n\n\n\n // step_by is not yet stabilized... so using plain loops instead\n\n let ystep = if yrange < 0 { -1 } else { 1 };\n\n let xstep = if xrange < 0 { -1 } else { 1 };\n\n let mut dy = 0;\n\n 'outer: loop {\n\n let mut dx = 0;\n","file_path":"predict/src/player.rs","rank":63,"score":103222.67247138472},{"content":"/// for now, doesn't handle landing sideways or at any angle really, nor drifting. collision with\n\n/// arena is also not handled. collisions with other players or ball will never be handled here\n\nfn next_player_state_grounded(\n\n current: &PlayerState,\n\n controller: &BrickControllerState,\n\n time_step: f32,\n\n) -> Result<PlayerState, String> {\n\n let mut next = (*current).clone();\n\n\n\n let (translation, velocity, angular_velocity, rotation) = ground_turn_prediction(¤t, &controller, time_step)?;\n\n\n\n // because we extrapolate around the edges of our measurements, it's possible we calculate\n\n // a velocity beyond what's possible in the game. so we must scale it down here.\n\n let scale = if velocity.norm() > MAX_BOOST_SPEED {\n\n MAX_BOOST_SPEED / velocity.norm()\n\n } else {\n\n 1.0\n\n };\n\n\n\n // XXX NOTE using the velocity scaling for the translation isn't correct at all, but it's\n\n // likely to be at least proportional, and likely closer to correct than not scaling at all.\n\n next.position = current.position + scale * translation;\n\n next.position.z = RESTING_Z; // avoid drifting upward/downward when we're just driving on the ground!\n\n next.velocity = scale * velocity;\n\n next.angular_velocity = angular_velocity;\n\n next.rotation = UnitQuaternion::from_rotation_matrix(&rotation); // was easier to just return the end rotation directly. TODO stop using quaternion\n\n\n\n Ok(next)\n\n}\n\n\n","file_path":"predict/src/player.rs","rank":64,"score":101572.3151671092},{"content":"fn find_prediction_category(ball: &BallState) -> PredictionCategory {\n\n // NOTE using the \"soaring\" calculations when interacting with wall/curves, even when rolling,\n\n // since we at least have arena collision for that and will get a better prediction even if not\n\n // 100% accurate\n\n let in_air = ball.position.z > BALL_COLLISION_RADIUS || ball.velocity.z.abs() < 1.0;\n\n let on_side_curve = ball.position.x.abs() > SIDE_CURVE_DISTANCE;\n\n let on_back_curve = ball.position.y.abs() > BACK_CURVE_DISTANCE;\n\n if in_air || on_side_curve || on_back_curve {\n\n PredictionCategory::Soaring\n\n } else {\n\n PredictionCategory::Rolling\n\n }\n\n}\n\n\n","file_path":"predict/src/ball.rs","rank":65,"score":100987.15522134882},{"content":"pub fn next_player_state(\n\n current: &PlayerState,\n\n controller: &BrickControllerState,\n\n time_step: f32,\n\n) -> Result<PlayerState, String> {\n\n let mut next_player = match find_prediction_category(¤t) {\n\n PredictionCategory::Ground => next_player_state_grounded(¤t, &controller, time_step)?,\n\n //PredictionCategory::Ground2 => next_velocity_grounded2(¤t, &controller, time_step),\n\n //PredictionCategory::Wall => next_velocity_walled(¤t, &controller, time_step),\n\n //PredictionCategory::Ceiling => next_velocity_ceilinged(¤t, &controller, time_step),\n\n //PredictionCategory::CurveWall => next_velocity_curve_walled(¤t, &controller, time_step),\n\n //PredictionCategory::Air => next_velocity_flying(¤t, &controller, time_step),\n\n };\n\n\n\n if next_player.position.z < CAR_DIMENSIONS.z / 2.0 {\n\n next_player.position.z = CAR_DIMENSIONS.z / 2.0;\n\n }\n\n\n\n Ok(next_player)\n\n}\n\n\n","file_path":"predict/src/player.rs","rank":66,"score":99963.0474230132},{"content":"pub fn update_gamepad(gilrs: &mut Gilrs, gamepad: &mut Gamepad) {\n\n while let Some(Event { event, .. }) = gilrs.next_event() {\n\n match event {\n\n EventType::ButtonChanged(button, value, _code) => match button {\n\n Button::RightTrigger2 => gamepad.rt2 = value,\n\n Button::LeftTrigger2 => gamepad.lt2 = value,\n\n _ => {}\n\n },\n\n EventType::ButtonPressed(button, _code) => match button {\n\n Button::Select => gamepad.select_toggled = !gamepad.select_toggled,\n\n Button::RightTrigger => gamepad.rt = true,\n\n Button::LeftTrigger => gamepad.lt = true,\n\n Button::North => gamepad.north = true,\n\n Button::East => gamepad.east = true,\n\n Button::South => gamepad.south = true,\n\n Button::West => gamepad.west = true,\n\n _ => {}\n\n },\n\n EventType::ButtonReleased(button, _code) => match button {\n\n Button::RightTrigger => gamepad.rt = false,\n","file_path":"passthrough/src/lib.rs","rank":67,"score":97728.00180727622},{"content":"pub fn find_prediction_category(_current: &PlayerState) -> PredictionCategory {\n\n // hard-coded the only thing we can handle right now\n\n PredictionCategory::Ground\n\n}\n\n\n","file_path":"predict/src/player.rs","rank":68,"score":97641.80599584113},{"content":"pub fn normalized_player(player: &PlayerState, ceil_vx: bool, ceil_vy: bool) -> NormalizedPlayerState {\n\n let avz = (player.angular_velocity.z / GROUND_AVZ_GRID_FACTOR).round() as i16;\n\n\n\n let lv = player.local_velocity();\n\n\n\n let mut local_vx = if ceil_vx {\n\n (lv.x / GROUND_SPEED_GRID_FACTOR).ceil() as i16\n\n } else {\n\n (lv.x / GROUND_SPEED_GRID_FACTOR).floor() as i16\n\n };\n\n\n\n let mut local_vy = if ceil_vy {\n\n (lv.y / GROUND_SPEED_GRID_FACTOR).ceil() as i16\n\n } else {\n\n (lv.y / GROUND_SPEED_GRID_FACTOR).floor() as i16\n\n };\n\n\n\n // scale down if we're looking at something beyond the limits after a ceil or something\n\n let max = ((MAX_BOOST_SPEED / GROUND_SPEED_GRID_FACTOR).round() as i32).pow(2);\n\n let sum = (local_vy as i32).pow(2) + (local_vx as i32).pow(2);\n\n if sum > max {\n\n let ratio = (MAX_BOOST_SPEED / GROUND_SPEED_GRID_FACTOR) / (sum as f32).sqrt();\n\n local_vx = (local_vx as f32 * ratio).round() as i16;\n\n local_vy = (local_vy as f32 * ratio).round() as i16;\n\n }\n\n\n\n NormalizedPlayerState { local_vx, local_vy, avz }\n\n}\n","file_path":"predict/src/sample.rs","rank":69,"score":96652.66721464458},{"content":"fn is_hidden(entry: &DirEntry) -> bool {\n\n entry.file_name().to_str().map(|s| s.starts_with('.')).unwrap_or(false)\n\n}\n\n\n\npub type SampleMap<'a> = HashMap<NormalizedPlayerState, &'a [PlayerState], MyHasher>;\n\n\n\n//fn continuous_sample(sample: &[PlayerState]) {\n\n// let mut last = sample[0];\n\n// for player in sample[1..] {\n\n// let predicted = player.position + TICK * last.velocity;\n\n// if last.velocity.x()\n\n//\n\n// last = player;\n\n// }\n\n// return true\n\n//}\n\n\n","file_path":"predict/src/sample.rs","rank":70,"score":95338.77090267272},{"content":"extern crate predict;\n\nextern crate state;\n\n\n\nuse state::*;\n\nuse std::cmp::Ordering;\n\n\n\nconst NUM_TICKS: usize = 16;\n\n\n","file_path":"predict/tests/compare_with_sample_files.rs","rank":71,"score":91530.72803642876},{"content":" if (player_start.angular_velocity.z.abs() / 0.2) >= 20.0\n\n || player_start.local_velocity().y < 50.0\n\n || player_start.local_velocity().x.abs() > 1000.0\n\n {\n\n continue;\n\n }\n\n\n\n let predicted_player_end =\n\n predict::player::next_player_state(&player_start, &controller, NUM_TICKS as f32 * TICK)\n\n .expect(\"failed prediction\");\n\n let position_error = (predicted_player_end.position - player_end.position).norm();\n\n let velocity_error = (predicted_player_end.velocity - player_end.velocity).norm();\n\n let avz_error = (predicted_player_end.angular_velocity.z - player_end.angular_velocity.z).abs();\n\n\n\n position_errors.push(position_error);\n\n velocity_errors.push(velocity_error);\n\n avz_errors.push(avz_error);\n\n\n\n if position_error > max_position_error {\n\n max_position_error = position_error;\n","file_path":"predict/tests/compare_with_sample_files.rs","rank":72,"score":91522.34966898417},{"content":" println!(\"player_start normalized: {:?}\", normalized);\n\n println!(\"player_start: {:?}\", player_start);\n\n println!(\"expected player_end: {:?}\", player_end);\n\n println!(\"predicted player_end: {:?}\", predicted_player_end);\n\n }\n\n }\n\n }\n\n\n\n println!();\n\n println!();\n\n println!(\"---------------------------------------------------------\");\n\n println!(\"{:?}\", controller);\n\n println!(\"max position error: {}\", max_position_error);\n\n println!(\"rms position error: {}\", rms(&position_errors));\n\n println!(\n\n \"50th percentile position error: {}\",\n\n percentile_value(&mut position_errors, 50.0)\n\n );\n\n println!(\n\n \"95th percentile position error: {}\",\n","file_path":"predict/tests/compare_with_sample_files.rs","rank":73,"score":91517.44336597652},{"content":" }\n\n if velocity_error > max_velocity_error {\n\n max_velocity_error = velocity_error;\n\n }\n\n if avz_error > max_avz_error {\n\n max_avz_error = avz_error;\n\n }\n\n\n\n //println!(\"position error: {}\", position_error);\n\n //if position_error > 20.0 {\n\n if velocity_error > 40.0 {\n\n let normalized = predict::sample::normalized_player_rounded(&player_start);\n\n println!();\n\n println!(\"---------------------------------------------------------\");\n\n println!(\n\n \"position error: {}, velocity_error: {}, avz_error: {}\",\n\n position_error, velocity_error, avz_error\n\n );\n\n let v = player_start.velocity;\n\n println!(\"rg '{},{},{}' -- *.csv\", v.x, v.y, v.z);\n","file_path":"predict/tests/compare_with_sample_files.rs","rank":74,"score":91517.16905277994},{"content":" percentile_value(&mut position_errors, 95.0)\n\n );\n\n println!(\n\n \"99th percentile position error: {}\",\n\n percentile_value(&mut position_errors, 99.0)\n\n );\n\n println!(\n\n \"99.9th percentile position error: {}\",\n\n percentile_value(&mut position_errors, 99.9)\n\n );\n\n\n\n println!(\"max velocity error: {}\", max_velocity_error);\n\n println!(\"rms velocity error: {}\", rms(&velocity_errors));\n\n println!(\n\n \"50th percentile velocity error: {}\",\n\n percentile_value(&mut velocity_errors, 50.0)\n\n );\n\n println!(\n\n \"95th percentile velocity error: {}\",\n\n percentile_value(&mut velocity_errors, 95.0)\n","file_path":"predict/tests/compare_with_sample_files.rs","rank":75,"score":91516.95228822879},{"content":" assert!(max_position_error < 20.0);\n\n assert!(rms(&position_errors) < 0.6);\n\n assert!(percentile_value(&mut position_errors, 50.0) < 0.5);\n\n assert!(percentile_value(&mut position_errors, 95.0) < 1.5);\n\n assert!(percentile_value(&mut position_errors, 99.0) < 2.5);\n\n assert!(percentile_value(&mut position_errors, 99.9) < 7.5);\n\n\n\n assert!(rms(&velocity_errors) < 9.5);\n\n assert!(rms(&avz_errors) < 0.15);\n\n}\n\n\n","file_path":"predict/tests/compare_with_sample_files.rs","rank":76,"score":91516.93651574614},{"content":" );\n\n println!(\n\n \"99th percentile velocity error: {}\",\n\n percentile_value(&mut velocity_errors, 99.0)\n\n );\n\n println!(\n\n \"99.9th percentile velocity error: {}\",\n\n percentile_value(&mut velocity_errors, 99.9)\n\n );\n\n\n\n println!(\"max avz error: {}\", max_avz_error);\n\n println!(\"rms avz error: {}\", rms(&avz_errors));\n\n println!(\"50th percentile avz error: {}\", percentile_value(&mut avz_errors, 50.0));\n\n println!(\"95th percentile avz error: {}\", percentile_value(&mut avz_errors, 95.0));\n\n println!(\"99th percentile avz error: {}\", percentile_value(&mut avz_errors, 99.0));\n\n println!(\"99.9th percentile avz error: {}\", percentile_value(&mut avz_errors, 99.9));\n\n println!();\n\n println!();\n\n\n\n // TODO investigate the worst offenders and reduce these values\n","file_path":"predict/tests/compare_with_sample_files.rs","rank":77,"score":91516.80251945769},{"content":"fn update_simulation_visualization(bot: &BotState, plan_result: &PlanResult) {\n\n let PlanResult {\n\n plan,\n\n visualization_lines: lines,\n\n visualization_points: points,\n\n ..\n\n } = plan_result;\n\n\n\n let mut visualization_lines = LINES.write().unwrap();\n\n visualization_lines.clear();\n\n\n\n // lines directly from plan result\n\n visualization_lines.append(&mut lines.clone());\n\n\n\n // white line showing best planned path\n\n if let Some(ref plan) = bot.plan {\n\n visualization_lines.append(&mut plan_lines(&plan, Point3::new(1.0, 1.0, 1.0)));\n\n }\n\n\n\n // blue line showing most recently calculated path\n","file_path":"brick/src/main.rs","rank":78,"score":91008.26187065193},{"content":"/// guess best point on ball to hit, get the heading at that point\n\npub fn simple_desired_contact(ball: &BallState, desired_ball_position: &Vector3<f32>) -> DesiredContact {\n\n let desired_vector = Unit::new_normalize(desired_ball_position - ball.position);\n\n let desired_velocity = 3000.0 * desired_vector.into_inner();\n\n let velocity_delta = desired_velocity - ball.velocity;\n\n\n\n // this is pretty crude, doesn't even consider that the ball will undergo gravity after the\n\n // hit! but should be good enough for us here for now\n\n let impulse_direction = Unit::new_normalize(velocity_delta);\n\n let ball_normal = -1.0 * impulse_direction.into_inner();\n\n\n\n DesiredContact {\n\n position: ball.position + BALL_COLLISION_RADIUS * ball_normal,\n\n heading: -1.0 * ball_normal,\n\n }\n\n}\n\n\n","file_path":"brain/src/play.rs","rank":79,"score":90668.26837218515},{"content":"pub fn ball_collides(ball: &BallState, player: &PlayerState) -> bool {\n\n (closest_point_for_collision(ball, player) - ball.position).norm() < BALL_COLLISION_RADIUS\n\n}\n\n\n","file_path":"predict/src/player.rs","rank":80,"score":88117.44811873179},{"content":"fn ground_turn_prediction(\n\n current: &PlayerState,\n\n controller: &BrickControllerState,\n\n time_step: f32,\n\n) -> Result<PlayerPrediction, String> {\n\n // we don't have transformations for single ticks, but we'll do some special handling of\n\n // this case as we need it for car-ball collisions\n\n let original_time_step = time_step;\n\n let time_step = if time_step == TICK { 2.0 * TICK } else { time_step };\n\n\n\n let quad = ground_turn_quad_tranformations(current, controller, time_step);\n\n\n\n // TODO error\n\n let mut x1y1 = quad[0].ok_or_else(|| {\n\n format!(\n\n \"Missing turn x1y1 for player: {:?} & controller: {:?}\",\n\n sample::normalized_player(¤t, false, false),\n\n controller\n\n )\n\n })?;\n","file_path":"predict/src/player.rs","rank":81,"score":86340.53431925841},{"content":"//// since the ray collision algorithm doesn't allow for the ray ending early, but does account\n\n//// for point of origin, we just test it in both directions for a complete line test. minimize\n\n//// the overhead by using the previous position as the ray origin first, assuming we'll\n\n//// mostly be moving *towards* the desired position for most expanded a* paths\n\npub fn line_collides_bounding_box(bounding_box: &BoundingBox, start: Vector3<f32>, end: Vector3<f32>) -> bool {\n\n ray_collides_bounding_box(&bounding_box, start, end) && ray_collides_bounding_box(&bounding_box, end, start)\n\n}\n\n\n","file_path":"brain/src/plan.rs","rank":82,"score":82855.9513637187},{"content":"// https://bheisler.github.io/post/writing-gpu-accelerated-path-tracer-part-3/\n\n// https://gamedev.stackexchange.com/a/18459/4929\n\npub fn ray_collides_bounding_box(bounding_box: &BoundingBox, start: Vector3<f32>, end: Vector3<f32>) -> bool {\n\n let dir = end - start;\n\n let dir_inv = Vector3::new(1.0 / dir.x, 1.0 / dir.y, 1.0 / dir.z);\n\n\n\n let mut txmin = (bounding_box.min_x - start.x) * dir_inv.x;\n\n let mut txmax = (bounding_box.max_x - start.x) * dir_inv.x;\n\n\n\n if txmin > txmax {\n\n mem::swap(&mut txmin, &mut txmax);\n\n }\n\n\n\n let mut tymin = (bounding_box.min_y - start.y) * dir_inv.y;\n\n let mut tymax = (bounding_box.max_y - start.y) * dir_inv.y;\n\n\n\n if tymin > tymax {\n\n mem::swap(&mut tymin, &mut tymax);\n\n }\n\n\n\n if txmin > tymax || tymin > txmax {\n\n return false;\n","file_path":"brain/src/plan.rs","rank":83,"score":82854.29875989299},{"content":"pub fn trajectory_enters_soccar_goal(ball: &BallState) -> bool {\n\n // FIXME check full ball trajectory, with bouncing\n\n //let goal = Vector3::new(0.0, BACK_WALL_DISTANCE, GOAL_Z / 2.0);\n\n let goal = na::Vector2::new(0.0, BACK_WALL_DISTANCE);\n\n let pos = na::Vector2::new(ball.position.x, ball.position.y);\n\n let v = na::Vector2::new(ball.velocity.x, ball.velocity.y);\n\n\n\n // check if 2d ball velocty is towards goal\n\n // TODO use exact angle of left side and right side of goal from current ball position instead\n\n // of the dot product approximate check\n\n (goal - pos).normalize().dot(&v.normalize()) > 0.95\n\n}\n\n\n","file_path":"predict/src/ball.rs","rank":84,"score":82523.51265513619},{"content":"fn bot_logic_loop(sender: Sender<PlanResult>, receiver: Receiver<(GameState, BotState)>) {\n\n let mut model = brain::get_model();\n\n loop {\n\n let (mut game, mut bot) = receiver.recv().expect(\"Couldn't receive game state\");\n\n\n\n // make sure we have the latest, drop earlier states\n\n while let Ok((g, b)) = receiver.try_recv() {\n\n game = g;\n\n bot = b;\n\n }\n\n\n\n let plan_result = brain::play::play(&mut model, &game, &mut bot);\n\n sender.send(plan_result).expect(\"Failed to send plan result\");\n\n }\n\n}\n\n\n","file_path":"brick/src/main.rs","rank":85,"score":82042.77881412214},{"content":"#[allow(clippy::needless_collect)] // it's actually needed as rev does not work after unfold\n\nfn reverse_path(\n\n parents: &ParentsMap,\n\n initial_index: usize,\n\n initial_is_secondary: bool,\n\n initial_player: &PlayerState,\n\n initial_cost: f32,\n\n) -> Plan {\n\n let path = itertools::unfold((initial_index, initial_is_secondary), |vals| {\n\n let index = (*vals).0;\n\n let is_secondary = (*vals).1;\n\n parents.get_index(index).map(|(_rounded, (v1, maybe_v2))| {\n\n let vertex = if is_secondary { maybe_v2.as_ref().unwrap() } else { v1 };\n\n (*vals).0 = vertex.parent_index;\n\n (*vals).1 = vertex.parent_is_secondary;\n\n let player = if index == initial_index {\n\n initial_player.clone()\n\n } else {\n\n vertex.player.clone()\n\n };\n\n let cost = if index == initial_index {\n","file_path":"brain/src/plan.rs","rank":86,"score":80724.95916002918},{"content":"fn bot_logic_loop_test(sender: Sender<PlanResult>, receiver: Receiver<(GameState, BotState)>) {\n\n let mut gilrs = Gilrs::new().unwrap();\n\n let mut gamepad = Gamepad::default();\n\n let mut model = brain::get_model();\n\n\n\n let mut loop_helper = LoopHelper::builder().build_with_target_rate(1000.0); // limit to 1000 FPS\n\n //.build_with_target_rate(0.2); // limit to 0.2 FPS\n\n\n\n loop {\n\n loop_helper.loop_start();\n\n let (mut game, mut bot) = receiver.recv().expect(\"Couldn't receive game state\");\n\n\n\n // make sure we have the latest, drop earlier states\n\n while let Ok((g, b)) = receiver.try_recv() {\n\n game = g;\n\n bot = b;\n\n }\n\n\n\n update_gamepad(&mut gilrs, &mut gamepad);\n\n if !gamepad.select_toggled {\n","file_path":"brick/src/main.rs","rank":87,"score":80245.34270831264},{"content":"pub fn get_model() -> impl HeuristicModel {\n\n // TODO config file or something\n\n //let path = \"./heuristic/train/nn/simple_throttle_cost_saved_model/1552341051/\";\n\n //NeuralHeuristic::try_new(path).expect(\"Failed to initialize NeuralHeuristic\")\n\n\n\n // TODO config file or something\n\n let path = \"./time.csv\";\n\n KnnHeuristic::try_new(path).expect(\"Failed to initialize KnnHeuristic\")\n\n\n\n //BasicHeuristic::default()\n\n}\n","file_path":"brain/src/lib.rs","rank":88,"score":77233.36109787448},{"content":"fn interpolate_transformation_halfway(\n\n transformation: driving_model::PlayerTransformation,\n\n current: &PlayerState,\n\n) -> driving_model::PlayerTransformation {\n\n let mut transformation = transformation;\n\n transformation.translation_x /= 2;\n\n transformation.translation_y /= 2;\n\n transformation.end_yaw /= 2.0;\n\n transformation.end_angular_velocity_z =\n\n current.angular_velocity.z + (transformation.end_angular_velocity_z - current.angular_velocity.z) / 2.0;\n\n\n\n // NOTE start local vx/vy is with car facing forwards in y direction, but end_velocity is with car\n\n // facing leftwards, ie negative x direction. so we align them first before interpolation\n\n let start_velocity = Vector3::new(\n\n transformation.start_local_vx as f32,\n\n transformation.start_local_vy as f32,\n\n 0.0,\n\n );\n\n let rotation = Rotation3::from_euler_angles(0.0, 0.0, std::f32::consts::PI / 2.0); // anti-clockwise\n\n let start_velocity = rotation * start_velocity;\n","file_path":"predict/src/player.rs","rank":89,"score":76915.82275578206},{"content":"fn plan_lines(plan: &[PlanStep], color: Point3<f32>) -> Vec<Line> {\n\n let mut lines = Vec::with_capacity(plan.len());\n\n let pos = plan\n\n .get(0)\n\n .map(|(p, _, _)| p.position)\n\n .unwrap_or_else(|| Vector3::new(0.0, 0.0, 0.0));\n\n let mut last_point = Point3::new(pos.x, pos.y, pos.z);\n\n for (ps, _, _) in plan {\n\n let point = Point3::new(ps.position.x, ps.position.y, ps.position.z + 0.1);\n\n lines.push((last_point, point, color));\n\n last_point = point;\n\n }\n\n lines\n\n}\n\n\n","file_path":"brick/src/main.rs","rank":90,"score":76694.12100400763},{"content":"pub fn closest_plan_index(given_player: &PlayerState, plan: &[PlanStep]) -> usize {\n\n assert!(!plan.is_empty());\n\n\n\n let mut index = 0;\n\n let mut min_distance = std::f32::MAX;\n\n\n\n for (i, (player, _, _)) in plan.iter().enumerate() {\n\n let distance = (given_player.position - player.position).norm();\n\n if distance < min_distance {\n\n min_distance = distance;\n\n index = i\n\n }\n\n }\n\n\n\n index\n\n}\n\n\n","file_path":"brain/src/play.rs","rank":91,"score":75465.96543076662},{"content":"pub fn get_collision(\n\n ball_trajectory: &[BallState],\n\n player: &PlayerState,\n\n controller: &BrickControllerState,\n\n time_step: f32,\n\n) -> Option<(PlayerState, BallState, Vector3<f32>, f32)> {\n\n let num_ticks: usize = (time_step / TICK).round() as usize;\n\n assert!(num_ticks % 2 == 0);\n\n\n\n // 2-tick steps\n\n let mut last = player.clone();\n\n for step in 1..=(num_ticks / 2) {\n\n if let Ok(next) = next_player_state(&last, controller, TICK * 2.0) {\n\n if let Some(ball) = ball_trajectory.get(step * 2) {\n\n if ball_collides(ball, &next) {\n\n // check if one tick earlier collides, since we are using 2-tick steps\n\n if let Ok(next_single_tick) = next_player_state(&last, controller, TICK) {\n\n let single_tick_ball = &ball_trajectory[step * 2 - 1];\n\n if ball_collides(single_tick_ball, &next_single_tick) {\n\n let collision_time = (2 * step - 1) as f32 * TICK;\n","file_path":"predict/src/player.rs","rank":92,"score":75306.55501168605},{"content":"fn ground_turn_quad_tranformations(\n\n current: &PlayerState,\n\n controller: &BrickControllerState,\n\n time_step: f32,\n\n) -> [Option<&'static driving_model::PlayerTransformation>; 4] {\n\n // TODO handle missing values properly: go lower/higher to find another point to use as an\n\n // interpolation anchor\n\n //println!(\"x1y1\");\n\n let normalized = sample::normalized_player(¤t, false, false);\n\n let mut x1y1 = ground_turn_matching_transformation(normalized, &controller, time_step, -3, -3, None, None);\n\n\n\n //println!(\"x2y1\");\n\n let normalized = sample::normalized_player(¤t, true, false);\n\n let mut x2y1 = ground_turn_matching_transformation(normalized, &controller, time_step, 3, -3, None, None);\n\n\n\n // when we fail in on direction, search in the other\n\n if x1y1.is_some() && x2y1.is_none() {\n\n //println!(\"-- x2y1 fallback --\");\n\n let x1y1_transformation = x1y1.as_ref().unwrap();\n\n let skip = x1y1_transformation.normalized_player(current.angular_velocity.z);\n","file_path":"predict/src/player.rs","rank":93,"score":74599.54881069326},{"content":"type Line = (Point3<f32>, Point3<f32>, Point3<f32>);\n\n\n\nlazy_static! {\n\n static ref GAME_STATE: RwLock<GameState> = RwLock::new(GameState::default());\n\n static ref LINES: RwLock<Vec<Line>> = RwLock::new(vec![]);\n\n static ref POINTS: RwLock<Vec<(Point3<f32>, Point3<f32>)>> = RwLock::new(vec![]);\n\n}\n\n\n","file_path":"brick/src/main.rs","rank":94,"score":74342.6727986946},{"content":"fn record_missing_record_state(\n\n rlbot: &rlbot::RLBot,\n\n input: &ControllerState,\n\n index: &mut HashMap<predict::sample::NormalizedPlayerState, PlayerState>,\n\n record_state: &mut RecordState,\n\n adjustment: &mut Adjustment,\n\n) -> Result<(), Box<dyn Error>> {\n\n record_state.records.clear();\n\n rlbot.update_player_input(0, &input)?;\n\n\n\n loop {\n\n // waits and checks the tick to ensure it meets our conditions. and it records the first tick\n\n record_state.set_game_state_accurately(&rlbot, index, adjustment)?;\n\n\n\n loop {\n\n //rlbot.update_player_input(0, &input)?;\n\n let tick = next_flat(&rlbot);\n\n record_state.record(&tick);\n\n\n\n if record_state.sample_complete() {\n","file_path":"record/src/main.rs","rank":95,"score":74182.22861973986},{"content":"fn throttle_left() -> ControllerState {\n\n let mut input = ControllerState::default();\n\n input.throttle = 1.0;\n\n input.steer = -1.0;\n\n input\n\n}\n\n\n","file_path":"record/src/main.rs","rank":96,"score":72572.96087564385},{"content":"fn boost_straight() -> ControllerState {\n\n let mut input = ControllerState::default();\n\n input.boost = true;\n\n input\n\n}\n\n\n","file_path":"record/src/main.rs","rank":97,"score":72572.96087564385},{"content":"fn throttle_straight() -> ControllerState {\n\n let mut input = ControllerState::default();\n\n input.throttle = 1.0;\n\n input\n\n}\n\n\n","file_path":"record/src/main.rs","rank":98,"score":72572.96087564385},{"content":"fn throttle_right() -> ControllerState {\n\n let mut input = ControllerState::default();\n\n input.throttle = 1.0;\n\n input.steer = 1.0;\n\n input\n\n}\n\n\n","file_path":"record/src/main.rs","rank":99,"score":72572.96087564385}],"string":"[\n {\n \"content\": \"fn percentile_value(numbers: &mut Vec<f32>, percentile: f32) -> f32 {\\n\\n numbers.sort_by(|a, b| a.partial_cmp(b).unwrap_or(Ordering::Less));\\n\\n let i = (percentile * numbers.len() as f32) as usize / 100;\\n\\n numbers[i]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"predict/tests/compare_with_sample_files.rs\",\n \"rank\": 0,\n \"score\": 211561.96753803157\n },\n {\n \"content\": \"fn write_data(path: &str, plan: Plan) -> Result<(), Box<dyn Error>> {\\n\\n let serializable_plan = SerializablePlan(plan);\\n\\n create_dir_all(&path)?;\\n\\n let file_path = Path::new(path).join(\\\"plan.bincode\\\");\\n\\n let f = BufWriter::new(File::create(file_path)?);\\n\\n let mut e = GzEncoder::new(f, Compression::default());\\n\\n Ok(serialize_into(&mut e, &serializable_plan)?)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"generate-data/src/main.rs\",\n \"rank\": 1,\n \"score\": 198817.00637231107\n },\n {\n \"content\": \"pub fn load_sample_file(path: &PathBuf) -> Vec<PlayerState> {\\n\\n let mut rdr = csv::ReaderBuilder::new()\\n\\n .has_headers(false)\\n\\n .from_reader(fs::File::open(path).unwrap_or_else(|_| panic!(\\\"File doesn't exist: {}\\\", path.to_string_lossy())));\\n\\n let data: Vec<PlayerState> = rdr\\n\\n .records()\\n\\n .map(|record| {\\n\\n let record = record.expect(\\\"CSV parse failed?\\\");\\n\\n let _frame: f32 = record\\n\\n .get(0)\\n\\n .expect(\\\"Invalid row?\\\")\\n\\n .parse()\\n\\n .expect(\\\"Can't convert time to f32\\\");\\n\\n PlayerState {\\n\\n position: Vector3::new(\\n\\n record.get(1).expect(\\\"Invalid row?\\\").parse().expect(\\\"Can't convert x to f32\\\"),\\n\\n record.get(2).expect(\\\"Invalid row?\\\").parse().expect(\\\"Can't convert y to f32\\\"),\\n\\n record.get(3).expect(\\\"Invalid row?\\\").parse().expect(\\\"Can't convert z to f32\\\"),\\n\\n ),\\n\\n velocity: Vector3::new(\\n\",\n \"file_path\": \"predict/src/sample.rs\",\n \"rank\": 2,\n \"score\": 190793.92016337195\n },\n {\n \"content\": \"fn rms(numbers: &[f32]) -> f32 {\\n\\n let total_error_squared: f32 = numbers.iter().map(|x| x * x).sum();\\n\\n (total_error_squared / (numbers.len() as f32)).sqrt()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"predict/tests/compare_with_sample_files.rs\",\n \"rank\": 3,\n \"score\": 187791.54601372126\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\nfn restore_snapshot(rlbot: &rlbot::RLBot, bot: &mut BotState, frame: &mut u32, name: &str) -> Result<(), Box<dyn Error>> {\\n\\n let dir = \\\"data/snapshots\\\";\\n\\n let path = Path::new(dir).join(name.to_owned() + \\\".bincode.gz\\\");\\n\\n let f = BufReader::new(File::open(path)?);\\n\\n let mut decoder = GzDecoder::new(f);\\n\\n let (historical_game, historical_bot): (GameState, BotState) = bincode::deserialize_from(&mut decoder)?;\\n\\n\\n\\n // replace our bot data with the historical bot\\n\\n *bot = historical_bot;\\n\\n\\n\\n // update RL game state with historical game state\\n\\n *frame = historical_game.frame;\\n\\n let player = historical_game.player;\\n\\n let ball = historical_game.ball;\\n\\n let car_state = get_desired_car_state(&player);\\n\\n let ball_state = get_desired_ball_state(&ball);\\n\\n let desired_game_state = rlbot::DesiredGameState::new().car_state(0, car_state).ball_state(ball_state);\\n\\n Ok(rlbot.set_game_state(&desired_game_state)?)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"brick/src/main.rs\",\n \"rank\": 4,\n \"score\": 187116.28041781217\n },\n {\n \"content\": \"#[allow(non_snake_case)]\\n\\npub fn calculate_hit(ball: &BallState, player: &PlayerState, collision: &Vector3<f32>) -> Result<BallState, Box<dyn Error>> {\\n\\n let n1 = (collision - ball.position).normalize();\\n\\n\\n\\n let L_b = (collision - ball.position).cross_matrix();\\n\\n let L_c = (collision - player.position).cross_matrix();\\n\\n\\n\\n let player_rotation = player.rotation.to_rotation_matrix();\\n\\n let invI_c = player_rotation * (*CAR_INVERSE_INERTIA * player_rotation.transpose());\\n\\n\\n\\n let invM = ((1.0 / BALL_MASS) + (1.0 / CAR_MASS)) * na::Matrix3::identity()\\n\\n - ((L_b * L_b) / BALL_INERTIA)\\n\\n - (L_c * (invI_c * L_c));\\n\\n let M = invM.try_inverse().ok_or(\\\"M matrix inversion failed\\\")?;\\n\\n\\n\\n let delta_v = (player.velocity - (L_c * player.angular_velocity)) - (ball.velocity - (L_b * ball.angular_velocity));\\n\\n\\n\\n // compute the impulse that is consistent with an inelastic collision\\n\\n let J1 = M * delta_v;\\n\\n\\n\\n let J1_perp = J1.dot(&n1).min(-1.0f32) * n1;\\n\",\n \"file_path\": \"predict/src/ball.rs\",\n \"rank\": 5,\n \"score\": 175373.2154631068\n },\n {\n \"content\": \"fn shoot<H: HeuristicModel>(model: &mut H, game: &GameState, bot: &mut BotState) -> PlanResult {\\n\\n let desired_ball_position: Vector3<f32> = opponent_goal_shoot_at(&game);\\n\\n let last_plan = None;\\n\\n // FIXME check if last plan is still valid before using this\\n\\n // let last_plan\\n\\n // if bot.last_action.is_some() && bot.last_action.as_ref().unwrap() == &Action::Shoot {\\n\\n // bot.plan.as_ref()\\n\\n // } else {\\n\\n // None\\n\\n // };\\n\\n let result = hit_ball(model, game, bot, &desired_ball_position, last_plan);\\n\\n bot.last_action = Some(Action::Shoot);\\n\\n result\\n\\n}\\n\\n\\n\",\n \"file_path\": \"brain/src/play.rs\",\n \"rank\": 6,\n \"score\": 174329.64113795568\n },\n {\n \"content\": \"fn files<'a>(dir: &'a str) -> impl Iterator<Item = PathBuf> + 'a {\\n\\n WalkDir::new(dir)\\n\\n .into_iter()\\n\\n .filter_entry(|e| !is_hidden(e))\\n\\n .filter_map(|entry| {\\n\\n let entry = entry.unwrap();\\n\\n if entry.file_type().is_file() {\\n\\n Some(entry.path().to_owned())\\n\\n } else {\\n\\n None\\n\\n }\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"predict/src/sample.rs\",\n \"rank\": 7,\n \"score\": 174212.58094068783\n },\n {\n \"content\": \"fn non_admissable_estimated_time<H: HeuristicModel>(model: &mut H, current: &PlayerState, ball: &BallState) -> f32 {\\n\\n // unreachable, we can't fly\\n\\n if ball.position.z - BALL_COLLISION_RADIUS > CAR_DIMENSIONS.z + CAR_OFFSET.z {\\n\\n return std::f32::MAX;\\n\\n }\\n\\n\\n\\n let mut single_heuristic_cost = [0.0];\\n\\n model\\n\\n .unscaled_heuristic(&[current.clone()], &mut single_heuristic_cost[0..1])\\n\\n .expect(\\\"Heuristic failed initial!\\\");\\n\\n unsafe { *single_heuristic_cost.get_unchecked(0) }\\n\\n}\\n\\n\\n\\n// TODO\\n\\n//fn shadow(game: &GameState) -> PlayerState {\\n\\n//}\\n\\n\\n\",\n \"file_path\": \"brain/src/play.rs\",\n \"rank\": 8,\n \"score\": 172663.29007675778\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\nfn turn_plan(current: &PlayerState, angle: f32) -> Result<Plan, Box<dyn Error>> {\\n\\n let mut plan = vec![];\\n\\n let current_heading = current.rotation.to_rotation_matrix() * Vector3::new(-1.0, 0.0, 0.0);\\n\\n let desired_heading = Rotation3::from_euler_angles(0.0, 0.0, angle) * current_heading;\\n\\n let mut turn_controller = BrickControllerState::default();\\n\\n turn_controller.throttle = Throttle::Forward;\\n\\n turn_controller.steer = if angle < 0.0 { Steer::Right } else { Steer::Left };\\n\\n\\n\\n let mut straight_controller = BrickControllerState::default();\\n\\n straight_controller.throttle = Throttle::Forward;\\n\\n\\n\\n const TURN_DURATION: f32 = 16.0 * TICK;\\n\\n // straighten out for zero angular velocity at end, hopefully 16 ticks is enough?\\n\\n const STRAIGHT_DURATION: f32 = 16.0 * TICK;\\n\\n\\n\\n // iterate till dot product is maximized (ie we match the desired heading)\\n\\n let mut last_dot = std::f32::MIN;\\n\\n let mut player = current.clone();\\n\\n loop {\\n\\n let turn_player = predict::player::next_player_state(&player, &turn_controller, TURN_DURATION)?;\\n\",\n \"file_path\": \"brick/src/main.rs\",\n \"rank\": 9,\n \"score\": 170263.80498751812\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\nfn forward_plan(current: &PlayerState, time: f32) -> Result<Plan, Box<dyn Error>> {\\n\\n let mut plan = vec![];\\n\\n\\n\\n let mut controller = BrickControllerState::default();\\n\\n controller.throttle = Throttle::Forward;\\n\\n\\n\\n let mut player = current.clone();\\n\\n let mut time_so_far = 0.0;\\n\\n while time_so_far < time {\\n\\n let step_duration = 16.0 * TICK;\\n\\n player = predict::player::next_player_state(&player, &controller, step_duration)?;\\n\\n plan.push((player.clone(), controller.clone(), step_duration));\\n\\n time_so_far += step_duration;\\n\\n }\\n\\n\\n\\n Ok(plan)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"brick/src/main.rs\",\n \"rank\": 10,\n \"score\": 170263.80498751812\n },\n {\n \"content\": \"/// main entrypoint for bot to figure out what to do given the current state\\n\\n// TODO we need to also include our current (ie previously used) strategy state as an input here,\\n\\n// and logic for expiring it if it's no longer applicable.\\n\\npub fn play<H: HeuristicModel>(model: &mut H, game: &GameState, bot: &mut BotState) -> PlanResult {\\n\\n match what_do(game) {\\n\\n Action::Shoot => shoot(model, game, bot),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"brain/src/play.rs\",\n \"rank\": 11,\n \"score\": 169660.26353005215\n },\n {\n \"content\": \"fn bot_test_plan<H: brain::HeuristicModel>(model: &mut H, game: &GameState, bot: &mut BotState) -> PlanResult {\\n\\n // canned plans\\n\\n //\\n\\n // // let player = &game.player.lag_compensated_player(&bot.controller_history, LAG_FRAMES);\\n\\n // let player = PlayerState::default();\\n\\n //\\n\\n // let mut plan_result = if let Ok(plan) = snek_plan(&player) {\\n\\n // //for (i, (_next_player, controller, cost)) in plan.iter().enumerate() {\\n\\n // // println!(\\\"i: {}, steer: {:?}, steps: {}\\\", i, controller.steer, (cost / TICK).round() as i32);\\n\\n // //}\\n\\n // PlanResult {\\n\\n // plan: Some(plan),\\n\\n // cost_diff: 0.0,\\n\\n // visualization_lines: vec![],\\n\\n // visualization_points: vec![],\\n\\n // }\\n\\n // } else {\\n\\n // PlanResult {\\n\\n // plan: None,\\n\\n // cost_diff: 0.0,\\n\",\n \"file_path\": \"brick/src/main.rs\",\n \"rank\": 12,\n \"score\": 164581.71772103396\n },\n {\n \"content\": \"pub fn csv_files<'a>(dir: &'a str) -> impl Iterator<Item = PathBuf> + 'a {\\n\\n files(dir).filter(|path| path.extension() == Some(OsStr::new(\\\"csv\\\")))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"predict/src/sample.rs\",\n \"rank\": 13,\n \"score\": 163306.19112659086\n },\n {\n \"content\": \"fn pd_adjust(input: &mut rlbot::ControllerState, errors: &VecDeque<f32>) {\\n\\n // build up some errors before we do anything\\n\\n if errors.len() <= DIFFERENTIAL_STEPS {\\n\\n return;\\n\\n }\\n\\n let last_error = errors[errors.len() - 1];\\n\\n let error_slope = (last_error - errors[errors.len() - 1 - DIFFERENTIAL_STEPS]) / DIFFERENTIAL_STEPS as f32;\\n\\n //println!(\\n\\n // \\\"last_error: {:?}, error_slope: {:?}\\\",\\n\\n // last_error, error_slope\\n\\n //); // TODO normalize slope to speed!\\n\\n let proportional_signal = PROPORTIONAL_DIST_GAIN * last_error;\\n\\n let differential_signal = DIFFERENTIAL_GAIN * error_slope;\\n\\n let signal = proportional_signal + differential_signal;\\n\\n //println!(\\n\\n // \\\"signal: {}, p: {}, d: {}\\\",\\n\\n // signal, proportional_signal, differential_signal\\n\\n //);\\n\\n input.steer += signal;\\n\\n\\n\",\n \"file_path\": \"brain/src/play.rs\",\n \"rank\": 14,\n \"score\": 160683.25878978104\n },\n {\n \"content\": \"pub fn load_all_samples(dir: &str) -> Vec<Vec<PlayerState>> {\\n\\n csv_files(dir).map(|f| load_sample_file(&f)).collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"predict/src/sample.rs\",\n \"rank\": 15,\n \"score\": 159547.10458973018\n },\n {\n \"content\": \"fn main() -> Result<(), Box<dyn Error>> {\\n\\n let args = Docopt::new(USAGE).and_then(|dopt| dopt.parse()).unwrap_or_else(|e| e.exit());\\n\\n\\n\\n let test_bot = args.get_bool(\\\"--bot-test\\\");\\n\\n if args.get_bool(\\\"--bot\\\") || test_bot {\\n\\n thread::spawn(move || loop {\\n\\n let t = thread::spawn(move || {\\n\\n if test_bot {\\n\\n panic::catch_unwind(run_bot_test).expect(\\\"Panic catch unwind failed\\\");\\n\\n } else {\\n\\n panic::catch_unwind(run_bot).expect(\\\"Panic catch unwind failed\\\");\\n\\n }\\n\\n });\\n\\n t.join()\\n\\n .expect_err(\\\"The bot thread should only end if panic, but it didn't panic.\\\");\\n\\n println!(\\\"XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX\\\");\\n\\n println!(\\\"XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX\\\");\\n\\n println!(\\\"XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX\\\");\\n\\n println!(\\\"XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX\\\");\\n\\n println!(\\\"XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX\\\");\\n\",\n \"file_path\": \"brick/src/main.rs\",\n \"rank\": 16,\n \"score\": 143380.21652448294\n },\n {\n \"content\": \"fn main() -> Result<(), Box<dyn Error>> {\\n\\n let rlbot = rlbot::init()?;\\n\\n\\n\\n let _batmobile = rlbot::PlayerLoadout::new().car_id(803);\\n\\n let fennec = rlbot::PlayerLoadout::new().car_id(4284);\\n\\n let mut settings = rlbot::MatchSettings::new().player_configurations(vec![rlbot::PlayerConfiguration::new(\\n\\n rlbot::PlayerClass::RLBotPlayer,\\n\\n \\\"Recorder\\\",\\n\\n 0,\\n\\n )\\n\\n .loadout(fennec)]);\\n\\n\\n\\n settings.mutator_settings = rlbot::MutatorSettings::new()\\n\\n .match_length(rlbot::MatchLength::Unlimited)\\n\\n .boost_option(rlbot::BoostOption::Unlimited_Boost);\\n\\n\\n\\n rlbot.start_match(&settings)?;\\n\\n rlbot.wait_for_match_start()?;\\n\\n\\n\\n // set initial state\\n\",\n \"file_path\": \"record/src/main.rs\",\n \"rank\": 17,\n \"score\": 143380.21652448288\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\nfn record_snapshot(game: &GameState, bot: &BotState) -> Result<(), Box<dyn Error>> {\\n\\n let dir = \\\"data/snapshots\\\";\\n\\n create_dir_all(dir)?;\\n\\n\\n\\n let file_path = SNAPSHOT_NUMBER.with(|num| {\\n\\n let mut path;\\n\\n loop {\\n\\n path = Path::new(dir).join(format!(\\\"snapshot{}.bincode.gz\\\", *num.borrow()));\\n\\n if !path.exists() {\\n\\n break;\\n\\n }\\n\\n (*num.borrow_mut()) += 1;\\n\\n }\\n\\n path\\n\\n });\\n\\n let f = BufWriter::new(File::create(file_path)?);\\n\\n let mut e = GzEncoder::new(f, Compression::default());\\n\\n Ok(bincode::serialize_into(&mut e, &(game, bot))?)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"brick/src/main.rs\",\n \"rank\": 18,\n \"score\": 143040.5615297909\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\nfn square_plan(player: &PlayerState) -> Result<Plan, Box<dyn Error>> {\\n\\n let mut plan = vec![];\\n\\n plan.push((player.clone(), BrickControllerState::default(), 0.0));\\n\\n for _ in 0..4 {\\n\\n let mut plan_part = forward_plan(&plan[plan.len() - 1].0, 1000.0)?;\\n\\n plan.append(&mut plan_part);\\n\\n let mut plan_part = turn_plan(&plan[plan.len() - 1].0, -PI / 2.0)?;\\n\\n plan.append(&mut plan_part);\\n\\n }\\n\\n\\n\\n Ok(plan)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"brick/src/main.rs\",\n \"rank\": 19,\n \"score\": 141725.95846020436\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\nfn snek_plan(player: &PlayerState) -> Result<Plan, Box<dyn Error>> {\\n\\n let mut plan = vec![];\\n\\n plan.push((player.clone(), BrickControllerState::default(), 0.0));\\n\\n\\n\\n let mut plan_part = forward_plan(&plan[plan.len() - 1].0, 500.0)?;\\n\\n plan.append(&mut plan_part);\\n\\n for _ in 0..2 {\\n\\n let mut plan_part = turn_plan(&plan[plan.len() - 1].0, PI / 6.0)?;\\n\\n plan.append(&mut plan_part);\\n\\n let mut plan_part = turn_plan(&plan[plan.len() - 1].0, -PI / 6.0)?;\\n\\n plan.append(&mut plan_part);\\n\\n }\\n\\n\\n\\n Ok(plan)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"brick/src/main.rs\",\n \"rank\": 20,\n \"score\": 141725.95846020436\n },\n {\n \"content\": \"#[allow(dead_code, clippy::same_item_push)]\\n\\nfn snek_plan2(current: &PlayerState) -> Result<Plan, Box<dyn Error>> {\\n\\n let mut plan = vec![];\\n\\n let mut player = current.clone();\\n\\n plan.push((player.clone(), BrickControllerState::default(), 0.0));\\n\\n\\n\\n let mut controller = BrickControllerState::default();\\n\\n controller.throttle = Throttle::Forward;\\n\\n for _ in 0..4 {\\n\\n player = predict::player::next_player_state(&player, &controller, 16.0 * TICK)?;\\n\\n plan.push((player.clone(), controller.clone(), 16.0 * TICK));\\n\\n }\\n\\n\\n\\n for _ in 0..2 {\\n\\n controller.steer = Steer::Left;\\n\\n for _ in 0..4 {\\n\\n player = predict::player::next_player_state(&player, &controller, 16.0 * TICK)?;\\n\\n plan.push((player.clone(), controller.clone(), 16.0 * TICK));\\n\\n }\\n\\n\\n\\n controller.steer = Steer::Right;\\n\\n for _ in 0..4 {\\n\\n player = predict::player::next_player_state(&player, &controller, 16.0 * TICK)?;\\n\\n plan.push((player.clone(), controller.clone(), 16.0 * TICK));\\n\\n }\\n\\n }\\n\\n\\n\\n Ok(plan)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"brick/src/main.rs\",\n \"rank\": 21,\n \"score\": 141725.95846020436\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\nfn snek_plan3(current: &PlayerState) -> Result<Plan, Box<dyn Error>> {\\n\\n let mut plan = vec![];\\n\\n let mut player = current.clone();\\n\\n plan.push((player.clone(), BrickControllerState::default(), 0.0));\\n\\n\\n\\n let mut controller = BrickControllerState::default();\\n\\n controller.throttle = Throttle::Forward;\\n\\n\\n\\n let get_steer = |y| -> Steer {\\n\\n if y < 400.0 {\\n\\n Steer::Straight\\n\\n } else if y < 800.0 {\\n\\n Steer::Left\\n\\n } else if y < 1200.0 {\\n\\n Steer::Right\\n\\n } else if y < 1600.0 {\\n\\n Steer::Left\\n\\n } else if y < 2000.0 {\\n\\n Steer::Right\\n\\n } else {\\n\",\n \"file_path\": \"brick/src/main.rs\",\n \"rank\": 22,\n \"score\": 141725.95846020436\n },\n {\n \"content\": \"fn main() -> Result<(), Box<dyn Error>> {\\n\\n // fewer than normal threads, so some cores are left free for the computer user...\\n\\n rayon::ThreadPoolBuilder::new().num_threads(10).build_global().unwrap();\\n\\n\\n\\n let desired_ball_position: Vector3<f32> = brain::play::opponent_goal_shoot_at(&GameState::default());\\n\\n let ball = BallState::default();\\n\\n let desired_contact = brain::play::simple_desired_contact(&ball, &desired_ball_position);\\n\\n\\n\\n let config = SearchConfig {\\n\\n step_duration: 16.0 * TICK,\\n\\n slop: 40.0,\\n\\n max_cost: 10.0,\\n\\n max_iterations: 10_000_000, // allow more iterations before giving up\\n\\n scale_heuristic: 1.0,\\n\\n custom_filter: Some(|_| true), // ignore bounds\\n\\n };\\n\\n\\n\\n let max_speed_r = (MAX_BOOST_SPEED / SPEED_FACTOR).round() as i32;\\n\\n // TODO negative vy\\n\\n //(-max_speed_r..=max_speed_r).into_par_iter().for_each(|speed_r| {\\n\",\n \"file_path\": \"generate-data/src/main.rs\",\n \"rank\": 23,\n \"score\": 140338.8565583713\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\nfn offset_forward_plan(current: &PlayerState) -> Result<Plan, Box<dyn Error>> {\\n\\n let mut offset_player = current.clone();\\n\\n let heading = offset_player.rotation.to_rotation_matrix() * Vector3::new(-1.0, 0.0, 0.0);\\n\\n let clockwise_90_rotation = Rotation3::from_euler_angles(0.0, 0.0, -PI / 2.0);\\n\\n let right = clockwise_90_rotation * heading;\\n\\n offset_player.position += 200.0 * right;\\n\\n\\n\\n forward_plan(&offset_player, 4000.0)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"brick/src/main.rs\",\n \"rank\": 24,\n \"score\": 138902.14923979476\n },\n {\n \"content\": \"fn update_bot_state(game: &GameState, bot: &mut BotState, plan_result: &PlanResult) {\\n\\n if let Some(ref new_plan) = plan_result.plan {\\n\\n if let Some(ref existing_plan) = bot.plan {\\n\\n let new_plan_cost = new_plan.iter().map(|(_, _, cost)| cost).sum::<f32>();\\n\\n\\n\\n let closest_index = brain::play::closest_plan_index(&game.player, &existing_plan);\\n\\n let existing_plan_cost = existing_plan\\n\\n .iter()\\n\\n .enumerate()\\n\\n .filter(|(index, _val)| *index > closest_index)\\n\\n .map(|(_index, (_, _, cost))| cost)\\n\\n .sum::<f32>();\\n\\n\\n\\n // bail, we got a worse plan!\\n\\n if new_plan_cost >= existing_plan_cost && plan_is_valid(&game, &existing_plan) {\\n\\n //println!(\\\"bailing longer plan! existing_plan_cost: {}, new_plan_cost: {}\\\", existing_plan_cost, new_plan_cost);\\n\\n return;\\n\\n }\\n\\n\\n\\n //let existing_diff = bot.cost_diff.abs();\\n\",\n \"file_path\": \"brick/src/main.rs\",\n \"rank\": 25,\n \"score\": 136144.51328504024\n },\n {\n \"content\": \"fn interpolate_scalar(start: f32, end: f32, factor: f32) -> f32 {\\n\\n (1.0 - factor) * start + factor * end\\n\\n}\\n\\n\\n\",\n \"file_path\": \"predict/src/player.rs\",\n \"rank\": 26,\n \"score\": 135997.99627517667\n },\n {\n \"content\": \"// source: https://github.com/samuelpmish/RLUtilities/blob/master/src/simulation/ball.cc#L90\\n\\nfn psyonix_scale_impulse(val: f32) -> f32 {\\n\\n if val <= 500.0 {\\n\\n 0.65\\n\\n } else if val <= 2300.0 {\\n\\n 0.65 - 0.1 * (val - 500.0) / (2300.0 - 500.0)\\n\\n } else {\\n\\n 0.55 - 0.25 * (val - 2300.0) / (4600.0 - 2300.0)\\n\\n }\\n\\n}\\n\\n\\n\\n/// calculates ball state after collision with player. caller of this function must ensure there\\n\\n/// actually *is* a collision between the ball and player, otherwise the result of this is\\n\\n/// unpredictable\\n\",\n \"file_path\": \"predict/src/ball.rs\",\n \"rank\": 27,\n \"score\": 135555.98017042995\n },\n {\n \"content\": \"// source: https://www.youtube.com/watch?v=9uh8-nBlufM\\n\\nfn next_ball_state_rolling(ball: &BallState, time_step: f32) -> BallState {\\n\\n let mut next = ball.clone();\\n\\n\\n\\n let acceleration;\\n\\n if ball.velocity.norm() > SLIDING_SPEED {\\n\\n let heading = ball.velocity / ball.velocity.norm();\\n\\n acceleration = -SLIDING_DECELERATION * heading - AIR_RESISTANCE * next.velocity;\\n\\n } else {\\n\\n acceleration = -ROLLING_RESISTANCE * next.velocity\\n\\n }\\n\\n\\n\\n next.position += time_step * next.velocity;\\n\\n next.velocity += time_step * acceleration;\\n\\n\\n\\n // hard-coding certain values\\n\\n next.velocity.z = 0.0;\\n\\n next.position.z = BALL_COLLISION_RADIUS;\\n\\n\\n\\n next\\n\\n}\\n\\n\\n\",\n \"file_path\": \"predict/src/ball.rs\",\n \"rank\": 28,\n \"score\": 133684.07069944148\n },\n {\n \"content\": \"fn next_ball_state_soaring(ball: &BallState, time_step: f32) -> BallState {\\n\\n let mut next;\\n\\n\\n\\n if let Some(normal) = arena_contact_normal(&ball) {\\n\\n if na::Matrix::dot(&ball.velocity, &normal) < 0.0 {\\n\\n // we're going towards the arena contact, so let's bounce\\n\\n next = calculate_bounce(&ball, &normal);\\n\\n } else {\\n\\n // already bounced\\n\\n next = ball.clone();\\n\\n }\\n\\n } else {\\n\\n next = ball.clone();\\n\\n }\\n\\n\\n\\n // FIXME rl utils uses prev velocity instead of next velocity, we should too?\\n\\n let acceleration = Vector3::new(0.0, 0.0, -GRAVITY) - AIR_RESISTANCE * next.velocity;\\n\\n\\n\\n if next.velocity.norm() > BALL_MAX_SPEED {\\n\\n next.velocity = next.velocity.normalize() * BALL_MAX_SPEED;\\n\",\n \"file_path\": \"predict/src/ball.rs\",\n \"rank\": 29,\n \"score\": 133684.07069944148\n },\n {\n \"content\": \"fn draw_lines(rlbot: &rlbot::RLBot, lines: &[Line], chunk_num: &mut i32) -> Result<(), Box<dyn Error>> {\\n\\n for chunk in lines.chunks(200) {\\n\\n // TODO in case of multiple bricks, add player index * 1000 to the group id\\n\\n let mut group = rlbot.begin_render_group(VISUALIZATION_GROUP_ID + *chunk_num);\\n\\n\\n\\n for &l in chunk.iter() {\\n\\n let p1 = l.0;\\n\\n let p2 = l.1;\\n\\n let p3 = l.2;\\n\\n let color = group.color_rgb((255.0 * p3.x) as u8, (255.0 * p3.y) as u8, (255.0 * p3.z) as u8);\\n\\n group.draw_line_3d((-p1.x, p1.y, p1.z), (-p2.x, p2.y, p2.z), color);\\n\\n }\\n\\n\\n\\n group.render()?;\\n\\n\\n\\n *chunk_num += 1;\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"brick/src/main.rs\",\n \"rank\": 30,\n \"score\": 133070.9461525139\n },\n {\n \"content\": \"pub fn next_ball_state(ball: &BallState, time_step: f32) -> BallState {\\n\\n match find_prediction_category(&ball) {\\n\\n PredictionCategory::Soaring => next_ball_state_soaring(&ball, time_step),\\n\\n PredictionCategory::Rolling => next_ball_state_rolling(&ball, time_step),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"predict/src/ball.rs\",\n \"rank\": 31,\n \"score\": 131631.0769737587\n },\n {\n \"content\": \"// using the current player state as a starting point, apply the plan\\n\\n// FIXME unexplode plan first and calculate using those longer durations for more accurate\\n\\n// values, then explode again\\n\\n// TODO for even more accuracy:\\n\\n// - simulate following the plan while not exactly on it\\n\\n// - simulate turn error correction\\n\\nfn adjusted_plan(player: &PlayerState, plan: Plan) -> Result<Plan, Box<dyn Error>> {\\n\\n let mut adjusted = Vec::with_capacity(plan.len());\\n\\n adjusted.push((player.clone(), BrickControllerState::default(), 0.0));\\n\\n let mut last_player: PlayerState = player.clone();\\n\\n plan.iter().filter(|(_, _, cost)| *cost > 0.0).map(|(_, controller, cost): &(PlayerState, BrickControllerState, f32)| -> Result<(PlayerState, BrickControllerState, f32), Box<dyn Error>> {\\n\\n let next_player = predict::player::next_player_state(&last_player, &controller, *cost);\\n\\n if next_player.is_err() {\\n\\n // print to stderr now since we're swallowing these errors right after this\\n\\n eprintln!(\\\"Warning: failed to adjust plan: {}\\\", next_player.as_ref().unwrap_err());\\n\\n }\\n\\n last_player = next_player?;\\n\\n Ok((last_player.clone(), controller.clone(), *cost))\\n\\n }).filter_map(Result::ok).for_each(|plan_val| {\\n\\n adjusted.push(plan_val);\\n\\n });\\n\\n\\n\\n Ok(adjusted)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"brick/src/main.rs\",\n \"rank\": 32,\n \"score\": 131146.91554685327\n },\n {\n \"content\": \"fn stitch_with_current_plan(game: &GameState, bot: &BotState, plan_result: &mut PlanResult) {\\n\\n if let Some(last_plan) = adjusted_plan_or_fallback(&game, bot) {\\n\\n if let Some(plan) = &plan_result.plan {\\n\\n let closest_index_now = brain::play::closest_plan_index(&game.player, &last_plan);\\n\\n let closest_index_plan = brain::play::closest_plan_index(&plan[0].0, &last_plan);\\n\\n\\n\\n if closest_index_plan < closest_index_now {\\n\\n // we had NOT compensated enough for the logic lag\\n\\n eprintln!(\\\"Aborting plan stitching due to inadequate logic lag compensation\\\");\\n\\n return;\\n\\n }\\n\\n\\n\\n // we had compensated enough for the logic lag, now adjust the plan\\n\\n let mut stitched_plan = last_plan\\n\\n .iter()\\n\\n .cloned()\\n\\n .skip(closest_index_now)\\n\\n .take(closest_index_plan - closest_index_now)\\n\\n .collect::<Vec<_>>();\\n\\n stitched_plan.extend(plan.clone());\\n\",\n \"file_path\": \"brick/src/main.rs\",\n \"rank\": 33,\n \"score\": 130584.05703337654\n },\n {\n \"content\": \"/// factor: number from 0.0 to 1.0 for interpolation between start and end, 0.0 being 100% at\\n\\n/// start, 1.0 being 100% at end. Note that this actually also handles factors outside the 0.0 to\\n\\n/// 1.0 range, in which case it's a linear extrapolation\\n\\nfn interpolate(start: Vector3<f32>, end: Vector3<f32>, factor: f32) -> Vector3<f32> {\\n\\n (1.0 - factor) * start + factor * end\\n\\n}\\n\\n\\n\",\n \"file_path\": \"predict/src/player.rs\",\n \"rank\": 34,\n \"score\": 127672.58337431183\n },\n {\n \"content\": \"fn compare<'a>(controller: BrickControllerState, all_samples: impl Iterator<Item = &'a Vec<PlayerState>>) {\\n\\n let mut position_errors = vec![];\\n\\n let mut velocity_errors = vec![];\\n\\n let mut avz_errors = vec![];\\n\\n let mut max_position_error = 0.0;\\n\\n let mut max_velocity_error = 0.0;\\n\\n let mut max_avz_error = 0.0;\\n\\n\\n\\n for full_sample in all_samples {\\n\\n let mut i = 0;\\n\\n // offset by 32 frames to ensure minimum 32 frames of simulation ahead in the slice\\n\\n while full_sample[i..].len() > NUM_TICKS {\\n\\n let sample = &full_sample[i..];\\n\\n i += 1;\\n\\n\\n\\n let player_start = &sample[0];\\n\\n let player_end = &sample[NUM_TICKS];\\n\\n\\n\\n // we can miss data at the edges, or not be able to extrapolate at the edges. ignore for now\\n\\n // TODO remove all these checks\\n\",\n \"file_path\": \"predict/tests/compare_with_sample_files.rs\",\n \"rank\": 35,\n \"score\": 127625.76234056253\n },\n {\n \"content\": \"pub fn ball_trajectory(ball: &BallState, duration: f32) -> Vec<BallState> {\\n\\n let mut t = 0.0;\\n\\n let mut trajectory = Vec::with_capacity((duration / TICK).ceil() as usize);\\n\\n let mut ball_now = ball.clone();\\n\\n trajectory.push(ball_now);\\n\\n while t < duration {\\n\\n t += TICK;\\n\\n ball_now = next_ball_state(trajectory.last().unwrap(), TICK);\\n\\n trajectory.push(ball_now);\\n\\n }\\n\\n trajectory\\n\\n}\\n\\n\\n\",\n \"file_path\": \"predict/src/ball.rs\",\n \"rank\": 36,\n \"score\": 126973.54273017513\n },\n {\n \"content\": \"// FIXME lot more going in the rl utils now, probably helps handle more types of bounces:\\n\\n// https://github.com/samuelpmish/RLUtilities/blob/master/src/simulation/ball.cc#L36\\n\\nfn calculate_bounce(ball: &BallState, normal: &Unit<Vector3<f32>>) -> BallState {\\n\\n let mut bounced = (*ball).clone();\\n\\n\\n\\n let v_perp = na::Matrix::dot(&ball.velocity, &normal.into_inner()) * normal.into_inner();\\n\\n let v_para = ball.velocity - v_perp;\\n\\n let v_spin = BALL_COLLISION_RADIUS * normal.cross(&ball.angular_velocity); // velocity of edge of ball, relative to ball center\\n\\n let s = v_para + v_spin; // this is the velocity at point of impact (edge of ball) in global coords\\n\\n\\n\\n let ratio = v_perp.norm() / s.norm();\\n\\n\\n\\n let delta_v_perp = -(1.0 + RESTITUTION) * v_perp;\\n\\n let delta_v_para = -f32::min(1.0, Y * ratio) * MU * s;\\n\\n\\n\\n bounced.velocity += delta_v_perp + delta_v_para;\\n\\n bounced.angular_velocity += A * BALL_COLLISION_RADIUS * delta_v_para.cross(&normal);\\n\\n\\n\\n bounced\\n\\n}\\n\\n\\n\",\n \"file_path\": \"predict/src/ball.rs\",\n \"rank\": 37,\n \"score\": 126973.54273017513\n },\n {\n \"content\": \"#[test]\\n\\nfn test_throttle_straight() {\\n\\n let mut controller = BrickControllerState::default();\\n\\n controller.throttle = Throttle::Forward;\\n\\n let all_samples = predict::sample::THROTTLE_STRAIGHT_ALL.iter();\\n\\n compare(controller, all_samples);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"predict/tests/compare_with_sample_files.rs\",\n \"rank\": 38,\n \"score\": 126776.07604328476\n },\n {\n \"content\": \"#[test]\\n\\nfn test_boost_left() {\\n\\n let mut controller = BrickControllerState::default();\\n\\n controller.steer = Steer::Left;\\n\\n controller.boost = true;\\n\\n let all_samples = predict::sample::BOOST_LEFT_ALL.iter();\\n\\n compare(controller, all_samples);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"predict/tests/compare_with_sample_files.rs\",\n \"rank\": 39,\n \"score\": 126776.07604328476\n },\n {\n \"content\": \"#[test]\\n\\nfn test_throttle_right() {\\n\\n let mut controller = BrickControllerState::default();\\n\\n controller.steer = Steer::Right;\\n\\n controller.throttle = Throttle::Forward;\\n\\n let all_samples = predict::sample::THROTTLE_RIGHT_ALL.iter();\\n\\n compare(controller, all_samples);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"predict/tests/compare_with_sample_files.rs\",\n \"rank\": 40,\n \"score\": 126776.07604328476\n },\n {\n \"content\": \"#[test]\\n\\nfn test_boost_straight() {\\n\\n let mut controller = BrickControllerState::default();\\n\\n controller.boost = true;\\n\\n let all_samples = predict::sample::BOOST_STRAIGHT_ALL.iter();\\n\\n compare(controller, all_samples);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"predict/tests/compare_with_sample_files.rs\",\n \"rank\": 41,\n \"score\": 126776.07604328476\n },\n {\n \"content\": \"#[test]\\n\\nfn test_boost_right() {\\n\\n let mut controller = BrickControllerState::default();\\n\\n controller.steer = Steer::Right;\\n\\n controller.boost = true;\\n\\n let all_samples = predict::sample::BOOST_RIGHT_ALL.iter();\\n\\n compare(controller, all_samples);\\n\\n}\\n\",\n \"file_path\": \"predict/tests/compare_with_sample_files.rs\",\n \"rank\": 42,\n \"score\": 126776.07604328476\n },\n {\n \"content\": \"#[test]\\n\\nfn test_throttle_left() {\\n\\n let mut controller = BrickControllerState::default();\\n\\n controller.steer = Steer::Left;\\n\\n controller.throttle = Throttle::Forward;\\n\\n let all_samples = predict::sample::THROTTLE_LEFT_ALL.iter();\\n\\n compare(controller, all_samples);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"predict/tests/compare_with_sample_files.rs\",\n \"rank\": 43,\n \"score\": 126776.07604328476\n },\n {\n \"content\": \"// rip-off of: https://github.com/samuelpmish/RLUtilities/blob/master/src/simulation/ball.cc#L82\\n\\npub fn closest_point_for_collision(ball: &BallState, player: &PlayerState) -> Vector3<f32> {\\n\\n let mut local_pos = player.rotation.to_rotation_matrix().inverse() * (ball.position - player.hitbox_center());\\n\\n local_pos.x = na::clamp(local_pos.x, -CAR_DIMENSIONS.x / 2.0, CAR_DIMENSIONS.x / 2.0);\\n\\n local_pos.y = na::clamp(local_pos.y, -CAR_DIMENSIONS.y / 2.0, CAR_DIMENSIONS.y / 2.0);\\n\\n local_pos.z = na::clamp(local_pos.z, -CAR_DIMENSIONS.z / 2.0, CAR_DIMENSIONS.z / 2.0);\\n\\n player.hitbox_center() + player.rotation.to_rotation_matrix() * local_pos\\n\\n}\\n\\n\\n\",\n \"file_path\": \"predict/src/player.rs\",\n \"rank\": 44,\n \"score\": 124306.60083388686\n },\n {\n \"content\": \"fn round_player_state(player: &PlayerState, step_duration: f32, speed: f32) -> RoundedPlayerState {\\n\\n // we're using the rounded speed to determine the grid size. we want a good bit of tolerance for\\n\\n // this, if we relax the rounded velocity equality check. or some other logic that will ensure\\n\\n // same grid for different player states that we want to match\\n\\n let rounding_factor = 1.0; // TODO tune. for both correctness AND speed!\\n\\n let mut rounded_speed = (speed / rounding_factor).round();\\n\\n if rounded_speed == 0.0 {\\n\\n rounded_speed = 0.5;\\n\\n }\\n\\n let rounded_speed = rounded_speed * rounding_factor;\\n\\n\\n\\n let grid_size = step_duration * rounded_speed;\\n\\n //let velocity_margin = 250.0; // TODO tune\\n\\n let (_roll, _pitch, yaw) = player.rotation.euler_angles();\\n\\n\\n\\n RoundedPlayerState {\\n\\n // TODO we could have individual grid sizes for x/y/z based on vx/vy/vz. not sure it's\\n\\n // worth it.\\n\\n x: (grid_size * (player.position.x / grid_size).round()) as i16,\\n\\n y: (grid_size * (player.position.y / grid_size).round()) as i16,\\n\",\n \"file_path\": \"brain/src/plan.rs\",\n \"rank\": 45,\n \"score\": 123786.24154692181\n },\n {\n \"content\": \"pub fn index_all_samples<'a>(all_samples: &'a [Vec<PlayerState>]) -> SampleMap<'a> {\\n\\n let mut indexed = SampleMap::default();\\n\\n\\n\\n for sample in all_samples {\\n\\n if sample.len() < MIN_SAMPLE_LENGTH {\\n\\n println!(\\\"bad sample: {:?}\\\", sample[0]);\\n\\n }\\n\\n\\n\\n let mut j = 0;\\n\\n\\n\\n while sample[j..].len() >= MIN_SAMPLE_LENGTH {\\n\\n let key = normalized_player_rounded(&sample[j]);\\n\\n\\n\\n match indexed.entry(key) {\\n\\n Vacant(e) => {\\n\\n e.insert(&sample[j..]);\\n\\n }\\n\\n Occupied(mut e) => {\\n\\n // replace the sample in case we have one closer to the intended normalized\\n\\n // velocity value\\n\",\n \"file_path\": \"predict/src/sample.rs\",\n \"rank\": 46,\n \"score\": 121820.00587066825\n },\n {\n \"content\": \"fn move_ball_out_of_the_way(rlbot: &rlbot::RLBot) -> Result<(), Box<dyn Error>> {\\n\\n let position = rlbot::Vector3Partial::new().x(3800.0).y(4800.0).z(98.0);\\n\\n\\n\\n let physics = rlbot::DesiredPhysics::new().location(position);\\n\\n\\n\\n let ball_state = rlbot::DesiredBallState::new().physics(physics);\\n\\n\\n\\n let desired_game_state = rlbot::DesiredGameState::new().ball_state(ball_state);\\n\\n\\n\\n rlbot.set_game_state(&desired_game_state)?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"record/src/main.rs\",\n \"rank\": 47,\n \"score\": 117982.18694526449\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\nfn move_ball_out_of_the_way(rlbot: &rlbot::RLBot) -> Result<(), Box<dyn Error>> {\\n\\n let position = rlbot::Vector3Partial::new().x(3800.0).y(4800.0).z(98.0);\\n\\n let physics = rlbot::DesiredPhysics::new().location(position);\\n\\n let ball_state = rlbot::DesiredBallState::new().physics(physics);\\n\\n let desired_game_state = rlbot::DesiredGameState::new().ball_state(ball_state);\\n\\n rlbot.set_game_state(&desired_game_state)?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"brick/src/main.rs\",\n \"rank\": 48,\n \"score\": 117982.18694526449\n },\n {\n \"content\": \"/// returns normal at contact point if ball is currently colliding with the arena\\n\\npub fn arena_contact_normal(ball: &BallState) -> Option<Unit<Vector3<f32>>> {\\n\\n let sphere = ncollide::shape::Ball::new(BALL_COLLISION_RADIUS);\\n\\n let ball_pos = Isometry3::new(ball.position, na::zero()); // TODO if we want to handle cube ball, track and pass on the rotation\\n\\n let arena_pos = Isometry3::new(na::zero(), na::zero());\\n\\n\\n\\n let margin = 0.0;\\n\\n let contact = ncollide::query::contact(&arena_pos, &(*ARENA), &ball_pos, &sphere, margin);\\n\\n\\n\\n contact.map(|c| c.normal)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"predict/src/ball.rs\",\n \"rank\": 49,\n \"score\": 117457.24844638104\n },\n {\n \"content\": \"fn squared_distance(a: f32, b: f32) -> f32 {\\n\\n (b - a).powf(2.0)\\n\\n}\\n\\n\\n\\npub(crate) fn knn_distance(a: &[f32], b: &[f32]) -> f32 {\\n\\n squared_distance(a[0], b[0]) // x\\n\\n + squared_distance(a[1], b[1]) // y\\n\\n // FIXME we don't set these in generate-data // + SCALE_VELOCITY_DISTANCE * squared_distance(a[2], b[2]) // vx\\n\\n + SCALE_VELOCITY_DISTANCE * squared_distance(a[3], b[3]) // vy\\n\\n + scaled_circular_distance(a[4], b[4]).powf(2.0) // yaw\\n\\n}\\n\\n\\n\\nimpl KnnHeuristic {\\n\\n pub fn try_new(path: &str) -> Result<Self, Box<dyn Error>> {\\n\\n let mut tree = KdTree::new(KNN_DIMENSIONS);\\n\\n\\n\\n let mut rdr = csv::ReaderBuilder::new().has_headers(false).from_reader(File::open(path)?);\\n\\n\\n\\n for record in rdr.records() {\\n\\n let record = record?;\\n\",\n \"file_path\": \"heuristic/src/knn.rs\",\n \"rank\": 50,\n \"score\": 117071.44103866865\n },\n {\n \"content\": \"// +PI and -PI are the same angle, so the distance needs to take that into account!\\n\\nfn scaled_circular_distance(a: f32, b: f32) -> f32 {\\n\\n SCALE_CIRCULAR_DISTANCE * (a - b).abs().min(2.0 * PI + a - b).min(2.0 * PI + b - a)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"heuristic/src/knn.rs\",\n \"rank\": 51,\n \"score\": 115256.24647769672\n },\n {\n \"content\": \"// scale to [0, 1]\\n\\nfn scale(val: f32, min: f32, max: f32) -> f32 {\\n\\n (val - min) / (max - min)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"heuristic/src/neural.rs\",\n \"rank\": 52,\n \"score\": 114744.14763777424\n },\n {\n \"content\": \"/// updates our game state, which is a representation of the packet/ticket, but with our own data\\n\\n/// types etc\\n\\npub fn update_game_state(game_state: &mut GameState, tick: &rlbot::GameTickPacket, player_index: usize, frame: u32) {\\n\\n let ball = tick.ball.as_ref().expect(\\\"Missing ball\\\");\\n\\n let players = &tick.players;\\n\\n let player = players.get(player_index).expect(\\\"Missing player\\\");\\n\\n\\n\\n let bp = &ball.physics;\\n\\n let bl = &bp.location;\\n\\n let bv = &bp.velocity;\\n\\n let bav = &bp.angular_velocity;\\n\\n game_state.ball.position = Vector3::new(-bl.x, bl.y, bl.z); // x should be positive towards right, it only makes sense\\n\\n game_state.ball.velocity = Vector3::new(-bv.x, bv.y, bv.z); // x should be positive towards right, it only makes sense\\n\\n game_state.ball.angular_velocity = Vector3::new(-bav.x, bav.y, bav.z); // x should be positive towards right, it only makes sense\\n\\n\\n\\n let pp = &player.physics;\\n\\n let pl = &pp.location;\\n\\n let pv = &pp.velocity;\\n\\n let pav = &pp.angular_velocity;\\n\\n let pr = &pp.rotation;\\n\\n game_state.player.position = Vector3::new(-pl.x, pl.y, pl.z); // x should be positive towards right, it only makes sense\\n\\n game_state.player.velocity = Vector3::new(-pv.x, pv.y, pv.z); // x should be positive towards right, it only makes sense\\n\",\n \"file_path\": \"state/src/lib.rs\",\n \"rank\": 53,\n \"score\": 114361.92730102448\n },\n {\n \"content\": \"pub fn normalized_player_rounded(player: &PlayerState) -> NormalizedPlayerState {\\n\\n let lv = player.local_velocity();\\n\\n NormalizedPlayerState {\\n\\n local_vx: (lv.x / GROUND_SPEED_GRID_FACTOR).round() as i16,\\n\\n local_vy: (lv.y / GROUND_SPEED_GRID_FACTOR).round() as i16,\\n\\n avz: (player.angular_velocity.z / GROUND_AVZ_GRID_FACTOR).round() as i16,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"predict/src/sample.rs\",\n \"rank\": 54,\n \"score\": 112433.1908980073\n },\n {\n \"content\": \"// NOTE min/max values must match those used when scaling training data!\\n\\nfn scale_pos(val: f32) -> f32 {\\n\\n scale(val, -10_000.0, 10_000.0)\\n\\n}\\n\",\n \"file_path\": \"heuristic/src/neural.rs\",\n \"rank\": 55,\n \"score\": 112205.81032495532\n },\n {\n \"content\": \"fn scale_avel(val: f32) -> f32 {\\n\\n scale(val, -6.0, 6.0)\\n\\n}\\n\",\n \"file_path\": \"heuristic/src/neural.rs\",\n \"rank\": 56,\n \"score\": 112198.88311425704\n },\n {\n \"content\": \"fn scale_rot(val: f32) -> f32 {\\n\\n scale(val, -3.2, 3.2)\\n\\n}\\n\\n\\n\\nimpl HeuristicModel for NeuralHeuristic {\\n\\n fn unscaled_heuristic(&mut self, players: &[PlayerState], costs: &mut [f32]) -> Result<(), Box<dyn Error>> {\\n\\n let mut players_tensor = Tensor::new(&[players.len() as u64, 12u64]);\\n\\n for (i, player) in players.iter().enumerate() {\\n\\n let offset = i * 12;\\n\\n // FIXME use normalization rotation\\n\\n let pos = player.position; //self.normalization_rotation * (player.position - self.ball_position);\\n\\n players_tensor[offset + 0] = scale_pos(pos.x);\\n\\n players_tensor[offset + 1] = scale_pos(pos.y);\\n\\n players_tensor[offset + 2] = scale_pos(pos.z);\\n\\n\\n\\n // FIXME use normalization rotation\\n\\n let vel = player.velocity; //self.normalization_rotation * player.velocity;\\n\\n players_tensor[offset + 3] = scale_vel(vel.x);\\n\\n players_tensor[offset + 4] = scale_vel(vel.y);\\n\\n players_tensor[offset + 5] = scale_vel(vel.z);\\n\",\n \"file_path\": \"heuristic/src/neural.rs\",\n \"rank\": 57,\n \"score\": 112198.88311425704\n },\n {\n \"content\": \"fn scale_vel(val: f32) -> f32 {\\n\\n scale(val, -2300.0, 2300.0)\\n\\n}\\n\",\n \"file_path\": \"heuristic/src/neural.rs\",\n \"rank\": 58,\n \"score\": 112198.88311425704\n },\n {\n \"content\": \"/// modifies the plan to use finer-grained steps\\n\\npub fn explode_plan(plan: &Option<Plan>) -> Result<Option<Plan>, Box<dyn Error>> {\\n\\n if let Some(ref plan) = plan {\\n\\n if plan.get(0).is_none() {\\n\\n return Ok(None);\\n\\n }\\n\\n let mut exploded_plan = Vec::with_capacity(plan.len()); // will be at least this long\\n\\n exploded_plan.push(plan[0].clone());\\n\\n\\n\\n // for every plan segment, we expand within that segment. using small ticks repeated causes\\n\\n // the errors to accumulate rapidly, so we start over with each plan segment starting with\\n\\n // a more accurate base value\\n\\n for i in 1..plan.len() {\\n\\n let num_ticks = (plan[i].2 / TICK).round() as i32;\\n\\n let num_steps = num_ticks / TICKS_PER_STEP;\\n\\n #[allow(clippy::modulo_one)]\\n\\n let remaining_ticks = num_ticks % TICKS_PER_STEP;\\n\\n\\n\\n // NOTE since the controller value in each plan tuple is the controller that needs to\\n\\n // be applied to the *previous* player state in order to reach the player state in the\\n\\n // current tuple, we get the player from the period index and apply the controller from\\n\",\n \"file_path\": \"brain/src/plan.rs\",\n \"rank\": 59,\n \"score\": 108663.535782413\n },\n {\n \"content\": \"/// tuple of (translation, acceleration, angular_acceleration, rotation)\\n\\ntype PlayerPrediction = (Vector3<f32>, Vector3<f32>, Vector3<f32>, Rotation3<f32>);\\n\\n\\n\",\n \"file_path\": \"predict/src/player.rs\",\n \"rank\": 60,\n \"score\": 108462.61216926313\n },\n {\n \"content\": \"pub fn next_input(player: &PlayerState, bot: &mut BotState) -> rlbot::ControllerState {\\n\\n if let Some(ref plan) = bot.plan {\\n\\n // we need to take into account the inputs previously sent that will be processed\\n\\n // prior to finding where we are. instead of passing the current player, apply\\n\\n // LAG_FRAMES inputs that are not yet applied\\n\\n let player = player.lag_compensated_player(&bot.controller_history, LAG_FRAMES);\\n\\n let index = closest_plan_index(&player, &plan);\\n\\n\\n\\n // we need to look one past closest index to see the controller to reach next position\\n\\n if index < plan.len() - 1 {\\n\\n let current_heading = player.rotation.to_rotation_matrix() * Vector3::new(-1.0, 0.0, 0.0);\\n\\n let (closest_player, _, _) = &plan[index];\\n\\n let (_next_player, controller, _) = &plan[index + 1];\\n\\n //println!(\\\"index: {}, controller.steer: {:?}\\\", index, controller.steer);\\n\\n\\n\\n // FIXME we should account for differences in the tick and interpolate between the two\\n\\n // closest indices to get the real closet delta/distance\\n\\n let closest_delta = player.position - closest_player.position;\\n\\n let closest_distance = closest_delta.norm();\\n\\n let clockwise_90_rotation = Rotation3::from_euler_angles(0.0, 0.0, PI / 2.0);\\n\",\n \"file_path\": \"brain/src/play.rs\",\n \"rank\": 61,\n \"score\": 106432.37558073991\n },\n {\n \"content\": \"pub fn opponent_goal_shoot_at(game: &GameState) -> Vector3<f32> {\\n\\n // TODO calculate which part of the goal is hardest for the opponent to reach\\n\\n match game.player.team {\\n\\n // FIXME check if we have this right...\\n\\n Team::Blue => Vector3::new(0.0, BACK_WALL_DISTANCE, GOAL_Z / 2.0),\\n\\n Team::Orange => Vector3::new(0.0, -BACK_WALL_DISTANCE, GOAL_Z / 2.0),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"brain/src/play.rs\",\n \"rank\": 62,\n \"score\": 104433.25081872902\n },\n {\n \"content\": \"fn ground_turn_matching_transformation(\\n\\n normalized: sample::NormalizedPlayerState,\\n\\n controller: &BrickControllerState,\\n\\n time_step: f32,\\n\\n xrange: i16,\\n\\n yrange: i16,\\n\\n skipx: Option<i16>,\\n\\n skipy: Option<i16>,\\n\\n) -> Option<&'static driving_model::PlayerTransformation> {\\n\\n // based on current player state, and steer, throttle and boost, gets the right transformation,\\n\\n // with some wiggle room based on xrange/yrange\\n\\n let mut local_normalized = normalized;\\n\\n let mut transformation: Option<&'static driving_model::PlayerTransformation> = None;\\n\\n\\n\\n // step_by is not yet stabilized... so using plain loops instead\\n\\n let ystep = if yrange < 0 { -1 } else { 1 };\\n\\n let xstep = if xrange < 0 { -1 } else { 1 };\\n\\n let mut dy = 0;\\n\\n 'outer: loop {\\n\\n let mut dx = 0;\\n\",\n \"file_path\": \"predict/src/player.rs\",\n \"rank\": 63,\n \"score\": 103222.67247138472\n },\n {\n \"content\": \"/// for now, doesn't handle landing sideways or at any angle really, nor drifting. collision with\\n\\n/// arena is also not handled. collisions with other players or ball will never be handled here\\n\\nfn next_player_state_grounded(\\n\\n current: &PlayerState,\\n\\n controller: &BrickControllerState,\\n\\n time_step: f32,\\n\\n) -> Result<PlayerState, String> {\\n\\n let mut next = (*current).clone();\\n\\n\\n\\n let (translation, velocity, angular_velocity, rotation) = ground_turn_prediction(¤t, &controller, time_step)?;\\n\\n\\n\\n // because we extrapolate around the edges of our measurements, it's possible we calculate\\n\\n // a velocity beyond what's possible in the game. so we must scale it down here.\\n\\n let scale = if velocity.norm() > MAX_BOOST_SPEED {\\n\\n MAX_BOOST_SPEED / velocity.norm()\\n\\n } else {\\n\\n 1.0\\n\\n };\\n\\n\\n\\n // XXX NOTE using the velocity scaling for the translation isn't correct at all, but it's\\n\\n // likely to be at least proportional, and likely closer to correct than not scaling at all.\\n\\n next.position = current.position + scale * translation;\\n\\n next.position.z = RESTING_Z; // avoid drifting upward/downward when we're just driving on the ground!\\n\\n next.velocity = scale * velocity;\\n\\n next.angular_velocity = angular_velocity;\\n\\n next.rotation = UnitQuaternion::from_rotation_matrix(&rotation); // was easier to just return the end rotation directly. TODO stop using quaternion\\n\\n\\n\\n Ok(next)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"predict/src/player.rs\",\n \"rank\": 64,\n \"score\": 101572.3151671092\n },\n {\n \"content\": \"fn find_prediction_category(ball: &BallState) -> PredictionCategory {\\n\\n // NOTE using the \\\"soaring\\\" calculations when interacting with wall/curves, even when rolling,\\n\\n // since we at least have arena collision for that and will get a better prediction even if not\\n\\n // 100% accurate\\n\\n let in_air = ball.position.z > BALL_COLLISION_RADIUS || ball.velocity.z.abs() < 1.0;\\n\\n let on_side_curve = ball.position.x.abs() > SIDE_CURVE_DISTANCE;\\n\\n let on_back_curve = ball.position.y.abs() > BACK_CURVE_DISTANCE;\\n\\n if in_air || on_side_curve || on_back_curve {\\n\\n PredictionCategory::Soaring\\n\\n } else {\\n\\n PredictionCategory::Rolling\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"predict/src/ball.rs\",\n \"rank\": 65,\n \"score\": 100987.15522134882\n },\n {\n \"content\": \"pub fn next_player_state(\\n\\n current: &PlayerState,\\n\\n controller: &BrickControllerState,\\n\\n time_step: f32,\\n\\n) -> Result<PlayerState, String> {\\n\\n let mut next_player = match find_prediction_category(¤t) {\\n\\n PredictionCategory::Ground => next_player_state_grounded(¤t, &controller, time_step)?,\\n\\n //PredictionCategory::Ground2 => next_velocity_grounded2(¤t, &controller, time_step),\\n\\n //PredictionCategory::Wall => next_velocity_walled(¤t, &controller, time_step),\\n\\n //PredictionCategory::Ceiling => next_velocity_ceilinged(¤t, &controller, time_step),\\n\\n //PredictionCategory::CurveWall => next_velocity_curve_walled(¤t, &controller, time_step),\\n\\n //PredictionCategory::Air => next_velocity_flying(¤t, &controller, time_step),\\n\\n };\\n\\n\\n\\n if next_player.position.z < CAR_DIMENSIONS.z / 2.0 {\\n\\n next_player.position.z = CAR_DIMENSIONS.z / 2.0;\\n\\n }\\n\\n\\n\\n Ok(next_player)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"predict/src/player.rs\",\n \"rank\": 66,\n \"score\": 99963.0474230132\n },\n {\n \"content\": \"pub fn update_gamepad(gilrs: &mut Gilrs, gamepad: &mut Gamepad) {\\n\\n while let Some(Event { event, .. }) = gilrs.next_event() {\\n\\n match event {\\n\\n EventType::ButtonChanged(button, value, _code) => match button {\\n\\n Button::RightTrigger2 => gamepad.rt2 = value,\\n\\n Button::LeftTrigger2 => gamepad.lt2 = value,\\n\\n _ => {}\\n\\n },\\n\\n EventType::ButtonPressed(button, _code) => match button {\\n\\n Button::Select => gamepad.select_toggled = !gamepad.select_toggled,\\n\\n Button::RightTrigger => gamepad.rt = true,\\n\\n Button::LeftTrigger => gamepad.lt = true,\\n\\n Button::North => gamepad.north = true,\\n\\n Button::East => gamepad.east = true,\\n\\n Button::South => gamepad.south = true,\\n\\n Button::West => gamepad.west = true,\\n\\n _ => {}\\n\\n },\\n\\n EventType::ButtonReleased(button, _code) => match button {\\n\\n Button::RightTrigger => gamepad.rt = false,\\n\",\n \"file_path\": \"passthrough/src/lib.rs\",\n \"rank\": 67,\n \"score\": 97728.00180727622\n },\n {\n \"content\": \"pub fn find_prediction_category(_current: &PlayerState) -> PredictionCategory {\\n\\n // hard-coded the only thing we can handle right now\\n\\n PredictionCategory::Ground\\n\\n}\\n\\n\\n\",\n \"file_path\": \"predict/src/player.rs\",\n \"rank\": 68,\n \"score\": 97641.80599584113\n },\n {\n \"content\": \"pub fn normalized_player(player: &PlayerState, ceil_vx: bool, ceil_vy: bool) -> NormalizedPlayerState {\\n\\n let avz = (player.angular_velocity.z / GROUND_AVZ_GRID_FACTOR).round() as i16;\\n\\n\\n\\n let lv = player.local_velocity();\\n\\n\\n\\n let mut local_vx = if ceil_vx {\\n\\n (lv.x / GROUND_SPEED_GRID_FACTOR).ceil() as i16\\n\\n } else {\\n\\n (lv.x / GROUND_SPEED_GRID_FACTOR).floor() as i16\\n\\n };\\n\\n\\n\\n let mut local_vy = if ceil_vy {\\n\\n (lv.y / GROUND_SPEED_GRID_FACTOR).ceil() as i16\\n\\n } else {\\n\\n (lv.y / GROUND_SPEED_GRID_FACTOR).floor() as i16\\n\\n };\\n\\n\\n\\n // scale down if we're looking at something beyond the limits after a ceil or something\\n\\n let max = ((MAX_BOOST_SPEED / GROUND_SPEED_GRID_FACTOR).round() as i32).pow(2);\\n\\n let sum = (local_vy as i32).pow(2) + (local_vx as i32).pow(2);\\n\\n if sum > max {\\n\\n let ratio = (MAX_BOOST_SPEED / GROUND_SPEED_GRID_FACTOR) / (sum as f32).sqrt();\\n\\n local_vx = (local_vx as f32 * ratio).round() as i16;\\n\\n local_vy = (local_vy as f32 * ratio).round() as i16;\\n\\n }\\n\\n\\n\\n NormalizedPlayerState { local_vx, local_vy, avz }\\n\\n}\\n\",\n \"file_path\": \"predict/src/sample.rs\",\n \"rank\": 69,\n \"score\": 96652.66721464458\n },\n {\n \"content\": \"fn is_hidden(entry: &DirEntry) -> bool {\\n\\n entry.file_name().to_str().map(|s| s.starts_with('.')).unwrap_or(false)\\n\\n}\\n\\n\\n\\npub type SampleMap<'a> = HashMap<NormalizedPlayerState, &'a [PlayerState], MyHasher>;\\n\\n\\n\\n//fn continuous_sample(sample: &[PlayerState]) {\\n\\n// let mut last = sample[0];\\n\\n// for player in sample[1..] {\\n\\n// let predicted = player.position + TICK * last.velocity;\\n\\n// if last.velocity.x()\\n\\n//\\n\\n// last = player;\\n\\n// }\\n\\n// return true\\n\\n//}\\n\\n\\n\",\n \"file_path\": \"predict/src/sample.rs\",\n \"rank\": 70,\n \"score\": 95338.77090267272\n },\n {\n \"content\": \"extern crate predict;\\n\\nextern crate state;\\n\\n\\n\\nuse state::*;\\n\\nuse std::cmp::Ordering;\\n\\n\\n\\nconst NUM_TICKS: usize = 16;\\n\\n\\n\",\n \"file_path\": \"predict/tests/compare_with_sample_files.rs\",\n \"rank\": 71,\n \"score\": 91530.72803642876\n },\n {\n \"content\": \" if (player_start.angular_velocity.z.abs() / 0.2) >= 20.0\\n\\n || player_start.local_velocity().y < 50.0\\n\\n || player_start.local_velocity().x.abs() > 1000.0\\n\\n {\\n\\n continue;\\n\\n }\\n\\n\\n\\n let predicted_player_end =\\n\\n predict::player::next_player_state(&player_start, &controller, NUM_TICKS as f32 * TICK)\\n\\n .expect(\\\"failed prediction\\\");\\n\\n let position_error = (predicted_player_end.position - player_end.position).norm();\\n\\n let velocity_error = (predicted_player_end.velocity - player_end.velocity).norm();\\n\\n let avz_error = (predicted_player_end.angular_velocity.z - player_end.angular_velocity.z).abs();\\n\\n\\n\\n position_errors.push(position_error);\\n\\n velocity_errors.push(velocity_error);\\n\\n avz_errors.push(avz_error);\\n\\n\\n\\n if position_error > max_position_error {\\n\\n max_position_error = position_error;\\n\",\n \"file_path\": \"predict/tests/compare_with_sample_files.rs\",\n \"rank\": 72,\n \"score\": 91522.34966898417\n },\n {\n \"content\": \" println!(\\\"player_start normalized: {:?}\\\", normalized);\\n\\n println!(\\\"player_start: {:?}\\\", player_start);\\n\\n println!(\\\"expected player_end: {:?}\\\", player_end);\\n\\n println!(\\\"predicted player_end: {:?}\\\", predicted_player_end);\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n println!();\\n\\n println!();\\n\\n println!(\\\"---------------------------------------------------------\\\");\\n\\n println!(\\\"{:?}\\\", controller);\\n\\n println!(\\\"max position error: {}\\\", max_position_error);\\n\\n println!(\\\"rms position error: {}\\\", rms(&position_errors));\\n\\n println!(\\n\\n \\\"50th percentile position error: {}\\\",\\n\\n percentile_value(&mut position_errors, 50.0)\\n\\n );\\n\\n println!(\\n\\n \\\"95th percentile position error: {}\\\",\\n\",\n \"file_path\": \"predict/tests/compare_with_sample_files.rs\",\n \"rank\": 73,\n \"score\": 91517.44336597652\n },\n {\n \"content\": \" }\\n\\n if velocity_error > max_velocity_error {\\n\\n max_velocity_error = velocity_error;\\n\\n }\\n\\n if avz_error > max_avz_error {\\n\\n max_avz_error = avz_error;\\n\\n }\\n\\n\\n\\n //println!(\\\"position error: {}\\\", position_error);\\n\\n //if position_error > 20.0 {\\n\\n if velocity_error > 40.0 {\\n\\n let normalized = predict::sample::normalized_player_rounded(&player_start);\\n\\n println!();\\n\\n println!(\\\"---------------------------------------------------------\\\");\\n\\n println!(\\n\\n \\\"position error: {}, velocity_error: {}, avz_error: {}\\\",\\n\\n position_error, velocity_error, avz_error\\n\\n );\\n\\n let v = player_start.velocity;\\n\\n println!(\\\"rg '{},{},{}' -- *.csv\\\", v.x, v.y, v.z);\\n\",\n \"file_path\": \"predict/tests/compare_with_sample_files.rs\",\n \"rank\": 74,\n \"score\": 91517.16905277994\n },\n {\n \"content\": \" percentile_value(&mut position_errors, 95.0)\\n\\n );\\n\\n println!(\\n\\n \\\"99th percentile position error: {}\\\",\\n\\n percentile_value(&mut position_errors, 99.0)\\n\\n );\\n\\n println!(\\n\\n \\\"99.9th percentile position error: {}\\\",\\n\\n percentile_value(&mut position_errors, 99.9)\\n\\n );\\n\\n\\n\\n println!(\\\"max velocity error: {}\\\", max_velocity_error);\\n\\n println!(\\\"rms velocity error: {}\\\", rms(&velocity_errors));\\n\\n println!(\\n\\n \\\"50th percentile velocity error: {}\\\",\\n\\n percentile_value(&mut velocity_errors, 50.0)\\n\\n );\\n\\n println!(\\n\\n \\\"95th percentile velocity error: {}\\\",\\n\\n percentile_value(&mut velocity_errors, 95.0)\\n\",\n \"file_path\": \"predict/tests/compare_with_sample_files.rs\",\n \"rank\": 75,\n \"score\": 91516.95228822879\n },\n {\n \"content\": \" assert!(max_position_error < 20.0);\\n\\n assert!(rms(&position_errors) < 0.6);\\n\\n assert!(percentile_value(&mut position_errors, 50.0) < 0.5);\\n\\n assert!(percentile_value(&mut position_errors, 95.0) < 1.5);\\n\\n assert!(percentile_value(&mut position_errors, 99.0) < 2.5);\\n\\n assert!(percentile_value(&mut position_errors, 99.9) < 7.5);\\n\\n\\n\\n assert!(rms(&velocity_errors) < 9.5);\\n\\n assert!(rms(&avz_errors) < 0.15);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"predict/tests/compare_with_sample_files.rs\",\n \"rank\": 76,\n \"score\": 91516.93651574614\n },\n {\n \"content\": \" );\\n\\n println!(\\n\\n \\\"99th percentile velocity error: {}\\\",\\n\\n percentile_value(&mut velocity_errors, 99.0)\\n\\n );\\n\\n println!(\\n\\n \\\"99.9th percentile velocity error: {}\\\",\\n\\n percentile_value(&mut velocity_errors, 99.9)\\n\\n );\\n\\n\\n\\n println!(\\\"max avz error: {}\\\", max_avz_error);\\n\\n println!(\\\"rms avz error: {}\\\", rms(&avz_errors));\\n\\n println!(\\\"50th percentile avz error: {}\\\", percentile_value(&mut avz_errors, 50.0));\\n\\n println!(\\\"95th percentile avz error: {}\\\", percentile_value(&mut avz_errors, 95.0));\\n\\n println!(\\\"99th percentile avz error: {}\\\", percentile_value(&mut avz_errors, 99.0));\\n\\n println!(\\\"99.9th percentile avz error: {}\\\", percentile_value(&mut avz_errors, 99.9));\\n\\n println!();\\n\\n println!();\\n\\n\\n\\n // TODO investigate the worst offenders and reduce these values\\n\",\n \"file_path\": \"predict/tests/compare_with_sample_files.rs\",\n \"rank\": 77,\n \"score\": 91516.80251945769\n },\n {\n \"content\": \"fn update_simulation_visualization(bot: &BotState, plan_result: &PlanResult) {\\n\\n let PlanResult {\\n\\n plan,\\n\\n visualization_lines: lines,\\n\\n visualization_points: points,\\n\\n ..\\n\\n } = plan_result;\\n\\n\\n\\n let mut visualization_lines = LINES.write().unwrap();\\n\\n visualization_lines.clear();\\n\\n\\n\\n // lines directly from plan result\\n\\n visualization_lines.append(&mut lines.clone());\\n\\n\\n\\n // white line showing best planned path\\n\\n if let Some(ref plan) = bot.plan {\\n\\n visualization_lines.append(&mut plan_lines(&plan, Point3::new(1.0, 1.0, 1.0)));\\n\\n }\\n\\n\\n\\n // blue line showing most recently calculated path\\n\",\n \"file_path\": \"brick/src/main.rs\",\n \"rank\": 78,\n \"score\": 91008.26187065193\n },\n {\n \"content\": \"/// guess best point on ball to hit, get the heading at that point\\n\\npub fn simple_desired_contact(ball: &BallState, desired_ball_position: &Vector3<f32>) -> DesiredContact {\\n\\n let desired_vector = Unit::new_normalize(desired_ball_position - ball.position);\\n\\n let desired_velocity = 3000.0 * desired_vector.into_inner();\\n\\n let velocity_delta = desired_velocity - ball.velocity;\\n\\n\\n\\n // this is pretty crude, doesn't even consider that the ball will undergo gravity after the\\n\\n // hit! but should be good enough for us here for now\\n\\n let impulse_direction = Unit::new_normalize(velocity_delta);\\n\\n let ball_normal = -1.0 * impulse_direction.into_inner();\\n\\n\\n\\n DesiredContact {\\n\\n position: ball.position + BALL_COLLISION_RADIUS * ball_normal,\\n\\n heading: -1.0 * ball_normal,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"brain/src/play.rs\",\n \"rank\": 79,\n \"score\": 90668.26837218515\n },\n {\n \"content\": \"pub fn ball_collides(ball: &BallState, player: &PlayerState) -> bool {\\n\\n (closest_point_for_collision(ball, player) - ball.position).norm() < BALL_COLLISION_RADIUS\\n\\n}\\n\\n\\n\",\n \"file_path\": \"predict/src/player.rs\",\n \"rank\": 80,\n \"score\": 88117.44811873179\n },\n {\n \"content\": \"fn ground_turn_prediction(\\n\\n current: &PlayerState,\\n\\n controller: &BrickControllerState,\\n\\n time_step: f32,\\n\\n) -> Result<PlayerPrediction, String> {\\n\\n // we don't have transformations for single ticks, but we'll do some special handling of\\n\\n // this case as we need it for car-ball collisions\\n\\n let original_time_step = time_step;\\n\\n let time_step = if time_step == TICK { 2.0 * TICK } else { time_step };\\n\\n\\n\\n let quad = ground_turn_quad_tranformations(current, controller, time_step);\\n\\n\\n\\n // TODO error\\n\\n let mut x1y1 = quad[0].ok_or_else(|| {\\n\\n format!(\\n\\n \\\"Missing turn x1y1 for player: {:?} & controller: {:?}\\\",\\n\\n sample::normalized_player(¤t, false, false),\\n\\n controller\\n\\n )\\n\\n })?;\\n\",\n \"file_path\": \"predict/src/player.rs\",\n \"rank\": 81,\n \"score\": 86340.53431925841\n },\n {\n \"content\": \"//// since the ray collision algorithm doesn't allow for the ray ending early, but does account\\n\\n//// for point of origin, we just test it in both directions for a complete line test. minimize\\n\\n//// the overhead by using the previous position as the ray origin first, assuming we'll\\n\\n//// mostly be moving *towards* the desired position for most expanded a* paths\\n\\npub fn line_collides_bounding_box(bounding_box: &BoundingBox, start: Vector3<f32>, end: Vector3<f32>) -> bool {\\n\\n ray_collides_bounding_box(&bounding_box, start, end) && ray_collides_bounding_box(&bounding_box, end, start)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"brain/src/plan.rs\",\n \"rank\": 82,\n \"score\": 82855.9513637187\n },\n {\n \"content\": \"// https://bheisler.github.io/post/writing-gpu-accelerated-path-tracer-part-3/\\n\\n// https://gamedev.stackexchange.com/a/18459/4929\\n\\npub fn ray_collides_bounding_box(bounding_box: &BoundingBox, start: Vector3<f32>, end: Vector3<f32>) -> bool {\\n\\n let dir = end - start;\\n\\n let dir_inv = Vector3::new(1.0 / dir.x, 1.0 / dir.y, 1.0 / dir.z);\\n\\n\\n\\n let mut txmin = (bounding_box.min_x - start.x) * dir_inv.x;\\n\\n let mut txmax = (bounding_box.max_x - start.x) * dir_inv.x;\\n\\n\\n\\n if txmin > txmax {\\n\\n mem::swap(&mut txmin, &mut txmax);\\n\\n }\\n\\n\\n\\n let mut tymin = (bounding_box.min_y - start.y) * dir_inv.y;\\n\\n let mut tymax = (bounding_box.max_y - start.y) * dir_inv.y;\\n\\n\\n\\n if tymin > tymax {\\n\\n mem::swap(&mut tymin, &mut tymax);\\n\\n }\\n\\n\\n\\n if txmin > tymax || tymin > txmax {\\n\\n return false;\\n\",\n \"file_path\": \"brain/src/plan.rs\",\n \"rank\": 83,\n \"score\": 82854.29875989299\n },\n {\n \"content\": \"pub fn trajectory_enters_soccar_goal(ball: &BallState) -> bool {\\n\\n // FIXME check full ball trajectory, with bouncing\\n\\n //let goal = Vector3::new(0.0, BACK_WALL_DISTANCE, GOAL_Z / 2.0);\\n\\n let goal = na::Vector2::new(0.0, BACK_WALL_DISTANCE);\\n\\n let pos = na::Vector2::new(ball.position.x, ball.position.y);\\n\\n let v = na::Vector2::new(ball.velocity.x, ball.velocity.y);\\n\\n\\n\\n // check if 2d ball velocty is towards goal\\n\\n // TODO use exact angle of left side and right side of goal from current ball position instead\\n\\n // of the dot product approximate check\\n\\n (goal - pos).normalize().dot(&v.normalize()) > 0.95\\n\\n}\\n\\n\\n\",\n \"file_path\": \"predict/src/ball.rs\",\n \"rank\": 84,\n \"score\": 82523.51265513619\n },\n {\n \"content\": \"fn bot_logic_loop(sender: Sender<PlanResult>, receiver: Receiver<(GameState, BotState)>) {\\n\\n let mut model = brain::get_model();\\n\\n loop {\\n\\n let (mut game, mut bot) = receiver.recv().expect(\\\"Couldn't receive game state\\\");\\n\\n\\n\\n // make sure we have the latest, drop earlier states\\n\\n while let Ok((g, b)) = receiver.try_recv() {\\n\\n game = g;\\n\\n bot = b;\\n\\n }\\n\\n\\n\\n let plan_result = brain::play::play(&mut model, &game, &mut bot);\\n\\n sender.send(plan_result).expect(\\\"Failed to send plan result\\\");\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"brick/src/main.rs\",\n \"rank\": 85,\n \"score\": 82042.77881412214\n },\n {\n \"content\": \"#[allow(clippy::needless_collect)] // it's actually needed as rev does not work after unfold\\n\\nfn reverse_path(\\n\\n parents: &ParentsMap,\\n\\n initial_index: usize,\\n\\n initial_is_secondary: bool,\\n\\n initial_player: &PlayerState,\\n\\n initial_cost: f32,\\n\\n) -> Plan {\\n\\n let path = itertools::unfold((initial_index, initial_is_secondary), |vals| {\\n\\n let index = (*vals).0;\\n\\n let is_secondary = (*vals).1;\\n\\n parents.get_index(index).map(|(_rounded, (v1, maybe_v2))| {\\n\\n let vertex = if is_secondary { maybe_v2.as_ref().unwrap() } else { v1 };\\n\\n (*vals).0 = vertex.parent_index;\\n\\n (*vals).1 = vertex.parent_is_secondary;\\n\\n let player = if index == initial_index {\\n\\n initial_player.clone()\\n\\n } else {\\n\\n vertex.player.clone()\\n\\n };\\n\\n let cost = if index == initial_index {\\n\",\n \"file_path\": \"brain/src/plan.rs\",\n \"rank\": 86,\n \"score\": 80724.95916002918\n },\n {\n \"content\": \"fn bot_logic_loop_test(sender: Sender<PlanResult>, receiver: Receiver<(GameState, BotState)>) {\\n\\n let mut gilrs = Gilrs::new().unwrap();\\n\\n let mut gamepad = Gamepad::default();\\n\\n let mut model = brain::get_model();\\n\\n\\n\\n let mut loop_helper = LoopHelper::builder().build_with_target_rate(1000.0); // limit to 1000 FPS\\n\\n //.build_with_target_rate(0.2); // limit to 0.2 FPS\\n\\n\\n\\n loop {\\n\\n loop_helper.loop_start();\\n\\n let (mut game, mut bot) = receiver.recv().expect(\\\"Couldn't receive game state\\\");\\n\\n\\n\\n // make sure we have the latest, drop earlier states\\n\\n while let Ok((g, b)) = receiver.try_recv() {\\n\\n game = g;\\n\\n bot = b;\\n\\n }\\n\\n\\n\\n update_gamepad(&mut gilrs, &mut gamepad);\\n\\n if !gamepad.select_toggled {\\n\",\n \"file_path\": \"brick/src/main.rs\",\n \"rank\": 87,\n \"score\": 80245.34270831264\n },\n {\n \"content\": \"pub fn get_model() -> impl HeuristicModel {\\n\\n // TODO config file or something\\n\\n //let path = \\\"./heuristic/train/nn/simple_throttle_cost_saved_model/1552341051/\\\";\\n\\n //NeuralHeuristic::try_new(path).expect(\\\"Failed to initialize NeuralHeuristic\\\")\\n\\n\\n\\n // TODO config file or something\\n\\n let path = \\\"./time.csv\\\";\\n\\n KnnHeuristic::try_new(path).expect(\\\"Failed to initialize KnnHeuristic\\\")\\n\\n\\n\\n //BasicHeuristic::default()\\n\\n}\\n\",\n \"file_path\": \"brain/src/lib.rs\",\n \"rank\": 88,\n \"score\": 77233.36109787448\n },\n {\n \"content\": \"fn interpolate_transformation_halfway(\\n\\n transformation: driving_model::PlayerTransformation,\\n\\n current: &PlayerState,\\n\\n) -> driving_model::PlayerTransformation {\\n\\n let mut transformation = transformation;\\n\\n transformation.translation_x /= 2;\\n\\n transformation.translation_y /= 2;\\n\\n transformation.end_yaw /= 2.0;\\n\\n transformation.end_angular_velocity_z =\\n\\n current.angular_velocity.z + (transformation.end_angular_velocity_z - current.angular_velocity.z) / 2.0;\\n\\n\\n\\n // NOTE start local vx/vy is with car facing forwards in y direction, but end_velocity is with car\\n\\n // facing leftwards, ie negative x direction. so we align them first before interpolation\\n\\n let start_velocity = Vector3::new(\\n\\n transformation.start_local_vx as f32,\\n\\n transformation.start_local_vy as f32,\\n\\n 0.0,\\n\\n );\\n\\n let rotation = Rotation3::from_euler_angles(0.0, 0.0, std::f32::consts::PI / 2.0); // anti-clockwise\\n\\n let start_velocity = rotation * start_velocity;\\n\",\n \"file_path\": \"predict/src/player.rs\",\n \"rank\": 89,\n \"score\": 76915.82275578206\n },\n {\n \"content\": \"fn plan_lines(plan: &[PlanStep], color: Point3<f32>) -> Vec<Line> {\\n\\n let mut lines = Vec::with_capacity(plan.len());\\n\\n let pos = plan\\n\\n .get(0)\\n\\n .map(|(p, _, _)| p.position)\\n\\n .unwrap_or_else(|| Vector3::new(0.0, 0.0, 0.0));\\n\\n let mut last_point = Point3::new(pos.x, pos.y, pos.z);\\n\\n for (ps, _, _) in plan {\\n\\n let point = Point3::new(ps.position.x, ps.position.y, ps.position.z + 0.1);\\n\\n lines.push((last_point, point, color));\\n\\n last_point = point;\\n\\n }\\n\\n lines\\n\\n}\\n\\n\\n\",\n \"file_path\": \"brick/src/main.rs\",\n \"rank\": 90,\n \"score\": 76694.12100400763\n },\n {\n \"content\": \"pub fn closest_plan_index(given_player: &PlayerState, plan: &[PlanStep]) -> usize {\\n\\n assert!(!plan.is_empty());\\n\\n\\n\\n let mut index = 0;\\n\\n let mut min_distance = std::f32::MAX;\\n\\n\\n\\n for (i, (player, _, _)) in plan.iter().enumerate() {\\n\\n let distance = (given_player.position - player.position).norm();\\n\\n if distance < min_distance {\\n\\n min_distance = distance;\\n\\n index = i\\n\\n }\\n\\n }\\n\\n\\n\\n index\\n\\n}\\n\\n\\n\",\n \"file_path\": \"brain/src/play.rs\",\n \"rank\": 91,\n \"score\": 75465.96543076662\n },\n {\n \"content\": \"pub fn get_collision(\\n\\n ball_trajectory: &[BallState],\\n\\n player: &PlayerState,\\n\\n controller: &BrickControllerState,\\n\\n time_step: f32,\\n\\n) -> Option<(PlayerState, BallState, Vector3<f32>, f32)> {\\n\\n let num_ticks: usize = (time_step / TICK).round() as usize;\\n\\n assert!(num_ticks % 2 == 0);\\n\\n\\n\\n // 2-tick steps\\n\\n let mut last = player.clone();\\n\\n for step in 1..=(num_ticks / 2) {\\n\\n if let Ok(next) = next_player_state(&last, controller, TICK * 2.0) {\\n\\n if let Some(ball) = ball_trajectory.get(step * 2) {\\n\\n if ball_collides(ball, &next) {\\n\\n // check if one tick earlier collides, since we are using 2-tick steps\\n\\n if let Ok(next_single_tick) = next_player_state(&last, controller, TICK) {\\n\\n let single_tick_ball = &ball_trajectory[step * 2 - 1];\\n\\n if ball_collides(single_tick_ball, &next_single_tick) {\\n\\n let collision_time = (2 * step - 1) as f32 * TICK;\\n\",\n \"file_path\": \"predict/src/player.rs\",\n \"rank\": 92,\n \"score\": 75306.55501168605\n },\n {\n \"content\": \"fn ground_turn_quad_tranformations(\\n\\n current: &PlayerState,\\n\\n controller: &BrickControllerState,\\n\\n time_step: f32,\\n\\n) -> [Option<&'static driving_model::PlayerTransformation>; 4] {\\n\\n // TODO handle missing values properly: go lower/higher to find another point to use as an\\n\\n // interpolation anchor\\n\\n //println!(\\\"x1y1\\\");\\n\\n let normalized = sample::normalized_player(¤t, false, false);\\n\\n let mut x1y1 = ground_turn_matching_transformation(normalized, &controller, time_step, -3, -3, None, None);\\n\\n\\n\\n //println!(\\\"x2y1\\\");\\n\\n let normalized = sample::normalized_player(¤t, true, false);\\n\\n let mut x2y1 = ground_turn_matching_transformation(normalized, &controller, time_step, 3, -3, None, None);\\n\\n\\n\\n // when we fail in on direction, search in the other\\n\\n if x1y1.is_some() && x2y1.is_none() {\\n\\n //println!(\\\"-- x2y1 fallback --\\\");\\n\\n let x1y1_transformation = x1y1.as_ref().unwrap();\\n\\n let skip = x1y1_transformation.normalized_player(current.angular_velocity.z);\\n\",\n \"file_path\": \"predict/src/player.rs\",\n \"rank\": 93,\n \"score\": 74599.54881069326\n },\n {\n \"content\": \"type Line = (Point3<f32>, Point3<f32>, Point3<f32>);\\n\\n\\n\\nlazy_static! {\\n\\n static ref GAME_STATE: RwLock<GameState> = RwLock::new(GameState::default());\\n\\n static ref LINES: RwLock<Vec<Line>> = RwLock::new(vec![]);\\n\\n static ref POINTS: RwLock<Vec<(Point3<f32>, Point3<f32>)>> = RwLock::new(vec![]);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"brick/src/main.rs\",\n \"rank\": 94,\n \"score\": 74342.6727986946\n },\n {\n \"content\": \"fn record_missing_record_state(\\n\\n rlbot: &rlbot::RLBot,\\n\\n input: &ControllerState,\\n\\n index: &mut HashMap<predict::sample::NormalizedPlayerState, PlayerState>,\\n\\n record_state: &mut RecordState,\\n\\n adjustment: &mut Adjustment,\\n\\n) -> Result<(), Box<dyn Error>> {\\n\\n record_state.records.clear();\\n\\n rlbot.update_player_input(0, &input)?;\\n\\n\\n\\n loop {\\n\\n // waits and checks the tick to ensure it meets our conditions. and it records the first tick\\n\\n record_state.set_game_state_accurately(&rlbot, index, adjustment)?;\\n\\n\\n\\n loop {\\n\\n //rlbot.update_player_input(0, &input)?;\\n\\n let tick = next_flat(&rlbot);\\n\\n record_state.record(&tick);\\n\\n\\n\\n if record_state.sample_complete() {\\n\",\n \"file_path\": \"record/src/main.rs\",\n \"rank\": 95,\n \"score\": 74182.22861973986\n },\n {\n \"content\": \"fn throttle_left() -> ControllerState {\\n\\n let mut input = ControllerState::default();\\n\\n input.throttle = 1.0;\\n\\n input.steer = -1.0;\\n\\n input\\n\\n}\\n\\n\\n\",\n \"file_path\": \"record/src/main.rs\",\n \"rank\": 96,\n \"score\": 72572.96087564385\n },\n {\n \"content\": \"fn boost_straight() -> ControllerState {\\n\\n let mut input = ControllerState::default();\\n\\n input.boost = true;\\n\\n input\\n\\n}\\n\\n\\n\",\n \"file_path\": \"record/src/main.rs\",\n \"rank\": 97,\n \"score\": 72572.96087564385\n },\n {\n \"content\": \"fn throttle_straight() -> ControllerState {\\n\\n let mut input = ControllerState::default();\\n\\n input.throttle = 1.0;\\n\\n input\\n\\n}\\n\\n\\n\",\n \"file_path\": \"record/src/main.rs\",\n \"rank\": 98,\n \"score\": 72572.96087564385\n },\n {\n \"content\": \"fn throttle_right() -> ControllerState {\\n\\n let mut input = ControllerState::default();\\n\\n input.throttle = 1.0;\\n\\n input.steer = 1.0;\\n\\n input\\n\\n}\\n\\n\\n\",\n \"file_path\": \"record/src/main.rs\",\n \"rank\": 99,\n \"score\": 72572.96087564385\n }\n]","isConversational":false}}},{"rowIdx":1393,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"utoipa-gen/src/openapi.rs"},"repo_name":{"kind":"string","value":"juhaku/utoipa"},"commit":{"kind":"string","value":"070b00c13b41040e9605c62a0d7c3b5fcf04899c"},"file_code":{"kind":"string","value":"use proc_macro2::Ident;\nuse proc_macro_error::ResultExt;\nuse syn::{\n parenthesized,\n parse::{Parse, ParseStream},\n punctuated::Punctuated,\n token::{And, Comma},\n Attribute, Error, ExprPath, GenericParam, Generics, Token,\n};\n\nuse proc_macro2::TokenStream;\nuse quote::{format_ident, quote, quote_spanned, ToTokens};\n\nuse crate::{\n parse_utils, path::PATH_STRUCT_PREFIX, security_requirement::SecurityRequirementAttr, Array,\n ExternalDocs,\n};\n\nmod info;\n\n#[derive(Default)]\n#[cfg_attr(feature = \"debug\", derive(Debug))]\npub struct OpenApiAttr {\n handlers: Punctuated<ExprPath, Comma>,\n components: Punctuated<Component, Comma>,\n modifiers: Punctuated<Modifier, Comma>,\n security: Option<Array<SecurityRequirementAttr>>,\n tags: Option<Array<Tag>>,\n external_docs: Option<ExternalDocs>,\n}\n\npub fn parse_openapi_attrs(attrs: &[Attribute]) -> Option<OpenApiAttr> {\n attrs\n .iter()\n .find(|attribute| attribute.path.is_ident(\"openapi\"))\n .map(|attribute| attribute.parse_args::<OpenApiAttr>().unwrap_or_abort())\n}\n\nimpl Parse for OpenApiAttr {\n fn parse(input: syn::parse::ParseStream) -> syn::Result<Self> {\n const EXPECTED_ATTRIBUTE: &str =\n \"unexpected attribute, expected any of: handlers, components, modifiers, security, tags, external_docs\";\n let mut openapi = OpenApiAttr::default();\n\n while !input.is_empty() {\n let ident = input.parse::<Ident>().map_err(|error| {\n Error::new(error.span(), &format!(\"{}, {}\", EXPECTED_ATTRIBUTE, error))\n })?;\n let attribute = &*ident.to_string();\n\n match attribute {\n \"handlers\" => {\n openapi.handlers = parse_utils::parse_punctuated_within_parenthesis(input)?;\n }\n \"components\" => {\n openapi.components = parse_utils::parse_punctuated_within_parenthesis(input)?\n }\n \"modifiers\" => {\n openapi.modifiers = parse_utils::parse_punctuated_within_parenthesis(input)?;\n }\n \"security\" => {\n let security;\n parenthesized!(security in input);\n openapi.security = Some(parse_utils::parse_groups(&security)?)\n }\n \"tags\" => {\n let tags;\n parenthesized!(tags in input);\n openapi.tags = Some(parse_utils::parse_groups(&tags)?);\n }\n \"external_docs\" => {\n let external_docs;\n parenthesized!(external_docs in input);\n openapi.external_docs = Some(external_docs.parse()?);\n }\n _ => {\n return Err(Error::new(ident.span(), EXPECTED_ATTRIBUTE));\n }\n }\n\n if !input.is_empty() {\n input.parse::<Token![,]>()?;\n }\n }\n\n Ok(openapi)\n }\n}\n\n#[cfg_attr(feature = \"debug\", derive(Debug))]\nstruct Component {\n ty: Ident,\n generics: Generics,\n}\n\nimpl Component {\n fn has_lifetime_generics(&self) -> bool {\n self.generics\n .params\n .iter()\n .any(|generic| matches!(generic, GenericParam::Lifetime(_)))\n }\n}\n\nimpl Parse for Component {\n fn parse(input: ParseStream) -> syn::Result<Self> {\n Ok(Component {\n ty: input.parse()?,\n generics: input.parse()?,\n })\n }\n}\n\n#[cfg_attr(feature = \"debug\", derive(Debug))]\nstruct Modifier {\n and: And,\n ident: Ident,\n}\n\nimpl ToTokens for Modifier {\n fn to_tokens(&self, tokens: &mut TokenStream) {\n let and = &self.and;\n let ident = &self.ident;\n tokens.extend(quote! {\n #and #ident\n })\n }\n}\n\nimpl Parse for Modifier {\n fn parse(input: ParseStream) -> syn::Result<Self> {\n Ok(Self {\n and: input.parse()?,\n ident: input.parse()?,\n })\n }\n}\n\n#[derive(Default)]\n#[cfg_attr(feature = \"debug\", derive(Debug))]\nstruct Tag {\n name: String,\n description: Option<String>,\n external_docs: Option<ExternalDocs>,\n}\n\nimpl Parse for Tag {\n fn parse(input: ParseStream) -> syn::Result<Self> {\n const EXPECTED_ATTRIBUTE: &str =\n \"unexpected token, expected any of: name, description, external_docs\";\n\n let mut tag = Tag::default();\n\n while !input.is_empty() {\n let ident = input.parse::<Ident>().map_err(|error| {\n syn::Error::new(error.span(), &format!(\"{}, {}\", EXPECTED_ATTRIBUTE, error))\n })?;\n let attribute_name = &*ident.to_string();\n\n match attribute_name {\n \"name\" => tag.name = parse_utils::parse_next_literal_str(input)?,\n \"description\" => {\n tag.description = Some(parse_utils::parse_next_literal_str(input)?)\n }\n \"external_docs\" => {\n let content;\n parenthesized!(content in input);\n tag.external_docs = Some(content.parse::<ExternalDocs>()?);\n }\n _ => return Err(syn::Error::new(ident.span(), EXPECTED_ATTRIBUTE)),\n }\n\n if !input.is_empty() {\n input.parse::<Token![,]>()?;\n }\n }\n\n Ok(tag)\n }\n}\n\nimpl ToTokens for Tag {\n fn to_tokens(&self, tokens: &mut TokenStream) {\n let name = &self.name;\n tokens.extend(quote! {\n utoipa::openapi::tag::TagBuilder::new().name(#name)\n });\n\n if let Some(ref description) = self.description {\n tokens.extend(quote! {\n .description(Some(#description))\n });\n }\n\n if let Some(ref external_docs) = self.external_docs {\n tokens.extend(quote! {\n .external_docs(Some(#external_docs))\n });\n }\n\n tokens.extend(quote! { .build() })\n }\n}\n\npub(crate) struct OpenApi(pub OpenApiAttr, pub Ident);\n\nimpl ToTokens for OpenApi {\n fn to_tokens(&self, tokens: &mut proc_macro2::TokenStream) {\n let OpenApi(attributes, ident) = self;\n\n let info = info::impl_info();\n let components = impl_components(&attributes.components, tokens).map(|components| {\n quote! { .components(Some(#components)) }\n });\n\n let modifiers = &attributes.modifiers;\n let modifiers_len = modifiers.len();\n\n modifiers.iter().for_each(|modifier| {\n let assert_modifier = format_ident!(\"_Assert{}\", modifier.ident);\n let ident = &modifier.ident;\n quote_spanned! {modifier.ident.span()=>\n struct #assert_modifier where #ident : utoipa::Modify;\n };\n });\n\n let path_items = impl_paths(&attributes.handlers);\n\n let securities = attributes.security.as_ref().map(|securities| {\n quote! {\n .security(Some(#securities))\n }\n });\n let tags = attributes.tags.as_ref().map(|tags| {\n quote! {\n .tags(Some(#tags))\n }\n });\n let external_docs = attributes.external_docs.as_ref().map(|external_docs| {\n quote! {\n .external_docs(Some(#external_docs))\n }\n });\n\n tokens.extend(quote! {\n impl utoipa::OpenApi for #ident {\n fn openapi() -> utoipa::openapi::OpenApi {\n use utoipa::{Component, Path};\n let mut openapi = utoipa::openapi::OpenApiBuilder::new()\n .info(#info)\n .paths(#path_items)\n #components\n #securities\n #tags\n #external_docs.build();\n\n let _mods: [&dyn utoipa::Modify; #modifiers_len] = [#modifiers];\n _mods.iter().for_each(|modifier| modifier.modify(&mut openapi));\n\n openapi\n }\n }\n });\n }\n}\n\nfn impl_components(\n components: &Punctuated<Component, Comma>,\n tokens: &mut TokenStream,\n) -> Option<TokenStream> {\n if !components.is_empty() {\n let mut components_tokens = components.iter().fold(\n quote! { utoipa::openapi::ComponentsBuilder::new() },\n |mut schema, component| {\n let ident = &component.ty;\n let span = ident.span();\n let component_name = &*ident.to_string();\n let (_, ty_generics, _) = component.generics.split_for_impl();\n\n let assert_ty_generics = if component.has_lifetime_generics() {\n Some(quote! {<'static>})\n } else {\n Some(ty_generics.to_token_stream())\n };\n let assert_component = format_ident!(\"_AssertComponent{}\", component_name);\n tokens.extend(quote_spanned! {span=>\n struct #assert_component where #ident #assert_ty_generics: utoipa::Component;\n });\n\n let ty_generics = if component.has_lifetime_generics() {\n None\n } else {\n Some(ty_generics)\n };\n schema.extend(quote! {\n .component(#component_name, <#ident #ty_generics>::component())\n });\n\n schema\n },\n );\n components_tokens.extend(quote! { .build() });\n Some(components_tokens)\n } else {\n None\n }\n}\n\nfn impl_paths(handler_paths: &Punctuated<ExprPath, Comma>) -> TokenStream {\n handler_paths.iter().fold(\n quote! { utoipa::openapi::path::PathsBuilder::new() },\n |mut paths, handler| {\n let segments = handler.path.segments.iter().collect::<Vec<_>>();\n let handler_fn_name = &*segments.last().unwrap().ident.to_string();\n\n let tag = &*segments\n .iter()\n .take(segments.len() - 1)\n .map(|part| part.ident.to_string())\n .collect::<Vec<_>>()\n .join(\"::\");\n\n let handler_ident = format_ident!(\"{}{}\", PATH_STRUCT_PREFIX, handler_fn_name);\n let handler_ident_name = &*handler_ident.to_string();\n\n let usage = syn::parse_str::<ExprPath>(\n &vec![\n if tag.is_empty() { None } else { Some(tag) },\n Some(handler_ident_name),\n ]\n .into_iter()\n .flatten()\n .collect::<Vec<_>>()\n .join(\"::\"),\n )\n .unwrap();\n\n paths.extend(quote! {\n .path(#usage::path(), #usage::path_item(Some(#tag)))\n });\n\n paths\n },\n )\n}\n"},"prefix":{"kind":"string","value":"use proc_macro2::Ident;\nuse proc_macro_error::ResultExt;\nuse syn::{\n parenthesized,\n parse::{Parse, ParseStream},\n punctuated::Punctuated,\n token::{And, Comma},\n Attribute, Error, ExprPath, GenericParam, Generics, Token,\n};\n\nuse proc_macro2::TokenStream;\nuse quote::{format_ident, quote, quote_spanned, ToTokens};\n\nuse crate::{\n parse_utils, path::PATH_STRUCT_PREFIX, security_requirement::SecurityRequirementAttr, Array,\n ExternalDocs,\n};\n\nmod info;\n\n#[derive(Default)]\n#[cfg_attr(feature = \"debug\", derive(Debug))]\npub struct OpenApiAttr {\n handlers: Punctuated<ExprPath, Comma>,\n components: Punctuated<Component, Comma>,\n modifiers: Punctuated<Modifier, Comma>,\n security: Option<Array<SecurityRequirementAttr>>,\n tags: Option<Array<Tag>>,\n external_docs: Option<ExternalDocs>,\n}\n\npub fn parse_openapi_attrs(attrs: &[Attribute]) -> Option<OpenApiAttr> {\n attrs\n .iter()\n .find(|attribute| attribute.path.is_ident(\"openapi\"))\n .map(|attribute| attribute.parse_args::<OpenApiAttr>().unwrap_or_abort())\n}\n\nimpl Parse for OpenApiAttr {\n fn parse(input: syn::parse::ParseStream) -> syn::Result<Self> {\n const EXPECTED_ATTRIBUTE: &str =\n \"unexpected attribute, expected any of: handlers, components, modifiers, security, tags, external_docs\";\n let mut openapi = OpenApiAttr::default();\n\n while !input.is_empty() {\n let ident = input.parse::<Ident>().map_err(|error| {\n Error::new(error.span(), &format!(\"{}, {}\", EXPECTED_ATTRIBUTE, error))\n })?;\n let attribute = &*ident.to_string();\n\n match attribute {\n \"handlers\" => {\n openapi.handlers = parse_utils::parse_punctuated_within_parenthesis(input)?;\n }\n \"components\" => {\n openapi.components = parse_utils::parse_punctuated_within_parenthesis(input)?\n }\n \"modifiers\" => {\n openapi.modifiers = parse_utils::parse_punctuated_within_parenthesis(input)?;\n }\n \"security\" => {\n let security;\n parenthesized!(security in input);\n openapi.security = Some(parse_utils::parse_groups(&security)?)\n }\n \"tags\" => {\n let tags;\n parenthesized!(tags in input);\n openapi.tags = Some(parse_utils::parse_groups(&tags)?);\n }\n \"external_docs\" => {\n let external_docs;\n parenthesized!(external_docs in input);\n openapi.external_docs = Some(external_docs.parse()?);\n }\n _ => {\n return Err(Error::new(ident.span(), EXPECTED_ATTRIBUTE));\n }\n }\n\n if !input.is_empty() {\n input.parse::<Token![,]>()?;\n }\n }\n\n Ok(openapi)\n }\n}\n\n#[cfg_attr(feature = \"debug\", derive(Debug))]\nstruct Component {\n ty: Ident,\n generics: Generics,\n}\n\nimpl Component {\n "},"suffix":{"kind":"string","value":"\n}\n\nimpl Parse for Component {\n fn parse(input: ParseStream) -> syn::Result<Self> {\n Ok(Component {\n ty: input.parse()?,\n generics: input.parse()?,\n })\n }\n}\n\n#[cfg_attr(feature = \"debug\", derive(Debug))]\nstruct Modifier {\n and: And,\n ident: Ident,\n}\n\nimpl ToTokens for Modifier {\n fn to_tokens(&self, tokens: &mut TokenStream) {\n let and = &self.and;\n let ident = &self.ident;\n tokens.extend(quote! {\n #and #ident\n })\n }\n}\n\nimpl Parse for Modifier {\n fn parse(input: ParseStream) -> syn::Result<Self> {\n Ok(Self {\n and: input.parse()?,\n ident: input.parse()?,\n })\n }\n}\n\n#[derive(Default)]\n#[cfg_attr(feature = \"debug\", derive(Debug))]\nstruct Tag {\n name: String,\n description: Option<String>,\n external_docs: Option<ExternalDocs>,\n}\n\nimpl Parse for Tag {\n fn parse(input: ParseStream) -> syn::Result<Self> {\n const EXPECTED_ATTRIBUTE: &str =\n \"unexpected token, expected any of: name, description, external_docs\";\n\n let mut tag = Tag::default();\n\n while !input.is_empty() {\n let ident = input.parse::<Ident>().map_err(|error| {\n syn::Error::new(error.span(), &format!(\"{}, {}\", EXPECTED_ATTRIBUTE, error))\n })?;\n let attribute_name = &*ident.to_string();\n\n match attribute_name {\n \"name\" => tag.name = parse_utils::parse_next_literal_str(input)?,\n \"description\" => {\n tag.description = Some(parse_utils::parse_next_literal_str(input)?)\n }\n \"external_docs\" => {\n let content;\n parenthesized!(content in input);\n tag.external_docs = Some(content.parse::<ExternalDocs>()?);\n }\n _ => return Err(syn::Error::new(ident.span(), EXPECTED_ATTRIBUTE)),\n }\n\n if !input.is_empty() {\n input.parse::<Token![,]>()?;\n }\n }\n\n Ok(tag)\n }\n}\n\nimpl ToTokens for Tag {\n fn to_tokens(&self, tokens: &mut TokenStream) {\n let name = &self.name;\n tokens.extend(quote! {\n utoipa::openapi::tag::TagBuilder::new().name(#name)\n });\n\n if let Some(ref description) = self.description {\n tokens.extend(quote! {\n .description(Some(#description))\n });\n }\n\n if let Some(ref external_docs) = self.external_docs {\n tokens.extend(quote! {\n .external_docs(Some(#external_docs))\n });\n }\n\n tokens.extend(quote! { .build() })\n }\n}\n\npub(crate) struct OpenApi(pub OpenApiAttr, pub Ident);\n\nimpl ToTokens for OpenApi {\n fn to_tokens(&self, tokens: &mut proc_macro2::TokenStream) {\n let OpenApi(attributes, ident) = self;\n\n let info = info::impl_info();\n let components = impl_components(&attributes.components, tokens).map(|components| {\n quote! { .components(Some(#components)) }\n });\n\n let modifiers = &attributes.modifiers;\n let modifiers_len = modifiers.len();\n\n modifiers.iter().for_each(|modifier| {\n let assert_modifier = format_ident!(\"_Assert{}\", modifier.ident);\n let ident = &modifier.ident;\n quote_spanned! {modifier.ident.span()=>\n struct #assert_modifier where #ident : utoipa::Modify;\n };\n });\n\n let path_items = impl_paths(&attributes.handlers);\n\n let securities = attributes.security.as_ref().map(|securities| {\n quote! {\n .security(Some(#securities))\n }\n });\n let tags = attributes.tags.as_ref().map(|tags| {\n quote! {\n .tags(Some(#tags))\n }\n });\n let external_docs = attributes.external_docs.as_ref().map(|external_docs| {\n quote! {\n .external_docs(Some(#external_docs))\n }\n });\n\n tokens.extend(quote! {\n impl utoipa::OpenApi for #ident {\n fn openapi() -> utoipa::openapi::OpenApi {\n use utoipa::{Component, Path};\n let mut openapi = utoipa::openapi::OpenApiBuilder::new()\n .info(#info)\n .paths(#path_items)\n #components\n #securities\n #tags\n #external_docs.build();\n\n let _mods: [&dyn utoipa::Modify; #modifiers_len] = [#modifiers];\n _mods.iter().for_each(|modifier| modifier.modify(&mut openapi));\n\n openapi\n }\n }\n });\n }\n}\n\nfn impl_components(\n components: &Punctuated<Component, Comma>,\n tokens: &mut TokenStream,\n) -> Option<TokenStream> {\n if !components.is_empty() {\n let mut components_tokens = components.iter().fold(\n quote! { utoipa::openapi::ComponentsBuilder::new() },\n |mut schema, component| {\n let ident = &component.ty;\n let span = ident.span();\n let component_name = &*ident.to_string();\n let (_, ty_generics, _) = component.generics.split_for_impl();\n\n let assert_ty_generics = if component.has_lifetime_generics() {\n Some(quote! {<'static>})\n } else {\n Some(ty_generics.to_token_stream())\n };\n let assert_component = format_ident!(\"_AssertComponent{}\", component_name);\n tokens.extend(quote_spanned! {span=>\n struct #assert_component where #ident #assert_ty_generics: utoipa::Component;\n });\n\n let ty_generics = if component.has_lifetime_generics() {\n None\n } else {\n Some(ty_generics)\n };\n schema.extend(quote! {\n .component(#component_name, <#ident #ty_generics>::component())\n });\n\n schema\n },\n );\n components_tokens.extend(quote! { .build() });\n Some(components_tokens)\n } else {\n None\n }\n}\n\nfn impl_paths(handler_paths: &Punctuated<ExprPath, Comma>) -> TokenStream {\n handler_paths.iter().fold(\n quote! { utoipa::openapi::path::PathsBuilder::new() },\n |mut paths, handler| {\n let segments = handler.path.segments.iter().collect::<Vec<_>>();\n let handler_fn_name = &*segments.last().unwrap().ident.to_string();\n\n let tag = &*segments\n .iter()\n .take(segments.len() - 1)\n .map(|part| part.ident.to_string())\n .collect::<Vec<_>>()\n .join(\"::\");\n\n let handler_ident = format_ident!(\"{}{}\", PATH_STRUCT_PREFIX, handler_fn_name);\n let handler_ident_name = &*handler_ident.to_string();\n\n let usage = syn::parse_str::<ExprPath>(\n &vec![\n if tag.is_empty() { None } else { Some(tag) },\n Some(handler_ident_name),\n ]\n .into_iter()\n .flatten()\n .collect::<Vec<_>>()\n .join(\"::\"),\n )\n .unwrap();\n\n paths.extend(quote! {\n .path(#usage::path(), #usage::path_item(Some(#tag)))\n });\n\n paths\n },\n )\n}\n"},"middle":{"kind":"string","value":"fn has_lifetime_generics(&self) -> bool {\n self.generics\n .params\n .iter()\n .any(|generic| matches!(generic, GenericParam::Lifetime(_)))\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":1394,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/main.rs"},"repo_name":{"kind":"string","value":"Drarig29/crypto-balance"},"commit":{"kind":"string","value":"b9f57923b4eb0c145ff7908c6d82425093225413"},"file_code":{"kind":"string","value":"#[macro_use]\nextern crate rocket;\nextern crate chrono;\nextern crate dotenv;\nextern crate hex;\nextern crate hmac;\nextern crate mongodb;\nextern crate reqwest;\nextern crate serde;\nextern crate serde_json;\nextern crate sha2;\n\nmod aggregate;\nmod database;\nmod model;\nmod requests;\nmod utils;\n\nuse chrono::{DateTime, Utc};\nuse dotenv::dotenv;\nuse env::VarError;\nuse rocket::fs::NamedFile;\nuse rocket::http::{ContentType, Status};\nuse rocket::request::Request;\nuse rocket::response::{self, Responder};\nuse rocket::serde::json::Json;\nuse rocket::Response;\nuse serde::{Deserialize, Serialize};\nuse serde_json::{json, Value};\nuse std::path::{Path, PathBuf};\nuse std::{env, vec};\n\n#[derive(Clone)]\npub struct Environment {\n app_password: String,\n binance_key: String,\n binance_secret: String,\n nomics_key: String,\n mongodb_host: String,\n mongodb_port: String,\n mongodb_username: String,\n mongodb_password: String,\n}\n\n#[derive(Serialize, Deserialize)]\npub struct AuthBody {\n password: String,\n}\n\n#[derive(Serialize, Deserialize)]\npub struct RequestBody {\n password: String,\n conversion: String,\n start: String,\n end: String,\n}\n\n#[derive(Debug)]\nstruct ApiResponse {\n status: Status,\n json: Value,\n}\n\n#[derive(Debug)]\npub struct TimeSpan {\n start: DateTime<Utc>,\n end: DateTime<Utc>,\n}\n\npub const BINANCE_API_BASE_URL: &str = \"https://api.binance.com/sapi/v1/accountSnapshot\";\npub const NOMICS_API_BASE_URL: &str = \"https://api.nomics.com/v1/currencies/sparkline\";\npub const ACCOUNT_TYPE: &str = \"SPOT\"; \n\nfn get_env_vars() -> Result<Environment, VarError> {\n let app_password = env::var(\"APPLICATION_PASSWORD\")?;\n let binance_key = env::var(\"BINANCE_API_KEY\")?;\n let binance_secret = env::var(\"BINANCE_API_SECRET\")?;\n let nomics_key = env::var(\"NOMICS_API_KEY\")?;\n let mongodb_host = env::var(\"MONGODB_HOST\")?;\n let mongodb_port = env::var(\"MONGODB_PORT\")?;\n let mongodb_username = env::var(\"MONGODB_USERNAME\")?;\n let mongodb_password = env::var(\"MONGODB_PASSWORD\")?;\n\n Ok(Environment {\n app_password,\n binance_key,\n binance_secret,\n nomics_key,\n mongodb_host,\n mongodb_port,\n mongodb_username,\n mongodb_password,\n })\n}\n\n#[get(\"/\")]\nasync fn index() -> Option<NamedFile> {\n NamedFile::open(\"static/index.html\").await.ok()\n}\n\n#[get(\"/<file..>\")]\nasync fn files(file: PathBuf) -> Option<NamedFile> {\n NamedFile::open(Path::new(\"static/\").join(file)).await.ok()\n}\n\nimpl<'r> Responder<'r, 'r> for ApiResponse {\n fn respond_to(self, req: &Request) -> response::Result<'r> {\n Response::build_from(self.json.respond_to(req).unwrap())\n .status(self.status)\n .header(ContentType::JSON)\n .ok()\n }\n}\n\n#[post(\"/auth\", format = \"json\", data = \"<body>\")]\nasync fn auth(body: Json<AuthBody>) -> ApiResponse {\n let env_variables = match get_env_vars() {\n Ok(res) => res,\n Err(e) => {\n return ApiResponse {\n status: Status::InternalServerError,\n json: json!(e.to_string()),\n }\n }\n };\n\n if body.password != env_variables.app_password {\n return ApiResponse {\n status: Status::Forbidden,\n json: json!(\"Incorrect password\".to_string()),\n };\n }\n\n ApiResponse {\n status: Status::Ok,\n json: json!(\"Success\".to_string()),\n }\n}\n\n#[post(\"/api\", format = \"json\", data = \"<body>\")]\nasync fn api(body: Json<RequestBody>) -> ApiResponse {\n let env_variables = match get_env_vars() {\n Ok(res) => res,\n Err(e) => {\n return ApiResponse {\n status: Status::InternalServerError,\n json: json!(e.to_string()),\n }\n }\n };\n\n if body.password != env_variables.app_password {\n return ApiResponse {\n status: Status::Forbidden,\n json: json!(\"Incorrect password\".to_string()),\n };\n }\n\n println!(\"Start: {}\\nEnd: {}\", body.start, body.end);\n let start = DateTime::parse_from_rfc3339(&body.start)\n .unwrap()\n .with_timezone(&Utc);\n\n let end = DateTime::parse_from_rfc3339(&body.end)\n .unwrap()\n .with_timezone(&Utc);\n\n let mongodb_url = format!(\n \"mongodb://{}:{}@{}:{}\",\n env_variables.mongodb_username,\n env_variables.mongodb_password,\n env_variables.mongodb_host,\n env_variables.mongodb_port,\n );\n\n let client = mongodb::Client::with_uri_str(&mongodb_url).await.unwrap();\n let database = client.database(\"crypto-balance\");\n\n let available_snapshots = database::get_snapshots(&database, start, end).await;\n let needed_timespans = utils::get_timespans_to_retrieve(available_snapshots, start, end);\n\n if needed_timespans.is_empty() {\n let computed_snapshots = database::get_computed_snapshots(&database, start, end).await;\n let result = serde_json::to_value(&computed_snapshots).unwrap();\n return ApiResponse {\n status: Status::Ok,\n json: result,\n };\n }\n\n let split_by_30_days = utils::split_all_timespans_max_days(&needed_timespans, 30);\n\n let snapshots = match requests::get_all_snapshots(\n &env_variables,\n ACCOUNT_TYPE,\n 30,\n &split_by_30_days,\n )\n .await\n {\n Ok(snapshots) => snapshots,\n Err(e) => {\n return ApiResponse {\n status: Status::InternalServerError,\n json: json!(e.to_string()),\n }\n }\n };\n\n database::push_snapshots(&database, snapshots).await;\n\n let assets = database::get_possessed_assets(&database).await;\n let split_by_45_days = utils::split_all_timespans_max_days(&needed_timespans, 45);\n\n let price_history = match requests::get_all_history(\n &env_variables,\n &assets,\n &body.conversion,\n &split_by_45_days,\n )\n .await\n {\n Ok(price_history) => price_history,\n Err(e) => {\n return ApiResponse {\n status: Status::InternalServerError,\n json: json!(e.to_string()),\n }\n }\n };\n\n database::push_history(&database, price_history).await;\n\n let computed_snapshots = database::get_computed_snapshots(&database, start, end).await;\n let result = serde_json::to_value(&computed_snapshots).unwrap();\n ApiResponse {\n status: Status::Ok,\n json: result,\n }\n}\n\n#[rocket::main]\nasync fn main() {\n dotenv().ok();\n\n let res = rocket::build()\n .mount(\"/\", routes![index, auth, api, files])\n .launch()\n .await;\n\n res.expect(\"An error occured while launching the rocket.\")\n}\n"},"prefix":{"kind":"string","value":"#[macro_use]\nextern crate rocket;\nextern crate chrono;\nextern crate dotenv;\nextern crate hex;\nextern crate hmac;\nextern crate mongodb;\nextern crate reqwest;\nextern crate serde;\nextern crate serde_json;\nextern crate sha2;\n\nmod aggregate;\nmod database;\nmod model;\nmod requests;\nmod utils;\n\nuse chrono::{DateTime, Utc};\nuse dotenv::dotenv;\nuse env::VarError;\nuse rocket::fs::NamedFile;\nuse rocket::http::{ContentType, Status};\nuse rocket::request::Request;\nuse rocket::response::{self, Responder};\nuse rocket::serde::json::Json;\nuse rocket::Response;\nuse serde::{Deserialize, Serialize};\nuse serde_json::{json, Value};\nuse std::path::{Path, PathBuf};\nuse std::{env, vec};\n\n#[derive(Clone)]\npub struct Environment {\n app_password: String,\n binance_key: String,\n binance_secret: String,\n nomics_key: String,\n mongodb_host: String,\n mongodb_port: String,\n mongodb_username: String,\n mongodb_password: String,\n}\n\n#[derive(Serialize, Deserialize)]\npub struct AuthBody {\n password: String,\n}\n\n#[derive(Serialize, Deserialize)]\npub struct RequestBody {\n password: String,\n conversion: String,\n start: String,\n end: String,\n}\n\n#[derive(Debug)]\nstruct ApiResponse {\n status: Status,\n json: Value,\n}\n\n#[derive(Debug)]\npub struct TimeSpan {\n start: DateTime<Utc>,\n end: DateTime<Utc>,\n}\n\npub const BINANCE_API_BASE_URL: &str = \"https://api.binance.com/sapi/v1/accountSnapshot\";\npub const NOMICS_API_BASE_URL: &str = \"https://api.nomics.com/v1/currencies/sparkline\";\npub const ACCOUNT_TYPE: &str = \"SPOT\"; \n\nfn get_env_vars() -> Result<Environment, VarError> {\n let app_password = env::var(\"APPLICATION_PASSWORD\")?;\n let binance_key = env::var(\"BINANCE_API_KEY\")?;\n let binance_secret = env::var(\"BINANCE_API_SECRET\")?;\n let nomics_key = env::var(\"NOMICS_API_KEY\")?;\n let mongodb_host = env::var(\"MONGODB_HOST\")?;\n let mongodb_port = env::var(\"MONGODB_PORT\")?;\n let mongodb_username = env::var(\"MONGODB_USERNAME\")?;\n let mongodb_password = env::var(\"MONGODB_PASSWORD\")?;\n\n "},"suffix":{"kind":"string","value":"\n}\n\n#[get(\"/\")]\nasync fn index() -> Option<NamedFile> {\n NamedFile::open(\"static/index.html\").await.ok()\n}\n\n#[get(\"/<file..>\")]\nasync fn files(file: PathBuf) -> Option<NamedFile> {\n NamedFile::open(Path::new(\"static/\").join(file)).await.ok()\n}\n\nimpl<'r> Responder<'r, 'r> for ApiResponse {\n fn respond_to(self, req: &Request) -> response::Result<'r> {\n Response::build_from(self.json.respond_to(req).unwrap())\n .status(self.status)\n .header(ContentType::JSON)\n .ok()\n }\n}\n\n#[post(\"/auth\", format = \"json\", data = \"<body>\")]\nasync fn auth(body: Json<AuthBody>) -> ApiResponse {\n let env_variables = match get_env_vars() {\n Ok(res) => res,\n Err(e) => {\n return ApiResponse {\n status: Status::InternalServerError,\n json: json!(e.to_string()),\n }\n }\n };\n\n if body.password != env_variables.app_password {\n return ApiResponse {\n status: Status::Forbidden,\n json: json!(\"Incorrect password\".to_string()),\n };\n }\n\n ApiResponse {\n status: Status::Ok,\n json: json!(\"Success\".to_string()),\n }\n}\n\n#[post(\"/api\", format = \"json\", data = \"<body>\")]\nasync fn api(body: Json<RequestBody>) -> ApiResponse {\n let env_variables = match get_env_vars() {\n Ok(res) => res,\n Err(e) => {\n return ApiResponse {\n status: Status::InternalServerError,\n json: json!(e.to_string()),\n }\n }\n };\n\n if body.password != env_variables.app_password {\n return ApiResponse {\n status: Status::Forbidden,\n json: json!(\"Incorrect password\".to_string()),\n };\n }\n\n println!(\"Start: {}\\nEnd: {}\", body.start, body.end);\n let start = DateTime::parse_from_rfc3339(&body.start)\n .unwrap()\n .with_timezone(&Utc);\n\n let end = DateTime::parse_from_rfc3339(&body.end)\n .unwrap()\n .with_timezone(&Utc);\n\n let mongodb_url = format!(\n \"mongodb://{}:{}@{}:{}\",\n env_variables.mongodb_username,\n env_variables.mongodb_password,\n env_variables.mongodb_host,\n env_variables.mongodb_port,\n );\n\n let client = mongodb::Client::with_uri_str(&mongodb_url).await.unwrap();\n let database = client.database(\"crypto-balance\");\n\n let available_snapshots = database::get_snapshots(&database, start, end).await;\n let needed_timespans = utils::get_timespans_to_retrieve(available_snapshots, start, end);\n\n if needed_timespans.is_empty() {\n let computed_snapshots = database::get_computed_snapshots(&database, start, end).await;\n let result = serde_json::to_value(&computed_snapshots).unwrap();\n return ApiResponse {\n status: Status::Ok,\n json: result,\n };\n }\n\n let split_by_30_days = utils::split_all_timespans_max_days(&needed_timespans, 30);\n\n let snapshots = match requests::get_all_snapshots(\n &env_variables,\n ACCOUNT_TYPE,\n 30,\n &split_by_30_days,\n )\n .await\n {\n Ok(snapshots) => snapshots,\n Err(e) => {\n return ApiResponse {\n status: Status::InternalServerError,\n json: json!(e.to_string()),\n }\n }\n };\n\n database::push_snapshots(&database, snapshots).await;\n\n let assets = database::get_possessed_assets(&database).await;\n let split_by_45_days = utils::split_all_timespans_max_days(&needed_timespans, 45);\n\n let price_history = match requests::get_all_history(\n &env_variables,\n &assets,\n &body.conversion,\n &split_by_45_days,\n )\n .await\n {\n Ok(price_history) => price_history,\n Err(e) => {\n return ApiResponse {\n status: Status::InternalServerError,\n json: json!(e.to_string()),\n }\n }\n };\n\n database::push_history(&database, price_history).await;\n\n let computed_snapshots = database::get_computed_snapshots(&database, start, end).await;\n let result = serde_json::to_value(&computed_snapshots).unwrap();\n ApiResponse {\n status: Status::Ok,\n json: result,\n }\n}\n\n#[rocket::main]\nasync fn main() {\n dotenv().ok();\n\n let res = rocket::build()\n .mount(\"/\", routes![index, auth, api, files])\n .launch()\n .await;\n\n res.expect(\"An error occured while launching the rocket.\")\n}\n"},"middle":{"kind":"string","value":"Ok(Environment {\n app_password,\n binance_key,\n binance_secret,\n nomics_key,\n mongodb_host,\n mongodb_port,\n mongodb_username,\n mongodb_password,\n })"},"strategy":{"kind":"string","value":"call_expression"},"context_items":{"kind":"list like","value":[{"content":"pub fn make_aggregate_query(start: DateTime<Utc>, end: DateTime<Utc>) -> Vec<bson::Document> {\n\n vec![\n\n doc! {\n\n \"$match\": {\n\n \"time\": {\n\n \"$gte\": start,\n\n \"$lte\": end\n\n }\n\n }\n\n },\n\n doc! {\n\n \"$sort\": {\n\n \"time\": 1\n\n }\n\n },\n\n doc! {\n\n \"$lookup\": {\n\n \"from\": \"history\",\n\n \"localField\": \"time\",\n\n \"foreignField\": \"time\",\n","file_path":"src/aggregate.rs","rank":0,"score":158000.05639397242},{"content":"pub fn get_uri_escaped_datetime(datetime: DateTime<Utc>) -> String {\n\n let formatted = datetime.to_rfc3339_opts(SecondsFormat::Secs, true);\n\n formatted.replace(\":\", \"%3A\")\n\n}\n\n\n","file_path":"src/utils.rs","rank":1,"score":118203.96395617942},{"content":"pub fn split_timespan_max_days(timespan: &TimeSpan, max_days: i64) -> Vec<TimeSpan> {\n\n if (timespan.end - timespan.start).num_days() < max_days {\n\n return vec![TimeSpan {\n\n start: timespan.start,\n\n end: timespan.end,\n\n }];\n\n }\n\n\n\n let mut timespans: Vec<TimeSpan> = vec![];\n\n\n\n let mut current_start = timespan.start;\n\n let mut current_end = timespan.start + Duration::days(max_days - 1);\n\n\n\n while current_end < timespan.end {\n\n timespans.push(TimeSpan {\n\n start: current_start,\n\n end: current_end,\n\n });\n\n\n\n current_start = current_end + Duration::days(1);\n","file_path":"src/utils.rs","rank":2,"score":116763.03020513375},{"content":"pub fn split_all_timespans_max_days(timespans: &[TimeSpan], max_days: i64) -> Vec<TimeSpan> {\n\n let mut results: Vec<TimeSpan> = vec![];\n\n\n\n for timespan in timespans {\n\n let mut intermediate_results = split_timespan_max_days(timespan, max_days);\n\n results.append(&mut intermediate_results);\n\n }\n\n\n\n results\n\n}\n\n\n","file_path":"src/utils.rs","rank":3,"score":114074.72010590954},{"content":"pub fn get_missing_timespans(needed: TimeSpan, available: TimeSpan) -> Vec<TimeSpan> {\n\n assert!(needed.start <= needed.end);\n\n assert!(available.start <= available.end);\n\n\n\n if needed.start >= available.start && needed.end <= available.end {\n\n return vec![];\n\n }\n\n\n\n if needed.start >= available.end && needed.end >= available.end {\n\n let start = if needed.start == available.end {\n\n needed.start + Duration::days(1)\n\n } else {\n\n needed.start\n\n };\n\n\n\n return vec![TimeSpan { start, ..needed }];\n\n }\n\n\n\n if needed.start <= available.start && needed.end <= available.start {\n\n let end = if needed.end == available.start {\n","file_path":"src/utils.rs","rank":4,"score":112191.69485296324},{"content":"pub fn get_mac_sha256(data: &String, secret: &String) -> String {\n\n let mut mac = HmacSha256::new_from_slice(secret.as_bytes()).unwrap();\n\n mac.update(data.as_bytes());\n\n\n\n let hash_message = mac.finalize().into_bytes();\n\n hex::encode(&hash_message)\n\n}\n","file_path":"src/utils.rs","rank":5,"score":109825.60195761104},{"content":"pub fn get_timespans_to_retrieve(\n\n snapshots: Vec<database::Snapshot>,\n\n start: DateTime<Utc>,\n\n end: DateTime<Utc>,\n\n) -> Vec<TimeSpan> {\n\n if snapshots.is_empty() {\n\n println!(\"No available data.\");\n\n return vec![TimeSpan { start, end }];\n\n }\n\n\n\n let database_start: DateTime<Utc> = snapshots.first().unwrap().time;\n\n let database_end: DateTime<Utc> = snapshots.last().unwrap().time;\n\n println!(\n\n \"Database start: {}\\nDatabase end: {}\",\n\n database_start, database_end\n\n );\n\n\n\n let needed = TimeSpan { start, end };\n\n\n\n let available = TimeSpan {\n","file_path":"src/utils.rs","rank":6,"score":103312.70446023237},{"content":"fn compute_value(asset_identifier: &str, amount_identifier: &str) -> bson::Document {\n\n doc! {\n\n \"$mergeObjects\": [\n\n {\n\n \"asset\": asset_identifier,\n\n \"amount\": amount_identifier,\n\n },\n\n {\n\n \"$let\": {\n\n \"vars\": {\n\n \"found\": {\n\n \"$first\": {\n\n \"$filter\": {\n\n \"input\": \"$prices\",\n\n \"as\": \"price\",\n\n \"cond\": {\n\n \"$eq\": [\"$$price.asset\", asset_identifier]\n\n }\n\n }\n\n }\n","file_path":"src/aggregate.rs","rank":7,"score":93364.02799592202},{"content":"type HmacSha256 = Hmac<Sha256>;\n\n\n","file_path":"src/utils.rs","rank":8,"score":60458.56674866275},{"content":"pub mod binance;\n\npub mod database;\n\npub mod nomics;","file_path":"src/model/mod.rs","rank":10,"score":45896.160397677246},{"content":"use chrono::{DateTime, Utc};\n\nuse mongodb::bson;\n\nuse mongodb::bson::doc;\n\n\n","file_path":"src/aggregate.rs","rank":12,"score":24032.186250832958},{"content":" \"as\": \"prices\"\n\n }\n\n },\n\n doc! {\n\n \"$project\": {\n\n \"time\": 1,\n\n \"total_asset_of_btc\": compute_value(\"BTC\", \"$total_asset_of_btc\"),\n\n \"balances\": {\n\n \"$map\": {\n\n \"input\": \"$balances\",\n\n \"as\": \"balance\",\n\n \"in\": compute_value(\"$$balance.asset\", \"$$balance.amount\")\n\n }\n\n }\n\n }\n\n },\n\n ]\n\n}\n\n\n","file_path":"src/aggregate.rs","rank":13,"score":24024.61549195697},{"content":" }\n\n },\n\n \"in\": {\n\n \"price\": \"$$found.price\",\n\n \"value\": { \"$multiply\": [amount_identifier, \"$$found.price\"] }\n\n }\n\n }\n\n }\n\n ]\n\n }\n\n}\n","file_path":"src/aggregate.rs","rank":14,"score":24024.484517151246},{"content":"use crate::model::{binance, database, nomics};\n\nuse crate::utils;\n\nuse crate::Environment;\n\nuse crate::TimeSpan;\n\nuse crate::{BINANCE_API_BASE_URL, NOMICS_API_BASE_URL};\n\nuse std::error::Error;\n\n\n\nuse chrono::{DateTime, Duration, TimeZone, Utc};\n\nuse reqwest::Client;\n\nuse std::time::SystemTime;\n\n\n\npub async fn get_all_snapshots(\n\n auth: &Environment,\n\n account_type: &str,\n\n limit: u8,\n\n timespans: &[TimeSpan],\n\n) -> Result<Vec<database::Snapshot>, Box<dyn Error>> {\n\n let mut snapshots = Vec::new();\n\n\n\n for timespan in timespans {\n","file_path":"src/requests.rs","rank":15,"score":23451.096681232222},{"content":" let mut snapshots = Vec::new();\n\n\n\n for timespan in timespans {\n\n let mut intermediate_results =\n\n match get_history(auth, ids, convert, timespan.start, timespan.end).await {\n\n Ok(intermediate_results) => intermediate_results,\n\n Err(e) => return Err(e),\n\n };\n\n\n\n snapshots.append(&mut intermediate_results);\n\n }\n\n\n\n Ok(snapshots)\n\n}\n\n\n\nasync fn get_snapshots(\n\n auth: &Environment,\n\n account_type: &str,\n\n limit: u8,\n\n start: DateTime<Utc>,\n","file_path":"src/requests.rs","rank":16,"score":23442.749906973295},{"content":" let intermediate_results =\n\n get_snapshots(auth, account_type, limit, timespan.start, timespan.end).await;\n\n\n\n let mut intermediate_results = match intermediate_results {\n\n Ok(intermediate_results) => intermediate_results,\n\n Err(e) => return Err(e),\n\n };\n\n\n\n snapshots.append(&mut intermediate_results);\n\n }\n\n\n\n Ok(snapshots)\n\n}\n\n\n\npub async fn get_all_history(\n\n auth: &Environment,\n\n ids: &[String],\n\n convert: &str,\n\n timespans: &[TimeSpan],\n\n) -> Result<Vec<database::CurrencyHistory>, Box<dyn Error>> {\n","file_path":"src/requests.rs","rank":17,"score":23442.69126325969},{"content":" convert: &str,\n\n start: DateTime<Utc>,\n\n end: DateTime<Utc>,\n\n) -> Result<Vec<database::CurrencyHistory>, Box<dyn Error>> {\n\n let client = Client::new();\n\n\n\n println!(\"Call Nomics API (start: {}, end: {})\", start, end);\n\n\n\n let params = format!(\n\n \"ids={}&convert={}&start={}&end={}\",\n\n ids.join(\",\"),\n\n convert,\n\n utils::get_uri_escaped_datetime(start),\n\n utils::get_uri_escaped_datetime(end),\n\n );\n\n\n\n let url = format!(\"{}?key={}&{}\", NOMICS_API_BASE_URL, auth.nomics_key, params);\n\n let res = client.get(url).send().await?;\n\n\n\n let json = match res.text().await {\n","file_path":"src/requests.rs","rank":18,"score":23441.961359993464},{"content":" .send()\n\n .await?;\n\n\n\n let json = match res.text().await {\n\n Ok(res) => res,\n\n Err(e) => return Err(Box::new(e)),\n\n };\n\n\n\n let obj = match serde_json::from_str::<binance::RootObject>(&json) {\n\n Ok(obj) => obj,\n\n Err(e) => return Err(Box::new(e)),\n\n };\n\n\n\n let snapshots: Vec<database::Snapshot> = obj\n\n .snapshots\n\n .iter()\n\n .map(|snapshot| database::Snapshot {\n\n time: chrono::Utc.timestamp_millis(snapshot.update_time) + Duration::seconds(1),\n\n balances: snapshot\n\n .data\n","file_path":"src/requests.rs","rank":19,"score":23441.320704387133},{"content":" end: DateTime<Utc>,\n\n) -> Result<Vec<database::Snapshot>, Box<dyn Error>> {\n\n let client = Client::new();\n\n\n\n let now = SystemTime::now()\n\n .duration_since(SystemTime::UNIX_EPOCH)\n\n .unwrap()\n\n .as_millis();\n\n\n\n let shifted_start = if start == end {\n\n start - Duration::days(1)\n\n } else {\n\n start - Duration::seconds(1)\n\n };\n\n\n\n let shifted_end = end - Duration::seconds(1);\n\n\n\n println!(\n\n \"Call Binance API (start: {}, end: {})\",\n\n shifted_start, shifted_end\n","file_path":"src/requests.rs","rank":20,"score":23440.19139354299},{"content":" Ok(res) => res,\n\n Err(e) => return Err(Box::new(e)),\n\n };\n\n\n\n let obj = match serde_json::from_str::<Vec<nomics::Sparkline>>(&json) {\n\n Ok(obj) => obj,\n\n Err(e) => return Err(Box::new(e)),\n\n };\n\n\n\n let history: Vec<database::CurrencyHistory> = obj\n\n .iter()\n\n .map(|history| {\n\n history\n\n .timestamps\n\n .iter()\n\n .enumerate()\n\n .map(|(i, timestamp)| database::CurrencyHistory {\n\n asset: history.currency.to_owned(),\n\n time: DateTime::parse_from_rfc3339(timestamp)\n\n .unwrap()\n","file_path":"src/requests.rs","rank":21,"score":23439.112356019945},{"content":" );\n\n\n\n let params = format!(\n\n \"type={}&limit={}×tamp={}&startTime={}&endTime={}\",\n\n account_type,\n\n limit,\n\n now,\n\n shifted_start.timestamp_millis(),\n\n shifted_end.timestamp_millis(),\n\n );\n\n\n\n let signature = utils::get_mac_sha256(¶ms, &auth.binance_secret);\n\n\n\n let url = format!(\n\n \"{}?{}&signature={}\",\n\n BINANCE_API_BASE_URL, params, signature\n\n );\n\n let res = client\n\n .get(url)\n\n .header(\"X-MBX-APIKEY\", auth.binance_key.to_owned())\n","file_path":"src/requests.rs","rank":22,"score":23437.563368993164},{"content":" .with_timezone(&Utc),\n\n price: history.prices[i].parse::<f32>().unwrap(),\n\n })\n\n .collect::<Vec<database::CurrencyHistory>>()\n\n })\n\n .flatten()\n\n .collect();\n\n\n\n println!(\"Got {} currencies history.\", history.len());\n\n\n\n Ok(history)\n\n}\n","file_path":"src/requests.rs","rank":23,"score":23436.377991114736},{"content":" .balances\n\n .iter()\n\n .filter(|balance| balance.free.parse::<f32>().unwrap() > 0.)\n\n .map(|balance| database::Balance {\n\n asset: balance.asset.to_owned(),\n\n amount: balance.free.parse::<f32>().unwrap(),\n\n })\n\n .collect(),\n\n total_asset_of_btc: snapshot.data.total_asset_of_btc.parse::<f32>().unwrap(),\n\n })\n\n .collect();\n\n\n\n println!(\"Got {} snapshots.\", snapshots.len());\n\n\n\n Ok(snapshots)\n\n}\n\n\n\nasync fn get_history(\n\n auth: &Environment,\n\n ids: &[String],\n","file_path":"src/requests.rs","rank":24,"score":23435.589795824322},{"content":"use crate::model::database;\n\nuse crate::TimeSpan;\n\n\n\nuse chrono::{DateTime, Duration, SecondsFormat, Utc};\n\n\n\nuse hmac::{Hmac, Mac, NewMac};\n\nuse sha2::Sha256;\n\n\n","file_path":"src/utils.rs","rank":25,"score":23323.62139954478},{"content":" current_end = current_start + Duration::days(max_days - 1);\n\n }\n\n\n\n timespans.push(TimeSpan {\n\n start: current_start,\n\n end: timespan.end,\n\n });\n\n\n\n timespans\n\n}\n\n\n","file_path":"src/utils.rs","rank":26,"score":23316.039437298794},{"content":" start: database_start,\n\n end: database_end,\n\n };\n\n\n\n let missing = get_missing_timespans(needed, available);\n\n\n\n println!(\"Missing: {:?}\", missing);\n\n\n\n missing\n\n}\n\n\n","file_path":"src/utils.rs","rank":27,"score":23315.148905314923},{"content":" needed.end - Duration::days(1)\n\n } else {\n\n needed.end\n\n };\n\n\n\n return vec![TimeSpan { end, ..needed }];\n\n }\n\n\n\n if needed.start <= available.start && needed.end <= available.end {\n\n let end = available.start - Duration::days(1);\n\n return vec![TimeSpan { end, ..needed }];\n\n }\n\n\n\n if needed.start >= available.start && needed.end >= available.end {\n\n let start = available.end + Duration::days(1);\n\n return vec![TimeSpan { start, ..needed }];\n\n }\n\n\n\n if needed.start <= available.start && needed.end >= available.end {\n\n let end = available.start - Duration::days(1);\n\n let start = available.end + Duration::days(1);\n\n return vec![TimeSpan { end, ..needed }, TimeSpan { start, ..needed }];\n\n }\n\n\n\n panic!(\"Unsupported case!\");\n\n}\n\n\n","file_path":"src/utils.rs","rank":28,"score":23313.428891407275},{"content":"use bson::serde_helpers::chrono_datetime_as_bson_datetime;\n\nuse chrono::{DateTime, Utc};\n\nuse serde::{Deserialize, Serialize};\n\n\n\n/* Collection: snapshots */\n\n\n\n#[derive(Serialize, Deserialize)]\n\npub struct Snapshot {\n\n #[serde(with = \"chrono_datetime_as_bson_datetime\")]\n\n pub time: DateTime<Utc>,\n\n pub total_asset_of_btc: f32,\n\n pub balances: Vec<Balance>,\n\n}\n\n\n\n#[derive(Serialize, Deserialize)]\n\npub struct Balance {\n\n pub asset: String,\n\n pub amount: f32,\n\n}\n\n\n","file_path":"src/model/database.rs","rank":29,"score":22693.528860520615},{"content":"/* Collection: history */\n\n\n\n#[derive(Serialize, Deserialize)]\n\npub struct CurrencyHistory {\n\n #[serde(with = \"chrono_datetime_as_bson_datetime\")]\n\n pub time: DateTime<Utc>,\n\n pub asset: String,\n\n pub price: f32,\n\n}\n\n\n\n/* Aggregation results */\n\n\n\n#[derive(Serialize, Deserialize)]\n\npub struct ComputedSnapshot {\n\n #[serde(with = \"chrono_datetime_as_bson_datetime\")]\n\n pub time: DateTime<Utc>,\n\n pub total_asset_of_btc: ComputedBalance,\n\n pub balances: Vec<ComputedBalance>,\n\n}\n\n\n\n#[derive(Serialize, Deserialize)]\n\npub struct ComputedBalance {\n\n pub asset: String,\n\n pub amount: f32,\n\n pub price: Option<f32>,\n\n pub value: Option<f32>,\n\n}\n","file_path":"src/model/database.rs","rank":30,"score":22692.081352810084},{"content":"use serde::{Deserialize, Serialize};\n\n\n\n#[derive(Serialize, Deserialize)]\n\npub struct Sparkline {\n\n pub currency: String,\n\n pub timestamps: Vec<String>,\n\n pub prices: Vec<String>,\n\n}","file_path":"src/model/nomics.rs","rank":31,"score":22691.99335891715},{"content":"use serde::{Deserialize, Serialize};\n\n\n\n#[derive(Serialize, Deserialize)]\n\npub struct RootObject {\n\n pub code: i64,\n\n pub msg: String,\n\n #[serde(rename = \"snapshotVos\")]\n\n pub snapshots: Vec<Snapshot>,\n\n}\n\n\n\n#[derive(Serialize, Deserialize)]\n\npub struct Snapshot {\n\n #[serde(rename = \"type\")]\n\n pub account_type: String,\n\n #[serde(rename = \"updateTime\")]\n\n pub update_time: i64,\n\n pub data: Data,\n\n}\n\n\n\n#[derive(Serialize, Deserialize)]\n","file_path":"src/model/binance.rs","rank":32,"score":22690.276977097365},{"content":"pub struct Data {\n\n #[serde(rename = \"totalAssetOfBtc\")]\n\n pub total_asset_of_btc: String,\n\n pub balances: Vec<Balance>,\n\n}\n\n\n\n#[derive(Serialize, Deserialize)]\n\npub struct Balance {\n\n pub asset: String,\n\n pub free: String,\n\n pub locked: String,\n\n}\n","file_path":"src/model/binance.rs","rank":33,"score":22687.582353059675},{"content":"use crate::aggregate::make_aggregate_query;\n\nuse crate::model::database;\n\nuse crate::rocket::futures::StreamExt;\n\n\n\nuse bson::Bson;\n\nuse bson::Document;\n\nuse chrono::{DateTime, Utc};\n\nuse mongodb::bson::doc;\n\nuse mongodb::options::FindOptions;\n\nuse mongodb::Collection;\n\nuse mongodb::Database;\n\nuse std::iter::Iterator;\n\n\n\npub async fn get_snapshots(\n\n database: &Database,\n\n start: DateTime<Utc>,\n\n end: DateTime<Utc>,\n\n) -> Vec<database::Snapshot> {\n\n let collection: Collection<Document> = database.collection(\"snapshots\");\n\n\n","file_path":"src/database.rs","rank":37,"score":17.972965032584852},{"content":" .iter()\n\n .map(|history| bson::ser::to_document(history).unwrap())\n\n .collect();\n\n\n\n let res = collection.insert_many(docs, None).await;\n\n res.expect(\"Could not insert the history.\");\n\n}\n\n\n\npub async fn get_computed_snapshots(\n\n database: &Database,\n\n start: DateTime<Utc>,\n\n end: DateTime<Utc>,\n\n) -> Vec<database::ComputedSnapshot> {\n\n let collection: Collection<Document> = database.collection(\"snapshots\");\n\n\n\n let computed_snapshots: Vec<database::ComputedSnapshot> = collection\n\n .aggregate(make_aggregate_query(start, end), None)\n\n .await\n\n .unwrap()\n\n .collect::<Vec<_>>()\n\n .await\n\n .into_iter()\n\n .flatten()\n\n .map(|document| bson::from_bson(Bson::Document(document)).unwrap())\n\n .collect();\n\n\n\n computed_snapshots\n\n}\n","file_path":"src/database.rs","rank":42,"score":7.621164688374066},{"content":"### Why Binance?\n\n\n\nBecause that's what I use personally! 😅\n\n\n\nMaximum time range for one request: 30 days.\n\n\n\nGo [here](https://binance.zendesk.com/hc/en-us/articles/360002502072-How-to-create-API) to know how to create a Binance API key.\n\n\n\n### Why Nomics?\n\n\n\nIt's the only API I found which can give an history anywhere in time **for free**. And the free plan accepts 1 request per second, which is reasonable.\n\n\n\nMaximum time range for one request: 45 days.\n\n\n\nGo [here](https://p.nomics.com/cryptocurrency-bitcoin-api) to know how to create a Nomics API key.\n\n\n\n### How it works?\n\n\n\n- Receives an API request from the frontend\n\n- Gets data stored in the MongoDB database\n\n- Computes the time range of this data\n\n- Computes the needed timespans to fill in the blanks (returns vector of timespans)\n\n- If the vector is empty\n\n - It's up to date\n\n - Aggregates data (wallet snapshots with price history) and returns as JSON\n\n- If the vector contains 1 (before or after) or 2 (before and after) timespans\n\n - Split the timespans in multiple timespans of N days maximum (because of API's time range limit)\n\n - Do as many API requests as timespans\n\n - Upload the results to the database (the time is a primary key)\n\n - Aggregates data (wallet snapshots with price history) and returns as JSON\n\n\n\n## Frontend\n\n\n\n- Built with React\n\n- Charts are made with [Recharts](https://recharts.org/en-US/)\n\n- Built with [esbuild](https://esbuild.github.io/)\n","file_path":"README.md","rank":43,"score":7.004629981581419},{"content":" .collect()\n\n}\n\n\n\npub async fn push_snapshots(database: &Database, snapshots: Vec<database::Snapshot>) {\n\n let collection: Collection<Document> = database.collection(\"snapshots\");\n\n\n\n let docs: Vec<bson::Document> = snapshots\n\n .iter()\n\n .map(|history| bson::ser::to_document(history).unwrap())\n\n .collect();\n\n\n\n let res = collection.insert_many(docs, None).await;\n\n res.expect(\"Could not insert the snapshots.\");\n\n}\n\n\n\npub async fn get_possessed_assets(database: &Database) -> Vec<String> {\n\n let collection: Collection<Document> = database.collection(\"snapshots\");\n\n\n\n let mut assets: Vec<String> = collection\n\n .distinct(\"balances.asset\", None, None)\n","file_path":"src/database.rs","rank":47,"score":5.330570423693241},{"content":" .await\n\n .unwrap()\n\n .iter()\n\n .map(|document| bson::from_bson(document.to_owned()).unwrap())\n\n .collect();\n\n\n\n let bitcoin_asset = \"BTC\".to_string();\n\n\n\n if !assets.contains(&bitcoin_asset) {\n\n assets.push(bitcoin_asset);\n\n }\n\n\n\n assets.sort_unstable();\n\n assets\n\n}\n\n\n\npub async fn push_history(database: &Database, price_history: Vec<database::CurrencyHistory>) {\n\n let collection: Collection<Document> = database.collection(\"history\");\n\n\n\n let docs: Vec<bson::Document> = price_history\n","file_path":"src/database.rs","rank":49,"score":4.217521003353917},{"content":" // Sort with older first.\n\n let find_options = FindOptions::builder().sort(doc! {\"time\": 1}).build();\n\n\n\n collection\n\n .find(\n\n doc! {\n\n \"time\": {\n\n \"$gte\": start,\n\n \"$lte\": end,\n\n }\n\n },\n\n find_options,\n\n )\n\n .await\n\n .unwrap()\n\n .collect::<Vec<_>>()\n\n .await\n\n .into_iter()\n\n .flatten()\n\n .map(|document| bson::from_bson(Bson::Document(document)).unwrap())\n","file_path":"src/database.rs","rank":50,"score":2.9187549324312165},{"content":"# Crypto Balance\n\n\n\nA web application made with Rust and React.\n\n\n\nYou can see an area chart with all your cryptocurrencies in the same chart. And a **full pie chart** whereas the one Binance offers groups every little amount of crypto in a single \"Others\" section...\n\n\n\n\n\n\n\n## Usage\n\n\n\nYou can use this web application with docker-compose.\n\n\n\nEdit the `.env` file at the root of the project with your personal API keys.\n\n\n\nOnce done, simply do the following:\n\n\n\n```bash\n\ndocker-compose build\n\ndocker-compose up -d\n\n```\n\n\n\nThis will start `mongo` (the database), `mongo-express` (a web interface to manage the database) and `crypto-balance`.\n\n\n\nYou can access:\n\n\n\n- The web app via http://127.0.0.1/\n\n- The MongoDB web interface via http://127.0.0.1:8081/\n\n- The database via the port 27017\n\n\n\n**Note:** You might need to build with either `DOCKER_BUILDKIT=1` or `COMPOSE_DOCKER_CLI_BUILD=1` depending on your docker-compose version. Upgrade to at least v2.0.0 to build without any of these flags.\n\n\n\n## Backend\n\n\n\nThe backend (in Rust) gets daily snapshots of your wallets and the price history for each cryptocurrency you have in your wallets.\n\n\n\nUsed APIs:\n\n\n\n- Binance API for the wallets snapshots (with the [Daily Account Snapshot](https://binance-docs.github.io/apidocs/spot/en/#daily-account-snapshot-user_data) endpoint)\n\n- Nomics API for the price history (with the [Currencies Sparkline](https://nomics.com/docs/#operation/getCurrenciesSparkline) endpoint)\n\n\n\nThe Binance API **does not give the fiat amount** corresponding to each cryptocurrency you have, hence the need of the Nomics API to get the price history.\n\n\n\nA MongoDB database is used to store this data as NoSQL. So when we ask for data in a time range, only the missing data is requested to APIs. The database contains **daily** data points and it is normalized to be at midnight (00:00) for each day.\n\n\n\n- Binance API saves snapshots each day at 23:59 (stored in MongoDB as +1 minute, which is the next day)\n\n- Nomics API gives a price history with data points at 00:00 (stored in MongoDB as is)\n\n\n","file_path":"README.md","rank":51,"score":2.6615320672727893}],"string":"[\n {\n \"content\": \"pub fn make_aggregate_query(start: DateTime<Utc>, end: DateTime<Utc>) -> Vec<bson::Document> {\\n\\n vec![\\n\\n doc! {\\n\\n \\\"$match\\\": {\\n\\n \\\"time\\\": {\\n\\n \\\"$gte\\\": start,\\n\\n \\\"$lte\\\": end\\n\\n }\\n\\n }\\n\\n },\\n\\n doc! {\\n\\n \\\"$sort\\\": {\\n\\n \\\"time\\\": 1\\n\\n }\\n\\n },\\n\\n doc! {\\n\\n \\\"$lookup\\\": {\\n\\n \\\"from\\\": \\\"history\\\",\\n\\n \\\"localField\\\": \\\"time\\\",\\n\\n \\\"foreignField\\\": \\\"time\\\",\\n\",\n \"file_path\": \"src/aggregate.rs\",\n \"rank\": 0,\n \"score\": 158000.05639397242\n },\n {\n \"content\": \"pub fn get_uri_escaped_datetime(datetime: DateTime<Utc>) -> String {\\n\\n let formatted = datetime.to_rfc3339_opts(SecondsFormat::Secs, true);\\n\\n formatted.replace(\\\":\\\", \\\"%3A\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 1,\n \"score\": 118203.96395617942\n },\n {\n \"content\": \"pub fn split_timespan_max_days(timespan: &TimeSpan, max_days: i64) -> Vec<TimeSpan> {\\n\\n if (timespan.end - timespan.start).num_days() < max_days {\\n\\n return vec![TimeSpan {\\n\\n start: timespan.start,\\n\\n end: timespan.end,\\n\\n }];\\n\\n }\\n\\n\\n\\n let mut timespans: Vec<TimeSpan> = vec![];\\n\\n\\n\\n let mut current_start = timespan.start;\\n\\n let mut current_end = timespan.start + Duration::days(max_days - 1);\\n\\n\\n\\n while current_end < timespan.end {\\n\\n timespans.push(TimeSpan {\\n\\n start: current_start,\\n\\n end: current_end,\\n\\n });\\n\\n\\n\\n current_start = current_end + Duration::days(1);\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 2,\n \"score\": 116763.03020513375\n },\n {\n \"content\": \"pub fn split_all_timespans_max_days(timespans: &[TimeSpan], max_days: i64) -> Vec<TimeSpan> {\\n\\n let mut results: Vec<TimeSpan> = vec![];\\n\\n\\n\\n for timespan in timespans {\\n\\n let mut intermediate_results = split_timespan_max_days(timespan, max_days);\\n\\n results.append(&mut intermediate_results);\\n\\n }\\n\\n\\n\\n results\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 3,\n \"score\": 114074.72010590954\n },\n {\n \"content\": \"pub fn get_missing_timespans(needed: TimeSpan, available: TimeSpan) -> Vec<TimeSpan> {\\n\\n assert!(needed.start <= needed.end);\\n\\n assert!(available.start <= available.end);\\n\\n\\n\\n if needed.start >= available.start && needed.end <= available.end {\\n\\n return vec![];\\n\\n }\\n\\n\\n\\n if needed.start >= available.end && needed.end >= available.end {\\n\\n let start = if needed.start == available.end {\\n\\n needed.start + Duration::days(1)\\n\\n } else {\\n\\n needed.start\\n\\n };\\n\\n\\n\\n return vec![TimeSpan { start, ..needed }];\\n\\n }\\n\\n\\n\\n if needed.start <= available.start && needed.end <= available.start {\\n\\n let end = if needed.end == available.start {\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 4,\n \"score\": 112191.69485296324\n },\n {\n \"content\": \"pub fn get_mac_sha256(data: &String, secret: &String) -> String {\\n\\n let mut mac = HmacSha256::new_from_slice(secret.as_bytes()).unwrap();\\n\\n mac.update(data.as_bytes());\\n\\n\\n\\n let hash_message = mac.finalize().into_bytes();\\n\\n hex::encode(&hash_message)\\n\\n}\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 5,\n \"score\": 109825.60195761104\n },\n {\n \"content\": \"pub fn get_timespans_to_retrieve(\\n\\n snapshots: Vec<database::Snapshot>,\\n\\n start: DateTime<Utc>,\\n\\n end: DateTime<Utc>,\\n\\n) -> Vec<TimeSpan> {\\n\\n if snapshots.is_empty() {\\n\\n println!(\\\"No available data.\\\");\\n\\n return vec![TimeSpan { start, end }];\\n\\n }\\n\\n\\n\\n let database_start: DateTime<Utc> = snapshots.first().unwrap().time;\\n\\n let database_end: DateTime<Utc> = snapshots.last().unwrap().time;\\n\\n println!(\\n\\n \\\"Database start: {}\\\\nDatabase end: {}\\\",\\n\\n database_start, database_end\\n\\n );\\n\\n\\n\\n let needed = TimeSpan { start, end };\\n\\n\\n\\n let available = TimeSpan {\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 6,\n \"score\": 103312.70446023237\n },\n {\n \"content\": \"fn compute_value(asset_identifier: &str, amount_identifier: &str) -> bson::Document {\\n\\n doc! {\\n\\n \\\"$mergeObjects\\\": [\\n\\n {\\n\\n \\\"asset\\\": asset_identifier,\\n\\n \\\"amount\\\": amount_identifier,\\n\\n },\\n\\n {\\n\\n \\\"$let\\\": {\\n\\n \\\"vars\\\": {\\n\\n \\\"found\\\": {\\n\\n \\\"$first\\\": {\\n\\n \\\"$filter\\\": {\\n\\n \\\"input\\\": \\\"$prices\\\",\\n\\n \\\"as\\\": \\\"price\\\",\\n\\n \\\"cond\\\": {\\n\\n \\\"$eq\\\": [\\\"$$price.asset\\\", asset_identifier]\\n\\n }\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/aggregate.rs\",\n \"rank\": 7,\n \"score\": 93364.02799592202\n },\n {\n \"content\": \"type HmacSha256 = Hmac<Sha256>;\\n\\n\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 8,\n \"score\": 60458.56674866275\n },\n {\n \"content\": \"pub mod binance;\\n\\npub mod database;\\n\\npub mod nomics;\",\n \"file_path\": \"src/model/mod.rs\",\n \"rank\": 10,\n \"score\": 45896.160397677246\n },\n {\n \"content\": \"use chrono::{DateTime, Utc};\\n\\nuse mongodb::bson;\\n\\nuse mongodb::bson::doc;\\n\\n\\n\",\n \"file_path\": \"src/aggregate.rs\",\n \"rank\": 12,\n \"score\": 24032.186250832958\n },\n {\n \"content\": \" \\\"as\\\": \\\"prices\\\"\\n\\n }\\n\\n },\\n\\n doc! {\\n\\n \\\"$project\\\": {\\n\\n \\\"time\\\": 1,\\n\\n \\\"total_asset_of_btc\\\": compute_value(\\\"BTC\\\", \\\"$total_asset_of_btc\\\"),\\n\\n \\\"balances\\\": {\\n\\n \\\"$map\\\": {\\n\\n \\\"input\\\": \\\"$balances\\\",\\n\\n \\\"as\\\": \\\"balance\\\",\\n\\n \\\"in\\\": compute_value(\\\"$$balance.asset\\\", \\\"$$balance.amount\\\")\\n\\n }\\n\\n }\\n\\n }\\n\\n },\\n\\n ]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/aggregate.rs\",\n \"rank\": 13,\n \"score\": 24024.61549195697\n },\n {\n \"content\": \" }\\n\\n },\\n\\n \\\"in\\\": {\\n\\n \\\"price\\\": \\\"$$found.price\\\",\\n\\n \\\"value\\\": { \\\"$multiply\\\": [amount_identifier, \\\"$$found.price\\\"] }\\n\\n }\\n\\n }\\n\\n }\\n\\n ]\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/aggregate.rs\",\n \"rank\": 14,\n \"score\": 24024.484517151246\n },\n {\n \"content\": \"use crate::model::{binance, database, nomics};\\n\\nuse crate::utils;\\n\\nuse crate::Environment;\\n\\nuse crate::TimeSpan;\\n\\nuse crate::{BINANCE_API_BASE_URL, NOMICS_API_BASE_URL};\\n\\nuse std::error::Error;\\n\\n\\n\\nuse chrono::{DateTime, Duration, TimeZone, Utc};\\n\\nuse reqwest::Client;\\n\\nuse std::time::SystemTime;\\n\\n\\n\\npub async fn get_all_snapshots(\\n\\n auth: &Environment,\\n\\n account_type: &str,\\n\\n limit: u8,\\n\\n timespans: &[TimeSpan],\\n\\n) -> Result<Vec<database::Snapshot>, Box<dyn Error>> {\\n\\n let mut snapshots = Vec::new();\\n\\n\\n\\n for timespan in timespans {\\n\",\n \"file_path\": \"src/requests.rs\",\n \"rank\": 15,\n \"score\": 23451.096681232222\n },\n {\n \"content\": \" let mut snapshots = Vec::new();\\n\\n\\n\\n for timespan in timespans {\\n\\n let mut intermediate_results =\\n\\n match get_history(auth, ids, convert, timespan.start, timespan.end).await {\\n\\n Ok(intermediate_results) => intermediate_results,\\n\\n Err(e) => return Err(e),\\n\\n };\\n\\n\\n\\n snapshots.append(&mut intermediate_results);\\n\\n }\\n\\n\\n\\n Ok(snapshots)\\n\\n}\\n\\n\\n\\nasync fn get_snapshots(\\n\\n auth: &Environment,\\n\\n account_type: &str,\\n\\n limit: u8,\\n\\n start: DateTime<Utc>,\\n\",\n \"file_path\": \"src/requests.rs\",\n \"rank\": 16,\n \"score\": 23442.749906973295\n },\n {\n \"content\": \" let intermediate_results =\\n\\n get_snapshots(auth, account_type, limit, timespan.start, timespan.end).await;\\n\\n\\n\\n let mut intermediate_results = match intermediate_results {\\n\\n Ok(intermediate_results) => intermediate_results,\\n\\n Err(e) => return Err(e),\\n\\n };\\n\\n\\n\\n snapshots.append(&mut intermediate_results);\\n\\n }\\n\\n\\n\\n Ok(snapshots)\\n\\n}\\n\\n\\n\\npub async fn get_all_history(\\n\\n auth: &Environment,\\n\\n ids: &[String],\\n\\n convert: &str,\\n\\n timespans: &[TimeSpan],\\n\\n) -> Result<Vec<database::CurrencyHistory>, Box<dyn Error>> {\\n\",\n \"file_path\": \"src/requests.rs\",\n \"rank\": 17,\n \"score\": 23442.69126325969\n },\n {\n \"content\": \" convert: &str,\\n\\n start: DateTime<Utc>,\\n\\n end: DateTime<Utc>,\\n\\n) -> Result<Vec<database::CurrencyHistory>, Box<dyn Error>> {\\n\\n let client = Client::new();\\n\\n\\n\\n println!(\\\"Call Nomics API (start: {}, end: {})\\\", start, end);\\n\\n\\n\\n let params = format!(\\n\\n \\\"ids={}&convert={}&start={}&end={}\\\",\\n\\n ids.join(\\\",\\\"),\\n\\n convert,\\n\\n utils::get_uri_escaped_datetime(start),\\n\\n utils::get_uri_escaped_datetime(end),\\n\\n );\\n\\n\\n\\n let url = format!(\\\"{}?key={}&{}\\\", NOMICS_API_BASE_URL, auth.nomics_key, params);\\n\\n let res = client.get(url).send().await?;\\n\\n\\n\\n let json = match res.text().await {\\n\",\n \"file_path\": \"src/requests.rs\",\n \"rank\": 18,\n \"score\": 23441.961359993464\n },\n {\n \"content\": \" .send()\\n\\n .await?;\\n\\n\\n\\n let json = match res.text().await {\\n\\n Ok(res) => res,\\n\\n Err(e) => return Err(Box::new(e)),\\n\\n };\\n\\n\\n\\n let obj = match serde_json::from_str::<binance::RootObject>(&json) {\\n\\n Ok(obj) => obj,\\n\\n Err(e) => return Err(Box::new(e)),\\n\\n };\\n\\n\\n\\n let snapshots: Vec<database::Snapshot> = obj\\n\\n .snapshots\\n\\n .iter()\\n\\n .map(|snapshot| database::Snapshot {\\n\\n time: chrono::Utc.timestamp_millis(snapshot.update_time) + Duration::seconds(1),\\n\\n balances: snapshot\\n\\n .data\\n\",\n \"file_path\": \"src/requests.rs\",\n \"rank\": 19,\n \"score\": 23441.320704387133\n },\n {\n \"content\": \" end: DateTime<Utc>,\\n\\n) -> Result<Vec<database::Snapshot>, Box<dyn Error>> {\\n\\n let client = Client::new();\\n\\n\\n\\n let now = SystemTime::now()\\n\\n .duration_since(SystemTime::UNIX_EPOCH)\\n\\n .unwrap()\\n\\n .as_millis();\\n\\n\\n\\n let shifted_start = if start == end {\\n\\n start - Duration::days(1)\\n\\n } else {\\n\\n start - Duration::seconds(1)\\n\\n };\\n\\n\\n\\n let shifted_end = end - Duration::seconds(1);\\n\\n\\n\\n println!(\\n\\n \\\"Call Binance API (start: {}, end: {})\\\",\\n\\n shifted_start, shifted_end\\n\",\n \"file_path\": \"src/requests.rs\",\n \"rank\": 20,\n \"score\": 23440.19139354299\n },\n {\n \"content\": \" Ok(res) => res,\\n\\n Err(e) => return Err(Box::new(e)),\\n\\n };\\n\\n\\n\\n let obj = match serde_json::from_str::<Vec<nomics::Sparkline>>(&json) {\\n\\n Ok(obj) => obj,\\n\\n Err(e) => return Err(Box::new(e)),\\n\\n };\\n\\n\\n\\n let history: Vec<database::CurrencyHistory> = obj\\n\\n .iter()\\n\\n .map(|history| {\\n\\n history\\n\\n .timestamps\\n\\n .iter()\\n\\n .enumerate()\\n\\n .map(|(i, timestamp)| database::CurrencyHistory {\\n\\n asset: history.currency.to_owned(),\\n\\n time: DateTime::parse_from_rfc3339(timestamp)\\n\\n .unwrap()\\n\",\n \"file_path\": \"src/requests.rs\",\n \"rank\": 21,\n \"score\": 23439.112356019945\n },\n {\n \"content\": \" );\\n\\n\\n\\n let params = format!(\\n\\n \\\"type={}&limit={}×tamp={}&startTime={}&endTime={}\\\",\\n\\n account_type,\\n\\n limit,\\n\\n now,\\n\\n shifted_start.timestamp_millis(),\\n\\n shifted_end.timestamp_millis(),\\n\\n );\\n\\n\\n\\n let signature = utils::get_mac_sha256(¶ms, &auth.binance_secret);\\n\\n\\n\\n let url = format!(\\n\\n \\\"{}?{}&signature={}\\\",\\n\\n BINANCE_API_BASE_URL, params, signature\\n\\n );\\n\\n let res = client\\n\\n .get(url)\\n\\n .header(\\\"X-MBX-APIKEY\\\", auth.binance_key.to_owned())\\n\",\n \"file_path\": \"src/requests.rs\",\n \"rank\": 22,\n \"score\": 23437.563368993164\n },\n {\n \"content\": \" .with_timezone(&Utc),\\n\\n price: history.prices[i].parse::<f32>().unwrap(),\\n\\n })\\n\\n .collect::<Vec<database::CurrencyHistory>>()\\n\\n })\\n\\n .flatten()\\n\\n .collect();\\n\\n\\n\\n println!(\\\"Got {} currencies history.\\\", history.len());\\n\\n\\n\\n Ok(history)\\n\\n}\\n\",\n \"file_path\": \"src/requests.rs\",\n \"rank\": 23,\n \"score\": 23436.377991114736\n },\n {\n \"content\": \" .balances\\n\\n .iter()\\n\\n .filter(|balance| balance.free.parse::<f32>().unwrap() > 0.)\\n\\n .map(|balance| database::Balance {\\n\\n asset: balance.asset.to_owned(),\\n\\n amount: balance.free.parse::<f32>().unwrap(),\\n\\n })\\n\\n .collect(),\\n\\n total_asset_of_btc: snapshot.data.total_asset_of_btc.parse::<f32>().unwrap(),\\n\\n })\\n\\n .collect();\\n\\n\\n\\n println!(\\\"Got {} snapshots.\\\", snapshots.len());\\n\\n\\n\\n Ok(snapshots)\\n\\n}\\n\\n\\n\\nasync fn get_history(\\n\\n auth: &Environment,\\n\\n ids: &[String],\\n\",\n \"file_path\": \"src/requests.rs\",\n \"rank\": 24,\n \"score\": 23435.589795824322\n },\n {\n \"content\": \"use crate::model::database;\\n\\nuse crate::TimeSpan;\\n\\n\\n\\nuse chrono::{DateTime, Duration, SecondsFormat, Utc};\\n\\n\\n\\nuse hmac::{Hmac, Mac, NewMac};\\n\\nuse sha2::Sha256;\\n\\n\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 25,\n \"score\": 23323.62139954478\n },\n {\n \"content\": \" current_end = current_start + Duration::days(max_days - 1);\\n\\n }\\n\\n\\n\\n timespans.push(TimeSpan {\\n\\n start: current_start,\\n\\n end: timespan.end,\\n\\n });\\n\\n\\n\\n timespans\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 26,\n \"score\": 23316.039437298794\n },\n {\n \"content\": \" start: database_start,\\n\\n end: database_end,\\n\\n };\\n\\n\\n\\n let missing = get_missing_timespans(needed, available);\\n\\n\\n\\n println!(\\\"Missing: {:?}\\\", missing);\\n\\n\\n\\n missing\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 27,\n \"score\": 23315.148905314923\n },\n {\n \"content\": \" needed.end - Duration::days(1)\\n\\n } else {\\n\\n needed.end\\n\\n };\\n\\n\\n\\n return vec![TimeSpan { end, ..needed }];\\n\\n }\\n\\n\\n\\n if needed.start <= available.start && needed.end <= available.end {\\n\\n let end = available.start - Duration::days(1);\\n\\n return vec![TimeSpan { end, ..needed }];\\n\\n }\\n\\n\\n\\n if needed.start >= available.start && needed.end >= available.end {\\n\\n let start = available.end + Duration::days(1);\\n\\n return vec![TimeSpan { start, ..needed }];\\n\\n }\\n\\n\\n\\n if needed.start <= available.start && needed.end >= available.end {\\n\\n let end = available.start - Duration::days(1);\\n\\n let start = available.end + Duration::days(1);\\n\\n return vec![TimeSpan { end, ..needed }, TimeSpan { start, ..needed }];\\n\\n }\\n\\n\\n\\n panic!(\\\"Unsupported case!\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 28,\n \"score\": 23313.428891407275\n },\n {\n \"content\": \"use bson::serde_helpers::chrono_datetime_as_bson_datetime;\\n\\nuse chrono::{DateTime, Utc};\\n\\nuse serde::{Deserialize, Serialize};\\n\\n\\n\\n/* Collection: snapshots */\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\\npub struct Snapshot {\\n\\n #[serde(with = \\\"chrono_datetime_as_bson_datetime\\\")]\\n\\n pub time: DateTime<Utc>,\\n\\n pub total_asset_of_btc: f32,\\n\\n pub balances: Vec<Balance>,\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\\npub struct Balance {\\n\\n pub asset: String,\\n\\n pub amount: f32,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/model/database.rs\",\n \"rank\": 29,\n \"score\": 22693.528860520615\n },\n {\n \"content\": \"/* Collection: history */\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\\npub struct CurrencyHistory {\\n\\n #[serde(with = \\\"chrono_datetime_as_bson_datetime\\\")]\\n\\n pub time: DateTime<Utc>,\\n\\n pub asset: String,\\n\\n pub price: f32,\\n\\n}\\n\\n\\n\\n/* Aggregation results */\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\\npub struct ComputedSnapshot {\\n\\n #[serde(with = \\\"chrono_datetime_as_bson_datetime\\\")]\\n\\n pub time: DateTime<Utc>,\\n\\n pub total_asset_of_btc: ComputedBalance,\\n\\n pub balances: Vec<ComputedBalance>,\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\\npub struct ComputedBalance {\\n\\n pub asset: String,\\n\\n pub amount: f32,\\n\\n pub price: Option<f32>,\\n\\n pub value: Option<f32>,\\n\\n}\\n\",\n \"file_path\": \"src/model/database.rs\",\n \"rank\": 30,\n \"score\": 22692.081352810084\n },\n {\n \"content\": \"use serde::{Deserialize, Serialize};\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\\npub struct Sparkline {\\n\\n pub currency: String,\\n\\n pub timestamps: Vec<String>,\\n\\n pub prices: Vec<String>,\\n\\n}\",\n \"file_path\": \"src/model/nomics.rs\",\n \"rank\": 31,\n \"score\": 22691.99335891715\n },\n {\n \"content\": \"use serde::{Deserialize, Serialize};\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\\npub struct RootObject {\\n\\n pub code: i64,\\n\\n pub msg: String,\\n\\n #[serde(rename = \\\"snapshotVos\\\")]\\n\\n pub snapshots: Vec<Snapshot>,\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\\npub struct Snapshot {\\n\\n #[serde(rename = \\\"type\\\")]\\n\\n pub account_type: String,\\n\\n #[serde(rename = \\\"updateTime\\\")]\\n\\n pub update_time: i64,\\n\\n pub data: Data,\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\",\n \"file_path\": \"src/model/binance.rs\",\n \"rank\": 32,\n \"score\": 22690.276977097365\n },\n {\n \"content\": \"pub struct Data {\\n\\n #[serde(rename = \\\"totalAssetOfBtc\\\")]\\n\\n pub total_asset_of_btc: String,\\n\\n pub balances: Vec<Balance>,\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Deserialize)]\\n\\npub struct Balance {\\n\\n pub asset: String,\\n\\n pub free: String,\\n\\n pub locked: String,\\n\\n}\\n\",\n \"file_path\": \"src/model/binance.rs\",\n \"rank\": 33,\n \"score\": 22687.582353059675\n },\n {\n \"content\": \"use crate::aggregate::make_aggregate_query;\\n\\nuse crate::model::database;\\n\\nuse crate::rocket::futures::StreamExt;\\n\\n\\n\\nuse bson::Bson;\\n\\nuse bson::Document;\\n\\nuse chrono::{DateTime, Utc};\\n\\nuse mongodb::bson::doc;\\n\\nuse mongodb::options::FindOptions;\\n\\nuse mongodb::Collection;\\n\\nuse mongodb::Database;\\n\\nuse std::iter::Iterator;\\n\\n\\n\\npub async fn get_snapshots(\\n\\n database: &Database,\\n\\n start: DateTime<Utc>,\\n\\n end: DateTime<Utc>,\\n\\n) -> Vec<database::Snapshot> {\\n\\n let collection: Collection<Document> = database.collection(\\\"snapshots\\\");\\n\\n\\n\",\n \"file_path\": \"src/database.rs\",\n \"rank\": 37,\n \"score\": 17.972965032584852\n },\n {\n \"content\": \" .iter()\\n\\n .map(|history| bson::ser::to_document(history).unwrap())\\n\\n .collect();\\n\\n\\n\\n let res = collection.insert_many(docs, None).await;\\n\\n res.expect(\\\"Could not insert the history.\\\");\\n\\n}\\n\\n\\n\\npub async fn get_computed_snapshots(\\n\\n database: &Database,\\n\\n start: DateTime<Utc>,\\n\\n end: DateTime<Utc>,\\n\\n) -> Vec<database::ComputedSnapshot> {\\n\\n let collection: Collection<Document> = database.collection(\\\"snapshots\\\");\\n\\n\\n\\n let computed_snapshots: Vec<database::ComputedSnapshot> = collection\\n\\n .aggregate(make_aggregate_query(start, end), None)\\n\\n .await\\n\\n .unwrap()\\n\\n .collect::<Vec<_>>()\\n\\n .await\\n\\n .into_iter()\\n\\n .flatten()\\n\\n .map(|document| bson::from_bson(Bson::Document(document)).unwrap())\\n\\n .collect();\\n\\n\\n\\n computed_snapshots\\n\\n}\\n\",\n \"file_path\": \"src/database.rs\",\n \"rank\": 42,\n \"score\": 7.621164688374066\n },\n {\n \"content\": \"### Why Binance?\\n\\n\\n\\nBecause that's what I use personally! 😅\\n\\n\\n\\nMaximum time range for one request: 30 days.\\n\\n\\n\\nGo [here](https://binance.zendesk.com/hc/en-us/articles/360002502072-How-to-create-API) to know how to create a Binance API key.\\n\\n\\n\\n### Why Nomics?\\n\\n\\n\\nIt's the only API I found which can give an history anywhere in time **for free**. And the free plan accepts 1 request per second, which is reasonable.\\n\\n\\n\\nMaximum time range for one request: 45 days.\\n\\n\\n\\nGo [here](https://p.nomics.com/cryptocurrency-bitcoin-api) to know how to create a Nomics API key.\\n\\n\\n\\n### How it works?\\n\\n\\n\\n- Receives an API request from the frontend\\n\\n- Gets data stored in the MongoDB database\\n\\n- Computes the time range of this data\\n\\n- Computes the needed timespans to fill in the blanks (returns vector of timespans)\\n\\n- If the vector is empty\\n\\n - It's up to date\\n\\n - Aggregates data (wallet snapshots with price history) and returns as JSON\\n\\n- If the vector contains 1 (before or after) or 2 (before and after) timespans\\n\\n - Split the timespans in multiple timespans of N days maximum (because of API's time range limit)\\n\\n - Do as many API requests as timespans\\n\\n - Upload the results to the database (the time is a primary key)\\n\\n - Aggregates data (wallet snapshots with price history) and returns as JSON\\n\\n\\n\\n## Frontend\\n\\n\\n\\n- Built with React\\n\\n- Charts are made with [Recharts](https://recharts.org/en-US/)\\n\\n- Built with [esbuild](https://esbuild.github.io/)\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 43,\n \"score\": 7.004629981581419\n },\n {\n \"content\": \" .collect()\\n\\n}\\n\\n\\n\\npub async fn push_snapshots(database: &Database, snapshots: Vec<database::Snapshot>) {\\n\\n let collection: Collection<Document> = database.collection(\\\"snapshots\\\");\\n\\n\\n\\n let docs: Vec<bson::Document> = snapshots\\n\\n .iter()\\n\\n .map(|history| bson::ser::to_document(history).unwrap())\\n\\n .collect();\\n\\n\\n\\n let res = collection.insert_many(docs, None).await;\\n\\n res.expect(\\\"Could not insert the snapshots.\\\");\\n\\n}\\n\\n\\n\\npub async fn get_possessed_assets(database: &Database) -> Vec<String> {\\n\\n let collection: Collection<Document> = database.collection(\\\"snapshots\\\");\\n\\n\\n\\n let mut assets: Vec<String> = collection\\n\\n .distinct(\\\"balances.asset\\\", None, None)\\n\",\n \"file_path\": \"src/database.rs\",\n \"rank\": 47,\n \"score\": 5.330570423693241\n },\n {\n \"content\": \" .await\\n\\n .unwrap()\\n\\n .iter()\\n\\n .map(|document| bson::from_bson(document.to_owned()).unwrap())\\n\\n .collect();\\n\\n\\n\\n let bitcoin_asset = \\\"BTC\\\".to_string();\\n\\n\\n\\n if !assets.contains(&bitcoin_asset) {\\n\\n assets.push(bitcoin_asset);\\n\\n }\\n\\n\\n\\n assets.sort_unstable();\\n\\n assets\\n\\n}\\n\\n\\n\\npub async fn push_history(database: &Database, price_history: Vec<database::CurrencyHistory>) {\\n\\n let collection: Collection<Document> = database.collection(\\\"history\\\");\\n\\n\\n\\n let docs: Vec<bson::Document> = price_history\\n\",\n \"file_path\": \"src/database.rs\",\n \"rank\": 49,\n \"score\": 4.217521003353917\n },\n {\n \"content\": \" // Sort with older first.\\n\\n let find_options = FindOptions::builder().sort(doc! {\\\"time\\\": 1}).build();\\n\\n\\n\\n collection\\n\\n .find(\\n\\n doc! {\\n\\n \\\"time\\\": {\\n\\n \\\"$gte\\\": start,\\n\\n \\\"$lte\\\": end,\\n\\n }\\n\\n },\\n\\n find_options,\\n\\n )\\n\\n .await\\n\\n .unwrap()\\n\\n .collect::<Vec<_>>()\\n\\n .await\\n\\n .into_iter()\\n\\n .flatten()\\n\\n .map(|document| bson::from_bson(Bson::Document(document)).unwrap())\\n\",\n \"file_path\": \"src/database.rs\",\n \"rank\": 50,\n \"score\": 2.9187549324312165\n },\n {\n \"content\": \"# Crypto Balance\\n\\n\\n\\nA web application made with Rust and React.\\n\\n\\n\\nYou can see an area chart with all your cryptocurrencies in the same chart. And a **full pie chart** whereas the one Binance offers groups every little amount of crypto in a single \\\"Others\\\" section...\\n\\n\\n\\n\\n\\n\\n\\n## Usage\\n\\n\\n\\nYou can use this web application with docker-compose.\\n\\n\\n\\nEdit the `.env` file at the root of the project with your personal API keys.\\n\\n\\n\\nOnce done, simply do the following:\\n\\n\\n\\n```bash\\n\\ndocker-compose build\\n\\ndocker-compose up -d\\n\\n```\\n\\n\\n\\nThis will start `mongo` (the database), `mongo-express` (a web interface to manage the database) and `crypto-balance`.\\n\\n\\n\\nYou can access:\\n\\n\\n\\n- The web app via http://127.0.0.1/\\n\\n- The MongoDB web interface via http://127.0.0.1:8081/\\n\\n- The database via the port 27017\\n\\n\\n\\n**Note:** You might need to build with either `DOCKER_BUILDKIT=1` or `COMPOSE_DOCKER_CLI_BUILD=1` depending on your docker-compose version. Upgrade to at least v2.0.0 to build without any of these flags.\\n\\n\\n\\n## Backend\\n\\n\\n\\nThe backend (in Rust) gets daily snapshots of your wallets and the price history for each cryptocurrency you have in your wallets.\\n\\n\\n\\nUsed APIs:\\n\\n\\n\\n- Binance API for the wallets snapshots (with the [Daily Account Snapshot](https://binance-docs.github.io/apidocs/spot/en/#daily-account-snapshot-user_data) endpoint)\\n\\n- Nomics API for the price history (with the [Currencies Sparkline](https://nomics.com/docs/#operation/getCurrenciesSparkline) endpoint)\\n\\n\\n\\nThe Binance API **does not give the fiat amount** corresponding to each cryptocurrency you have, hence the need of the Nomics API to get the price history.\\n\\n\\n\\nA MongoDB database is used to store this data as NoSQL. So when we ask for data in a time range, only the missing data is requested to APIs. The database contains **daily** data points and it is normalized to be at midnight (00:00) for each day.\\n\\n\\n\\n- Binance API saves snapshots each day at 23:59 (stored in MongoDB as +1 minute, which is the next day)\\n\\n- Nomics API gives a price history with data points at 00:00 (stored in MongoDB as is)\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 51,\n \"score\": 2.6615320672727893\n }\n]","isConversational":false}}},{"rowIdx":1395,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/tests/unit.rs"},"repo_name":{"kind":"string","value":"asomers/async-weighted-semaphore"},"commit":{"kind":"string","value":"2085026ab5f4a5b9b6bc8a724e7cdca75a212c32"},"file_code":{"kind":"string","value":"\nuse std::sync::{Arc, Barrier, Mutex};\n\nuse rand::{thread_rng, Rng, SeedableRng};\n\nuse std::sync::atomic::{AtomicIsize, AtomicBool};\nuse std::sync::atomic::Ordering::Relaxed;\nuse std::task::{Context, Waker, Poll};\nuse std::future::Future;\nuse std::{mem, thread, fmt};\n\nuse futures_test::task::{AwokenCount, new_count_waker};\nuse std::pin::Pin;\nuse futures_test::std_reexport::panic::catch_unwind;\nuse futures_test::std_reexport::collections::BTreeMap;\nuse rand_xorshift::XorShiftRng;\nuse std::fmt::Debug;\nuse futures_test::futures_core_reexport::core_reexport::fmt::Formatter;\nuse crate::{Semaphore, AcquireFuture, PoisonError, SemaphoreGuard};\n\nstruct TestFuture<'a> {\n waker: Waker,\n count: AwokenCount,\n old_count: usize,\n inner: Pin<Box<AcquireFuture<'a>>>,\n amount: usize,\n}\n\nimpl<'a> Debug for TestFuture<'a> {\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\n f.debug_struct(\"TF\")\n \n .field(\"w\", &(self.count.get() != self.old_count))\n .field(\"p\", &(self.inner.as_ref().get_ref() as *const AcquireFuture))\n \n .field(\"i\", &self.inner)\n .finish()\n }\n}\n\nimpl<'a> TestFuture<'a> {\n fn new(sem: &'a Semaphore, amount: usize) -> Self {\n let (waker, count) = new_count_waker();\n TestFuture { waker, count, old_count: 0, inner: Box::pin(sem.acquire(amount)), amount }\n }\n fn count(&self) -> usize {\n self.count.get()\n }\n fn poll(&mut self) -> Option<Result<SemaphoreGuard<'a>, PoisonError>> {\n match self.inner.as_mut().poll(&mut Context::from_waker(&self.waker)) {\n Poll::Pending => None,\n Poll::Ready(x) => Some(x)\n }\n }\n fn poll_if_woken(&mut self) -> Option<Result<SemaphoreGuard<'a>, PoisonError>> {\n let count = self.count.get();\n if self.old_count != count {\n self.old_count = count;\n self.poll()\n } else {\n None\n }\n }\n fn into_inner(self) -> Pin<Box<AcquireFuture<'a>>> {\n self.inner\n }\n}\n\n#[test]\nfn test_simple() {\n \n let semaphore = Semaphore::new(1);\n let mut a1 = TestFuture::new(&semaphore, 1);\n let g1 = a1.poll().unwrap().unwrap();\n let mut a2 = TestFuture::new(&semaphore, 1);\n assert_eq!(a1.count(), 0);\n assert_eq!(a2.count(), 0);\n assert!(a2.poll().is_none());\n mem::drop(g1);\n assert_eq!(a1.count(), 0);\n assert_eq!(a2.count(), 1);\n assert!(a2.poll().is_some());\n}\n\n#[test]\nfn test_zero_now() {\n let semaphore = Semaphore::new(1);\n let mut a1 = TestFuture::new(&semaphore, 0);\n let g1 = a1.poll().unwrap().unwrap();\n assert_eq!(a1.count(), 0);\n mem::drop(g1);\n}\n\n#[test]\nfn test_zero_pending() {\n let semaphore = Semaphore::new(0);\n println!(\"A {:?}\", semaphore);\n let mut a1 = TestFuture::new(&semaphore, 1);\n println!(\"B {:?}\", semaphore);\n assert!(a1.poll().is_none());\n println!(\"C {:?}\", semaphore);\n let mut a2 = TestFuture::new(&semaphore, 0);\n let _g2 = a2.poll();\n assert!(a2.poll().is_none());\n assert_eq!(a1.count(), 0);\n assert_eq!(a2.count(), 0);\n mem::drop(a1);\n assert_eq!(a2.count(), 1);\n assert!(a2.poll().is_some());\n}\n\n#[test]\nfn test_cancel() {\n let semaphore = Semaphore::new(1);\n let mut a1 = TestFuture::new(&semaphore, 2);\n assert!(a1.poll().is_none());\n let mut a2 = TestFuture::new(&semaphore, 1);\n assert!(a2.poll().is_none());\n assert_eq!(a1.count(), 0);\n assert_eq!(a2.count(), 0);\n mem::drop(a1);\n assert_eq!(a2.count(), 1);\n assert!(a2.poll().is_some());\n}\n\n#[test]\nfn test_leak() {\n let semaphore = Semaphore::new(1);\n let mut a1 = TestFuture::new(&semaphore, 2);\n assert!(a1.poll().is_none());\n lazy_static! {\n static ref SUPPRESS: Mutex<usize> = Mutex::new(0);\n }\n unsafe { *SUPPRESS.lock().unwrap() = Box::into_raw(Pin::into_inner_unchecked(a1.into_inner())) as usize; }\n mem::drop(semaphore);\n}\n\n#[test]\nfn test_poison_panic() {\n let semaphore = Semaphore::new(1);\n assert!(catch_unwind(\n || {\n let _guard = TestFuture::new(&semaphore, 1).poll().unwrap().unwrap();\n panic!(\"Expected panic\");\n }\n ).is_err());\n TestFuture::new(&semaphore, 2).poll().unwrap().err().unwrap();\n}\n\n#[test]\nfn test_poison_new() {\n let semaphore = Semaphore::new(usize::MAX);\n TestFuture::new(&semaphore, 2).poll().unwrap().err().unwrap();\n}\n\n#[test]\nfn test_poison_release_immediate() {\n let semaphore = Semaphore::new(0);\n semaphore.release(usize::MAX);\n TestFuture::new(&semaphore, 2).poll().unwrap().err().unwrap();\n}\n\n#[test]\nfn test_poison_release_add() {\n let semaphore = Semaphore::new(0);\n semaphore.release(Semaphore::MAX_AVAILABLE / 2);\n semaphore.release(Semaphore::MAX_AVAILABLE / 2 + 2);\n TestFuture::new(&semaphore, 2).poll().unwrap().err().unwrap();\n}\n\n#[test]\nfn test_poison_release_concurrent() {\n let semaphore = Semaphore::new(0);\n let mut future = TestFuture::new(&semaphore, 2);\n assert!(future.poll().is_none());\n semaphore.release(usize::MAX);\n future.poll_if_woken().expect(\"done\").err().expect(\"AcquireError\");\n}\n\n#[test]\nfn test_sequential() {\n let semaphore = Semaphore::new(0);\n let mut time = 0;\n let mut available = 0usize;\n let mut futures = BTreeMap::<usize, TestFuture>::new();\n let mut rng = XorShiftRng::seed_from_u64(954360855);\n for _ in 0..100000 {\n \n \n \n \n \n if rng.gen_bool(0.1) && futures.len() < 5 {\n let amount = rng.gen_range(0, 10);\n \n let mut fut = TestFuture::new(&semaphore, amount);\n if let Some(guard) = fut.poll() {\n guard.unwrap().forget();\n available = available.checked_sub(amount).unwrap();\n } else {\n futures.insert(time, fut);\n }\n time += 1;\n } else if rng.gen_bool(0.1) {\n let mut blocked = false;\n let mut ready = vec![];\n \n for (time, fut) in futures.iter_mut() {\n if rng.gen_bool(0.5) {\n if let Some(guard) = fut.poll_if_woken() {\n assert!(!blocked);\n guard.unwrap().forget();\n available = available.checked_sub(fut.amount).unwrap();\n ready.push(*time);\n } else {\n blocked = true;\n }\n }\n }\n for time in ready {\n futures.remove(&time);\n }\n } else if rng.gen_bool(0.1) && available < 30 {\n let amount = rng.gen_range(0, 10);\n \n available = available.checked_add(amount).unwrap();\n semaphore.release(amount);\n }\n }\n}\n\n#[test]\nfn test_parallel() {\n for i in 0..1000 {\n println!(\"iteration {:?}\", i);\n test_parallel_impl();\n }\n}\n\nfn test_parallel_impl() {\n let threads = 10;\n let semaphore = Arc::new(Semaphore::new(0));\n let resource = Arc::new(AtomicIsize::new(0));\n let barrier = Arc::new(Barrier::new(threads));\n let poisoned = Arc::new(AtomicBool::new(false));\n let pending_max = Arc::new(AtomicIsize::new(-1));\n (0..threads).map(|index| thread::Builder::new().name(format!(\"test_parallel_impl_{}\", index)).spawn({\n let semaphore = semaphore.clone();\n let resource = resource.clone();\n let barrier = barrier.clone();\n let poisoned = poisoned.clone();\n let pending_max = pending_max.clone();\n move || {\n let mut time = 0;\n let mut futures = BTreeMap::<usize, TestFuture>::new();\n let on_guard = |guard: Result<SemaphoreGuard, PoisonError>| {\n match guard {\n Err(PoisonError) => {}\n Ok(guard) => {\n let amount = guard.forget() as isize;\n resource.fetch_sub(amount, Relaxed).checked_sub(amount).unwrap();\n }\n }\n };\n for _ in 0.. {\n if thread_rng().gen_bool(0.1) {\n if futures.len() < 5 {\n let amount = thread_rng().gen_range(0, 10);\n let mut fut = TestFuture::new(&semaphore, amount);\n match fut.poll() {\n None => { futures.insert(time, fut); }\n Some(guard) => on_guard(guard),\n }\n time += 1;\n }\n }\n\n if thread_rng().gen_bool(0.001) {\n if barrier.wait().is_leader() {\n pending_max.store(-1, Relaxed);\n }\n let was_poisoned = poisoned.load(Relaxed);\n let mut ready = vec![];\n for (time, fut) in futures.iter_mut() {\n if let Some(guard) = fut.poll_if_woken() {\n on_guard(guard);\n ready.push(*time);\n }\n }\n for time in ready {\n futures.remove(&time);\n }\n\n barrier.wait();\n print!(\"{:?} \", futures.len());\n if let Some(front) = futures.values_mut().next() {\n pending_max.fetch_max(front.amount as isize, Relaxed);\n }\n let leader = barrier.wait();\n let pending_amount = pending_max.load(Relaxed);\n if pending_amount >= 0 && pending_amount <= resource.load(Relaxed) {\n for (time, fut) in futures.iter_mut() {\n println!(\"{:?} {:?}\", time, fut);\n }\n if leader.is_leader() {\n println!(\"{:?}\", semaphore);\n panic!(\"Should have acquired. {:?} of {:?}\", pending_amount, resource.load(Relaxed));\n }\n }\n if barrier.wait().is_leader() {\n println!();\n }\n if was_poisoned {\n return;\n }\n }\n if thread_rng().gen_bool(0.1) {\n let mut ready = vec![];\n for (time, fut) in futures.iter_mut().rev() {\n if thread_rng().gen_bool(0.5) {\n let guard = if time & 1 == 1 && thread_rng().gen_bool(0.5) {\n fut.poll()\n } else {\n fut.poll_if_woken()\n };\n if let Some(guard) = guard {\n on_guard(guard);\n ready.push(*time);\n } else if !ready.is_empty() {\n println!(\"{:?}\", semaphore);\n for (time, fut) in futures.iter_mut() {\n println!(\"{:?} {:?}\", time, fut);\n }\n panic!();\n }\n }\n }\n for time in ready {\n futures.remove(&time);\n }\n }\n if thread_rng().gen_bool(0.1) {\n let mut cancelled = vec![];\n for (time, _) in futures.iter_mut().rev() {\n if time & 2 == 2 && thread_rng().gen_bool(0.5) {\n cancelled.push(*time);\n }\n }\n for time in cancelled {\n futures.remove(&time);\n }\n }\n if thread_rng().gen_bool(0.1) && resource.load(Relaxed) < 20 {\n let amount = thread_rng().gen_range(0, 20);\n resource.fetch_add(amount as isize, Relaxed);\n semaphore.release(amount);\n }\n if thread_rng().gen_bool(0.1) {\n if let Ok(guard)\n = semaphore.try_acquire(thread_rng().gen_range(0, 10)) {\n on_guard(Ok(guard));\n }\n }\n if thread_rng().gen_bool(0.0001) {\n poisoned.store(true, Relaxed);\n semaphore.poison();\n }\n }\n }\n }).unwrap()).collect::<Vec<_>>().into_iter().for_each(|x| x.join().unwrap());\n}\n"},"prefix":{"kind":"string","value":"\nuse std::sync::{Arc, Barrier, Mutex};\n\nuse rand::{thread_rng, Rng, SeedableRng};\n\nuse std::sync::atomic::{AtomicIsize, AtomicBool};\nuse std::sync::atomic::Ordering::Relaxed;\nuse std::task::{Context, Waker, Poll};\nuse std::future::Future;\nuse std::{mem, thread, fmt};\n\nuse futures_test::task::{AwokenCount, new_count_waker};\nuse std::pin::Pin;\nuse futures_test::std_reexport::panic::catch_unwind;\nuse futures_test::std_reexport::collections::BTreeMap;\nuse rand_xorshift::XorShiftRng;\nuse std::fmt::Debug;\nuse futures_test::futures_core_reexport::core_reexport::fmt::Formatter;\nuse crate::{Semaphore, AcquireFuture, PoisonError, SemaphoreGuard};\n\nstruct TestFuture<'a> {\n waker: Waker,\n count: AwokenCount,\n old_count: usize,\n inner: Pin<Box<AcquireFuture<'a>>>,\n amount: usize,\n}\n\nimpl<'a> Debug for TestFuture<'a> {\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\n f.debug_struct(\"TF\")\n \n .field(\"w\", &(self.count.get() != self.old_count))\n .field(\"p\", &(self.inner.as_ref().get_ref() as *const AcquireFuture))\n \n .field(\"i\", &self.inner)\n .finish()\n }\n}\n\nimpl<'a> TestFuture<'a> {\n fn new(sem: &'a Semaphore, amount: usize) -> Self {\n let (waker, count) = new_count_waker();\n TestFuture { waker, count, old_count: 0, inner: Box::pin(sem.acquire(amount)), amount }\n }\n fn count(&self) -> usize {\n self.count.get()\n }\n fn poll(&mut self) -> Option<Result<SemaphoreGuard<'a>, PoisonError>> {\n match self.inner.as_mut().poll(&mut Context::from_waker(&self.waker)) {\n Poll::Pending => None,\n Poll::Ready(x) => Some(x)\n }\n }\n fn poll_if_woken(&mut self) -> Option<Result<SemaphoreGuard<'a>, PoisonError>> {\n let count = self.count.get();\n if self.old_count != count {\n self.old_count = count;\n self.poll()\n } else {\n None\n }\n }\n fn into_inner(self) -> Pin<Box<AcquireFuture<'a>>> {\n self.inner\n }\n}\n\n#[test]\nfn test_simple() {\n \n let semaphore = Semaphore::new(1);\n let mut a1 = TestFuture::new(&semaphore, 1);\n let g1 = a1.poll().unwrap().unwrap();\n let mut a2 = TestFuture::new(&semaphore, 1);\n assert_eq!(a1.count(), 0);\n assert_eq!(a2.count(), 0);\n assert!(a2.poll().is_none());\n mem::drop(g1);\n assert_eq!(a1.count(), 0);\n assert_eq!(a2.count(), 1);\n assert!(a2.poll().is_some());\n}\n\n#[test]\nfn test_zero_now() {\n let semaphore = Semaphore::new(1);\n let mut a1 = TestFuture::new(&semaphore, 0);\n let g1 = a1.poll().unwrap().unwrap();\n assert_eq!(a1.count(), 0);\n mem::drop(g1);\n}\n\n#[test]\nfn test_zero_pending() {\n let semaphore = Semaphore::new(0);\n println!(\"A {:?}\", semaphore);\n let mut a1 = TestFuture::new(&semaphore, 1);\n println!(\"B {:?}\", semaphore);\n assert!(a1.poll().is_none());\n println!(\"C {:?}\", semaphore);\n let mut a2 = TestFuture::new(&semaphore, 0);\n let _g2 = a2.poll();\n assert!(a2.poll().is_none());\n assert_eq!(a1.count(), 0);\n assert_eq!(a2.count(), 0);\n mem::drop(a1);\n assert_eq!(a2.count(), 1);\n assert!(a2.poll().is_some());\n}\n\n#[test]\nfn test_cancel() {\n let semaphore = Semaphore::new(1);\n let mut a1 = TestFuture::new(&semaphore, 2);\n assert!(a1.poll().is_none());\n let mut a2 = TestFuture::new(&semaphore, 1);\n assert!(a2.poll().is_none());\n assert_eq!(a1.count(), 0);\n assert_eq!(a2.count(), 0);\n mem::drop(a1);\n assert_eq!(a2.count(), 1);\n assert!(a2.poll().is_some());\n}\n\n#[test]\nfn test_leak() {\n let semaphore = Semaphore::new(1);\n let mut a1 = TestFuture::new(&semaphore, 2);\n assert!(a1.poll().is_none());\n lazy_static! {\n static ref SUPPRESS: Mutex<usize> = Mutex::new(0);\n }\n unsafe { *SUPPRESS.lock().unwrap() = Box::into_raw(Pin::into_inner_unchecked(a1.into_inner())) as usize; }\n mem::drop(semaphore);\n}\n\n#[test]\nfn test_poison_panic() {\n let semaphore = Semaphore::new(1);\n assert!(catch_unwind(\n || {\n let _guard = TestFuture::new(&semaphore, 1).poll().unwrap().unwrap();\n panic!(\"Expected panic\");\n }\n ).is_err());\n TestFuture::new(&semaphore, 2).poll().unwrap().err().unwrap();\n}\n\n#[test]\nfn test_poison_new() {\n let semaphore = Semaphore::new(usize::MAX);\n TestFuture::new(&semaphore, 2).poll().unwrap().err().unwrap();\n}\n\n#[test]\nfn test_poison_release_immediate() {\n let semaphore = Semaphore::new(0);\n semaphore.release(usize::MAX);\n TestFuture::new(&semaphore, 2).poll().unwrap().err().unwrap();\n}\n\n#[test]\nfn test_poison_release_add() {\n let semaphore = Semaphore::new(0);\n semaphore.release(Semaphore::MAX_AVAILABLE / 2);\n semaphore.release(Semaphore::MAX_AVAILABLE / 2 + 2);\n TestFuture::new(&semaphore, 2).poll().unwrap().err().unwrap();\n}\n\n#[test]\nfn test_poison_release_concurrent() {\n let semaphore = Semaphore::new(0);\n let mut future = TestFuture::new(&semaphore, 2);\n assert!(future.poll().is_none());\n semaphore.release(usize::MAX);\n future.poll_if_woken().expect(\"done\").err().expect(\"AcquireError\");\n}\n\n#[test]\nfn test_sequential() {\n let semaphore = Semaphore::new(0);\n let mut time = 0;\n let mut available = 0usize;\n let mut futures = BTreeMap::<usi"},"suffix":{"kind":"string","value":"\n\n#[test]\nfn test_parallel() {\n for i in 0..1000 {\n println!(\"iteration {:?}\", i);\n test_parallel_impl();\n }\n}\n\nfn test_parallel_impl() {\n let threads = 10;\n let semaphore = Arc::new(Semaphore::new(0));\n let resource = Arc::new(AtomicIsize::new(0));\n let barrier = Arc::new(Barrier::new(threads));\n let poisoned = Arc::new(AtomicBool::new(false));\n let pending_max = Arc::new(AtomicIsize::new(-1));\n (0..threads).map(|index| thread::Builder::new().name(format!(\"test_parallel_impl_{}\", index)).spawn({\n let semaphore = semaphore.clone();\n let resource = resource.clone();\n let barrier = barrier.clone();\n let poisoned = poisoned.clone();\n let pending_max = pending_max.clone();\n move || {\n let mut time = 0;\n let mut futures = BTreeMap::<usize, TestFuture>::new();\n let on_guard = |guard: Result<SemaphoreGuard, PoisonError>| {\n match guard {\n Err(PoisonError) => {}\n Ok(guard) => {\n let amount = guard.forget() as isize;\n resource.fetch_sub(amount, Relaxed).checked_sub(amount).unwrap();\n }\n }\n };\n for _ in 0.. {\n if thread_rng().gen_bool(0.1) {\n if futures.len() < 5 {\n let amount = thread_rng().gen_range(0, 10);\n let mut fut = TestFuture::new(&semaphore, amount);\n match fut.poll() {\n None => { futures.insert(time, fut); }\n Some(guard) => on_guard(guard),\n }\n time += 1;\n }\n }\n\n if thread_rng().gen_bool(0.001) {\n if barrier.wait().is_leader() {\n pending_max.store(-1, Relaxed);\n }\n let was_poisoned = poisoned.load(Relaxed);\n let mut ready = vec![];\n for (time, fut) in futures.iter_mut() {\n if let Some(guard) = fut.poll_if_woken() {\n on_guard(guard);\n ready.push(*time);\n }\n }\n for time in ready {\n futures.remove(&time);\n }\n\n barrier.wait();\n print!(\"{:?} \", futures.len());\n if let Some(front) = futures.values_mut().next() {\n pending_max.fetch_max(front.amount as isize, Relaxed);\n }\n let leader = barrier.wait();\n let pending_amount = pending_max.load(Relaxed);\n if pending_amount >= 0 && pending_amount <= resource.load(Relaxed) {\n for (time, fut) in futures.iter_mut() {\n println!(\"{:?} {:?}\", time, fut);\n }\n if leader.is_leader() {\n println!(\"{:?}\", semaphore);\n panic!(\"Should have acquired. {:?} of {:?}\", pending_amount, resource.load(Relaxed));\n }\n }\n if barrier.wait().is_leader() {\n println!();\n }\n if was_poisoned {\n return;\n }\n }\n if thread_rng().gen_bool(0.1) {\n let mut ready = vec![];\n for (time, fut) in futures.iter_mut().rev() {\n if thread_rng().gen_bool(0.5) {\n let guard = if time & 1 == 1 && thread_rng().gen_bool(0.5) {\n fut.poll()\n } else {\n fut.poll_if_woken()\n };\n if let Some(guard) = guard {\n on_guard(guard);\n ready.push(*time);\n } else if !ready.is_empty() {\n println!(\"{:?}\", semaphore);\n for (time, fut) in futures.iter_mut() {\n println!(\"{:?} {:?}\", time, fut);\n }\n panic!();\n }\n }\n }\n for time in ready {\n futures.remove(&time);\n }\n }\n if thread_rng().gen_bool(0.1) {\n let mut cancelled = vec![];\n for (time, _) in futures.iter_mut().rev() {\n if time & 2 == 2 && thread_rng().gen_bool(0.5) {\n cancelled.push(*time);\n }\n }\n for time in cancelled {\n futures.remove(&time);\n }\n }\n if thread_rng().gen_bool(0.1) && resource.load(Relaxed) < 20 {\n let amount = thread_rng().gen_range(0, 20);\n resource.fetch_add(amount as isize, Relaxed);\n semaphore.release(amount);\n }\n if thread_rng().gen_bool(0.1) {\n if let Ok(guard)\n = semaphore.try_acquire(thread_rng().gen_range(0, 10)) {\n on_guard(Ok(guard));\n }\n }\n if thread_rng().gen_bool(0.0001) {\n poisoned.store(true, Relaxed);\n semaphore.poison();\n }\n }\n }\n }).unwrap()).collect::<Vec<_>>().into_iter().for_each(|x| x.join().unwrap());\n}\n"},"middle":{"kind":"string","value":"ze, TestFuture>::new();\n let mut rng = XorShiftRng::seed_from_u64(954360855);\n for _ in 0..100000 {\n \n \n \n \n \n if rng.gen_bool(0.1) && futures.len() < 5 {\n let amount = rng.gen_range(0, 10);\n \n let mut fut = TestFuture::new(&semaphore, amount);\n if let Some(guard) = fut.poll() {\n guard.unwrap().forget();\n available = available.checked_sub(amount).unwrap();\n } else {\n futures.insert(time, fut);\n }\n time += 1;\n } else if rng.gen_bool(0.1) {\n let mut blocked = false;\n let mut ready = vec![];\n \n for (time, fut) in futures.iter_mut() {\n if rng.gen_bool(0.5) {\n if let Some(guard) = fut.poll_if_woken() {\n assert!(!blocked);\n guard.unwrap().forget();\n available = available.checked_sub(fut.amount).unwrap();\n ready.push(*time);\n } else {\n blocked = true;\n }\n }\n }\n for time in ready {\n futures.remove(&time);\n }\n } else if rng.gen_bool(0.1) && available < 30 {\n let amount = rng.gen_range(0, 10);\n \n available = available.checked_add(amount).unwrap();\n semaphore.release(amount);\n }\n }\n}"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"struct SemMutex(Semaphore, UnsafeCell<usize>);\n\n\n\nunsafe impl Send for SemMutex {}\n\n\n\nunsafe impl Sync for SemMutex {}\n\n\n\nimpl Default for SemMutex {\n\n fn default() -> Self {\n\n SemMutex(Semaphore::new(1), UnsafeCell::new(0))\n\n }\n\n}\n\n\n\nimpl AtomicCounter for SemMutex {\n\n fn do_loop<'a>(items: Vec<Arc<Self>>) -> BoxFuture<'static, ()> {\n\n Box::pin(async move {\n\n for x in get_loop(&items) {\n\n let _guard = x.0.acquire(1).await.unwrap();\n\n unsafe { *x.1.get() += 1; }\n\n }\n\n })\n\n }\n\n}\n\n\n","file_path":"benches/mutex.rs","rank":0,"score":117835.99228394657},{"content":"#[bench]\n\nfn run_futures_mutex(bencher: &mut Bencher) {\n\n run_impl::<FuturesMutex<usize>>(bencher);\n\n}\n\n\n","file_path":"benches/mutex.rs","rank":1,"score":107570.93198252961},{"content":"#[test]\n\nfn test() {\n\n let lock = Arc::new(RwLock::new(Vec::new()));\n\n let threads = 10;\n\n let iters = 500;\n\n (0..threads).map(|thread| {\n\n let lock = lock.clone();\n\n thread::spawn(move || {\n\n block_on(async {\n\n for i in (thread..iters * threads + thread).step_by(threads) {\n\n while lock.read().await.unwrap().len() != i {}\n\n lock.write().await.unwrap().push(i)\n\n }\n\n })\n\n })\n\n }).collect::<Vec<_>>().into_iter().for_each(|x| x.join().unwrap());\n\n let vec = Arc::try_unwrap(lock).unwrap().into_inner().unwrap();\n\n assert_eq!(vec, (0..threads*iters).collect::<Vec<_>>());\n\n}","file_path":"src/tests/lock.rs","rank":3,"score":88567.28810744936},{"content":"#[bench]\n\nfn run_sem_mutex(bencher: &mut Bencher) {\n\n run_impl::<SemMutex>(bencher);\n\n}","file_path":"benches/mutex.rs","rank":4,"score":88060.33189558965},{"content":"#[bench]\n\nfn run_sync_mutex(bencher: &mut Bencher) {\n\n run_impl::<SyncMutex<usize>>(bencher);\n\n}\n\n\n","file_path":"benches/mutex.rs","rank":5,"score":88060.33189558965},{"content":"#[bench]\n\nfn run_tokio_mutex(bencher: &mut Bencher) {\n\n run_impl::<TokioMutex<usize>>(bencher);\n\n}\n\n\n","file_path":"benches/mutex.rs","rank":6,"score":88060.33189558965},{"content":"#[bench]\n\nfn run_async_std_mutex(bencher: &mut Bencher) {\n\n run_impl::<AsyncStdMutex<usize>>(bencher);\n\n}\n\n\n","file_path":"benches/mutex.rs","rank":10,"score":85364.60933135831},{"content":"#[bench]\n\nfn run_atomic(bencher: &mut Bencher) {\n\n run_impl::<AtomicUsize>(bencher);\n\n}\n\n\n","file_path":"benches/mutex.rs","rank":13,"score":82652.63402115341},{"content":"struct ReaderInner(Pipe);\n\n\n","file_path":"src/tests/pipe.rs","rank":15,"score":79686.47005718287},{"content":"struct WriterInner(Pipe);\n\n\n\n#[derive(Clone)]\n\npub struct Reader {\n\n inner: Arc<ReaderInner>,\n\n}\n\n\n\n#[derive(Clone)]\n\npub struct Writer {\n\n inner: Arc<WriterInner>\n\n}\n\n\n","file_path":"src/tests/pipe.rs","rank":16,"score":79686.47005718287},{"content":"fn run_impl<T: AtomicCounter>(bencher: &mut Bencher) {\n\n let items = (0..ITEMS).map(|_| Arc::new(T::default())).collect::<Vec<_>>();\n\n let pool = ThreadPool::builder().pool_size(PARALLELISM).create().unwrap();\n\n bencher.iter(|| {\n\n block_on(join_all((0..CONCURRENCY).map(|_| {\n\n let items = items.clone();\n\n pool.spawn_with_handle(T::do_loop(items)).unwrap()\n\n }).collect::<Vec<_>>().into_iter()));\n\n });\n\n}\n\n\n","file_path":"benches/mutex.rs","rank":17,"score":70477.56168731803},{"content":"#[test]\n\nfn test_pipe() {\n\n for _i in 0..100 {\n\n test_pipe_impl();\n\n }\n\n}\n\n\n","file_path":"src/tests/pipe.rs","rank":21,"score":66354.41608448338},{"content":"#[derive(Clone)]\n\nstruct Pipe {\n\n ready: Arc<Semaphore>,\n\n free: Arc<Semaphore>,\n\n buffer: Arc<Mutex<VecDeque<u8>>>,\n\n}\n\n\n","file_path":"src/tests/pipe.rs","rank":22,"score":65929.35957167023},{"content":"fn pipe(capacity: usize) -> (Writer, Reader) {\n\n let ready = Arc::new(Semaphore::new(0));\n\n let free = Arc::new(Semaphore::new(capacity));\n\n let buffer = Arc::new(Mutex::new(VecDeque::with_capacity(capacity)));\n\n let pipe = Pipe { ready, free, buffer };\n\n let reader = Arc::new(ReaderInner(pipe.clone()));\n\n let writer = Arc::new(WriterInner(pipe.clone()));\n\n (Writer { inner: writer }, Reader { inner: reader })\n\n}\n\n\n\nimpl Reader {\n\n async fn read_exact(&self, buf: &mut [u8]) -> usize {\n\n assert!(buf.len() < self.inner.0.buffer.lock().await.capacity());\n\n let total = if let Ok(guard) = self.inner.0.ready.acquire(buf.len()).await {\n\n guard.forget();\n\n let mut lock = self.inner.0.buffer.lock().await;\n\n assert!(buf.len() <= lock.len());\n\n for b in buf.iter_mut() {\n\n *b = lock.pop_front().unwrap();\n\n }\n","file_path":"src/tests/pipe.rs","rank":23,"score":65460.02394655033},{"content":"fn test_pipe_impl() {\n\n let threads = 10;\n\n let iters = 1000;\n\n let (w, r) = pipe(20);\n\n for _ in 0..threads {\n\n let w = w.clone();\n\n thread::spawn(move || block_on(async {\n\n for _ in 0..iters {\n\n let n = thread_rng().gen_range(0, 1000);\n\n w.write_all(format!(\"{}\\n\", n).as_ref()).await.unwrap();\n\n }\n\n }));\n\n }\n\n mem::drop(w);\n\n block_on(async {\n\n let mut result = Vec::new();\n\n loop {\n\n let mut buf = vec![0u8; thread_rng().gen_range(0, 10)];\n\n let n = r.read_exact(&mut buf).await;\n\n result.extend_from_slice(&buf[0..n]);\n","file_path":"src/tests/pipe.rs","rank":26,"score":64075.3884601653},{"content":"fn run_impl(bencher: &mut Bencher) {\n\n let pool = ThreadPool::builder().pool_size(PARALLELISM).create().unwrap();\n\n bencher.iter(|| {\n\n let items = (0..ITEMS)\n\n .map(|i| Arc::new(Semaphore::new(if i == 0 { TOKENS } else { 0 })))\n\n .collect::<Vec<_>>();\n\n block_on(join_all((0..ITEMS).map(|index| {\n\n let items = items.clone();\n\n pool.spawn_with_handle(async move {\n\n let mut rng = XorShiftRng::from_entropy();\n\n for _ in 0..ITERS {\n\n let amount = rng.gen_range(1usize, 1 << MAX_ACQUIRE + 1).trailing_zeros() as usize;\n\n match items[index].acquire(amount).await {\n\n Ok(guard) => guard.forget(),\n\n Err(PoisonError) => break,\n\n };\n\n items[(index + 1) % ITEMS].release(amount);\n\n }\n\n items[(index + 1) % ITEMS].poison();\n\n }).unwrap()\n\n })));\n\n });\n\n}\n\n\n","file_path":"benches/ring.rs","rank":27,"score":62483.13681927817},{"content":"#[bench]\n\nfn run_weighted(bencher: &mut Bencher) {\n\n run_impl(bencher);\n\n}","file_path":"benches/ring.rs","rank":28,"score":62483.13681927817},{"content":"#[test]\n\nfn test_readme_deps() {\n\n version_sync::assert_markdown_deps_updated!(\"README.md\");\n\n}\n\n\n","file_path":"src/lib.rs","rank":31,"score":58523.9709353066},{"content":"#[test]\n\nfn test_html_root_url() {\n\n version_sync::assert_html_root_url_updated!(\"src/lib.rs\");\n\n}","file_path":"src/lib.rs","rank":32,"score":56193.70940578151},{"content":"trait AtomicCounter: Default + 'static + Send + Sync {\n\n fn do_loop<'a>(items: Vec<Arc<Self>>) -> BoxFuture<'static, ()>;\n\n}\n\n\n\nimpl AtomicCounter for AtomicUsize {\n\n fn do_loop<'a>(items: Vec<Arc<Self>>) -> BoxFuture<'static, ()> {\n\n Box::pin(async move {\n\n for x in get_loop(&items) {\n\n x.fetch_add(1, SeqCst);\n\n }\n\n })\n\n }\n\n}\n\n\n\nimpl AtomicCounter for SyncMutex<usize> {\n\n fn do_loop<'a>(items: Vec<Arc<Self>>) -> BoxFuture<'static, ()> {\n\n Box::pin(async move {\n\n for x in get_loop(&items) {\n\n *x.lock().unwrap() += 1;\n\n }\n","file_path":"benches/mutex.rs","rank":33,"score":50416.710819529704},{"content":"fn get_loop<'a, T>(v: &'a Vec<Arc<T>>) -> impl Iterator<Item=&'a T> {\n\n (0..ITERS).map(move |i| &*v[i % ITEMS])\n\n}\n\n\n","file_path":"benches/mutex.rs","rank":34,"score":36709.80773635972},{"content":"#![feature(test)]\n\nextern crate test;\n\n\n\nuse test::Bencher;\n\nuse std::sync::{Mutex as SyncMutex, Arc};\n\nuse async_std::sync::Mutex as AsyncStdMutex;\n\nuse futures_locks::Mutex as FuturesMutex;\n\nuse tokio::sync::Mutex as TokioMutex;\n\nuse futures::executor::block_on;\n\nuse async_std::task::spawn;\n\nuse futures_test::std_reexport::sync::atomic::AtomicUsize;\n\nuse futures_test::std_reexport::sync::atomic::Ordering::SeqCst;\n\nuse async_weighted_semaphore::Semaphore;\n\nuse std::cell::UnsafeCell;\n\nuse std::thread;\n\nuse futures::future::BoxFuture;\n\nuse futures::executor::ThreadPool;\n\nuse futures::task::SpawnExt;\n\nuse futures::future::join_all;\n\n\n\nconst PARALLELISM: usize = 8;\n\nconst CONCURRENCY: usize = 100;\n\nconst ITEMS: usize = 2;\n\nconst ITERS: usize = 1000;\n\n\n","file_path":"benches/mutex.rs","rank":35,"score":27142.420816567716},{"content":" })\n\n }\n\n}\n\n\n\nimpl AtomicCounter for AsyncStdMutex<usize> {\n\n fn do_loop<'a>(items: Vec<Arc<Self>>) -> BoxFuture<'static, ()> {\n\n Box::pin(async move {\n\n for x in get_loop(&items) {\n\n *x.lock().await += 1;\n\n }\n\n })\n\n }\n\n}\n\n\n\nimpl AtomicCounter for TokioMutex<usize> {\n\n fn do_loop<'a>(items: Vec<Arc<Self>>) -> BoxFuture<'static, ()> {\n\n Box::pin(async move {\n\n for x in get_loop(&items) {\n\n *x.lock().await += 1;\n\n }\n","file_path":"benches/mutex.rs","rank":36,"score":27134.1614175233},{"content":" })\n\n }\n\n}\n\n\n\nimpl AtomicCounter for FuturesMutex<usize> {\n\n fn do_loop<'a>(items: Vec<Arc<Self>>) -> BoxFuture<'static, ()> {\n\n Box::pin(async move {\n\n for x in get_loop(&items) {\n\n *x.lock().await += 1;\n\n }\n\n })\n\n }\n\n}\n\n\n","file_path":"benches/mutex.rs","rank":37,"score":27133.9348086802},{"content":"unsafe impl Send for Semaphore {}\n\n\n\nimpl UnwindSafe for Semaphore {}\n\n\n\nimpl RefUnwindSafe for Semaphore {}\n\n\n\nimpl Debug for Semaphore {\n\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\n\n match self.acquire.load(Relaxed) {\n\n Available(available) => write!(f, \"Semaphore::Ready({:?})\", available)?,\n\n Queued(_) => match self.release.load(Relaxed) {\n\n Unlocked(available) => write!(f, \"Semaphore::Blocked({:?})\", available)?,\n\n _ => write!(f, \"Semaphore::Unknown\")?,\n\n },\n\n };\n\n Ok(())\n\n }\n\n}\n\n\n\n\n","file_path":"src/semaphore.rs","rank":38,"score":27054.09376314834},{"content":"\n\n /// Wait until there are no older pending calls to [acquire](#method.acquire) and at least `amount` permits available.\n\n /// Then consume the requested permits and return a [`SemaphoreGuard`].\n\n /// # Errors\n\n /// Returns [`PoisonError`] is the semaphore is poisoned.\n\n /// # Examples\n\n /// ```\n\n /// # use futures::executor::block_on;\n\n /// # use std::future::Future;\n\n /// use async_weighted_semaphore::Semaphore;\n\n /// async fn limit_concurrency(semaphore: &Semaphore, future: impl Future<Output=()>) {\n\n /// let guard = semaphore.acquire(1).await.unwrap();\n\n /// future.await\n\n /// }\n\n /// ```\n\n pub fn acquire(&self, amount: usize) -> AcquireFuture {\n\n AcquireFuture(UnsafeCell::new(Waiter {\n\n semaphore: self,\n\n step: UnsafeCell::new(AcquireStep::Entering),\n\n waker: unsafe { AtomicWaker::new() },\n","file_path":"src/semaphore.rs","rank":39,"score":27053.389786818774},{"content":" /// }\n\n /// ```\n\n pub fn acquire_arc(self: &Arc<Self>, amount: usize) -> AcquireFutureArc {\n\n AcquireFutureArc {\n\n arc: self.clone(),\n\n inner: unsafe { mem::transmute::<AcquireFuture, AcquireFuture>(self.acquire(amount)) },\n\n }\n\n }\n\n\n\n\n\n /// Like [try_acquire](#method.try_acquire), but takes an [`Arc`] `<Semaphore>`, and returns a guard that is `'static`,\n\n /// [`Send`] and [`Sync`].\n\n /// # Examples\n\n /// ```\n\n /// # use async_weighted_semaphore::{Semaphore, TryAcquireError, SemaphoreGuardArc};\n\n /// # use std::sync::Arc;\n\n /// use async_channel::{Sender, TrySendError};\n\n /// // Limit size of a producer-consumer queue\n\n /// async fn try_send<T>(semaphore: &Arc<Semaphore>,\n\n /// sender: &Sender<(SemaphoreGuardArc, T)>,\n","file_path":"src/semaphore.rs","rank":40,"score":27052.378616180587},{"content":"use std::{fmt, mem};\n\nuse std::panic::{RefUnwindSafe, UnwindSafe};\n\nuse std::sync::atomic::Ordering::{Relaxed, Acquire};\n\nuse crate::state::ReleaseState::Unlocked;\n\nuse crate::state::AcquireState::{Available, Queued};\n\nuse std::fmt::{Debug, Formatter};\n\nuse crate::state::{AcquireStep, Waiter, Permits, AcquireState, ReleaseState};\n\nuse std::cell::UnsafeCell;\n\nuse crate::{AcquireFuture, TryAcquireError, SemaphoreGuard, AcquireFutureArc, SemaphoreGuardArc};\n\nuse std::marker::{PhantomPinned, PhantomData};\n\nuse crate::waker::AtomicWaker;\n\nuse std::ptr::null;\n\nuse std::sync::Arc;\n\nuse crate::atomic::Atomic;\n\nuse std::mem::size_of;\n\nuse crate::release::ReleaseAction;\n\n#[allow(unused_imports)] // used by docs\n\nuse crate::errors::PoisonError;\n\n\n\n/// An async weighted semaphore. See [crate documentation](index.html) for usage.\n","file_path":"src/semaphore.rs","rank":41,"score":27050.606479471728},{"content":" /// }\n\n /// }\n\n /// ```\n\n pub fn try_acquire(&self, amount: usize) -> Result<SemaphoreGuard, TryAcquireError> {\n\n let mut current = self.acquire.load(Acquire);\n\n loop {\n\n match current {\n\n Queued(_) => return Err(TryAcquireError::WouldBlock),\n\n Available(available) => {\n\n let available = available.into_usize().ok_or(TryAcquireError::Poisoned)?;\n\n if available < amount {\n\n return Err(TryAcquireError::WouldBlock);\n\n }\n\n if self.acquire.cmpxchg_weak_acqrel(&mut current, Available(Permits::new(available - amount))) {\n\n return Ok(SemaphoreGuard::new(self, amount));\n\n }\n\n }\n\n }\n\n }\n\n }\n","file_path":"src/semaphore.rs","rank":42,"score":27049.83569003354},{"content":" /// }\n\n /// }\n\n /// ```\n\n pub const MAX_AVAILABLE: usize = (1 << (size_of::<usize>() * 8 - 3)) - 1;\n\n\n\n /// Create a new semaphore with an initial number of permits.\n\n /// # Examples\n\n /// ```\n\n /// use async_weighted_semaphore::Semaphore;\n\n /// let semaphore = Semaphore::new(1024);\n\n /// ```\n\n pub fn new(initial: usize) -> Self {\n\n Semaphore {\n\n acquire: Atomic::new(Available(Permits::new(initial))),\n\n release: Atomic::new(Unlocked(Permits::new(0))),\n\n front: UnsafeCell::new(null()),\n\n middle: UnsafeCell::new(null()),\n\n next_cancel: Atomic::new(null()),\n\n }\n\n }\n","file_path":"src/semaphore.rs","rank":43,"score":27048.795372347042},{"content":" amount,\n\n next: UnsafeCell::new(null()),\n\n prev: UnsafeCell::new(null()),\n\n next_cancel: UnsafeCell::new(null()),\n\n }), PhantomData, PhantomPinned)\n\n }\n\n\n\n /// Like [acquire](#method.acquire), but fails if the call would block.\n\n /// # Errors\n\n /// * Returns [`TryAcquireError::Poisoned`] is the semaphore is poisoned.\n\n /// * Returns [`TryAcquireError::WouldBlock`] if a call to `acquire` would have blocked. This can\n\n /// occur if there are insufficient available permits or if there is another pending call to acquire.\n\n /// # Examples\n\n /// ```\n\n /// # use futures::executor::block_on;\n\n /// # use std::future::Future;\n\n /// use async_weighted_semaphore::Semaphore;\n\n /// async fn run_if_safe(semaphore: &Semaphore, future: impl Future<Output=()>) {\n\n /// if semaphore.try_acquire(1).is_ok() {\n\n /// future.await\n","file_path":"src/semaphore.rs","rank":44,"score":27048.326276114076},{"content":" ReleaseAction { sem: self, releasable: Permits::new(amount) }.release();\n\n }\n\n }\n\n\n\n /// Poison the semaphore, causing all pending and future calls to `acquire` to fail immediately.\n\n /// This can be used to unblock pending acquires when the guarded operation would fail anyway.\n\n /// # Examples\n\n /// ```\n\n /// # use async_weighted_semaphore::{Semaphore, TryAcquireError};\n\n /// # use std::sync::Arc;\n\n /// # use async_std::sync::Mutex;\n\n /// use async_channel::{Receiver, RecvError};\n\n /// async fn consume(semaphore: &Semaphore, receiver: Receiver<usize>){\n\n /// while let Ok(x) = receiver.recv().await {\n\n /// println!(\"{:?}\", x);\n\n /// semaphore.release(1);\n\n /// }\n\n /// // There will be no more calls to recv, so unblock all senders.\n\n /// semaphore.poison();\n\n /// }\n\n /// ```\n\n pub fn poison(&self) {\n\n unsafe {\n\n ReleaseAction { sem: self, releasable: Permits::poison() }.release();\n\n }\n\n }\n\n}\n","file_path":"src/semaphore.rs","rank":45,"score":27047.361032794728},{"content":"\n\n /// Return `amount` permits to the semaphore. This will eventually wake any calls to [acquire](#method.acquire)\n\n /// that can succeed with the additional permits. Calling `release` often makes sense after calling\n\n /// [`SemaphoreGuard::forget`] or when using the semaphore to signal the number of elements that\n\n /// are available for processing.\n\n /// # Examples\n\n /// ```\n\n /// # use async_weighted_semaphore::{Semaphore, TryAcquireError};\n\n /// use async_channel::{Receiver, RecvError};\n\n /// // Limit size of a producer-consumer queue\n\n /// async fn recv<T>(semaphore: &Semaphore, recv: &Receiver<T>) -> Result<T, RecvError>{\n\n /// let result = recv.recv().await?;\n\n /// // Note that this only guards elements in the queue, not those being processed after the\n\n /// // queue.\n\n /// semaphore.release(1);\n\n /// Ok(result)\n\n /// }\n\n /// ```\n\n pub fn release(&self, amount: usize) {\n\n unsafe {\n","file_path":"src/semaphore.rs","rank":46,"score":27046.25271239278},{"content":"impl Semaphore {\n\n /// The maximum number of permits that can be made available. This is slightly smaller than\n\n /// [`usize::MAX`]. If the number of available permits exceeds this number, it may poison the\n\n /// semaphore.\n\n /// # Examples\n\n /// ```\n\n /// # use async_weighted_semaphore::{Semaphore, SemaphoreGuard};\n\n /// struct ReadWriteLock(Semaphore);\n\n /// impl ReadWriteLock {\n\n /// fn new() -> Self {\n\n /// ReadWriteLock(Semaphore::new(Semaphore::MAX_AVAILABLE))\n\n /// }\n\n /// // Acquire one permit, allowing up to MAX_AVAILABLE concurrent readers.\n\n /// async fn read(&self) -> SemaphoreGuard<'_> {\n\n /// self.0.acquire(1).await.unwrap()\n\n /// }\n\n /// // The writer acquires all the permits, prevent any concurrent writers or readers. The\n\n /// // first-in-first-out priority policy prevents writer starvation.\n\n /// async fn write(&self) -> SemaphoreGuard<'_> {\n\n /// self.0.acquire(Semaphore::MAX_AVAILABLE).await.unwrap()\n","file_path":"src/semaphore.rs","rank":47,"score":27044.79374714544},{"content":" /// message: T\n\n /// ) -> Result<(), TrySendError<T>>{\n\n /// match semaphore.try_acquire_arc(1) {\n\n /// Err(TryAcquireError::WouldBlock) => Err(TrySendError::Full(message)),\n\n /// // A semaphore can be poisoned to prevent deadlock when a channel closes.\n\n /// Err(TryAcquireError::Poisoned) => Err(TrySendError::Closed(message)),\n\n /// Ok(guard) => match sender.try_send((guard, message)) {\n\n /// Err(TrySendError::Closed((guard, message))) => Err(TrySendError::Closed(message)),\n\n /// Err(TrySendError::Full((guard, message))) => Err(TrySendError::Full(message)),\n\n /// Ok(()) => Ok(())\n\n /// }\n\n /// }\n\n /// }\n\n /// ```\n\n pub fn try_acquire_arc(self: &Arc<Self>, amount: usize) -> Result<SemaphoreGuardArc, TryAcquireError> {\n\n let guard = self.try_acquire(amount)?;\n\n let result = SemaphoreGuardArc::new(self.clone(), amount);\n\n guard.forget();\n\n Ok(result)\n\n }\n","file_path":"src/semaphore.rs","rank":48,"score":27043.222183914215},{"content":"\n\n /// Like [acquire](#method.acquire), but takes an [`Arc`] `<Semaphore>` and returns a guard that is `'static`, [`Send`] and [`Sync`].\n\n /// # Examples\n\n /// ```\n\n /// # use async_weighted_semaphore::{Semaphore, PoisonError, SemaphoreGuardArc};\n\n /// # use std::sync::Arc;\n\n /// use async_channel::{Sender, SendError};\n\n /// // Limit size of a producer-consumer queue\n\n /// async fn send<T>(semaphore: &Arc<Semaphore>,\n\n /// sender: &Sender<(SemaphoreGuardArc, T)>,\n\n /// message: T\n\n /// ) -> Result<(), SendError<T>>{\n\n /// match semaphore.acquire_arc(1).await {\n\n /// // A semaphore can be poisoned to prevent deadlock when a channel closes.\n\n /// Err(PoisonError) => Err(SendError(message)),\n\n /// Ok(guard) => match sender.send((guard, message)).await{\n\n /// Err(SendError((guard, message))) => Err(SendError(message)),\n\n /// Ok(()) => Ok(())\n\n /// }\n\n /// }\n","file_path":"src/semaphore.rs","rank":49,"score":27043.21194900267},{"content":"// This implementation encodes state (the available counter, acquire queue, and cancel queue) into\n\n// multiple atomic variables and linked lists. Concurrent acquires (and concurrent cancels) synchronize\n\n// by pushing onto a stack with an atomic swap. Releases synchronize with other operations by attempting\n\n// to acquire a lock. If the lock is successfully acquired, the release can proceed. Otherwise\n\n// the lock is marked dirty to indicate that there is additional work for the lock owner to do.\n\npub struct Semaphore {\n\n // The number of available permits or the back of the queue (without next edges).\n\n pub(crate) acquire: Atomic<AcquireState>,\n\n // A number of releasable permits, and the state of the current release lock.\n\n pub(crate) release: Atomic<ReleaseState>,\n\n // The front of the queue (with next edges).\n\n pub(crate) front: UnsafeCell<*const Waiter>,\n\n // The last node swapped from AcquireState (with next edges).\n\n pub(crate) middle: UnsafeCell<*const Waiter>,\n\n // A stack of nodes that are cancelling.\n\n pub(crate) next_cancel: Atomic<*const Waiter>,\n\n}\n\n\n\nunsafe impl Sync for Semaphore {}\n\n\n","file_path":"src/semaphore.rs","rank":50,"score":27039.84117364435},{"content":" f.debug_struct(\"AW\")\n\n .field(\"s\", &self.state.load(SeqCst))\n\n .field(\"d\", &self.data.load(SeqCst))\n\n .field(\"t\", &self.vtable.load(SeqCst))\n\n .field(\"t\", unsafe { &*self.thread.get() })\n\n .finish()\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use crate::waker::{WakerResult, AtomicWaker};\n\n use std::future::Future;\n\n use futures::task::{Context, Poll};\n\n use std::pin::Pin;\n\n\n\n use futures::pin_mut;\n\n use futures::poll;\n\n\n\n\n","file_path":"src/waker.rs","rank":51,"score":26835.47527746393},{"content":" use futures::executor::block_on;\n\n use std::thread;\n\n use futures_test::std_reexport::sync::mpsc::sync_channel;\n\n\n\n struct Tester {\n\n waiter: AtomicWaker,\n\n }\n\n\n\n unsafe impl Send for Tester {}\n\n\n\n unsafe impl Sync for Tester {}\n\n\n\n impl Unpin for Tester {}\n\n\n\n impl Future for Tester {\n\n type Output = bool;\n\n fn poll(self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<bool> {\n\n unsafe {\n\n self.waiter.poll(cx)\n\n }\n","file_path":"src/waker.rs","rank":52,"score":26833.636299903887},{"content":" unsafe {\n\n let tester = Tester { waiter: AtomicWaker::new() };\n\n pin_mut!(tester);\n\n assert_eq!(Poll::Pending, poll!(&mut tester));\n\n\n\n match tester.waiter.start_cancel() {\n\n WakerResult::Cancelling => {\n\n AtomicWaker::accept_cancel(&tester.as_mut().waiter);\n\n tester.waiter.wait_cancel();\n\n }\n\n WakerResult::Finished { .. } => panic!(),\n\n }\n\n }\n\n });\n\n }\n\n\n\n #[test]\n\n fn test_finish_cancel() {\n\n block_on(async {\n\n unsafe {\n","file_path":"src/waker.rs","rank":53,"score":26832.426558412128},{"content":" let tester = Tester { waiter: AtomicWaker::new() };\n\n pin_mut!(tester);\n\n assert_eq!(Poll::Pending, poll!(&mut tester));\n\n assert_eq!(WakerResult::Finished { poisoned: true },\n\n AtomicWaker::finish(&tester.waiter, true));\n\n match tester.waiter.start_cancel() {\n\n WakerResult::Cancelling => panic!(),\n\n WakerResult::Finished { poisoned } => { assert!(poisoned) }\n\n }\n\n }\n\n });\n\n }\n\n\n\n #[test]\n\n fn test_cancel_finish() {\n\n block_on(async {\n\n unsafe {\n\n let tester = Tester { waiter: AtomicWaker::new() };\n\n pin_mut!(tester);\n\n assert_eq!(Poll::Pending, poll!(&mut tester));\n","file_path":"src/waker.rs","rank":54,"score":26831.05430984205},{"content":"use std::cell::UnsafeCell;\n\nuse std::task::{Waker, Poll, Context, RawWakerVTable};\n\n\n\nuse std::sync::atomic::Ordering::{Acquire, SeqCst, Relaxed};\n\nuse crate::waker::State::{Cancelled, Cancelling};\n\nuse crate::atomic::{Atomic, Packable};\n\nuse std::{mem, thread, fmt};\n\n\n\nuse std::thread::{Thread, panicking};\n\nuse std::fmt::{Debug, Formatter};\n\nuse std::ptr::null;\n\nuse crate::waker::State::{Pending, Storing, Finished, Loading};\n\n\n\n#[derive(Copy, Clone, Eq, PartialOrd, PartialEq, Ord, Debug)]\n","file_path":"src/waker.rs","rank":55,"score":26830.383755790626},{"content":" }\n\n }\n\n\n\n #[test]\n\n fn test_finish() {\n\n block_on(async {\n\n unsafe {\n\n let tester = Tester { waiter: AtomicWaker::new() };\n\n pin_mut!(tester);\n\n assert_eq!(Poll::Pending, poll!(&mut tester));\n\n assert_eq!(WakerResult::Finished { poisoned: false },\n\n AtomicWaker::finish(&tester.waiter as *const AtomicWaker, false));\n\n assert_eq!(Poll::Ready(false), poll!(&mut tester));\n\n }\n\n });\n\n }\n\n\n\n #[test]\n\n fn test_cancel() {\n\n block_on(async {\n","file_path":"src/waker.rs","rank":56,"score":26829.080641061864},{"content":" // Store a new waker and return the poisoned bit if finished.\n\n #[must_use]\n\n pub unsafe fn poll(&self, context: &mut Context) -> Poll<bool> {\n\n let mut waker = Some(context.waker().clone());\n\n let mut current = self.state.load(Acquire);\n\n loop {\n\n match current {\n\n Pending | Loading => {\n\n if self.state.cmpxchg_weak_acqrel(&mut current, Storing) {\n\n current = Storing;\n\n break;\n\n }\n\n }\n\n Finished { poisoned } => return Poll::Ready(poisoned),\n\n _ => unreachable!()\n\n };\n\n }\n\n let (data, vtable) =\n\n mem::transmute_copy::<_, (*const (), *const RawWakerVTable)>(waker.as_ref().unwrap());\n\n let old_data = self.data.load(Relaxed);\n","file_path":"src/waker.rs","rank":57,"score":26828.869261061907},{"content":"}\n\n\n\nimpl Drop for AtomicWaker {\n\n fn drop(&mut self) {\n\n match self.state.load(Relaxed) {\n\n Pending | Cancelled => unsafe {\n\n let data = self.data.load(Relaxed);\n\n let vtable = self.vtable.load(Relaxed);\n\n if vtable != null() {\n\n mem::drop(mem::transmute::<_, Waker>((data, vtable)));\n\n }\n\n }\n\n Finished { .. } => {}\n\n _ => if !panicking() { unreachable!() }\n\n }\n\n }\n\n}\n\n\n\nimpl Debug for AtomicWaker {\n\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\n","file_path":"src/waker.rs","rank":58,"score":26828.221677188827},{"content":" match tester.waiter.start_cancel() {\n\n WakerResult::Cancelling => {\n\n AtomicWaker::accept_cancel(&tester.waiter);\n\n tester.waiter.wait_cancel();\n\n }\n\n WakerResult::Finished { .. } => panic!(),\n\n }\n\n }\n\n });\n\n }\n\n\n\n fn test_race(cancel: bool) {\n\n unsafe {\n\n let iters = 10000;\n\n let mut testers = (0..iters).map(|_| Tester { waiter: AtomicWaker::new() }).collect::<Vec<_>>();\n\n let (send, recv) = sync_channel(0);\n\n let h1 = thread::spawn(move || block_on(async {\n\n let mut results = vec![];\n\n for i in 0..iters {\n\n let mut tester = &mut testers[i];\n","file_path":"src/waker.rs","rank":59,"score":26828.20354795446},{"content":"impl Packable for State {\n\n unsafe fn encode(val: Self) -> usize {\n\n mem::transmute::<_, u8>(val) as usize\n\n }\n\n\n\n unsafe fn decode(val: usize) -> Self {\n\n mem::transmute(val as u8)\n\n }\n\n}\n\n\n\nimpl AtomicWaker {\n\n pub unsafe fn new() -> Self {\n\n AtomicWaker {\n\n state: Atomic::new(Pending),\n\n vtable: Atomic::new(null()),\n\n data: Atomic::new(null()),\n\n thread: UnsafeCell::new(None),\n\n }\n\n }\n\n\n","file_path":"src/waker.rs","rank":60,"score":26827.60804405663},{"content":" }\n\n }\n\n Finished { poisoned } => {\n\n return WakerResult::Finished { poisoned };\n\n }\n\n _ => unreachable!(\"{:?}\", current)\n\n }\n\n }\n\n }\n\n\n\n // Wait for the producer thread to accept cancellation\n\n pub unsafe fn wait_cancel(&self) {\n\n loop {\n\n match self.state.load(Acquire) {\n\n Cancelling => thread::park(),\n\n Cancelled => break,\n\n _ => panic!(),\n\n }\n\n }\n\n }\n","file_path":"src/waker.rs","rank":61,"score":26827.27697424529},{"content":" data: Atomic<*const ()>,\n\n state: Atomic<State>,\n\n // The thread waiting for acceptance of cancellation\n\n thread: UnsafeCell<Option<Thread>>,\n\n}\n\n\n\n// The result of an attempt to finish or cancel.\n\n#[derive(Copy, Clone, Eq, PartialOrd, PartialEq, Ord, Debug)]\n\npub enum WakerResult {\n\n // The future has been cancelled. The producer should accept_cancel.\n\n // The future thread should wait_cancel.\n\n Cancelling,\n\n // The future completed.\n\n Finished { poisoned: bool },\n\n}\n\n\n\nunsafe impl Send for AtomicWaker {}\n\n\n\nunsafe impl Sync for AtomicWaker {}\n\n\n","file_path":"src/waker.rs","rank":62,"score":26827.234112367303},{"content":" assert_eq!(Poll::Pending, poll!(&mut tester));\n\n send.send(&*(&tester.waiter as *const AtomicWaker)).unwrap();\n\n let result = if cancel {\n\n match tester.waiter.start_cancel() {\n\n WakerResult::Cancelling => {\n\n tester.waiter.wait_cancel();\n\n None\n\n }\n\n WakerResult::Finished { poisoned } => Some(poisoned),\n\n }\n\n } else {\n\n Some(tester.await)\n\n };\n\n results.push(result);\n\n }\n\n results\n\n }));\n\n let h2 = thread::spawn(move || block_on(async {\n\n let mut results = vec![];\n\n for i in 0..iters {\n","file_path":"src/waker.rs","rank":63,"score":26827.232267246927},{"content":" }\n\n\n\n // Signal that the future is finished.\n\n pub unsafe fn finish(this: *const Self, poisoned: bool) -> WakerResult {\n\n let mut current = (*this).state.load(Acquire);\n\n loop {\n\n match current {\n\n Pending => {\n\n if (*this).state.cmpxchg_weak_acqrel(&mut current, Loading) {\n\n current = Loading;\n\n }\n\n }\n\n Loading => {\n\n let data = (*this).data.load(Relaxed);\n\n let vtable = (*this).vtable.load(Relaxed);\n\n if (*this).state.cmpxchg_weak_acqrel(&mut current, Finished { poisoned }) {\n\n let waker = mem::transmute::<_, Waker>((data, vtable));\n\n waker.wake();\n\n return WakerResult::Finished { poisoned };\n\n }\n","file_path":"src/waker.rs","rank":64,"score":26827.064709723905},{"content":" }\n\n Storing => {\n\n if (*this).state.cmpxchg_weak_acqrel(&mut current, Finished { poisoned }) {\n\n return WakerResult::Finished { poisoned };\n\n }\n\n }\n\n Cancelling => return WakerResult::Cancelling,\n\n _ => unreachable!()\n\n }\n\n }\n\n }\n\n\n\n pub unsafe fn start_cancel(&self) -> WakerResult {\n\n *self.thread.get() = Some(thread::current());\n\n let mut current = self.state.load(Acquire);\n\n loop {\n\n match current {\n\n Pending | Loading => {\n\n if self.state.cmpxchg_weak_acqrel(&mut current, Cancelling) {\n\n return WakerResult::Cancelling;\n","file_path":"src/waker.rs","rank":65,"score":26827.025676561854},{"content":"\n\n // Accept cancellation on the producer thread, notifying the future thread.\n\n pub unsafe fn accept_cancel(this: *const Self) {\n\n let mut current = (*this).state.load(Acquire);\n\n loop {\n\n match current {\n\n Cancelling => {\n\n let thread = (*(*this).thread.get()).take().unwrap();\n\n if (*this).state.cmpxchg_weak_acqrel(&mut current, Cancelled) {\n\n thread.unpark();\n\n break;\n\n } else {\n\n *(*this).thread.get() = Some(thread);\n\n continue;\n\n }\n\n }\n\n _ => unreachable!(\"{:?}\", current)\n\n }\n\n }\n\n }\n","file_path":"src/waker.rs","rank":66,"score":26826.067950007717},{"content":" let waiter = recv.recv().unwrap();\n\n let result =\n\n match AtomicWaker::finish(waiter, i % 2 == 0) {\n\n WakerResult::Cancelling => {\n\n AtomicWaker::accept_cancel(waiter);\n\n WakerResult::Cancelling\n\n }\n\n WakerResult::Finished { poisoned } =>\n\n WakerResult::Finished { poisoned }\n\n };\n\n results.push(result);\n\n }\n\n results\n\n }));\n\n let r1 = h1.join().unwrap();\n\n let r2 = h2.join().unwrap();\n\n for (send, recv) in r1.into_iter().zip(r2.into_iter()) {\n\n match (cancel, send, recv) {\n\n (_, Some(o), WakerResult::Finished { poisoned: i }) if i == o => {}\n\n (true, None, WakerResult::Cancelling) => {}\n","file_path":"src/waker.rs","rank":67,"score":26822.59766370551},{"content":" let old_vtable = self.vtable.load(Relaxed);\n\n self.data.store(data, Relaxed);\n\n self.vtable.store(vtable, Relaxed);\n\n if old_vtable != null() {\n\n mem::drop(mem::transmute::<_, Waker>((old_data, old_vtable)));\n\n }\n\n loop {\n\n match current {\n\n Storing => {\n\n if self.state.cmpxchg_weak_acqrel(&mut current, Pending) {\n\n mem::forget(waker.take());\n\n return Poll::Pending;\n\n }\n\n }\n\n Finished { poisoned } => {\n\n return Poll::Ready(poisoned);\n\n }\n\n _ => unreachable!(\"{:?}\", current)\n\n }\n\n }\n","file_path":"src/waker.rs","rank":68,"score":26822.455867146633},{"content":" _ => panic!(\"Unexpected outcome {:?}\", (cancel, send, recv))\n\n }\n\n }\n\n }\n\n }\n\n\n\n #[test]\n\n fn test_poll_race() {\n\n test_race(false);\n\n }\n\n\n\n #[test]\n\n fn test_cancel_race() {\n\n test_race(true);\n\n }\n\n}\n","file_path":"src/waker.rs","rank":69,"score":26821.1812577683},{"content":"#[derive(Copy, Clone, Eq, PartialOrd, PartialEq, Ord, Debug)]\n\nenum State {\n\n Pending,\n\n // A poll is in progress, storing a new waker.\n\n Storing,\n\n // A finish is in progress, loading the waker.\n\n Loading,\n\n // A finish has succeeded, and will call wake if necessary.\n\n Finished { poisoned: bool },\n\n // start_cancel has been called.\n\n Cancelling,\n\n // accept_cancel has been called.\n\n Cancelled,\n\n}\n\n\n\n// A primitive for synchronizing between two threads:\n\n// Future: a thread that polls the a future and may decide to cancel (drop) it.\n\n// Producer: one that marks the future as finished or accepts cancellation.\n\npub struct AtomicWaker {\n\n vtable: Atomic<*const RawWakerVTable>,\n\n // Split the waker among two atomics. These only need to be atomic to prevent data races.\n","file_path":"src/waker.rs","rank":70,"score":25085.990954612473},{"content":"use crate::{Semaphore, PoisonError};\n\nuse std::sync::Arc;\n\nuse futures_test::std_reexport::collections::VecDeque;\n\nuse async_std::sync::Mutex;\n\nuse std::io::{BufReader, BufRead};\n\nuse std::{mem, thread};\n\nuse futures::executor::block_on;\n\nuse rand::{thread_rng, Rng};\n\n\n\n\n\n\n\n#[derive(Clone)]\n","file_path":"src/tests/pipe.rs","rank":79,"score":24021.312540449435},{"content":"use crate::{Semaphore, PoisonError, SemaphoreGuard};\n\nuse std::cell::UnsafeCell;\n\nuse std::ops::{Deref, DerefMut};\n\nuse std::thread;\n\nuse std::sync::Arc;\n\nuse futures::executor::block_on;\n\n\n\n\n\n#[derive(Debug)]\n\npub struct RwLock<T: ?Sized> {\n\n semaphore: Semaphore,\n\n inner: UnsafeCell<T>,\n\n}\n\n\n\npub struct RwLockReadGuard<'a, T: ?Sized> {\n\n _guard: SemaphoreGuard<'a>,\n\n value: *const T,\n\n}\n\n\n\npub struct RwLockWriteGuard<'a, T: ?Sized> {\n","file_path":"src/tests/lock.rs","rank":80,"score":24020.570759163114},{"content":" _guard: SemaphoreGuard<'a>,\n\n value: *mut T,\n\n}\n\n\n\nimpl<T: ?Sized> RwLock<T> {\n\n fn new(inner: T) -> Self where T: Sized {\n\n RwLock {\n\n semaphore: Semaphore::new(Semaphore::MAX_AVAILABLE),\n\n inner: UnsafeCell::new(inner),\n\n }\n\n }\n\n async fn read(&self) -> Result<RwLockReadGuard<'_, T>, PoisonError> {\n\n Ok(RwLockReadGuard { _guard: self.semaphore.acquire(1).await?, value: self.inner.get() })\n\n }\n\n async fn write(&self) -> Result<RwLockWriteGuard<'_, T>, PoisonError> {\n\n Ok(RwLockWriteGuard { _guard: self.semaphore.acquire(Semaphore::MAX_AVAILABLE).await?, value: self.inner.get() })\n\n }\n\n fn into_inner(self) -> Result<T, PoisonError> where T: Sized {\n\n match self.semaphore.try_acquire(0) {\n\n Ok(_) => Ok(self.inner.into_inner()),\n","file_path":"src/tests/lock.rs","rank":82,"score":24017.30324150991},{"content":" fn deref(&self) -> &Self::Target {\n\n unsafe { &*self.value }\n\n }\n\n}\n\n\n\nimpl<'a, T: ?Sized> Deref for RwLockWriteGuard<'a, T> {\n\n type Target = T;\n\n\n\n fn deref(&self) -> &Self::Target {\n\n unsafe { &*self.value }\n\n }\n\n}\n\n\n\nimpl<'a, T: ?Sized> DerefMut for RwLockWriteGuard<'a, T> {\n\n fn deref_mut(&mut self) -> &mut Self::Target {\n\n unsafe { &mut *self.value }\n\n }\n\n}\n\n\n\n\n\n#[test]\n","file_path":"src/tests/lock.rs","rank":83,"score":24015.216474704637},{"content":" if n != buf.len() {\n\n break;\n\n }\n\n }\n\n let mut lines = 0;\n\n for line in BufReader::new(&mut result.as_slice()).lines() {\n\n line.unwrap().parse::<usize>().unwrap();\n\n lines += 1;\n\n }\n\n assert_eq!(threads * iters, lines);\n\n });\n\n}","file_path":"src/tests/pipe.rs","rank":86,"score":24011.398737788382},{"content":" mem::drop(lock);\n\n self.inner.0.ready.release(buf.len());\n\n Ok(())\n\n }\n\n}\n\n\n\nimpl Drop for ReaderInner {\n\n fn drop(&mut self) {\n\n self.0.free.poison();\n\n }\n\n}\n\n\n\nimpl Drop for WriterInner {\n\n fn drop(&mut self) {\n\n self.0.ready.poison();\n\n }\n\n}\n\n\n","file_path":"src/tests/pipe.rs","rank":87,"score":24010.176401552213},{"content":" buf.len()\n\n } else {\n\n let mut lock = self.inner.0.buffer.lock().await;\n\n let length = lock.len().min(buf.len());\n\n for (i, b) in lock.drain(..length).enumerate() {\n\n buf[i] = b;\n\n }\n\n length\n\n };\n\n self.inner.0.free.release(total);\n\n total\n\n }\n\n}\n\n\n\nimpl Writer {\n\n async fn write_all(&self, buf: &[u8]) -> Result<(), PoisonError> {\n\n assert!(buf.len() < self.inner.0.buffer.lock().await.capacity());\n\n self.inner.0.free.acquire(buf.len()).await?.forget();\n\n let mut lock = self.inner.0.buffer.lock().await;\n\n lock.extend(buf.iter().cloned());\n","file_path":"src/tests/pipe.rs","rank":88,"score":24009.331195305032},{"content":" Err(_) => Err(PoisonError),\n\n }\n\n }\n\n}\n\n\n\nunsafe impl<T: ?Sized + Send> Send for RwLock<T> {}\n\n\n\nunsafe impl<T: ?Sized + Sync + Send> Sync for RwLock<T> {}\n\n\n\nunsafe impl<'a, T: ?Sized + Sync> Send for RwLockReadGuard<'a, T> {}\n\n\n\nunsafe impl<'a, T: ?Sized + Sync> Sync for RwLockReadGuard<'a, T> {}\n\n\n\nunsafe impl<'a, T: ?Sized + Sync + Send> Send for RwLockWriteGuard<'a, T> {}\n\n\n\nunsafe impl<'a, T: ?Sized + Sync + Send> Sync for RwLockWriteGuard<'a, T> {}\n\n\n\nimpl<'a, T: ?Sized> Deref for RwLockReadGuard<'a, T> {\n\n type Target = T;\n\n\n","file_path":"src/tests/lock.rs","rank":89,"score":24006.71589428367},{"content":"mod unit;\n\nmod pipe;\n\nmod lock;\n","file_path":"src/tests/mod.rs","rank":90,"score":24003.529597530236},{"content":"# async-weighted-semaphore\n\n[](https://travis-ci.com/github/nathdobson/async-weighted-semaphore)\n\n[](\n\nhttps://github.com/nathdobson/async-weighted-semaphore)\n\n[](\n\nhttps://crates.io/crates/async-weighted-semaphore)\n\n[](\n\nhttps://docs.rs/async-weighted-semaphore)\n\n\n\nAn async semaphore where any number of permits can be acquired or released in one call.\n\n\n\n## License\n\n\n\nLicensed under either of\n\n\n\n * Apache License, Version 2.0\n\n ([LICENSE-APACHE](LICENSE-APACHE) or http://www.apache.org/licenses/LICENSE-2.0)\n\n * MIT license\n\n ([LICENSE-MIT](LICENSE-MIT) or http://opensource.org/licenses/MIT)\n\n\n\nat your option.\n\n\n\n## Contribution\n\n\n\nUnless you explicitly state otherwise, any contribution intentionally submitted\n\nfor inclusion in the work by you, as defined in the Apache-2.0 license, shall be\n","file_path":"README.md","rank":91,"score":14800.016795005908},{"content":"impl Debug for AcquireFutureArc {\n\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\n\n f.debug_tuple(\"AcquireFutureArc\").field(&unsafe { self.inner.waiter() }.amount).finish()\n\n }\n\n}\n\n\n\nimpl<'a> AcquireFuture<'a> {\n\n unsafe fn waiter(&self) -> &Waiter {\n\n &*self.0.get()\n\n }\n\n // Try to acquire or add to queue.\n\n unsafe fn poll_enter(self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Result<SemaphoreGuard<'a>, PoisonError>> {\n\n let acquire = &(*self.waiter().semaphore).acquire;\n\n let mut current = acquire.load(Acquire);\n\n loop {\n\n let (available, back) = match current {\n\n Queued(back) => (0, back),\n\n Available(available) => {\n\n let available = match available.into_usize() {\n\n None => {\n","file_path":"src/acquire.rs","rank":92,"score":30.077490934641194},{"content":"/// A [`Future`] returned by [`Semaphore::acquire_arc`] that produces a [`SemaphoreGuardArc`].\n\npub struct AcquireFutureArc {\n\n pub(crate) arc: Arc<Semaphore>,\n\n pub(crate) inner: AcquireFuture<'static>,\n\n}\n\n\n\nunsafe impl<'a> Sync for AcquireFuture<'a> {}\n\n\n\nunsafe impl<'a> Send for AcquireFuture<'a> {}\n\n\n\nimpl<'a> UnwindSafe for AcquireFuture<'a> {}\n\n\n\nimpl<'a> RefUnwindSafe for AcquireFuture<'a> {}\n\n\n\nimpl<'a> Debug for AcquireFuture<'a> {\n\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\n\n f.debug_tuple(\"AcquireFuture\").field(&unsafe { self.waiter() }.amount).finish()\n\n }\n\n}\n\n\n","file_path":"src/acquire.rs","rank":93,"score":22.002653795416553},{"content":" }\n\n pub fn poison() -> Self {\n\n Permits(usize::max_value())\n\n }\n\n pub fn into_usize(self) -> Option<usize> {\n\n if self.0 <= Semaphore::MAX_AVAILABLE {\n\n Some(self.0)\n\n } else {\n\n None\n\n }\n\n }\n\n}\n\n\n\nimpl Debug for Permits {\n\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\n\n if self.0 <= Semaphore::MAX_AVAILABLE {\n\n write!(f, \"{:?}\", self.0)\n\n } else {\n\n write!(f, \"poison\")\n\n }\n","file_path":"src/state.rs","rank":94,"score":21.523271239726352},{"content":"use crate::state::{Waiter, AcquireStep, Permits};\n\nuse std::cell::UnsafeCell;\n\nuse std::marker::{PhantomPinned, PhantomData};\n\nuse crate::{Semaphore, SemaphoreGuard, SemaphoreGuardArc};\n\nuse std::sync::Arc;\n\nuse std::panic::{UnwindSafe, RefUnwindSafe};\n\nuse std::fmt::{Debug, Formatter};\n\nuse std::{fmt};\n\nuse std::task::{Context, Poll};\n\nuse crate::state::AcquireState::{Available, Queued};\n\nuse std::ptr::null;\n\nuse std::pin::Pin;\n\nuse std::future::Future;\n\nuse crate::waker::{WakerResult};\n\nuse crate::errors::PoisonError;\n\nuse std::sync::atomic::Ordering::Acquire;\n\n\n\n/// A [`Future`] returned by [`Semaphore::acquire`] that produces a [`SemaphoreGuard`].\n\npub struct AcquireFuture<'a>(pub(crate) UnsafeCell<Waiter>, pub(crate) PhantomData<&'a Semaphore>, pub(crate) PhantomPinned);\n\n\n","file_path":"src/acquire.rs","rank":95,"score":20.290775078997033},{"content":"#![feature(test)]\n\nextern crate test;\n\n\n\nuse test::Bencher;\n\nuse async_weighted_semaphore::{Semaphore, PoisonError};\n\nuse std::sync::Arc;\n\nuse futures::executor::{ThreadPool, block_on};\n\nuse futures::task::SpawnExt;\n\nuse rand::{Rng, SeedableRng};\n\nuse rand_xorshift::XorShiftRng;\n\nuse futures::future::join_all;\n\n\n\nconst PARALLELISM: usize = 8;\n\nconst ITEMS: usize = 10;\n\nconst ITERS: usize = 10000;\n\nconst MAX_ACQUIRE: usize = 5;\n\nconst TOKENS: usize = (MAX_ACQUIRE - 1) * ITEMS + 1;\n\n\n","file_path":"benches/ring.rs","rank":96,"score":20.10443204995533},{"content":"\n\n fn poll(self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Self::Output> {\n\n unsafe {\n\n let this = self.get_unchecked_mut();\n\n match Pin::new_unchecked(&mut this.inner).poll(cx) {\n\n Poll::Ready(guard) => {\n\n let result =\n\n SemaphoreGuardArc::new(this.arc.clone(), guard?.forget());\n\n Poll::Ready(Ok(result))\n\n }\n\n Poll::Pending => Poll::Pending,\n\n }\n\n }\n\n }\n\n}\n\n\n\nimpl<'a> Drop for AcquireFuture<'a> {\n\n fn drop(&mut self) {\n\n unsafe {\n\n match *self.waiter().step.get() {\n","file_path":"src/acquire.rs","rank":97,"score":19.688032170619092},{"content":" (*self.waiter().semaphore).release(available);\n\n return Poll::Pending;\n\n }\n\n }\n\n\n\n unsafe fn poll_waiting(self: Pin<&mut Self>, cx: &mut Context) -> Poll<Result<SemaphoreGuard<'a>, PoisonError>> {\n\n match self.waiter().waker.poll(cx) {\n\n Poll::Pending => Poll::Pending,\n\n Poll::Ready(poisoned) => {\n\n *self.waiter().step.get() = AcquireStep::Done;\n\n if poisoned {\n\n Poll::Ready(Err(PoisonError))\n\n } else {\n\n Poll::Ready(Ok(SemaphoreGuard::new(&*self.waiter().semaphore, self.waiter().amount)))\n\n }\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"src/acquire.rs","rank":98,"score":19.475100558070963},{"content":"impl<'a> Future for AcquireFuture<'a> {\n\n type Output = Result<SemaphoreGuard<'a>, PoisonError>;\n\n\n\n fn poll(self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Self::Output> {\n\n unsafe {\n\n match *(*self.0.get()).step.get() {\n\n AcquireStep::Entering => {\n\n self.poll_enter(cx)\n\n }\n\n AcquireStep::Waiting => {\n\n self.poll_waiting(cx)\n\n }\n\n AcquireStep::Done => panic!(\"Polling completed future.\")\n\n }\n\n }\n\n }\n\n}\n\n\n\nimpl Future for AcquireFutureArc {\n\n type Output = Result<SemaphoreGuardArc, PoisonError>;\n","file_path":"src/acquire.rs","rank":99,"score":19.051491558666093}],"string":"[\n {\n \"content\": \"struct SemMutex(Semaphore, UnsafeCell<usize>);\\n\\n\\n\\nunsafe impl Send for SemMutex {}\\n\\n\\n\\nunsafe impl Sync for SemMutex {}\\n\\n\\n\\nimpl Default for SemMutex {\\n\\n fn default() -> Self {\\n\\n SemMutex(Semaphore::new(1), UnsafeCell::new(0))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl AtomicCounter for SemMutex {\\n\\n fn do_loop<'a>(items: Vec<Arc<Self>>) -> BoxFuture<'static, ()> {\\n\\n Box::pin(async move {\\n\\n for x in get_loop(&items) {\\n\\n let _guard = x.0.acquire(1).await.unwrap();\\n\\n unsafe { *x.1.get() += 1; }\\n\\n }\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/mutex.rs\",\n \"rank\": 0,\n \"score\": 117835.99228394657\n },\n {\n \"content\": \"#[bench]\\n\\nfn run_futures_mutex(bencher: &mut Bencher) {\\n\\n run_impl::<FuturesMutex<usize>>(bencher);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/mutex.rs\",\n \"rank\": 1,\n \"score\": 107570.93198252961\n },\n {\n \"content\": \"#[test]\\n\\nfn test() {\\n\\n let lock = Arc::new(RwLock::new(Vec::new()));\\n\\n let threads = 10;\\n\\n let iters = 500;\\n\\n (0..threads).map(|thread| {\\n\\n let lock = lock.clone();\\n\\n thread::spawn(move || {\\n\\n block_on(async {\\n\\n for i in (thread..iters * threads + thread).step_by(threads) {\\n\\n while lock.read().await.unwrap().len() != i {}\\n\\n lock.write().await.unwrap().push(i)\\n\\n }\\n\\n })\\n\\n })\\n\\n }).collect::<Vec<_>>().into_iter().for_each(|x| x.join().unwrap());\\n\\n let vec = Arc::try_unwrap(lock).unwrap().into_inner().unwrap();\\n\\n assert_eq!(vec, (0..threads*iters).collect::<Vec<_>>());\\n\\n}\",\n \"file_path\": \"src/tests/lock.rs\",\n \"rank\": 3,\n \"score\": 88567.28810744936\n },\n {\n \"content\": \"#[bench]\\n\\nfn run_sem_mutex(bencher: &mut Bencher) {\\n\\n run_impl::<SemMutex>(bencher);\\n\\n}\",\n \"file_path\": \"benches/mutex.rs\",\n \"rank\": 4,\n \"score\": 88060.33189558965\n },\n {\n \"content\": \"#[bench]\\n\\nfn run_sync_mutex(bencher: &mut Bencher) {\\n\\n run_impl::<SyncMutex<usize>>(bencher);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/mutex.rs\",\n \"rank\": 5,\n \"score\": 88060.33189558965\n },\n {\n \"content\": \"#[bench]\\n\\nfn run_tokio_mutex(bencher: &mut Bencher) {\\n\\n run_impl::<TokioMutex<usize>>(bencher);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/mutex.rs\",\n \"rank\": 6,\n \"score\": 88060.33189558965\n },\n {\n \"content\": \"#[bench]\\n\\nfn run_async_std_mutex(bencher: &mut Bencher) {\\n\\n run_impl::<AsyncStdMutex<usize>>(bencher);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/mutex.rs\",\n \"rank\": 10,\n \"score\": 85364.60933135831\n },\n {\n \"content\": \"#[bench]\\n\\nfn run_atomic(bencher: &mut Bencher) {\\n\\n run_impl::<AtomicUsize>(bencher);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/mutex.rs\",\n \"rank\": 13,\n \"score\": 82652.63402115341\n },\n {\n \"content\": \"struct ReaderInner(Pipe);\\n\\n\\n\",\n \"file_path\": \"src/tests/pipe.rs\",\n \"rank\": 15,\n \"score\": 79686.47005718287\n },\n {\n \"content\": \"struct WriterInner(Pipe);\\n\\n\\n\\n#[derive(Clone)]\\n\\npub struct Reader {\\n\\n inner: Arc<ReaderInner>,\\n\\n}\\n\\n\\n\\n#[derive(Clone)]\\n\\npub struct Writer {\\n\\n inner: Arc<WriterInner>\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/pipe.rs\",\n \"rank\": 16,\n \"score\": 79686.47005718287\n },\n {\n \"content\": \"fn run_impl<T: AtomicCounter>(bencher: &mut Bencher) {\\n\\n let items = (0..ITEMS).map(|_| Arc::new(T::default())).collect::<Vec<_>>();\\n\\n let pool = ThreadPool::builder().pool_size(PARALLELISM).create().unwrap();\\n\\n bencher.iter(|| {\\n\\n block_on(join_all((0..CONCURRENCY).map(|_| {\\n\\n let items = items.clone();\\n\\n pool.spawn_with_handle(T::do_loop(items)).unwrap()\\n\\n }).collect::<Vec<_>>().into_iter()));\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/mutex.rs\",\n \"rank\": 17,\n \"score\": 70477.56168731803\n },\n {\n \"content\": \"#[test]\\n\\nfn test_pipe() {\\n\\n for _i in 0..100 {\\n\\n test_pipe_impl();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/pipe.rs\",\n \"rank\": 21,\n \"score\": 66354.41608448338\n },\n {\n \"content\": \"#[derive(Clone)]\\n\\nstruct Pipe {\\n\\n ready: Arc<Semaphore>,\\n\\n free: Arc<Semaphore>,\\n\\n buffer: Arc<Mutex<VecDeque<u8>>>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/pipe.rs\",\n \"rank\": 22,\n \"score\": 65929.35957167023\n },\n {\n \"content\": \"fn pipe(capacity: usize) -> (Writer, Reader) {\\n\\n let ready = Arc::new(Semaphore::new(0));\\n\\n let free = Arc::new(Semaphore::new(capacity));\\n\\n let buffer = Arc::new(Mutex::new(VecDeque::with_capacity(capacity)));\\n\\n let pipe = Pipe { ready, free, buffer };\\n\\n let reader = Arc::new(ReaderInner(pipe.clone()));\\n\\n let writer = Arc::new(WriterInner(pipe.clone()));\\n\\n (Writer { inner: writer }, Reader { inner: reader })\\n\\n}\\n\\n\\n\\nimpl Reader {\\n\\n async fn read_exact(&self, buf: &mut [u8]) -> usize {\\n\\n assert!(buf.len() < self.inner.0.buffer.lock().await.capacity());\\n\\n let total = if let Ok(guard) = self.inner.0.ready.acquire(buf.len()).await {\\n\\n guard.forget();\\n\\n let mut lock = self.inner.0.buffer.lock().await;\\n\\n assert!(buf.len() <= lock.len());\\n\\n for b in buf.iter_mut() {\\n\\n *b = lock.pop_front().unwrap();\\n\\n }\\n\",\n \"file_path\": \"src/tests/pipe.rs\",\n \"rank\": 23,\n \"score\": 65460.02394655033\n },\n {\n \"content\": \"fn test_pipe_impl() {\\n\\n let threads = 10;\\n\\n let iters = 1000;\\n\\n let (w, r) = pipe(20);\\n\\n for _ in 0..threads {\\n\\n let w = w.clone();\\n\\n thread::spawn(move || block_on(async {\\n\\n for _ in 0..iters {\\n\\n let n = thread_rng().gen_range(0, 1000);\\n\\n w.write_all(format!(\\\"{}\\\\n\\\", n).as_ref()).await.unwrap();\\n\\n }\\n\\n }));\\n\\n }\\n\\n mem::drop(w);\\n\\n block_on(async {\\n\\n let mut result = Vec::new();\\n\\n loop {\\n\\n let mut buf = vec![0u8; thread_rng().gen_range(0, 10)];\\n\\n let n = r.read_exact(&mut buf).await;\\n\\n result.extend_from_slice(&buf[0..n]);\\n\",\n \"file_path\": \"src/tests/pipe.rs\",\n \"rank\": 26,\n \"score\": 64075.3884601653\n },\n {\n \"content\": \"fn run_impl(bencher: &mut Bencher) {\\n\\n let pool = ThreadPool::builder().pool_size(PARALLELISM).create().unwrap();\\n\\n bencher.iter(|| {\\n\\n let items = (0..ITEMS)\\n\\n .map(|i| Arc::new(Semaphore::new(if i == 0 { TOKENS } else { 0 })))\\n\\n .collect::<Vec<_>>();\\n\\n block_on(join_all((0..ITEMS).map(|index| {\\n\\n let items = items.clone();\\n\\n pool.spawn_with_handle(async move {\\n\\n let mut rng = XorShiftRng::from_entropy();\\n\\n for _ in 0..ITERS {\\n\\n let amount = rng.gen_range(1usize, 1 << MAX_ACQUIRE + 1).trailing_zeros() as usize;\\n\\n match items[index].acquire(amount).await {\\n\\n Ok(guard) => guard.forget(),\\n\\n Err(PoisonError) => break,\\n\\n };\\n\\n items[(index + 1) % ITEMS].release(amount);\\n\\n }\\n\\n items[(index + 1) % ITEMS].poison();\\n\\n }).unwrap()\\n\\n })));\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/ring.rs\",\n \"rank\": 27,\n \"score\": 62483.13681927817\n },\n {\n \"content\": \"#[bench]\\n\\nfn run_weighted(bencher: &mut Bencher) {\\n\\n run_impl(bencher);\\n\\n}\",\n \"file_path\": \"benches/ring.rs\",\n \"rank\": 28,\n \"score\": 62483.13681927817\n },\n {\n \"content\": \"#[test]\\n\\nfn test_readme_deps() {\\n\\n version_sync::assert_markdown_deps_updated!(\\\"README.md\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 31,\n \"score\": 58523.9709353066\n },\n {\n \"content\": \"#[test]\\n\\nfn test_html_root_url() {\\n\\n version_sync::assert_html_root_url_updated!(\\\"src/lib.rs\\\");\\n\\n}\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 32,\n \"score\": 56193.70940578151\n },\n {\n \"content\": \"trait AtomicCounter: Default + 'static + Send + Sync {\\n\\n fn do_loop<'a>(items: Vec<Arc<Self>>) -> BoxFuture<'static, ()>;\\n\\n}\\n\\n\\n\\nimpl AtomicCounter for AtomicUsize {\\n\\n fn do_loop<'a>(items: Vec<Arc<Self>>) -> BoxFuture<'static, ()> {\\n\\n Box::pin(async move {\\n\\n for x in get_loop(&items) {\\n\\n x.fetch_add(1, SeqCst);\\n\\n }\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\\nimpl AtomicCounter for SyncMutex<usize> {\\n\\n fn do_loop<'a>(items: Vec<Arc<Self>>) -> BoxFuture<'static, ()> {\\n\\n Box::pin(async move {\\n\\n for x in get_loop(&items) {\\n\\n *x.lock().unwrap() += 1;\\n\\n }\\n\",\n \"file_path\": \"benches/mutex.rs\",\n \"rank\": 33,\n \"score\": 50416.710819529704\n },\n {\n \"content\": \"fn get_loop<'a, T>(v: &'a Vec<Arc<T>>) -> impl Iterator<Item=&'a T> {\\n\\n (0..ITERS).map(move |i| &*v[i % ITEMS])\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/mutex.rs\",\n \"rank\": 34,\n \"score\": 36709.80773635972\n },\n {\n \"content\": \"#![feature(test)]\\n\\nextern crate test;\\n\\n\\n\\nuse test::Bencher;\\n\\nuse std::sync::{Mutex as SyncMutex, Arc};\\n\\nuse async_std::sync::Mutex as AsyncStdMutex;\\n\\nuse futures_locks::Mutex as FuturesMutex;\\n\\nuse tokio::sync::Mutex as TokioMutex;\\n\\nuse futures::executor::block_on;\\n\\nuse async_std::task::spawn;\\n\\nuse futures_test::std_reexport::sync::atomic::AtomicUsize;\\n\\nuse futures_test::std_reexport::sync::atomic::Ordering::SeqCst;\\n\\nuse async_weighted_semaphore::Semaphore;\\n\\nuse std::cell::UnsafeCell;\\n\\nuse std::thread;\\n\\nuse futures::future::BoxFuture;\\n\\nuse futures::executor::ThreadPool;\\n\\nuse futures::task::SpawnExt;\\n\\nuse futures::future::join_all;\\n\\n\\n\\nconst PARALLELISM: usize = 8;\\n\\nconst CONCURRENCY: usize = 100;\\n\\nconst ITEMS: usize = 2;\\n\\nconst ITERS: usize = 1000;\\n\\n\\n\",\n \"file_path\": \"benches/mutex.rs\",\n \"rank\": 35,\n \"score\": 27142.420816567716\n },\n {\n \"content\": \" })\\n\\n }\\n\\n}\\n\\n\\n\\nimpl AtomicCounter for AsyncStdMutex<usize> {\\n\\n fn do_loop<'a>(items: Vec<Arc<Self>>) -> BoxFuture<'static, ()> {\\n\\n Box::pin(async move {\\n\\n for x in get_loop(&items) {\\n\\n *x.lock().await += 1;\\n\\n }\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\\nimpl AtomicCounter for TokioMutex<usize> {\\n\\n fn do_loop<'a>(items: Vec<Arc<Self>>) -> BoxFuture<'static, ()> {\\n\\n Box::pin(async move {\\n\\n for x in get_loop(&items) {\\n\\n *x.lock().await += 1;\\n\\n }\\n\",\n \"file_path\": \"benches/mutex.rs\",\n \"rank\": 36,\n \"score\": 27134.1614175233\n },\n {\n \"content\": \" })\\n\\n }\\n\\n}\\n\\n\\n\\nimpl AtomicCounter for FuturesMutex<usize> {\\n\\n fn do_loop<'a>(items: Vec<Arc<Self>>) -> BoxFuture<'static, ()> {\\n\\n Box::pin(async move {\\n\\n for x in get_loop(&items) {\\n\\n *x.lock().await += 1;\\n\\n }\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/mutex.rs\",\n \"rank\": 37,\n \"score\": 27133.9348086802\n },\n {\n \"content\": \"unsafe impl Send for Semaphore {}\\n\\n\\n\\nimpl UnwindSafe for Semaphore {}\\n\\n\\n\\nimpl RefUnwindSafe for Semaphore {}\\n\\n\\n\\nimpl Debug for Semaphore {\\n\\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\\n\\n match self.acquire.load(Relaxed) {\\n\\n Available(available) => write!(f, \\\"Semaphore::Ready({:?})\\\", available)?,\\n\\n Queued(_) => match self.release.load(Relaxed) {\\n\\n Unlocked(available) => write!(f, \\\"Semaphore::Blocked({:?})\\\", available)?,\\n\\n _ => write!(f, \\\"Semaphore::Unknown\\\")?,\\n\\n },\\n\\n };\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"src/semaphore.rs\",\n \"rank\": 38,\n \"score\": 27054.09376314834\n },\n {\n \"content\": \"\\n\\n /// Wait until there are no older pending calls to [acquire](#method.acquire) and at least `amount` permits available.\\n\\n /// Then consume the requested permits and return a [`SemaphoreGuard`].\\n\\n /// # Errors\\n\\n /// Returns [`PoisonError`] is the semaphore is poisoned.\\n\\n /// # Examples\\n\\n /// ```\\n\\n /// # use futures::executor::block_on;\\n\\n /// # use std::future::Future;\\n\\n /// use async_weighted_semaphore::Semaphore;\\n\\n /// async fn limit_concurrency(semaphore: &Semaphore, future: impl Future<Output=()>) {\\n\\n /// let guard = semaphore.acquire(1).await.unwrap();\\n\\n /// future.await\\n\\n /// }\\n\\n /// ```\\n\\n pub fn acquire(&self, amount: usize) -> AcquireFuture {\\n\\n AcquireFuture(UnsafeCell::new(Waiter {\\n\\n semaphore: self,\\n\\n step: UnsafeCell::new(AcquireStep::Entering),\\n\\n waker: unsafe { AtomicWaker::new() },\\n\",\n \"file_path\": \"src/semaphore.rs\",\n \"rank\": 39,\n \"score\": 27053.389786818774\n },\n {\n \"content\": \" /// }\\n\\n /// ```\\n\\n pub fn acquire_arc(self: &Arc<Self>, amount: usize) -> AcquireFutureArc {\\n\\n AcquireFutureArc {\\n\\n arc: self.clone(),\\n\\n inner: unsafe { mem::transmute::<AcquireFuture, AcquireFuture>(self.acquire(amount)) },\\n\\n }\\n\\n }\\n\\n\\n\\n\\n\\n /// Like [try_acquire](#method.try_acquire), but takes an [`Arc`] `<Semaphore>`, and returns a guard that is `'static`,\\n\\n /// [`Send`] and [`Sync`].\\n\\n /// # Examples\\n\\n /// ```\\n\\n /// # use async_weighted_semaphore::{Semaphore, TryAcquireError, SemaphoreGuardArc};\\n\\n /// # use std::sync::Arc;\\n\\n /// use async_channel::{Sender, TrySendError};\\n\\n /// // Limit size of a producer-consumer queue\\n\\n /// async fn try_send<T>(semaphore: &Arc<Semaphore>,\\n\\n /// sender: &Sender<(SemaphoreGuardArc, T)>,\\n\",\n \"file_path\": \"src/semaphore.rs\",\n \"rank\": 40,\n \"score\": 27052.378616180587\n },\n {\n \"content\": \"use std::{fmt, mem};\\n\\nuse std::panic::{RefUnwindSafe, UnwindSafe};\\n\\nuse std::sync::atomic::Ordering::{Relaxed, Acquire};\\n\\nuse crate::state::ReleaseState::Unlocked;\\n\\nuse crate::state::AcquireState::{Available, Queued};\\n\\nuse std::fmt::{Debug, Formatter};\\n\\nuse crate::state::{AcquireStep, Waiter, Permits, AcquireState, ReleaseState};\\n\\nuse std::cell::UnsafeCell;\\n\\nuse crate::{AcquireFuture, TryAcquireError, SemaphoreGuard, AcquireFutureArc, SemaphoreGuardArc};\\n\\nuse std::marker::{PhantomPinned, PhantomData};\\n\\nuse crate::waker::AtomicWaker;\\n\\nuse std::ptr::null;\\n\\nuse std::sync::Arc;\\n\\nuse crate::atomic::Atomic;\\n\\nuse std::mem::size_of;\\n\\nuse crate::release::ReleaseAction;\\n\\n#[allow(unused_imports)] // used by docs\\n\\nuse crate::errors::PoisonError;\\n\\n\\n\\n/// An async weighted semaphore. See [crate documentation](index.html) for usage.\\n\",\n \"file_path\": \"src/semaphore.rs\",\n \"rank\": 41,\n \"score\": 27050.606479471728\n },\n {\n \"content\": \" /// }\\n\\n /// }\\n\\n /// ```\\n\\n pub fn try_acquire(&self, amount: usize) -> Result<SemaphoreGuard, TryAcquireError> {\\n\\n let mut current = self.acquire.load(Acquire);\\n\\n loop {\\n\\n match current {\\n\\n Queued(_) => return Err(TryAcquireError::WouldBlock),\\n\\n Available(available) => {\\n\\n let available = available.into_usize().ok_or(TryAcquireError::Poisoned)?;\\n\\n if available < amount {\\n\\n return Err(TryAcquireError::WouldBlock);\\n\\n }\\n\\n if self.acquire.cmpxchg_weak_acqrel(&mut current, Available(Permits::new(available - amount))) {\\n\\n return Ok(SemaphoreGuard::new(self, amount));\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/semaphore.rs\",\n \"rank\": 42,\n \"score\": 27049.83569003354\n },\n {\n \"content\": \" /// }\\n\\n /// }\\n\\n /// ```\\n\\n pub const MAX_AVAILABLE: usize = (1 << (size_of::<usize>() * 8 - 3)) - 1;\\n\\n\\n\\n /// Create a new semaphore with an initial number of permits.\\n\\n /// # Examples\\n\\n /// ```\\n\\n /// use async_weighted_semaphore::Semaphore;\\n\\n /// let semaphore = Semaphore::new(1024);\\n\\n /// ```\\n\\n pub fn new(initial: usize) -> Self {\\n\\n Semaphore {\\n\\n acquire: Atomic::new(Available(Permits::new(initial))),\\n\\n release: Atomic::new(Unlocked(Permits::new(0))),\\n\\n front: UnsafeCell::new(null()),\\n\\n middle: UnsafeCell::new(null()),\\n\\n next_cancel: Atomic::new(null()),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/semaphore.rs\",\n \"rank\": 43,\n \"score\": 27048.795372347042\n },\n {\n \"content\": \" amount,\\n\\n next: UnsafeCell::new(null()),\\n\\n prev: UnsafeCell::new(null()),\\n\\n next_cancel: UnsafeCell::new(null()),\\n\\n }), PhantomData, PhantomPinned)\\n\\n }\\n\\n\\n\\n /// Like [acquire](#method.acquire), but fails if the call would block.\\n\\n /// # Errors\\n\\n /// * Returns [`TryAcquireError::Poisoned`] is the semaphore is poisoned.\\n\\n /// * Returns [`TryAcquireError::WouldBlock`] if a call to `acquire` would have blocked. This can\\n\\n /// occur if there are insufficient available permits or if there is another pending call to acquire.\\n\\n /// # Examples\\n\\n /// ```\\n\\n /// # use futures::executor::block_on;\\n\\n /// # use std::future::Future;\\n\\n /// use async_weighted_semaphore::Semaphore;\\n\\n /// async fn run_if_safe(semaphore: &Semaphore, future: impl Future<Output=()>) {\\n\\n /// if semaphore.try_acquire(1).is_ok() {\\n\\n /// future.await\\n\",\n \"file_path\": \"src/semaphore.rs\",\n \"rank\": 44,\n \"score\": 27048.326276114076\n },\n {\n \"content\": \" ReleaseAction { sem: self, releasable: Permits::new(amount) }.release();\\n\\n }\\n\\n }\\n\\n\\n\\n /// Poison the semaphore, causing all pending and future calls to `acquire` to fail immediately.\\n\\n /// This can be used to unblock pending acquires when the guarded operation would fail anyway.\\n\\n /// # Examples\\n\\n /// ```\\n\\n /// # use async_weighted_semaphore::{Semaphore, TryAcquireError};\\n\\n /// # use std::sync::Arc;\\n\\n /// # use async_std::sync::Mutex;\\n\\n /// use async_channel::{Receiver, RecvError};\\n\\n /// async fn consume(semaphore: &Semaphore, receiver: Receiver<usize>){\\n\\n /// while let Ok(x) = receiver.recv().await {\\n\\n /// println!(\\\"{:?}\\\", x);\\n\\n /// semaphore.release(1);\\n\\n /// }\\n\\n /// // There will be no more calls to recv, so unblock all senders.\\n\\n /// semaphore.poison();\\n\\n /// }\\n\\n /// ```\\n\\n pub fn poison(&self) {\\n\\n unsafe {\\n\\n ReleaseAction { sem: self, releasable: Permits::poison() }.release();\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/semaphore.rs\",\n \"rank\": 45,\n \"score\": 27047.361032794728\n },\n {\n \"content\": \"\\n\\n /// Return `amount` permits to the semaphore. This will eventually wake any calls to [acquire](#method.acquire)\\n\\n /// that can succeed with the additional permits. Calling `release` often makes sense after calling\\n\\n /// [`SemaphoreGuard::forget`] or when using the semaphore to signal the number of elements that\\n\\n /// are available for processing.\\n\\n /// # Examples\\n\\n /// ```\\n\\n /// # use async_weighted_semaphore::{Semaphore, TryAcquireError};\\n\\n /// use async_channel::{Receiver, RecvError};\\n\\n /// // Limit size of a producer-consumer queue\\n\\n /// async fn recv<T>(semaphore: &Semaphore, recv: &Receiver<T>) -> Result<T, RecvError>{\\n\\n /// let result = recv.recv().await?;\\n\\n /// // Note that this only guards elements in the queue, not those being processed after the\\n\\n /// // queue.\\n\\n /// semaphore.release(1);\\n\\n /// Ok(result)\\n\\n /// }\\n\\n /// ```\\n\\n pub fn release(&self, amount: usize) {\\n\\n unsafe {\\n\",\n \"file_path\": \"src/semaphore.rs\",\n \"rank\": 46,\n \"score\": 27046.25271239278\n },\n {\n \"content\": \"impl Semaphore {\\n\\n /// The maximum number of permits that can be made available. This is slightly smaller than\\n\\n /// [`usize::MAX`]. If the number of available permits exceeds this number, it may poison the\\n\\n /// semaphore.\\n\\n /// # Examples\\n\\n /// ```\\n\\n /// # use async_weighted_semaphore::{Semaphore, SemaphoreGuard};\\n\\n /// struct ReadWriteLock(Semaphore);\\n\\n /// impl ReadWriteLock {\\n\\n /// fn new() -> Self {\\n\\n /// ReadWriteLock(Semaphore::new(Semaphore::MAX_AVAILABLE))\\n\\n /// }\\n\\n /// // Acquire one permit, allowing up to MAX_AVAILABLE concurrent readers.\\n\\n /// async fn read(&self) -> SemaphoreGuard<'_> {\\n\\n /// self.0.acquire(1).await.unwrap()\\n\\n /// }\\n\\n /// // The writer acquires all the permits, prevent any concurrent writers or readers. The\\n\\n /// // first-in-first-out priority policy prevents writer starvation.\\n\\n /// async fn write(&self) -> SemaphoreGuard<'_> {\\n\\n /// self.0.acquire(Semaphore::MAX_AVAILABLE).await.unwrap()\\n\",\n \"file_path\": \"src/semaphore.rs\",\n \"rank\": 47,\n \"score\": 27044.79374714544\n },\n {\n \"content\": \" /// message: T\\n\\n /// ) -> Result<(), TrySendError<T>>{\\n\\n /// match semaphore.try_acquire_arc(1) {\\n\\n /// Err(TryAcquireError::WouldBlock) => Err(TrySendError::Full(message)),\\n\\n /// // A semaphore can be poisoned to prevent deadlock when a channel closes.\\n\\n /// Err(TryAcquireError::Poisoned) => Err(TrySendError::Closed(message)),\\n\\n /// Ok(guard) => match sender.try_send((guard, message)) {\\n\\n /// Err(TrySendError::Closed((guard, message))) => Err(TrySendError::Closed(message)),\\n\\n /// Err(TrySendError::Full((guard, message))) => Err(TrySendError::Full(message)),\\n\\n /// Ok(()) => Ok(())\\n\\n /// }\\n\\n /// }\\n\\n /// }\\n\\n /// ```\\n\\n pub fn try_acquire_arc(self: &Arc<Self>, amount: usize) -> Result<SemaphoreGuardArc, TryAcquireError> {\\n\\n let guard = self.try_acquire(amount)?;\\n\\n let result = SemaphoreGuardArc::new(self.clone(), amount);\\n\\n guard.forget();\\n\\n Ok(result)\\n\\n }\\n\",\n \"file_path\": \"src/semaphore.rs\",\n \"rank\": 48,\n \"score\": 27043.222183914215\n },\n {\n \"content\": \"\\n\\n /// Like [acquire](#method.acquire), but takes an [`Arc`] `<Semaphore>` and returns a guard that is `'static`, [`Send`] and [`Sync`].\\n\\n /// # Examples\\n\\n /// ```\\n\\n /// # use async_weighted_semaphore::{Semaphore, PoisonError, SemaphoreGuardArc};\\n\\n /// # use std::sync::Arc;\\n\\n /// use async_channel::{Sender, SendError};\\n\\n /// // Limit size of a producer-consumer queue\\n\\n /// async fn send<T>(semaphore: &Arc<Semaphore>,\\n\\n /// sender: &Sender<(SemaphoreGuardArc, T)>,\\n\\n /// message: T\\n\\n /// ) -> Result<(), SendError<T>>{\\n\\n /// match semaphore.acquire_arc(1).await {\\n\\n /// // A semaphore can be poisoned to prevent deadlock when a channel closes.\\n\\n /// Err(PoisonError) => Err(SendError(message)),\\n\\n /// Ok(guard) => match sender.send((guard, message)).await{\\n\\n /// Err(SendError((guard, message))) => Err(SendError(message)),\\n\\n /// Ok(()) => Ok(())\\n\\n /// }\\n\\n /// }\\n\",\n \"file_path\": \"src/semaphore.rs\",\n \"rank\": 49,\n \"score\": 27043.21194900267\n },\n {\n \"content\": \"// This implementation encodes state (the available counter, acquire queue, and cancel queue) into\\n\\n// multiple atomic variables and linked lists. Concurrent acquires (and concurrent cancels) synchronize\\n\\n// by pushing onto a stack with an atomic swap. Releases synchronize with other operations by attempting\\n\\n// to acquire a lock. If the lock is successfully acquired, the release can proceed. Otherwise\\n\\n// the lock is marked dirty to indicate that there is additional work for the lock owner to do.\\n\\npub struct Semaphore {\\n\\n // The number of available permits or the back of the queue (without next edges).\\n\\n pub(crate) acquire: Atomic<AcquireState>,\\n\\n // A number of releasable permits, and the state of the current release lock.\\n\\n pub(crate) release: Atomic<ReleaseState>,\\n\\n // The front of the queue (with next edges).\\n\\n pub(crate) front: UnsafeCell<*const Waiter>,\\n\\n // The last node swapped from AcquireState (with next edges).\\n\\n pub(crate) middle: UnsafeCell<*const Waiter>,\\n\\n // A stack of nodes that are cancelling.\\n\\n pub(crate) next_cancel: Atomic<*const Waiter>,\\n\\n}\\n\\n\\n\\nunsafe impl Sync for Semaphore {}\\n\\n\\n\",\n \"file_path\": \"src/semaphore.rs\",\n \"rank\": 50,\n \"score\": 27039.84117364435\n },\n {\n \"content\": \" f.debug_struct(\\\"AW\\\")\\n\\n .field(\\\"s\\\", &self.state.load(SeqCst))\\n\\n .field(\\\"d\\\", &self.data.load(SeqCst))\\n\\n .field(\\\"t\\\", &self.vtable.load(SeqCst))\\n\\n .field(\\\"t\\\", unsafe { &*self.thread.get() })\\n\\n .finish()\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use crate::waker::{WakerResult, AtomicWaker};\\n\\n use std::future::Future;\\n\\n use futures::task::{Context, Poll};\\n\\n use std::pin::Pin;\\n\\n\\n\\n use futures::pin_mut;\\n\\n use futures::poll;\\n\\n\\n\\n\\n\",\n \"file_path\": \"src/waker.rs\",\n \"rank\": 51,\n \"score\": 26835.47527746393\n },\n {\n \"content\": \" use futures::executor::block_on;\\n\\n use std::thread;\\n\\n use futures_test::std_reexport::sync::mpsc::sync_channel;\\n\\n\\n\\n struct Tester {\\n\\n waiter: AtomicWaker,\\n\\n }\\n\\n\\n\\n unsafe impl Send for Tester {}\\n\\n\\n\\n unsafe impl Sync for Tester {}\\n\\n\\n\\n impl Unpin for Tester {}\\n\\n\\n\\n impl Future for Tester {\\n\\n type Output = bool;\\n\\n fn poll(self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<bool> {\\n\\n unsafe {\\n\\n self.waiter.poll(cx)\\n\\n }\\n\",\n \"file_path\": \"src/waker.rs\",\n \"rank\": 52,\n \"score\": 26833.636299903887\n },\n {\n \"content\": \" unsafe {\\n\\n let tester = Tester { waiter: AtomicWaker::new() };\\n\\n pin_mut!(tester);\\n\\n assert_eq!(Poll::Pending, poll!(&mut tester));\\n\\n\\n\\n match tester.waiter.start_cancel() {\\n\\n WakerResult::Cancelling => {\\n\\n AtomicWaker::accept_cancel(&tester.as_mut().waiter);\\n\\n tester.waiter.wait_cancel();\\n\\n }\\n\\n WakerResult::Finished { .. } => panic!(),\\n\\n }\\n\\n }\\n\\n });\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_finish_cancel() {\\n\\n block_on(async {\\n\\n unsafe {\\n\",\n \"file_path\": \"src/waker.rs\",\n \"rank\": 53,\n \"score\": 26832.426558412128\n },\n {\n \"content\": \" let tester = Tester { waiter: AtomicWaker::new() };\\n\\n pin_mut!(tester);\\n\\n assert_eq!(Poll::Pending, poll!(&mut tester));\\n\\n assert_eq!(WakerResult::Finished { poisoned: true },\\n\\n AtomicWaker::finish(&tester.waiter, true));\\n\\n match tester.waiter.start_cancel() {\\n\\n WakerResult::Cancelling => panic!(),\\n\\n WakerResult::Finished { poisoned } => { assert!(poisoned) }\\n\\n }\\n\\n }\\n\\n });\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_cancel_finish() {\\n\\n block_on(async {\\n\\n unsafe {\\n\\n let tester = Tester { waiter: AtomicWaker::new() };\\n\\n pin_mut!(tester);\\n\\n assert_eq!(Poll::Pending, poll!(&mut tester));\\n\",\n \"file_path\": \"src/waker.rs\",\n \"rank\": 54,\n \"score\": 26831.05430984205\n },\n {\n \"content\": \"use std::cell::UnsafeCell;\\n\\nuse std::task::{Waker, Poll, Context, RawWakerVTable};\\n\\n\\n\\nuse std::sync::atomic::Ordering::{Acquire, SeqCst, Relaxed};\\n\\nuse crate::waker::State::{Cancelled, Cancelling};\\n\\nuse crate::atomic::{Atomic, Packable};\\n\\nuse std::{mem, thread, fmt};\\n\\n\\n\\nuse std::thread::{Thread, panicking};\\n\\nuse std::fmt::{Debug, Formatter};\\n\\nuse std::ptr::null;\\n\\nuse crate::waker::State::{Pending, Storing, Finished, Loading};\\n\\n\\n\\n#[derive(Copy, Clone, Eq, PartialOrd, PartialEq, Ord, Debug)]\\n\",\n \"file_path\": \"src/waker.rs\",\n \"rank\": 55,\n \"score\": 26830.383755790626\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_finish() {\\n\\n block_on(async {\\n\\n unsafe {\\n\\n let tester = Tester { waiter: AtomicWaker::new() };\\n\\n pin_mut!(tester);\\n\\n assert_eq!(Poll::Pending, poll!(&mut tester));\\n\\n assert_eq!(WakerResult::Finished { poisoned: false },\\n\\n AtomicWaker::finish(&tester.waiter as *const AtomicWaker, false));\\n\\n assert_eq!(Poll::Ready(false), poll!(&mut tester));\\n\\n }\\n\\n });\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_cancel() {\\n\\n block_on(async {\\n\",\n \"file_path\": \"src/waker.rs\",\n \"rank\": 56,\n \"score\": 26829.080641061864\n },\n {\n \"content\": \" // Store a new waker and return the poisoned bit if finished.\\n\\n #[must_use]\\n\\n pub unsafe fn poll(&self, context: &mut Context) -> Poll<bool> {\\n\\n let mut waker = Some(context.waker().clone());\\n\\n let mut current = self.state.load(Acquire);\\n\\n loop {\\n\\n match current {\\n\\n Pending | Loading => {\\n\\n if self.state.cmpxchg_weak_acqrel(&mut current, Storing) {\\n\\n current = Storing;\\n\\n break;\\n\\n }\\n\\n }\\n\\n Finished { poisoned } => return Poll::Ready(poisoned),\\n\\n _ => unreachable!()\\n\\n };\\n\\n }\\n\\n let (data, vtable) =\\n\\n mem::transmute_copy::<_, (*const (), *const RawWakerVTable)>(waker.as_ref().unwrap());\\n\\n let old_data = self.data.load(Relaxed);\\n\",\n \"file_path\": \"src/waker.rs\",\n \"rank\": 57,\n \"score\": 26828.869261061907\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl Drop for AtomicWaker {\\n\\n fn drop(&mut self) {\\n\\n match self.state.load(Relaxed) {\\n\\n Pending | Cancelled => unsafe {\\n\\n let data = self.data.load(Relaxed);\\n\\n let vtable = self.vtable.load(Relaxed);\\n\\n if vtable != null() {\\n\\n mem::drop(mem::transmute::<_, Waker>((data, vtable)));\\n\\n }\\n\\n }\\n\\n Finished { .. } => {}\\n\\n _ => if !panicking() { unreachable!() }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Debug for AtomicWaker {\\n\\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\\n\",\n \"file_path\": \"src/waker.rs\",\n \"rank\": 58,\n \"score\": 26828.221677188827\n },\n {\n \"content\": \" match tester.waiter.start_cancel() {\\n\\n WakerResult::Cancelling => {\\n\\n AtomicWaker::accept_cancel(&tester.waiter);\\n\\n tester.waiter.wait_cancel();\\n\\n }\\n\\n WakerResult::Finished { .. } => panic!(),\\n\\n }\\n\\n }\\n\\n });\\n\\n }\\n\\n\\n\\n fn test_race(cancel: bool) {\\n\\n unsafe {\\n\\n let iters = 10000;\\n\\n let mut testers = (0..iters).map(|_| Tester { waiter: AtomicWaker::new() }).collect::<Vec<_>>();\\n\\n let (send, recv) = sync_channel(0);\\n\\n let h1 = thread::spawn(move || block_on(async {\\n\\n let mut results = vec![];\\n\\n for i in 0..iters {\\n\\n let mut tester = &mut testers[i];\\n\",\n \"file_path\": \"src/waker.rs\",\n \"rank\": 59,\n \"score\": 26828.20354795446\n },\n {\n \"content\": \"impl Packable for State {\\n\\n unsafe fn encode(val: Self) -> usize {\\n\\n mem::transmute::<_, u8>(val) as usize\\n\\n }\\n\\n\\n\\n unsafe fn decode(val: usize) -> Self {\\n\\n mem::transmute(val as u8)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl AtomicWaker {\\n\\n pub unsafe fn new() -> Self {\\n\\n AtomicWaker {\\n\\n state: Atomic::new(Pending),\\n\\n vtable: Atomic::new(null()),\\n\\n data: Atomic::new(null()),\\n\\n thread: UnsafeCell::new(None),\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/waker.rs\",\n \"rank\": 60,\n \"score\": 26827.60804405663\n },\n {\n \"content\": \" }\\n\\n }\\n\\n Finished { poisoned } => {\\n\\n return WakerResult::Finished { poisoned };\\n\\n }\\n\\n _ => unreachable!(\\\"{:?}\\\", current)\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n // Wait for the producer thread to accept cancellation\\n\\n pub unsafe fn wait_cancel(&self) {\\n\\n loop {\\n\\n match self.state.load(Acquire) {\\n\\n Cancelling => thread::park(),\\n\\n Cancelled => break,\\n\\n _ => panic!(),\\n\\n }\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/waker.rs\",\n \"rank\": 61,\n \"score\": 26827.27697424529\n },\n {\n \"content\": \" data: Atomic<*const ()>,\\n\\n state: Atomic<State>,\\n\\n // The thread waiting for acceptance of cancellation\\n\\n thread: UnsafeCell<Option<Thread>>,\\n\\n}\\n\\n\\n\\n// The result of an attempt to finish or cancel.\\n\\n#[derive(Copy, Clone, Eq, PartialOrd, PartialEq, Ord, Debug)]\\n\\npub enum WakerResult {\\n\\n // The future has been cancelled. The producer should accept_cancel.\\n\\n // The future thread should wait_cancel.\\n\\n Cancelling,\\n\\n // The future completed.\\n\\n Finished { poisoned: bool },\\n\\n}\\n\\n\\n\\nunsafe impl Send for AtomicWaker {}\\n\\n\\n\\nunsafe impl Sync for AtomicWaker {}\\n\\n\\n\",\n \"file_path\": \"src/waker.rs\",\n \"rank\": 62,\n \"score\": 26827.234112367303\n },\n {\n \"content\": \" assert_eq!(Poll::Pending, poll!(&mut tester));\\n\\n send.send(&*(&tester.waiter as *const AtomicWaker)).unwrap();\\n\\n let result = if cancel {\\n\\n match tester.waiter.start_cancel() {\\n\\n WakerResult::Cancelling => {\\n\\n tester.waiter.wait_cancel();\\n\\n None\\n\\n }\\n\\n WakerResult::Finished { poisoned } => Some(poisoned),\\n\\n }\\n\\n } else {\\n\\n Some(tester.await)\\n\\n };\\n\\n results.push(result);\\n\\n }\\n\\n results\\n\\n }));\\n\\n let h2 = thread::spawn(move || block_on(async {\\n\\n let mut results = vec![];\\n\\n for i in 0..iters {\\n\",\n \"file_path\": \"src/waker.rs\",\n \"rank\": 63,\n \"score\": 26827.232267246927\n },\n {\n \"content\": \" }\\n\\n\\n\\n // Signal that the future is finished.\\n\\n pub unsafe fn finish(this: *const Self, poisoned: bool) -> WakerResult {\\n\\n let mut current = (*this).state.load(Acquire);\\n\\n loop {\\n\\n match current {\\n\\n Pending => {\\n\\n if (*this).state.cmpxchg_weak_acqrel(&mut current, Loading) {\\n\\n current = Loading;\\n\\n }\\n\\n }\\n\\n Loading => {\\n\\n let data = (*this).data.load(Relaxed);\\n\\n let vtable = (*this).vtable.load(Relaxed);\\n\\n if (*this).state.cmpxchg_weak_acqrel(&mut current, Finished { poisoned }) {\\n\\n let waker = mem::transmute::<_, Waker>((data, vtable));\\n\\n waker.wake();\\n\\n return WakerResult::Finished { poisoned };\\n\\n }\\n\",\n \"file_path\": \"src/waker.rs\",\n \"rank\": 64,\n \"score\": 26827.064709723905\n },\n {\n \"content\": \" }\\n\\n Storing => {\\n\\n if (*this).state.cmpxchg_weak_acqrel(&mut current, Finished { poisoned }) {\\n\\n return WakerResult::Finished { poisoned };\\n\\n }\\n\\n }\\n\\n Cancelling => return WakerResult::Cancelling,\\n\\n _ => unreachable!()\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n pub unsafe fn start_cancel(&self) -> WakerResult {\\n\\n *self.thread.get() = Some(thread::current());\\n\\n let mut current = self.state.load(Acquire);\\n\\n loop {\\n\\n match current {\\n\\n Pending | Loading => {\\n\\n if self.state.cmpxchg_weak_acqrel(&mut current, Cancelling) {\\n\\n return WakerResult::Cancelling;\\n\",\n \"file_path\": \"src/waker.rs\",\n \"rank\": 65,\n \"score\": 26827.025676561854\n },\n {\n \"content\": \"\\n\\n // Accept cancellation on the producer thread, notifying the future thread.\\n\\n pub unsafe fn accept_cancel(this: *const Self) {\\n\\n let mut current = (*this).state.load(Acquire);\\n\\n loop {\\n\\n match current {\\n\\n Cancelling => {\\n\\n let thread = (*(*this).thread.get()).take().unwrap();\\n\\n if (*this).state.cmpxchg_weak_acqrel(&mut current, Cancelled) {\\n\\n thread.unpark();\\n\\n break;\\n\\n } else {\\n\\n *(*this).thread.get() = Some(thread);\\n\\n continue;\\n\\n }\\n\\n }\\n\\n _ => unreachable!(\\\"{:?}\\\", current)\\n\\n }\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/waker.rs\",\n \"rank\": 66,\n \"score\": 26826.067950007717\n },\n {\n \"content\": \" let waiter = recv.recv().unwrap();\\n\\n let result =\\n\\n match AtomicWaker::finish(waiter, i % 2 == 0) {\\n\\n WakerResult::Cancelling => {\\n\\n AtomicWaker::accept_cancel(waiter);\\n\\n WakerResult::Cancelling\\n\\n }\\n\\n WakerResult::Finished { poisoned } =>\\n\\n WakerResult::Finished { poisoned }\\n\\n };\\n\\n results.push(result);\\n\\n }\\n\\n results\\n\\n }));\\n\\n let r1 = h1.join().unwrap();\\n\\n let r2 = h2.join().unwrap();\\n\\n for (send, recv) in r1.into_iter().zip(r2.into_iter()) {\\n\\n match (cancel, send, recv) {\\n\\n (_, Some(o), WakerResult::Finished { poisoned: i }) if i == o => {}\\n\\n (true, None, WakerResult::Cancelling) => {}\\n\",\n \"file_path\": \"src/waker.rs\",\n \"rank\": 67,\n \"score\": 26822.59766370551\n },\n {\n \"content\": \" let old_vtable = self.vtable.load(Relaxed);\\n\\n self.data.store(data, Relaxed);\\n\\n self.vtable.store(vtable, Relaxed);\\n\\n if old_vtable != null() {\\n\\n mem::drop(mem::transmute::<_, Waker>((old_data, old_vtable)));\\n\\n }\\n\\n loop {\\n\\n match current {\\n\\n Storing => {\\n\\n if self.state.cmpxchg_weak_acqrel(&mut current, Pending) {\\n\\n mem::forget(waker.take());\\n\\n return Poll::Pending;\\n\\n }\\n\\n }\\n\\n Finished { poisoned } => {\\n\\n return Poll::Ready(poisoned);\\n\\n }\\n\\n _ => unreachable!(\\\"{:?}\\\", current)\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/waker.rs\",\n \"rank\": 68,\n \"score\": 26822.455867146633\n },\n {\n \"content\": \" _ => panic!(\\\"Unexpected outcome {:?}\\\", (cancel, send, recv))\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_poll_race() {\\n\\n test_race(false);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_cancel_race() {\\n\\n test_race(true);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/waker.rs\",\n \"rank\": 69,\n \"score\": 26821.1812577683\n },\n {\n \"content\": \"#[derive(Copy, Clone, Eq, PartialOrd, PartialEq, Ord, Debug)]\\n\\nenum State {\\n\\n Pending,\\n\\n // A poll is in progress, storing a new waker.\\n\\n Storing,\\n\\n // A finish is in progress, loading the waker.\\n\\n Loading,\\n\\n // A finish has succeeded, and will call wake if necessary.\\n\\n Finished { poisoned: bool },\\n\\n // start_cancel has been called.\\n\\n Cancelling,\\n\\n // accept_cancel has been called.\\n\\n Cancelled,\\n\\n}\\n\\n\\n\\n// A primitive for synchronizing between two threads:\\n\\n// Future: a thread that polls the a future and may decide to cancel (drop) it.\\n\\n// Producer: one that marks the future as finished or accepts cancellation.\\n\\npub struct AtomicWaker {\\n\\n vtable: Atomic<*const RawWakerVTable>,\\n\\n // Split the waker among two atomics. These only need to be atomic to prevent data races.\\n\",\n \"file_path\": \"src/waker.rs\",\n \"rank\": 70,\n \"score\": 25085.990954612473\n },\n {\n \"content\": \"use crate::{Semaphore, PoisonError};\\n\\nuse std::sync::Arc;\\n\\nuse futures_test::std_reexport::collections::VecDeque;\\n\\nuse async_std::sync::Mutex;\\n\\nuse std::io::{BufReader, BufRead};\\n\\nuse std::{mem, thread};\\n\\nuse futures::executor::block_on;\\n\\nuse rand::{thread_rng, Rng};\\n\\n\\n\\n\\n\\n\\n\\n#[derive(Clone)]\\n\",\n \"file_path\": \"src/tests/pipe.rs\",\n \"rank\": 79,\n \"score\": 24021.312540449435\n },\n {\n \"content\": \"use crate::{Semaphore, PoisonError, SemaphoreGuard};\\n\\nuse std::cell::UnsafeCell;\\n\\nuse std::ops::{Deref, DerefMut};\\n\\nuse std::thread;\\n\\nuse std::sync::Arc;\\n\\nuse futures::executor::block_on;\\n\\n\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct RwLock<T: ?Sized> {\\n\\n semaphore: Semaphore,\\n\\n inner: UnsafeCell<T>,\\n\\n}\\n\\n\\n\\npub struct RwLockReadGuard<'a, T: ?Sized> {\\n\\n _guard: SemaphoreGuard<'a>,\\n\\n value: *const T,\\n\\n}\\n\\n\\n\\npub struct RwLockWriteGuard<'a, T: ?Sized> {\\n\",\n \"file_path\": \"src/tests/lock.rs\",\n \"rank\": 80,\n \"score\": 24020.570759163114\n },\n {\n \"content\": \" _guard: SemaphoreGuard<'a>,\\n\\n value: *mut T,\\n\\n}\\n\\n\\n\\nimpl<T: ?Sized> RwLock<T> {\\n\\n fn new(inner: T) -> Self where T: Sized {\\n\\n RwLock {\\n\\n semaphore: Semaphore::new(Semaphore::MAX_AVAILABLE),\\n\\n inner: UnsafeCell::new(inner),\\n\\n }\\n\\n }\\n\\n async fn read(&self) -> Result<RwLockReadGuard<'_, T>, PoisonError> {\\n\\n Ok(RwLockReadGuard { _guard: self.semaphore.acquire(1).await?, value: self.inner.get() })\\n\\n }\\n\\n async fn write(&self) -> Result<RwLockWriteGuard<'_, T>, PoisonError> {\\n\\n Ok(RwLockWriteGuard { _guard: self.semaphore.acquire(Semaphore::MAX_AVAILABLE).await?, value: self.inner.get() })\\n\\n }\\n\\n fn into_inner(self) -> Result<T, PoisonError> where T: Sized {\\n\\n match self.semaphore.try_acquire(0) {\\n\\n Ok(_) => Ok(self.inner.into_inner()),\\n\",\n \"file_path\": \"src/tests/lock.rs\",\n \"rank\": 82,\n \"score\": 24017.30324150991\n },\n {\n \"content\": \" fn deref(&self) -> &Self::Target {\\n\\n unsafe { &*self.value }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a, T: ?Sized> Deref for RwLockWriteGuard<'a, T> {\\n\\n type Target = T;\\n\\n\\n\\n fn deref(&self) -> &Self::Target {\\n\\n unsafe { &*self.value }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a, T: ?Sized> DerefMut for RwLockWriteGuard<'a, T> {\\n\\n fn deref_mut(&mut self) -> &mut Self::Target {\\n\\n unsafe { &mut *self.value }\\n\\n }\\n\\n}\\n\\n\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"src/tests/lock.rs\",\n \"rank\": 83,\n \"score\": 24015.216474704637\n },\n {\n \"content\": \" if n != buf.len() {\\n\\n break;\\n\\n }\\n\\n }\\n\\n let mut lines = 0;\\n\\n for line in BufReader::new(&mut result.as_slice()).lines() {\\n\\n line.unwrap().parse::<usize>().unwrap();\\n\\n lines += 1;\\n\\n }\\n\\n assert_eq!(threads * iters, lines);\\n\\n });\\n\\n}\",\n \"file_path\": \"src/tests/pipe.rs\",\n \"rank\": 86,\n \"score\": 24011.398737788382\n },\n {\n \"content\": \" mem::drop(lock);\\n\\n self.inner.0.ready.release(buf.len());\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Drop for ReaderInner {\\n\\n fn drop(&mut self) {\\n\\n self.0.free.poison();\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Drop for WriterInner {\\n\\n fn drop(&mut self) {\\n\\n self.0.ready.poison();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/pipe.rs\",\n \"rank\": 87,\n \"score\": 24010.176401552213\n },\n {\n \"content\": \" buf.len()\\n\\n } else {\\n\\n let mut lock = self.inner.0.buffer.lock().await;\\n\\n let length = lock.len().min(buf.len());\\n\\n for (i, b) in lock.drain(..length).enumerate() {\\n\\n buf[i] = b;\\n\\n }\\n\\n length\\n\\n };\\n\\n self.inner.0.free.release(total);\\n\\n total\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Writer {\\n\\n async fn write_all(&self, buf: &[u8]) -> Result<(), PoisonError> {\\n\\n assert!(buf.len() < self.inner.0.buffer.lock().await.capacity());\\n\\n self.inner.0.free.acquire(buf.len()).await?.forget();\\n\\n let mut lock = self.inner.0.buffer.lock().await;\\n\\n lock.extend(buf.iter().cloned());\\n\",\n \"file_path\": \"src/tests/pipe.rs\",\n \"rank\": 88,\n \"score\": 24009.331195305032\n },\n {\n \"content\": \" Err(_) => Err(PoisonError),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nunsafe impl<T: ?Sized + Send> Send for RwLock<T> {}\\n\\n\\n\\nunsafe impl<T: ?Sized + Sync + Send> Sync for RwLock<T> {}\\n\\n\\n\\nunsafe impl<'a, T: ?Sized + Sync> Send for RwLockReadGuard<'a, T> {}\\n\\n\\n\\nunsafe impl<'a, T: ?Sized + Sync> Sync for RwLockReadGuard<'a, T> {}\\n\\n\\n\\nunsafe impl<'a, T: ?Sized + Sync + Send> Send for RwLockWriteGuard<'a, T> {}\\n\\n\\n\\nunsafe impl<'a, T: ?Sized + Sync + Send> Sync for RwLockWriteGuard<'a, T> {}\\n\\n\\n\\nimpl<'a, T: ?Sized> Deref for RwLockReadGuard<'a, T> {\\n\\n type Target = T;\\n\\n\\n\",\n \"file_path\": \"src/tests/lock.rs\",\n \"rank\": 89,\n \"score\": 24006.71589428367\n },\n {\n \"content\": \"mod unit;\\n\\nmod pipe;\\n\\nmod lock;\\n\",\n \"file_path\": \"src/tests/mod.rs\",\n \"rank\": 90,\n \"score\": 24003.529597530236\n },\n {\n \"content\": \"# async-weighted-semaphore\\n\\n[](https://travis-ci.com/github/nathdobson/async-weighted-semaphore)\\n\\n[](\\n\\nhttps://github.com/nathdobson/async-weighted-semaphore)\\n\\n[](\\n\\nhttps://crates.io/crates/async-weighted-semaphore)\\n\\n[](\\n\\nhttps://docs.rs/async-weighted-semaphore)\\n\\n\\n\\nAn async semaphore where any number of permits can be acquired or released in one call.\\n\\n\\n\\n## License\\n\\n\\n\\nLicensed under either of\\n\\n\\n\\n * Apache License, Version 2.0\\n\\n ([LICENSE-APACHE](LICENSE-APACHE) or http://www.apache.org/licenses/LICENSE-2.0)\\n\\n * MIT license\\n\\n ([LICENSE-MIT](LICENSE-MIT) or http://opensource.org/licenses/MIT)\\n\\n\\n\\nat your option.\\n\\n\\n\\n## Contribution\\n\\n\\n\\nUnless you explicitly state otherwise, any contribution intentionally submitted\\n\\nfor inclusion in the work by you, as defined in the Apache-2.0 license, shall be\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 91,\n \"score\": 14800.016795005908\n },\n {\n \"content\": \"impl Debug for AcquireFutureArc {\\n\\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\\n\\n f.debug_tuple(\\\"AcquireFutureArc\\\").field(&unsafe { self.inner.waiter() }.amount).finish()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> AcquireFuture<'a> {\\n\\n unsafe fn waiter(&self) -> &Waiter {\\n\\n &*self.0.get()\\n\\n }\\n\\n // Try to acquire or add to queue.\\n\\n unsafe fn poll_enter(self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Result<SemaphoreGuard<'a>, PoisonError>> {\\n\\n let acquire = &(*self.waiter().semaphore).acquire;\\n\\n let mut current = acquire.load(Acquire);\\n\\n loop {\\n\\n let (available, back) = match current {\\n\\n Queued(back) => (0, back),\\n\\n Available(available) => {\\n\\n let available = match available.into_usize() {\\n\\n None => {\\n\",\n \"file_path\": \"src/acquire.rs\",\n \"rank\": 92,\n \"score\": 30.077490934641194\n },\n {\n \"content\": \"/// A [`Future`] returned by [`Semaphore::acquire_arc`] that produces a [`SemaphoreGuardArc`].\\n\\npub struct AcquireFutureArc {\\n\\n pub(crate) arc: Arc<Semaphore>,\\n\\n pub(crate) inner: AcquireFuture<'static>,\\n\\n}\\n\\n\\n\\nunsafe impl<'a> Sync for AcquireFuture<'a> {}\\n\\n\\n\\nunsafe impl<'a> Send for AcquireFuture<'a> {}\\n\\n\\n\\nimpl<'a> UnwindSafe for AcquireFuture<'a> {}\\n\\n\\n\\nimpl<'a> RefUnwindSafe for AcquireFuture<'a> {}\\n\\n\\n\\nimpl<'a> Debug for AcquireFuture<'a> {\\n\\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\\n\\n f.debug_tuple(\\\"AcquireFuture\\\").field(&unsafe { self.waiter() }.amount).finish()\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/acquire.rs\",\n \"rank\": 93,\n \"score\": 22.002653795416553\n },\n {\n \"content\": \" }\\n\\n pub fn poison() -> Self {\\n\\n Permits(usize::max_value())\\n\\n }\\n\\n pub fn into_usize(self) -> Option<usize> {\\n\\n if self.0 <= Semaphore::MAX_AVAILABLE {\\n\\n Some(self.0)\\n\\n } else {\\n\\n None\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Debug for Permits {\\n\\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\\n\\n if self.0 <= Semaphore::MAX_AVAILABLE {\\n\\n write!(f, \\\"{:?}\\\", self.0)\\n\\n } else {\\n\\n write!(f, \\\"poison\\\")\\n\\n }\\n\",\n \"file_path\": \"src/state.rs\",\n \"rank\": 94,\n \"score\": 21.523271239726352\n },\n {\n \"content\": \"use crate::state::{Waiter, AcquireStep, Permits};\\n\\nuse std::cell::UnsafeCell;\\n\\nuse std::marker::{PhantomPinned, PhantomData};\\n\\nuse crate::{Semaphore, SemaphoreGuard, SemaphoreGuardArc};\\n\\nuse std::sync::Arc;\\n\\nuse std::panic::{UnwindSafe, RefUnwindSafe};\\n\\nuse std::fmt::{Debug, Formatter};\\n\\nuse std::{fmt};\\n\\nuse std::task::{Context, Poll};\\n\\nuse crate::state::AcquireState::{Available, Queued};\\n\\nuse std::ptr::null;\\n\\nuse std::pin::Pin;\\n\\nuse std::future::Future;\\n\\nuse crate::waker::{WakerResult};\\n\\nuse crate::errors::PoisonError;\\n\\nuse std::sync::atomic::Ordering::Acquire;\\n\\n\\n\\n/// A [`Future`] returned by [`Semaphore::acquire`] that produces a [`SemaphoreGuard`].\\n\\npub struct AcquireFuture<'a>(pub(crate) UnsafeCell<Waiter>, pub(crate) PhantomData<&'a Semaphore>, pub(crate) PhantomPinned);\\n\\n\\n\",\n \"file_path\": \"src/acquire.rs\",\n \"rank\": 95,\n \"score\": 20.290775078997033\n },\n {\n \"content\": \"#![feature(test)]\\n\\nextern crate test;\\n\\n\\n\\nuse test::Bencher;\\n\\nuse async_weighted_semaphore::{Semaphore, PoisonError};\\n\\nuse std::sync::Arc;\\n\\nuse futures::executor::{ThreadPool, block_on};\\n\\nuse futures::task::SpawnExt;\\n\\nuse rand::{Rng, SeedableRng};\\n\\nuse rand_xorshift::XorShiftRng;\\n\\nuse futures::future::join_all;\\n\\n\\n\\nconst PARALLELISM: usize = 8;\\n\\nconst ITEMS: usize = 10;\\n\\nconst ITERS: usize = 10000;\\n\\nconst MAX_ACQUIRE: usize = 5;\\n\\nconst TOKENS: usize = (MAX_ACQUIRE - 1) * ITEMS + 1;\\n\\n\\n\",\n \"file_path\": \"benches/ring.rs\",\n \"rank\": 96,\n \"score\": 20.10443204995533\n },\n {\n \"content\": \"\\n\\n fn poll(self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Self::Output> {\\n\\n unsafe {\\n\\n let this = self.get_unchecked_mut();\\n\\n match Pin::new_unchecked(&mut this.inner).poll(cx) {\\n\\n Poll::Ready(guard) => {\\n\\n let result =\\n\\n SemaphoreGuardArc::new(this.arc.clone(), guard?.forget());\\n\\n Poll::Ready(Ok(result))\\n\\n }\\n\\n Poll::Pending => Poll::Pending,\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> Drop for AcquireFuture<'a> {\\n\\n fn drop(&mut self) {\\n\\n unsafe {\\n\\n match *self.waiter().step.get() {\\n\",\n \"file_path\": \"src/acquire.rs\",\n \"rank\": 97,\n \"score\": 19.688032170619092\n },\n {\n \"content\": \" (*self.waiter().semaphore).release(available);\\n\\n return Poll::Pending;\\n\\n }\\n\\n }\\n\\n\\n\\n unsafe fn poll_waiting(self: Pin<&mut Self>, cx: &mut Context) -> Poll<Result<SemaphoreGuard<'a>, PoisonError>> {\\n\\n match self.waiter().waker.poll(cx) {\\n\\n Poll::Pending => Poll::Pending,\\n\\n Poll::Ready(poisoned) => {\\n\\n *self.waiter().step.get() = AcquireStep::Done;\\n\\n if poisoned {\\n\\n Poll::Ready(Err(PoisonError))\\n\\n } else {\\n\\n Poll::Ready(Ok(SemaphoreGuard::new(&*self.waiter().semaphore, self.waiter().amount)))\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/acquire.rs\",\n \"rank\": 98,\n \"score\": 19.475100558070963\n },\n {\n \"content\": \"impl<'a> Future for AcquireFuture<'a> {\\n\\n type Output = Result<SemaphoreGuard<'a>, PoisonError>;\\n\\n\\n\\n fn poll(self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Self::Output> {\\n\\n unsafe {\\n\\n match *(*self.0.get()).step.get() {\\n\\n AcquireStep::Entering => {\\n\\n self.poll_enter(cx)\\n\\n }\\n\\n AcquireStep::Waiting => {\\n\\n self.poll_waiting(cx)\\n\\n }\\n\\n AcquireStep::Done => panic!(\\\"Polling completed future.\\\")\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Future for AcquireFutureArc {\\n\\n type Output = Result<SemaphoreGuardArc, PoisonError>;\\n\",\n \"file_path\": \"src/acquire.rs\",\n \"rank\": 99,\n \"score\": 19.051491558666093\n }\n]","isConversational":false}}},{"rowIdx":1396,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/indexer/mod.rs"},"repo_name":{"kind":"string","value":"sinhrks/brassfibre"},"commit":{"kind":"string","value":"86028eaf7271b2cd560ef064969ef1cbf47396d4"},"file_code":{"kind":"string","value":"use std::cell::RefCell;\nuse std::collections::HashMap;\nuse std::collections::hash_map::Entry;\nuse std::hash::Hash;\nuse std::iter::FromIterator;\nuse std::slice;\nuse std::vec;\n\nuse nullvec::prelude::dev::algos::Indexing;\nuse traits::{Slicer, IndexerIndex, Append};\n\nmod convert;\nmod formatting;\nmod indexing;\nmod ops;\nmod sort;\n\n#[derive(Clone)]\npub struct Indexer<U: Clone + Hash> {\n \n pub values: Vec<U>,\n\n \n \n htable: RefCell<HashMap<U, usize>>,\n}\n\nimpl<U> Indexer<U>\nwhere\n U: Clone + Eq + Hash,\n{\n pub fn from_len(len: usize) -> Indexer<usize> {\n \n (0..len).collect()\n }\n\n pub fn new(values: Vec<U>) -> Self {\n Indexer {\n values: values,\n htable: RefCell::new(HashMap::new()),\n }\n }\n}\n\nimpl<U> Slicer for Indexer<U>\nwhere\n U: Clone + Eq + Hash,\n{\n type Scalar = U;\n\n fn len(&self) -> usize {\n self.values.len()\n }\n\n fn iloc(&self, location: &usize) -> Self::Scalar {\n self.values[*location].clone()\n }\n\n unsafe fn iloc_unchecked(&self, location: &usize) -> Self::Scalar {\n self.values.get_unchecked(*location).clone()\n }\n\n fn ilocs(&self, locations: &[usize]) -> Self {\n let new_values = Indexing::reindex(&self.values, locations);\n Indexer::new(new_values)\n }\n\n unsafe fn ilocs_unchecked(&self, locations: &[usize]) -> Self {\n let new_values = Indexing::reindex_unchecked(&self.values, locations);\n Indexer::new(new_values)\n }\n\n fn ilocs_forced(&self, _locations: &[usize]) -> Self {\n unimplemented!()\n }\n\n fn blocs(&self, flags: &[bool]) -> Self {\n let new_values: Vec<U> = Indexing::blocs(&self.values, flags);\n Indexer::new(new_values)\n }\n}\n\nimpl<U> IndexerIndex for Indexer<U>\nwhere\n U: Clone + Eq + Hash,\n{\n type Key = U;\n\n \n fn contains(&self, label: &U) -> bool {\n self.init_state();\n self.htable.borrow().contains_key(label)\n }\n\n fn push(&mut self, label: U) {\n let loc = self.len();\n \n let mut htable = self.htable.borrow_mut();\n match htable.entry(label.clone()) {\n Entry::Occupied(_) => panic!(\"duplicates are not allowed\"),\n Entry::Vacant(e) => e.insert(loc),\n };\n self.values.push(label);\n }\n\n \n fn get_loc(&self, label: &U) -> usize {\n self.init_state();\n *self.htable.borrow().get(label).unwrap()\n }\n\n \n fn get_locs(&self, labels: &[U]) -> Vec<usize> {\n labels.iter().map(|label| self.get_loc(label)).collect()\n }\n\n fn init_state(&self) {\n \n let mut htable = self.htable.borrow_mut();\n if htable.len() != 0 {\n return;\n }\n for (loc, label) in self.values.iter().enumerate() {\n match htable.entry(label.clone()) {\n Entry::Occupied(_) => panic!(\"duplicates are not allowed\"),\n Entry::Vacant(e) => e.insert(loc),\n };\n }\n }\n}\n\nimpl<'a, T> Append<'a> for Indexer<T>\nwhere\n T: Clone + Eq + Hash,\n{\n fn append(&self, other: &Self) -> Self {\n let mut new_values: Vec<T> = self.values.clone();\n new_values.append(&mut other.values.clone());\n Indexer::new(new_values)\n }\n}\n\nimpl<U> PartialEq for Indexer<U>\nwhere\n U: Clone + Eq + Hash,\n{\n fn eq(&self, other: &Indexer<U>) -> bool {\n self.values == other.values\n }\n}\n\nimpl<U> IntoIterator for Indexer<U>\nwhere\n U: Clone + Eq + Hash,\n{\n type Item = U;\n type IntoIter = vec::IntoIter<U>;\n\n fn into_iter(self) -> Self::IntoIter {\n self.values.into_iter()\n }\n}\n\nimpl<U> Indexer<U>\nwhere\n U: Clone + Eq + Hash,\n{\n pub fn iter(&self) -> slice::Iter<U> {\n self.values.iter()\n }\n}\n\nimpl<U> FromIterator<U> for Indexer<U>\nwhere\n U: Clone + Eq + Hash,\n{\n fn from_iter<T>(iter: T) -> Self\n where\n T: IntoIterator<Item = U>,\n {\n let values: Vec<U> = iter.into_iter().collect();\n Indexer::new(values)\n }\n}\n"},"prefix":{"kind":"string","value":"use std::cell::RefCell;\nuse std::collections::HashMap;\nuse std::collections::hash_map::Entry;\nuse std::hash::Hash;\nuse std::iter::FromIterator;\nuse std::slice;\nuse std::vec;\n\nuse nullvec::prelude::dev::algos::Indexing;\nuse traits::{Slicer, IndexerIndex, Append};\n\nmod convert;\nmod formatting;\nmod indexing;\nmod ops;\nmod sort;\n\n#[derive(Clone)]\npub struct Indexer<U: Clone + Hash> {\n \n pub values: Vec<U>,\n\n \n \n htable: RefCell<HashMap<U, usize>>,\n}\n\nimpl<U> Indexer<U>\nwhere\n U: Clone + Eq + Hash,\n{\n pub fn from_len(len: usize) -> Indexer<usize> {\n \n (0..len).collect()\n }\n\n pub fn new(values: Vec<U>) -> Self {\n Indexer {\n values: values,\n htable: RefCell::new(HashMap::new()),\n }\n }\n}\n\nimpl<U> Slicer for Indexer<U>\nwhere\n U: Clone + Eq + Hash,\n{\n type Scalar = U;\n\n fn len(&self) -> usize {\n self.values.len()\n }\n\n fn iloc(&self, location: &usize) -> Self::Scalar {\n self.values[*location].clone()\n }\n\n unsafe fn iloc_unchecked(&self, location: &usize) -> Self::Scalar {\n self.values.get_unchecked(*location).clone()\n }\n\n fn ilocs(&self, locations: &[usize]) -> Self {\n let new_values = Indexing::reindex(&self.values, locations);\n Indexer::new(new_values)\n }\n\n unsafe fn ilocs_unchecked(&self, locations: &[usize]) -> Self {\n let new_values = Indexing::reindex_unchecked(&self.values, locations);\n Indexer::new(new_values)\n }\n\n fn ilocs_forced(&self, _locations: &[usize]) -> Self {\n unimplemented!()\n }\n\n fn blocs(&self, flags: &[bool]) -> Self {\n let new_values: Vec<U> = Indexing::blocs(&self.values, flags);\n Indexer::new(new_values)\n }\n}\n\nimpl<U> IndexerIndex for Indexer<U>\nwhere\n U: Clone + Eq + Hash,\n{\n type Key = U;\n\n \n fn contains(&self, label: &U) -> bool {\n self.init_state();\n self.htable.borrow().contains_key(label)\n }\n\n fn push(&mut self, label: U) {\n let loc = self.len();\n \n let mut htable = self.htable.borrow_mut();\n match htable.entry(label.clone()) {\n Entry::Occupied(_) => panic!(\"duplicates are not allowed\"),\n Entry::Vacant(e) => e.insert(loc),\n };\n self.values.push(label);\n }\n\n \n fn get_loc(&self, label: &U) -> usize {\n self.init_state();\n *self.htable.borrow().get(label).unwrap()\n }\n\n \n fn get_locs(&self, labels: &[U]) -> Vec<usize> {\n labels.iter().map(|label| self.get_loc(label)).collect()\n }\n\n fn init_state(&self) {\n \n let mut htable = self.htable.borrow_mut();\n if htable.len() != 0 {\n return;\n }\n for (loc, label) in self.values.iter().enumerate() {\n match htable.entry(label.clone()) {\n Entry::Occupied(_) => panic!(\"duplicates are not allowed\"),\n Entry::Vacant(e) => e.insert(loc),\n };\n }\n }\n}\n\nimpl<'a, T> Append<'a> for Indexer<T>\nwhere\n T: Clone + Eq + Hash,\n{\n fn append(&self, other: &Self) -> Self {\n let mut new_values: Vec<T> = self.values.clone();\n new_values.append(&mut other.values.clone());\n Indexer::new(new_values)\n }\n}\n\nimpl<U> PartialEq for Indexer<U>\nwhere\n U: Clone + Eq + Hash,\n{\n fn eq(&self, other: &Indexer<U>) -> bool {\n self.values == other.values\n }\n}\n\nimpl<U> IntoIterator for Indexer<U>\nwhere\n U: Clone + Eq + Hash,\n{\n type Item = U;\n type IntoIter = vec::IntoIter<U>;\n\n fn into_iter(self) -> Self::IntoIter {\n self.values.into_iter()\n }\n}\n\nimpl<U> Indexer<U>\nwhere\n U: Clone + Eq + Hash,\n{\n pub fn iter(&self) -> slice::Iter<U> {\n self.values.iter()\n }\n}\n\nimpl<U> FromIterator<U> for Indexer<U>\nwhere\n U: Clone + Eq + Hash,\n{\n "},"suffix":{"kind":"string","value":"\n}\n"},"middle":{"kind":"string","value":"fn from_iter<T>(iter: T) -> Self\n where\n T: IntoIterator<Item = U>,\n {\n let values: Vec<U> = iter.into_iter().collect();\n Indexer::new(values)\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"/// Indexing methods for Indexer\n\npub trait IndexerIndex: Slicer {\n\n type Key;\n\n\n\n fn contains(&self, label: &Self::Key) -> bool;\n\n fn push(&mut self, label: Self::Key);\n\n fn get_loc(&self, label: &Self::Key) -> usize;\n\n fn get_locs(&self, labels: &[Self::Key]) -> Vec<usize>;\n\n\n\n // temp\n\n fn init_state(&self);\n\n}\n\n\n","file_path":"src/traits.rs","rank":0,"score":157291.8134599632},{"content":"/// Get max number of characters in a vector of String\n\nfn get_width(values: &[String]) -> usize {\n\n values.iter().map(|x| x.len()).max().unwrap()\n\n}\n\n\n","file_path":"src/formatting.rs","rank":1,"score":124450.86924839573},{"content":"#[test]\n\nfn test_index_append() {\n\n let index1: Indexer<i64> = Indexer::new(vec![1, 2, 3]);\n\n let index2: Indexer<i64> = Indexer::new(vec![4, 5, 6]);\n\n let res = index1.append(&index2);\n\n\n\n let exp: Indexer<i64> = Indexer::new(vec![1, 2, 3, 4, 5, 6]);\n\n assert_eq!(res, exp)\n\n}\n\n\n","file_path":"tests/indexer.rs","rank":2,"score":116513.63204324586},{"content":"/// Convert passed values to Vec of equally padded String\n\npub fn pad_string_vector<T: ToString>(values: &[T]) -> Vec<String> {\n\n let strs = to_string_vector(values);\n\n let pad = get_width(&strs);\n\n strs.iter().map(|x| pad_str(x, pad)).collect()\n\n}\n\n\n","file_path":"src/formatting.rs","rank":3,"score":113888.41398575073},{"content":"#[test]\n\nfn test_index_loc_str() {\n\n let values: Vec<&str> = vec![\"A\", \"B\", \"C\"];\n\n let idx = Indexer::<&str>::new(values);\n\n\n\n assert_eq!(idx.get_loc(&\"B\"), 1);\n\n assert_eq!(idx.get_loc(&\"C\"), 2);\n\n\n\n assert_eq!(idx.get_locs(&vec![\"B\", \"C\"]), vec![1, 2]);\n\n assert_eq!(idx.get_locs(&vec![\"A\", \"C\"]), vec![0, 2]);\n\n\n\n assert_eq!(idx.contains(&\"C\"), true);\n\n assert_eq!(idx.contains(&\"X\"), false);\n\n}\n\n\n","file_path":"tests/indexer.rs","rank":4,"score":112794.00298848879},{"content":"#[test]\n\nfn test_index_loc_int64() {\n\n let values: Vec<i64> = vec![1, 2, 3];\n\n let idx = Indexer::<i64>::new(values);\n\n\n\n assert_eq!(idx.get_loc(&1), 0);\n\n assert_eq!(idx.get_loc(&3), 2);\n\n\n\n assert_eq!(idx.get_locs(&vec![1, 3]), vec![0, 2]);\n\n assert_eq!(idx.get_locs(&vec![3, 2]), vec![2, 1]);\n\n\n\n assert_eq!(idx.contains(&1), true);\n\n assert_eq!(idx.contains(&5), false);\n\n}\n\n\n","file_path":"tests/indexer.rs","rank":5,"score":112794.00298848879},{"content":"#[test]\n\nfn test_clone() {\n\n let i = Scalar::i64(1);\n\n assert_eq!(i, i.clone());\n\n}\n","file_path":"tests/scalar.rs","rank":6,"score":112290.25309379966},{"content":"/// Convert passed values and header to Vec of equally padded String\n\npub fn pad_string_vector_with_header<T: ToString>(values: &[T], header: String) -> Vec<String> {\n\n let mut strs = to_string_vector(values);\n\n strs.insert(0, header);\n\n pad_string_vector(&strs)\n\n}\n\n\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n\n\n #[test]\n\n fn test_to_string_vector_int() {\n\n let values: Vec<i64> = vec![1, 2, 3, 4, 5];\n\n let s = super::to_string_vector(&values);\n\n\n\n let exp_values: Vec<&str> = vec![\"1\", \"2\", \"3\", \"4\", \"5\"];\n\n assert_eq!(&s, &exp_values);\n\n assert_eq!(&super::get_width(&s), &1);\n\n\n\n let values: Vec<i64> = vec![10, 200, 30, 4, 50];\n","file_path":"src/formatting.rs","rank":7,"score":102691.81124462563},{"content":"/// Concatenate along row\n\npub trait Append<'s>: Sized {\n\n fn append<'o>(&'s self, other: &'o Self) -> Self;\n\n}\n\n\n","file_path":"src/traits.rs","rank":8,"score":97282.89918835193},{"content":"fn default_columns(n: usize) -> Vec<String> {\n\n let columns: Vec<usize> = (0..n).collect();\n\n columns.into_iter().map(|x| x.to_string()).collect()\n\n}\n\n\n\nimpl<'a, I, C> DataFrame<'a, 'a, 'a, I, C>\n\nwhere\n\n I: Clone + Eq + Hash,\n\n C: Clone + Eq + Hash,\n\n{\n\n pub fn read_csv<R: Read>(\n\n mut reader: csv::Reader<R>,\n\n ) -> Result<DataFrame<'a, 'a, 'a, usize, String>, csv::Error> {\n\n\n\n // headers read 1st row regardless of has_headers property. Need to clone to avoid double\n\n // borrow in this function\n\n let header = reader.headers()?.clone();\n\n let columns: Vec<String> = if reader.has_headers() {\n\n header.iter().map(|s| s.to_string()).collect()\n\n } else {\n","file_path":"src/io/mod.rs","rank":9,"score":90595.34363922616},{"content":"fn pad_str(s: &str, pad: usize) -> String {\n\n let len = s.len();\n\n // ToDo: fix, can use dynamic formatter in format! macro?\n\n if len < pad {\n\n let mut new = \"\".to_string();\n\n for _ in 0..(pad - len) {\n\n new.push(' ');\n\n }\n\n new.push_str(s);\n\n new\n\n } else {\n\n s.to_string()\n\n }\n\n}\n\n\n","file_path":"src/formatting.rs","rank":10,"score":90393.06191062622},{"content":"#[test]\n\nfn test_dataframe_format() {\n\n let values = vec![\n\n array![1, 2, 3, 4, 5],\n\n array![6.1, 7.1, 8.1, 9.1, 10.1],\n\n array![11, 12, 13, 14, 15],\n\n ];\n\n let df = DataFrame::from_vec(values, vec![10, 20, 30, 40, 50], vec![\"X\", \"YYY\", \"ZZ\"]);\n\n\n\n // better way?\n\n let mut buf = Vec::new();\n\n let _ = write!(&mut buf, \"{}\", df);\n\n let res = str::from_utf8(&buf).unwrap();\n\n assert_eq!(res, \"DataFrame(columns=[\\\"X\\\", \\\"YYY\\\", \\\"ZZ\\\"])\");\n\n}\n\n\n","file_path":"tests/format.rs","rank":11,"score":85776.07296302333},{"content":"#[test]\n\nfn test_series_format() {\n\n let s = Series::new(vec![1, 10, 100], vec![\"XX\", \"Y\", \"ZZ\"]);\n\n\n\n // better way?\n\n let mut buf = Vec::new();\n\n let _ = write!(&mut buf, \"{}\", s);\n\n assert_eq!(&buf, b\"Series([1, 10, 100])\");\n\n}\n\n\n","file_path":"tests/format.rs","rank":12,"score":85776.07296302333},{"content":"#[test]\n\nfn test_index_iter() {\n\n let index: Indexer<i64> = Indexer::new(vec![1, 2, 3]);\n\n let mut it = index.iter();\n\n assert_eq!(it.next(), Some(&1));\n\n assert_eq!(it.next(), Some(&2));\n\n assert_eq!(it.next(), Some(&3));\n\n assert_eq!(it.next(), None);\n\n}\n\n\n","file_path":"tests/indexer.rs","rank":13,"score":85001.64562710834},{"content":"#[test]\n\nfn test_index_from_iter() {\n\n let index: Indexer<i64> = (3..6).collect();\n\n let exp: Indexer<i64> = Indexer::new(vec![3, 4, 5]);\n\n assert_eq!(index, exp);\n\n}\n","file_path":"tests/indexer.rs","rank":14,"score":85001.64562710834},{"content":"#[test]\n\nfn test_index_push() {\n\n let values: Vec<&str> = vec![\"A\", \"B\", \"C\"];\n\n let mut idx = Indexer::<&str>::new(values);\n\n\n\n let exp_index: Vec<&str> = vec![\"A\", \"B\", \"C\"];\n\n assert_eq!(idx.values, exp_index);\n\n assert_eq!(idx.len(), 3);\n\n assert_eq!(idx.get_loc(&\"C\"), 2);\n\n\n\n idx.push(\"D\");\n\n assert_eq!(idx.len(), 4);\n\n assert_eq!(idx.get_loc(&\"C\"), 2);\n\n assert_eq!(idx.get_loc(&\"D\"), 3);\n\n\n\n idx.push(\"E\");\n\n assert_eq!(idx.len(), 5);\n\n assert_eq!(idx.get_loc(&\"D\"), 3);\n\n assert_eq!(idx.get_loc(&\"E\"), 4);\n\n}\n\n\n","file_path":"tests/indexer.rs","rank":15,"score":85001.64562710834},{"content":"#[test]\n\nfn test_index_into_iter() {\n\n let index: Indexer<i64> = Indexer::new(vec![1, 2, 3]);\n\n let mut it = index.into_iter();\n\n assert_eq!(it.next(), Some(1));\n\n assert_eq!(it.next(), Some(2));\n\n assert_eq!(it.next(), Some(3));\n\n assert_eq!(it.next(), None);\n\n}\n\n\n","file_path":"tests/indexer.rs","rank":16,"score":85001.64562710834},{"content":"/// Convert each element in a vector to String\n\nfn to_string_vector<T: ToString>(values: &[T]) -> Vec<String> {\n\n values.iter().map(|x| x.to_string()).collect()\n\n}\n\n\n","file_path":"src/formatting.rs","rank":17,"score":83736.98946383604},{"content":"#[test]\n\nfn test_series_format_debug() {\n\n let s = Series::new(vec![1, 10, 100], vec![\"XX\", \"Y\", \"ZZ\"]);\n\n\n\n // better way?\n\n let mut buf = Vec::new();\n\n let _ = write!(&mut buf, \"{:?}\", s);\n\n assert_eq!(\n\n &buf,\n\n b\"XX 1\n\n Y 10\n\nZZ 100\"\n\n );\n\n}\n\n\n","file_path":"tests/format.rs","rank":18,"score":83346.90997452577},{"content":"#[test]\n\nfn test_dataframe_format_debug() {\n\n let values = vec![\n\n array![1, 2, 3, 4, 5],\n\n array![6.1, 7.1, 8.1, 9.1, 10.1],\n\n array![11, 12, 13, 14, 15],\n\n ];\n\n let df = DataFrame::from_vec(values, vec![10, 20, 30, 40, 50], vec![\"X\", \"YYY\", \"ZZ\"]);\n\n\n\n // better way?\n\n let mut buf = Vec::new();\n\n let _ = write!(&mut buf, \"{:?}\", df);\n\n let res = str::from_utf8(&buf).unwrap();\n\n assert_eq!(\n\n res,\n\n \" X YYY ZZ\n\n10 1 6.1 11\n\n20 2 7.1 12\n\n30 3 8.1 13\n\n40 4 9.1 14\n\n50 5 10.1 15\"\n\n );\n\n}\n","file_path":"tests/format.rs","rank":19,"score":83346.90997452577},{"content":"#[test]\n\nfn test_index_iloc_ilocs() {\n\n let values: Vec<i64> = vec![1, 2, 3];\n\n let idx = Indexer::<i64>::new(values);\n\n\n\n assert_eq!(idx.iloc(&0), 1);\n\n assert_eq!(idx.iloc(&2), 3);\n\n\n\n assert_eq!(idx.ilocs(&[2, 0]), Indexer::<i64>::new(vec![3, 1]));\n\n}\n\n\n","file_path":"tests/indexer.rs","rank":20,"score":82594.31152828998},{"content":"#[test]\n\nfn test_index_creation_string() {\n\n let values: Vec<String> = vec![\"A\".to_string(), \"B\".to_string(), \"C\".to_string()];\n\n let idx = Indexer::<String>::new(values);\n\n\n\n let exp_index: Vec<String> = vec![\"A\".to_string(), \"B\".to_string(), \"C\".to_string()];\n\n assert_eq!(idx.values, exp_index);\n\n assert_eq!(idx.len(), 3);\n\n}\n\n\n","file_path":"tests/indexer.rs","rank":21,"score":82594.31152828998},{"content":"#[test]\n\nfn test_index_creation_str() {\n\n let values: Vec<&str> = vec![\"A\", \"B\", \"C\"];\n\n let idx = Indexer::<&str>::new(values);\n\n\n\n let exp_index: Vec<&str> = vec![\"A\", \"B\", \"C\"];\n\n assert_eq!(idx.values, exp_index);\n\n assert_eq!(idx.len(), 3);\n\n}\n\n\n","file_path":"tests/indexer.rs","rank":22,"score":82594.31152828998},{"content":"#[test]\n\nfn test_index_creation_int64() {\n\n let values: Vec<i64> = vec![1, 2, 3];\n\n let idx = Indexer::<i64>::new(values);\n\n\n\n let exp_index: Vec<i64> = vec![1, 2, 3];\n\n assert_eq!(idx.values, exp_index);\n\n assert_eq!(idx.len(), 3);\n\n}\n\n\n","file_path":"tests/indexer.rs","rank":23,"score":82594.31152828998},{"content":"#[test]\n\nfn test_index_creation_from_len() {\n\n let idx: Indexer<usize> = Indexer::<usize>::from_len(3);\n\n assert_eq!(idx.values, vec![0, 1, 2]);\n\n assert_eq!(idx.len(), 3);\n\n\n\n let idx: Indexer<usize> = Indexer::<usize>::from_len(0);\n\n assert_eq!(idx.values, vec![]);\n\n assert_eq!(idx.len(), 0);\n\n}\n\n\n","file_path":"tests/indexer.rs","rank":24,"score":82594.31152828998},{"content":"fn main() {\n\n // cargo build --example indexer\n\n // ./target/debug/examples/indexer\n\n\n\n let values: Vec<i64> = vec![1, 2, 3, 4, 5];\n\n let indexer: Indexer<i64> = Indexer::new(values);\n\n // println!(\"{:}\", &s);\n\n println!(\"{:?}\", &indexer);\n\n println!(\"{:?}\", &indexer[2]);\n\n\n\n println!(\"{:?}\", &(indexer + 1));\n\n}\n","file_path":"examples/indexer.rs","rank":25,"score":81479.08507896558},{"content":"#[test]\n\nfn test_eq() {\n\n let iarr1 = array![1i64, 2, 3];\n\n let iarr2 = array![2i64, 3, 4];\n\n let iarr3 = array![1i64, 2, 3, 4, 5];\n\n let iarr4 = array![1i64, 2, 3];\n\n assert_eq!(iarr1, iarr1);\n\n assert_eq!(iarr1 == iarr2, false);\n\n assert_eq!(iarr1 == iarr3, false);\n\n assert_eq!(iarr1, iarr4);\n\n\n\n let farr1 = array![1.0f64, 2., 3.];\n\n let farr2 = array![2.0f64, 3., 4.];\n\n let farr3 = array![1.0f64, 2., 3., 4., 5.];\n\n let farr4 = array![1.0f64, 2., 3.];\n\n assert_eq!(farr1, farr1);\n\n assert_eq!(farr1 == farr2, false);\n\n assert_eq!(farr1 == farr3, false);\n\n assert_eq!(farr1, farr4);\n\n\n\n // different types\n\n assert_eq!(iarr1 == farr1, false);\n\n assert_eq!(iarr2 == farr2, false);\n\n assert_eq!(iarr3 == farr3, false);\n\n assert_eq!(iarr4 == farr4, false);\n\n}\n\n\n","file_path":"tests/array.rs","rank":26,"score":79271.89581355159},{"content":"#[test]\n\nfn test_clone() {\n\n let iarr1 = array![1i64, 2, 3];\n\n assert_eq!(iarr1, iarr1.clone());\n\n}\n\n\n\n\n","file_path":"tests/array.rs","rank":27,"score":79255.63667595378},{"content":"#[test]\n\nfn test_creation() {\n\n let i = Scalar::i64(1);\n\n assert_eq!(i.dtype(), \"i64\");\n\n}\n\n\n","file_path":"tests/scalar.rs","rank":28,"score":79240.42752200202},{"content":"#[test]\n\nfn test_append() {\n\n let iarr1 = array![1i64, 2, 3];\n\n assert_eq!(iarr1.dtype(), \"i64\");\n\n\n\n let iarr2 = array![1i64, 2, 3];\n\n assert_eq!(iarr2.dtype(), \"i64\");\n\n\n\n let res = iarr1.append(&iarr2);\n\n assert_eq!(res.dtype(), \"i64\");\n\n\n\n let exp = array![1i64, 2, 3, 1, 2, 3];\n\n assert_eq!(res, exp);\n\n}\n","file_path":"tests/array.rs","rank":29,"score":79181.3898005327},{"content":"#[test]\n\nfn test_copy() {\n\n let values: Vec<&str> = vec![\"A\", \"B\", \"C\"];\n\n let idx = Indexer::<&str>::new(values);\n\n\n\n // copy Indexer\n\n let copied = idx.clone();\n\n let exp_values: Vec<&str> = vec![\"A\", \"B\", \"C\"];\n\n assert_eq!(&copied.values, &exp_values);\n\n}\n\n\n","file_path":"tests/indexer.rs","rank":30,"score":78383.1821271088},{"content":"#[test]\n\nfn test_reindex() {\n\n let idx = Indexer::<&str>::new(vec![\"A\", \"B\", \"C\"]);\n\n\n\n let res = idx.reindex(&vec![1, 0, 2]);\n\n assert_eq!(res, Indexer::new(vec![\"B\", \"A\", \"C\"]));\n\n\n\n let res = idx.reindex(&vec![1, 0, 2]);\n\n assert_eq!(res, Indexer::new(vec![\"B\", \"A\", \"C\"]));\n\n}\n\n\n","file_path":"tests/indexer.rs","rank":31,"score":78383.1821271088},{"content":"#[test]\n\nfn test_equals() {\n\n let idx = Indexer::<&str>::new(vec![\"A\", \"B\", \"C\"]);\n\n\n\n let other = Indexer::<&str>::new(vec![\"A\", \"B\"]);\n\n assert_eq!(idx == other, false);\n\n\n\n let other = Indexer::<&str>::new(vec![\"A\", \"B\", \"X\"]);\n\n assert_eq!(idx == other, false);\n\n\n\n let other = Indexer::<&str>::new(vec![\"A\", \"B\", \"C\"]);\n\n assert_eq!(idx == other, true);\n\n assert_eq!(idx, other);\n\n}\n\n\n","file_path":"tests/indexer.rs","rank":32,"score":78383.1821271088},{"content":"/// Indexing methods for Index(Row)\n\npub trait RowIndex<'s>: Sized {\n\n // 's: lifetime of myself\n\n\n\n type Key;\n\n type Row;\n\n\n\n fn len(&'s self) -> usize;\n\n\n\n fn head(&'s self, n: usize) -> Self {\n\n let indexer: Vec<usize> = (0..n).collect();\n\n self.ilocs(&indexer)\n\n }\n\n\n\n fn tail(&'s self, n: usize) -> Self {\n\n let len = self.len();\n\n let indexer: Vec<usize> = ((len - n)..len).collect();\n\n self.ilocs(&indexer)\n\n }\n\n\n\n fn reindex<'l>(&'s self, labels: &'l [Self::Key]) -> Self;\n","file_path":"src/traits.rs","rank":33,"score":76410.16528266536},{"content":"/// Indexing methods for Columns\n\npub trait ColIndex<'s>: Sized {\n\n // 's: lifetime of myself\n\n\n\n type Key;\n\n type Column;\n\n\n\n /// Get column using label\n\n fn get<'l>(&'s self, label: &'l Self::Key) -> Self::Column;\n\n\n\n /// Get column using given index\n\n fn iget<'l>(&'s self, label: &'l usize) -> Self::Column;\n\n\n\n /// Slice columns using labels\n\n fn gets<'l>(&'s self, labels: &'l [Self::Key]) -> Self;\n\n\n\n /// Slice columns given indices\n\n fn igets<'l>(&'s self, locations: &'l [usize]) -> Self;\n\n\n\n // ToDo: Add .insert\n\n // ToDo bgets\n\n}\n\n\n","file_path":"src/traits.rs","rank":34,"score":76409.58082950533},{"content":"#[test]\n\nfn test_series_append() {\n\n let values: Vec<f64> = vec![1., 2., 3., 4., 5.];\n\n let index: Vec<i64> = vec![10, 20, 30, 40, 50];\n\n\n\n let s1 = Series::new(values, index);\n\n\n\n let values: Vec<f64> = vec![11., 12., 13., 14., 15.];\n\n let index: Vec<i64> = vec![110, 120, 130, 140, 150];\n\n\n\n let s2 = Series::new(values, index);\n\n\n\n let res = s1.append(&s2);\n\n let exp: Series<f64, i64> = Series::new(\n\n vec![1., 2., 3., 4., 5., 11., 12., 13., 14., 15.],\n\n vec![10, 20, 30, 40, 50, 110, 120, 130, 140, 150],\n\n );\n\n assert_eq!(res, exp);\n\n}\n\n\n","file_path":"tests/series.rs","rank":35,"score":76324.87699873961},{"content":"pub trait JoinOp<T> {\n\n fn inner(left: &[T], right: &[T]) -> (Vec<T>, Vec<usize>, Vec<usize>);\n\n fn left(left: &[T], right: &[T]) -> (Vec<T>, Vec<usize>, Vec<usize>);\n\n fn right(left: &[T], right: &[T]) -> (Vec<T>, Vec<usize>, Vec<usize>);\n\n fn outer(left: &[T], right: &[T]) -> (Vec<T>, Vec<usize>, Vec<usize>);\n\n\n\n fn keep_first(keep: &[T], other: &[T]) -> (Vec<T>, Vec<usize>, Vec<usize>);\n\n}\n\n\n\nimpl<T> JoinOp<T> for HashJoin\n\nwhere\n\n T: Clone + Hash + Eq,\n\n{\n\n fn inner(left: &[T], right: &[T]) -> (Vec<T>, Vec<usize>, Vec<usize>) {\n\n\n\n let exp_capacity = cmp::min(left.len(), right.len());\n\n\n\n let mut indexer: Vec<T> = Vec::with_capacity(exp_capacity);\n\n let mut lindexer: Vec<usize> = Vec::with_capacity(exp_capacity);\n\n let mut rindexer: Vec<usize> = Vec::with_capacity(exp_capacity);\n","file_path":"src/algos/join.rs","rank":36,"score":75944.44124600218},{"content":"#[test]\n\nfn test_series_slice_locs() {\n\n let values: Vec<f64> = vec![1., 2., 3., 4., 5.];\n\n let index: Vec<i64> = vec![10, 20, 30, 40, 50];\n\n\n\n let s = Series::new(values, index);\n\n\n\n // test internal constructions\n\n let exp_values: Cow<Vec<f64>> = Cow::Owned(vec![1., 2., 3., 4., 5.]);\n\n let exp_index: Cow<Indexer<i64>> = Cow::Owned(Indexer::new(vec![10, 20, 30, 40, 50]));\n\n assert_eq!(s.values, exp_values);\n\n assert_eq!(s.index, exp_index);\n\n\n\n // test label slice\n\n let res = s.locs(&vec![20, 30, 50]);\n\n let exp: Series<f64, i64> = Series::new(vec![2., 3., 5.], vec![20, 30, 50]);\n\n assert_eq!(res, exp);\n\n}\n\n\n","file_path":"tests/series.rs","rank":37,"score":73738.05390204594},{"content":"#[test]\n\nfn test_frame_slice_locs() {\n\n let values = vec![\n\n array![1i64, 2, 3, 4, 5],\n\n array![6.0f64, 7., 8., 9., 10.],\n\n array![11i64, 12, 13, 14, 15],\n\n ];\n\n let df = DataFrame::from_vec(\n\n values,\n\n vec![\"A\", \"BB\", \"CC\", \"D\", \"EEE\"],\n\n vec![\"X\", \"YYY\", \"ZZ\"],\n\n );\n\n assert_eq!(df.len(), 5);\n\n\n\n let res = df.locs(&vec![\"A\", \"D\", \"CC\"]);\n\n let exp_values = vec![\n\n array![1i64, 4, 3],\n\n array![6.0f64, 9., 8.],\n\n array![11i64, 14, 13],\n\n ];\n\n let exp = DataFrame::from_vec(exp_values, vec![\"A\", \"D\", \"CC\"], vec![\"X\", \"YYY\", \"ZZ\"]);\n\n assert_eq!(res.values, exp.values);\n\n assert_eq!(res.index, exp.index);\n\n assert_eq!(res.columns, exp.columns);\n\n}\n\n\n","file_path":"tests/frame.rs","rank":38,"score":73738.05390204594},{"content":"#[test]\n\nfn test_dataframe_append() {\n\n let values1 = vec![array![1, 2, 3], array![4.1, 5.1, 6.1], array![1, 2, 3]];\n\n let df1 = DataFrame::from_vec(values1, vec![\"A\", \"B\", \"C\"], vec![\"X\", \"Y\", \"Z\"]);\n\n\n\n let values2 = vec![array![4, 5], array![7.1, 8.1], array![4, 5]];\n\n let df2 = DataFrame::from_vec(values2, vec![\"D\", \"E\"], vec![\"X\", \"Y\", \"Z\"]);\n\n\n\n let res = df1.append(&df2);\n\n\n\n let exp_values = vec![\n\n array![1, 2, 3, 4, 5],\n\n array![4.1, 5.1, 6.1, 7.1, 8.1],\n\n array![1, 2, 3, 4, 5],\n\n ];\n\n let exp = DataFrame::from_vec(\n\n exp_values,\n\n vec![\"A\", \"B\", \"C\", \"D\", \"E\"],\n\n vec![\"X\", \"Y\", \"Z\"],\n\n );\n\n assert_eq!(res, exp);\n\n}\n\n\n","file_path":"tests/frame_reshape.rs","rank":39,"score":73711.15576053833},{"content":"#[test]\n\nfn test_series_creation_from_index() {\n\n let values: Vec<f64> = vec![1., 2., 3.];\n\n let index: Vec<i64> = vec![5, 6, 7];\n\n\n\n let s = Series::<f64, i64>::new(values, index);\n\n\n\n let exp_values: Cow<Vec<f64>> = Cow::Owned(vec![1., 2., 3.]);\n\n let exp_index: Cow<Indexer<i64>> = Cow::Owned(Indexer::new(vec![5, 6, 7]));\n\n assert_eq!(s.values, exp_values);\n\n assert_eq!(s.index, exp_index);\n\n\n\n assert_eq!(s.len(), 3);\n\n assert_eq!(s.index.len(), 3);\n\n}\n\n\n","file_path":"tests/series.rs","rank":40,"score":72980.79237928068},{"content":"#[test]\n\nfn test_series_creation_from_into_index() {\n\n let values: Vec<f64> = vec![1., 2., 3.];\n\n let index: Indexer<i64> = Indexer::new(vec![5, 6, 7]);\n\n\n\n let s = Series::<f64, i64>::new(values, index);\n\n\n\n let exp_values: Cow<Vec<f64>> = Cow::Owned(vec![1., 2., 3.]);\n\n let exp_index: Cow<Indexer<i64>> = Cow::Owned(Indexer::new(vec![5, 6, 7]));\n\n assert_eq!(s.values, exp_values);\n\n assert_eq!(s.index, exp_index);\n\n\n\n assert_eq!(s.len(), 3);\n\n assert_eq!(s.index.len(), 3);\n\n}\n\n\n","file_path":"tests/series.rs","rank":41,"score":72980.79237928068},{"content":"#[test]\n\nfn test_series_reindex_by_index() {\n\n let s: Series<&str, &str> = Series::new(vec![\"a\", \"b\", \"c\", \"d\"], vec![\"A\", \"B\", \"C\", \"D\"]);\n\n let res = s.reindex_by_index(&vec![1, 3, 0]);\n\n let exp: Series<&str, &str> = Series::new(vec![\"b\", \"d\", \"a\"], vec![\"B\", \"D\", \"A\"]);\n\n assert_eq!(res, exp);\n\n}\n\n\n","file_path":"tests/series.rs","rank":42,"score":72980.79237928068},{"content":"#[test]\n\n#[should_panic]\n\nfn test_frame_slice_locs_panic() {\n\n let values = vec![\n\n array![1i64, 2, 3, 4, 5],\n\n array![6.0f64, 7., 8., 9., 10.],\n\n array![11i64, 12, 13, 14, 15],\n\n ];\n\n let df = DataFrame::from_vec(\n\n values,\n\n vec![\"A\", \"BB\", \"CC\", \"D\", \"EEE\"],\n\n vec![\"X\", \"YYY\", \"ZZ\"],\n\n );\n\n\n\n df.locs(&vec![\"A\", \"D\", \"X\"]);\n\n}\n\n\n","file_path":"tests/frame.rs","rank":43,"score":71336.33519097991},{"content":"#[test]\n\n#[should_panic]\n\nfn test_series_reindex_by_index_panic() {\n\n let s: Series<&str, &str> = Series::new(vec![\"a\", \"b\", \"c\", \"d\"], vec![\"A\", \"B\", \"C\", \"D\"]);\n\n s.reindex_by_index(&vec![1, 3, 10]);\n\n}\n\n\n","file_path":"tests/series.rs","rank":44,"score":70609.94377453244},{"content":"#[test]\n\nfn test_series_value_counts_str() {\n\n let values: Vec<&str> = vec![\"a\", \"bb\", \"bb\", \"c\", \"a\", \"a\"];\n\n let s = Series::<&str, usize>::from_vec(values);\n\n\n\n let d = s.value_counts();\n\n let exp: Series<usize, &str> = Series::new(vec![3, 2, 1], vec![\"a\", \"bb\", \"c\"]);\n\n assert_eq!(d, exp);\n\n}\n","file_path":"tests/series_aggregation.rs","rank":45,"score":69110.35904498925},{"content":"#[test]\n\nfn test_series_value_counts_int() {\n\n let values: Vec<i64> = vec![1, 1, 3, 4, 2, 1, 1, 2, 3, 3];\n\n let s = Series::<i64, usize>::from_vec(values);\n\n\n\n let d = s.value_counts();\n\n let exp: Series<usize, i64> = Series::new(vec![4, 3, 2, 1], vec![1, 3, 2, 4]);\n\n assert_eq!(d, exp);\n\n}\n\n\n","file_path":"tests/series_aggregation.rs","rank":46,"score":69110.35904498925},{"content":"#[test]\n\n#[should_panic]\n\nfn test_dataframe_append_different_columns() {\n\n // different columns\n\n let values1 = vec![array![1, 2, 3], array![4.1, 5.1, 6.1], array![1, 2, 3]];\n\n let df1 = DataFrame::from_vec(values1, vec![\"A\", \"B\", \"C\"], vec![\"X\", \"Y\", \"Z\"]);\n\n\n\n let values2 = vec![array![4, 5], array![7.1, 8.1], array![4, 5]];\n\n let df2 = DataFrame::from_vec(values2, vec![\"D\", \"E\"], vec![\"XX\", \"Y\", \"Z\"]);\n\n\n\n df1.append(&df2);\n\n}\n\n\n","file_path":"tests/frame_reshape.rs","rank":47,"score":69097.96996054036},{"content":"#[test]\n\n#[should_panic]\n\nfn test_dataframe_append_different_dtype() {\n\n // different columns\n\n let values1 = vec![array![1, 2, 3], array![4.1, 5.1, 6.1], array![1, 2, 3]];\n\n let df1 = DataFrame::from_vec(values1, vec![\"A\", \"B\", \"C\"], vec![\"X\", \"Y\", \"Z\"]);\n\n\n\n let values2 = vec![array![4, 5], array![7.1, 8.1], array![4.1, 5.1]];\n\n let df2 = DataFrame::from_vec(values2, vec![\"D\", \"E\"], vec![\"X\", \"Y\", \"Z\"]);\n\n\n\n df1.append(&df2);\n\n}\n\n\n","file_path":"tests/frame_reshape.rs","rank":48,"score":69097.96996054036},{"content":"use std::hash::Hash;\n\n\n\nuse super::Indexer;\n\nuse nullvec::prelude::dev::algos::Sorter;\n\n\n\n//**********************************************\n\n//*Soat\n\n//**********************************************\n\n\n\nimpl<U> Indexer<U>\n\nwhere\n\n U: Clone + Eq + Hash + Ord,\n\n{\n\n pub fn argsort(&self) -> (Vec<usize>, Self) {\n\n let (indexer, sorted) = Sorter::argsort(&self.values);\n\n let sorted = Indexer::new(sorted);\n\n (indexer, sorted)\n\n }\n\n\n\n pub fn sort(&self) -> Self {\n","file_path":"src/indexer/sort.rs","rank":49,"score":68378.31397301417},{"content":" Indexer::new(Sorter::sort(&self.values))\n\n }\n\n}\n\n\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n\n\n use super::super::Indexer;\n\n\n\n #[test]\n\n fn test_index_argsort_int() {\n\n let idx = Indexer::new(vec![5, 4, 3, 2, 1]);\n\n let (indexer, sorted) = idx.argsort();\n\n assert_eq!(indexer, vec![4, 3, 2, 1, 0]);\n\n assert_eq!(sorted, Indexer::new(vec![1, 2, 3, 4, 5]));\n\n }\n\n\n\n #[test]\n\n fn test_index_sort_int() {\n","file_path":"src/indexer/sort.rs","rank":50,"score":68361.20121356468},{"content":" let idx = Indexer::new(vec![5, 4, 3, 2, 1]);\n\n let sorted = idx.sort();\n\n assert_eq!(sorted, Indexer::new(vec![1, 2, 3, 4, 5]));\n\n }\n\n\n\n #[test]\n\n fn test_index_argsort_str() {\n\n let idx = Indexer::new(vec![\"d\", \"b\", \"a\", \"c\"]);\n\n let (indexer, sorted) = idx.argsort();\n\n assert_eq!(indexer, vec![2, 1, 3, 0]);\n\n assert_eq!(sorted, Indexer::new(vec![\"a\", \"b\", \"c\", \"d\"]));\n\n }\n\n\n\n #[test]\n\n fn test_index_sort_str() {\n\n let idx = Indexer::new(vec![\"d\", \"b\", \"a\", \"c\"]);\n\n let sorted = idx.sort();\n\n assert_eq!(sorted, Indexer::new(vec![\"a\", \"b\", \"c\", \"d\"]));\n\n }\n\n}\n","file_path":"src/indexer/sort.rs","rank":51,"score":68355.1590755059},{"content":"use std::borrow::Cow;\n\nuse std::hash::Hash;\n\n\n\nuse super::Indexer;\n\n\n\n/// /////////////////////////////////////////////////////////////////////////////\n\n/// From / Into\n\n/// /////////////////////////////////////////////////////////////////////////////\n\n\n\nimpl<T: Clone + Eq + Hash> From<Vec<T>> for Indexer<T> {\n\n fn from(values: Vec<T>) -> Self {\n\n Indexer::new(values)\n\n }\n\n}\n\n\n\nimpl<T: Clone + Hash> Into<Vec<T>> for Indexer<T> {\n\n fn into(self) -> Vec<T> {\n\n self.values\n\n }\n\n}\n","file_path":"src/indexer/convert.rs","rank":52,"score":68319.80805874459},{"content":"\n\n/// /////////////////////////////////////////////////////////////////////////////\n\n/// Clone on Write\n\n/// /////////////////////////////////////////////////////////////////////////////\n\n\n\nimpl<'a, T: Clone + Hash> Into<Cow<'a, Indexer<T>>> for Indexer<T> {\n\n fn into(self) -> Cow<'a, Self> {\n\n Cow::Owned(self)\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n\n\n use super::super::Indexer;\n\n\n\n #[test]\n\n fn test_i64_vec_to_indexer() {\n\n let exp: Indexer<i64> = Indexer::new(vec![1, 2, 3]);\n\n\n","file_path":"src/indexer/convert.rs","rank":53,"score":68314.0404092785},{"content":" let idx: Indexer<i64> = vec![1, 2, 3].into();\n\n assert_eq!(idx, exp);\n\n\n\n let idx: Indexer<i64> = Indexer::from(vec![1, 2, 3]);\n\n assert_eq!(idx, exp);\n\n }\n\n\n\n #[test]\n\n fn test_i64_indexer_to_vec() {\n\n let exp: Vec<i64> = vec![1, 2, 3];\n\n\n\n let idx: Indexer<i64> = Indexer::new(vec![1, 2, 3]);\n\n let conv: Vec<i64> = idx.into();\n\n assert_eq!(conv, exp);\n\n\n\n // let idx: Indexer<i64> = Indexer::new(vec![1, 2, 3]);\n\n // let conv: Vec<i64> = Vec::from(idx.into());\n\n // assert_eq!(conv, exp);\n\n //\n\n }\n","file_path":"src/indexer/convert.rs","rank":54,"score":68303.77169829237},{"content":"\n\n #[test]\n\n fn test_str_vec_to_indexer() {\n\n let exp: Indexer<&str> = Indexer::new(vec![\"a\", \"b\", \"c\"]);\n\n\n\n let idx: Indexer<&str> = vec![\"a\", \"b\", \"c\"].into();\n\n assert_eq!(idx, exp);\n\n\n\n let idx: Indexer<&str> = Indexer::from(vec![\"a\", \"b\", \"c\"]);\n\n assert_eq!(idx, exp);\n\n }\n\n\n\n #[test]\n\n fn test_str_indexer_to_vec() {\n\n let exp: Vec<&str> = vec![\"a\", \"b\", \"c\"];\n\n\n\n let idx: Indexer<&str> = Indexer::new(vec![\"a\", \"b\", \"c\"]);\n\n let conv: Vec<&str> = idx.into();\n\n assert_eq!(conv, exp);\n\n\n","file_path":"src/indexer/convert.rs","rank":55,"score":68303.64731766502},{"content":" // let idx: Indexer<&str> = Indexer::new(vec![\"a\", \"b\", \"c\"]);\n\n // let conv: Vec<&str> = Vec::from(idx.into());\n\n // assert_eq!(conv, exp);\n\n //\n\n }\n\n\n\n #[test]\n\n fn test_string_vec_to_indexer() {\n\n let exp: Indexer<String> =\n\n Indexer::new(vec![\"a\".to_string(), \"b\".to_string(), \"c\".to_string()]);\n\n\n\n let idx: Indexer<String> = vec![\"a\".to_string(), \"b\".to_string(), \"c\".to_string()].into();\n\n assert_eq!(idx, exp);\n\n\n\n let idx: Indexer<String> =\n\n Indexer::from(vec![\"a\".to_string(), \"b\".to_string(), \"c\".to_string()]);\n\n assert_eq!(idx, exp);\n\n }\n\n\n\n #[test]\n","file_path":"src/indexer/convert.rs","rank":56,"score":68303.49768667895},{"content":" fn test_string_indexer_to_vec() {\n\n let exp: Vec<String> = vec![\"a\".to_string(), \"b\".to_string(), \"c\".to_string()];\n\n\n\n let idx: Indexer<String> =\n\n Indexer::new(vec![\"a\".to_string(), \"b\".to_string(), \"c\".to_string()]);\n\n let conv: Vec<String> = idx.into();\n\n assert_eq!(conv, exp);\n\n\n\n }\n\n}\n","file_path":"src/indexer/convert.rs","rank":57,"score":68302.2684425825},{"content":"use std::fmt;\n\nuse std::hash::Hash;\n\n\n\nuse super::Indexer;\n\n\n\n// Formatting\n\n\n\nimpl<U> fmt::Display for Indexer<U>\n\nwhere\n\n U: Clone + Eq + Hash + fmt::Debug,\n\n{\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n return write!(f, \"Index({:?})\", &self.values);\n\n }\n\n}\n\n\n\nimpl<U> fmt::Debug for Indexer<U>\n\nwhere\n\n U: Clone + Eq + Hash + fmt::Debug,\n\n{\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n return write!(f, \"Index({:?})\", &self.values);\n\n }\n\n}\n","file_path":"src/indexer/formatting.rs","rank":58,"score":68169.9845212978},{"content":"pub fn union<T>(a: &[T], b: &[T]) -> Vec<T>\n\nwhere\n\n T: Clone + Hash + Eq,\n\n{\n\n // Use HashMap to keep the order\n\n\n\n // Clone for result Vec\n\n let mut res: Vec<T> = a.to_vec();\n\n\n\n let set = CowCollections::to_hashset(a);\n\n\n\n for key in b.iter() {\n\n if !set.contains(&Cow::Borrowed(key)) {\n\n // do not clone if no need to insert\n\n res.push((*key).clone());\n\n }\n\n }\n\n res\n\n}\n\n\n","file_path":"src/algos/set.rs","rank":59,"score":68004.14272212569},{"content":"use std::hash::Hash;\n\nuse std::ops::{Add, Mul, Sub, Div, Rem, BitAnd, BitOr, BitXor};\n\n\n\nuse super::Indexer;\n\nuse nullvec::prelude::dev::algos::Elemwise;\n\n\n\nmacro_rules! define_numeric_op {\n\n ($t:ident, $m:ident) => {\n\n\n\n // Broadcast\n\n impl<U, O> $t<U> for Indexer<U>\n\n where U: Clone + Eq + Hash + $t<Output=O>,\n\n O: Clone + Eq + Hash {\n\n\n\n type Output = Indexer<O>;\n\n fn $m(self, _rhs: U) -> Self::Output {\n\n let new_values: Vec<O> = Elemwise::broadcast_oo(self.values, _rhs, |x, y| x.$m(y));\n\n Indexer::new(new_values)\n\n }\n\n }\n","file_path":"src/indexer/ops.rs","rank":60,"score":67499.89458388012},{"content":"\n\n impl<'a, U, O> $t<&'a U> for Indexer<U>\n\n where U: Clone + Eq + Hash + $t<Output=O>,\n\n O: Clone + Eq + Hash {\n\n\n\n type Output = Indexer<O>;\n\n fn $m(self, _rhs: &U) -> Self::Output {\n\n let new_values: Vec<O> = Elemwise::broadcast_or(self.values, _rhs, |x, y| x.$m(y));\n\n Indexer::new(new_values)\n\n }\n\n }\n\n\n\n impl<'b, U, O> $t<U> for &'b Indexer<U>\n\n where U: Clone + Eq + Hash + $t<Output=O>,\n\n O: Clone + Eq + Hash {\n\n\n\n // can't use self as impl is for reference?\n\n type Output = Indexer<O>;\n\n fn $m(self, _rhs: U) -> Self::Output {\n\n let new_values: Vec<O> = Elemwise::broadcast_ro(&self.values, _rhs, |x, y| x.$m(y));\n","file_path":"src/indexer/ops.rs","rank":61,"score":67499.29751781044},{"content":" }\n\n\n\n impl<'b, U, O> $t<Indexer<U>> for &'b Indexer<U>\n\n where U: Clone + Eq + Hash + $t<Output=O>,\n\n O: Clone + Eq + Hash {\n\n\n\n type Output = Indexer<O>;\n\n fn $m(self, _rhs: Indexer<U>) -> Self::Output {\n\n let new_values: Vec<O> = Elemwise::elemwise_ro(&self.values,\n\n _rhs.values,\n\n |x, y| x.$m(y));\n\n Indexer::new(new_values)\n\n }\n\n }\n\n\n\n impl<'a, 'b, U, O> $t<&'a Indexer<U>> for &'b Indexer<U>\n\n where U: Clone + Eq + Hash + $t<Output=O>,\n\n O: Clone + Eq + Hash {\n\n\n\n type Output = Indexer<O>;\n","file_path":"src/indexer/ops.rs","rank":62,"score":67497.92647918838},{"content":" Indexer::new(new_values)\n\n }\n\n }\n\n\n\n impl<'a, 'b, U, O> $t<&'a U> for &'b Indexer<U>\n\n where U: Clone + Eq + Hash + $t<Output=O>,\n\n O: Clone + Eq + Hash {\n\n\n\n type Output = Indexer<O>;\n\n fn $m(self, _rhs: &U) -> Self::Output {\n\n let new_values: Vec<O> = Elemwise::broadcast_rr(&self.values, _rhs, |x, y| x.$m(y));\n\n Indexer::new(new_values)\n\n }\n\n }\n\n\n\n // Element-wise\n\n impl<U, O> $t<Indexer<U>> for Indexer<U>\n\n where U: Clone + Eq + Hash + $t<Output=O>,\n\n O: Clone + Eq + Hash {\n\n\n","file_path":"src/indexer/ops.rs","rank":63,"score":67497.6649964894},{"content":" type Output = Indexer<O>;\n\n fn $m(self, _rhs: Self) -> Self::Output {\n\n let new_values: Vec<O> = Elemwise::elemwise_oo(self.values,\n\n _rhs.values,\n\n |x, y| x.$m(y));\n\n Indexer::new(new_values)\n\n }\n\n }\n\n\n\n impl<'a, U, O> $t<&'a Indexer<U>> for Indexer<U>\n\n where U: Clone + Eq + Hash + $t<Output=O>,\n\n O: Clone + Eq + Hash {\n\n\n\n type Output = Indexer<O>;\n\n fn $m(self, _rhs: &Self) -> Self::Output {\n\n let new_values: Vec<O> = Elemwise::elemwise_or(self.values,\n\n &_rhs.values,\n\n |x, y| x.$m(y));\n\n Indexer::new(new_values)\n\n }\n","file_path":"src/indexer/ops.rs","rank":64,"score":67496.82814377139},{"content":"#[cfg(test)]\n\nmod tests {\n\n\n\n use super::super::Indexer;\n\n\n\n #[test]\n\n fn test_index_ops_i64_broadcast() {\n\n let idx = Indexer::<i64>::new(vec![1, 2, 3]);\n\n // idx moves by ops\n\n assert_eq!(&(idx + 3).values, &vec![4, 5, 6]);\n\n\n\n let idx = Indexer::<i64>::new(vec![1, 2, 3]);\n\n assert_eq!(&(idx * 2).values, &vec![2, 4, 6]);\n\n\n\n let idx = Indexer::<i64>::new(vec![1, 2, 3]);\n\n assert_eq!(&(idx - 3).values, &vec![-2, -1, 0]);\n\n\n\n let idx = Indexer::<i64>::new(vec![1, 2, 3]);\n\n assert_eq!(&(idx / 2).values, &vec![0, 1, 1]);\n\n\n","file_path":"src/indexer/ops.rs","rank":65,"score":67490.50944122113},{"content":" fn $m(self, _rhs: &Indexer<U>) -> Self::Output {\n\n let new_values: Vec<O> = Elemwise::elemwise_rr(&self.values,\n\n &_rhs.values,\n\n |x, y| x.$m(y));\n\n Indexer::new(new_values)\n\n }\n\n }\n\n }\n\n}\n\n\n\ndefine_numeric_op!(Add, add);\n\ndefine_numeric_op!(Mul, mul);\n\ndefine_numeric_op!(Sub, sub);\n\ndefine_numeric_op!(Div, div);\n\ndefine_numeric_op!(Rem, rem);\n\ndefine_numeric_op!(BitAnd, bitand);\n\ndefine_numeric_op!(BitOr, bitor);\n\ndefine_numeric_op!(BitXor, bitxor);\n\n\n\n\n","file_path":"src/indexer/ops.rs","rank":66,"score":67486.95095419092},{"content":" let idx = Indexer::<i64>::new(vec![1, 2, 3]);\n\n assert_eq!(&(idx % 2).values, &vec![1, 0, 1]);\n\n }\n\n\n\n #[test]\n\n fn test_index_ops_i64_broadcast_refs() {\n\n let idx = Indexer::<i64>::new(vec![1, 2, 3]);\n\n assert_eq!(&(&idx + 3).values, &vec![4, 5, 6]);\n\n assert_eq!(&(&idx + &3).values, &vec![4, 5, 6]);\n\n assert_eq!(&(idx + &3).values, &vec![4, 5, 6]);\n\n }\n\n\n\n // ToDo\n\n // #[test]\n\n // fn test_index_ops_str_broadcast() {\n\n // let idx = Indexer::<String>::new(vec![\"a\".to_string(), \"b\".to_string(), \"c\".to_string()]);\n\n // idx moves by ops\n\n // let exp = Indexer::<String>::new(vec![\"ax\".to_string(), \"bx\".to_string(), \"cx\".to_string()]);\n\n // assert_eq!(idx + \"x\".to_string(), exp);\n\n // }\n","file_path":"src/indexer/ops.rs","rank":67,"score":67486.36718821581},{"content":" //\n\n\n\n #[test]\n\n fn test_index_ops_i64_elemwise() {\n\n let idx = Indexer::<i64>::new(vec![1, 2, 3]);\n\n let r = Indexer::<i64>::new(vec![1, 3, 2]);\n\n // idx moves by ops\n\n assert_eq!(&(idx + r).values, &vec![2, 5, 5]);\n\n\n\n let idx = Indexer::<i64>::new(vec![1, 2, 3]);\n\n let r = Indexer::<i64>::new(vec![1, 3, 2]);\n\n assert_eq!(&(idx * r).values, &vec![1, 6, 6]);\n\n\n\n let idx = Indexer::<i64>::new(vec![1, 2, 3]);\n\n let r = Indexer::<i64>::new(vec![1, 3, 2]);\n\n assert_eq!(&(idx - r).values, &vec![0, -1, 1]);\n\n\n\n let idx = Indexer::<i64>::new(vec![1, 2, 3]);\n\n let r = Indexer::<i64>::new(vec![1, 3, 2]);\n\n assert_eq!(&(idx / r).values, &vec![1, 0, 1]);\n","file_path":"src/indexer/ops.rs","rank":68,"score":67486.21206993534},{"content":"\n\n let idx = Indexer::<i64>::new(vec![1, 2, 3]);\n\n let r = Indexer::<i64>::new(vec![1, 3, 2]);\n\n assert_eq!(&(idx % r).values, &vec![0, 2, 1]);\n\n }\n\n\n\n #[test]\n\n fn test_index_ops_i64_elemwise_refs() {\n\n let idx = Indexer::<i64>::new(vec![1, 2, 3]);\n\n let r = Indexer::<i64>::new(vec![1, 3, 2]);\n\n\n\n assert_eq!(&(&idx + r).values, &vec![2, 5, 5]);\n\n\n\n let r = Indexer::<i64>::new(vec![1, 3, 2]);\n\n assert_eq!(&(&idx + &r).values, &vec![2, 5, 5]);\n\n assert_eq!(&(idx + &r).values, &vec![2, 5, 5]);\n\n }\n\n}\n","file_path":"src/indexer/ops.rs","rank":69,"score":67485.94311253112},{"content":"#[test]\n\nfn test_read_csv_error_different_items() {\n\n let data = \"A,B,C\n\n1,7,1.1\n\n1,3\n\n1,1,4.5\";\n\n let rdr = csv::ReaderBuilder::new().has_headers(true).from_reader(\n\n data.as_bytes(),\n\n );\n\n let res = DataFrame::<usize, String>::read_csv(rdr);\n\n assert!(res.is_err())\n\n}\n\n\n","file_path":"tests/io_csv.rs","rank":80,"score":67125.64892204807},{"content":"pub trait Description<'s>\n\n : BasicAggregation<'s> + NumericAggregation<'s> + ComparisonAggregation<'s> {\n\n type Described;\n\n\n\n fn describe(&'s self) -> Self::Described;\n\n}\n","file_path":"src/traits.rs","rank":81,"score":51731.70511955398},{"content":"/// Join by index\n\npub trait Join: Sized {\n\n fn join_inner(&self, other: &Self) -> Self;\n\n}\n\n\n","file_path":"src/traits.rs","rank":82,"score":50278.756690106675},{"content":"pub trait NumericAggregation<'s> {\n\n // result which is coerced (to f64 or its container)\n\n type Coerced;\n\n\n\n fn mean(&'s self) -> Self::Coerced;\n\n fn var(&'s self) -> Self::Coerced;\n\n fn unbiased_var(&'s self) -> Self::Coerced;\n\n fn std(&'s self) -> Self::Coerced;\n\n fn unbiased_std(&'s self) -> Self::Coerced;\n\n}\n\n\n","file_path":"src/traits.rs","rank":83,"score":50274.68715438919},{"content":"pub trait BasicAggregation<'s> {\n\n // result which can keep current dtype\n\n type Kept;\n\n // result for count (to usize or its container)\n\n type Counted;\n\n\n\n fn sum(&'s self) -> Self::Kept;\n\n fn count(&'s self) -> Self::Counted;\n\n}\n\n\n","file_path":"src/traits.rs","rank":84,"score":50274.68715438919},{"content":"pub trait ComparisonAggregation<'s> {\n\n type Kept;\n\n\n\n fn min(&'s self) -> Self::Kept;\n\n fn max(&'s self) -> Self::Kept;\n\n}\n\n\n","file_path":"src/traits.rs","rank":85,"score":50274.68715438919},{"content":"pub trait Grouper<T> {\n\n // ToDo: Implement efficient multimap\n\n fn groupby(key: &[T]) -> HashGrouper<T>;\n\n fn get(&self, key: &T) -> Option<&Vec<usize>>;\n\n fn keys(&self) -> Vec<T>;\n\n fn len(&self) -> usize;\n\n}\n\n\n\nimpl<T> Grouper<T> for HashGrouper<T>\n\nwhere\n\n T: Clone + Hash + Eq,\n\n{\n\n fn groupby(key: &[T]) -> HashGrouper<T> {\n\n\n\n let mut map: HashMap<T, Vec<usize>> = HashMap::new();\n\n\n\n for (i, k) in key.iter().enumerate() {\n\n let e = map.entry(k.clone()).or_insert_with(Vec::<usize>::new);\n\n e.push(i);\n\n }\n","file_path":"src/algos/grouper.rs","rank":86,"score":48941.50958291056},{"content":"pub trait Apply<'s, R> {\n\n // R: Type function returns, dummy to avoid unconstrained lifetime parameter\n\n\n\n type In;\n\n type FOut;\n\n type Out;\n\n\n\n fn apply<'f>(&'s self, func: &'f Fn(&Self::In) -> Self::FOut) -> Self::Out;\n\n}\n\n\n","file_path":"src/traits.rs","rank":87,"score":48296.33545878603},{"content":"/// Concatenate along columns\n\npub trait Concatenation<'s>: Sized {\n\n fn concat<'o>(&'s self, other: &'o Self) -> Self;\n\n}\n\n\n","file_path":"src/traits.rs","rank":88,"score":48296.33545878603},{"content":"fn main() {\n\n // cargo build --example series\n\n // ./target/debug/examples/series\n\n\n\n println!(\"** Creation **\");\n\n let values: Vec<i64> = vec![1, 2, 3, 4, 3];\n\n let index: Vec<i64> = vec![10, 20, 30, 40, 50];\n\n let s = Series::<i64, i64>::new(values, index);\n\n\n\n println!(\"{:?}\\n\", &s);\n\n\n\n println!(\"** Selection **\");\n\n println!(\"by multiple index labels\\n{:?}\\n\", &s.locs(&[10, 40, 50]));\n\n println!(\"by multiple index locations\\n{:?}\\n\", &s.ilocs(&[2, 3, 4]));\n\n\n\n println!(\"** Calculation **\");\n\n println!(\"elemwise\\n{:?}\\n\", &(&s + 1));\n\n println!(\"sum\\n{:?}\\n\", &s.sum());\n\n println!(\"describe\\n{:?}\\n\", &s.describe());\n\n println!(\"histogram\\n{:?}\\n\", s.value_counts());\n\n\n\n println!(\"** Group By **\");\n\n let sg = s.groupby(&[1, 1, 1, 2, 2]);\n\n // println!(\"{:?}\", sg.grouper);\n\n println!(\"{:?}\\n\", sg.get_group(&1));\n\n println!(\"{:?}\\n\", sg.sum());\n\n}\n","file_path":"examples/series.rs","rank":89,"score":47734.42391682647},{"content":"fn main() {\n\n // cargo build --example frame\n\n // ./target/debug/examples/frame\n\n\n\n println!(\"** Creation **\");\n\n let values = vec![\n\n array![1, 2, 3, 4, 5],\n\n array![6.1, 7.1, 8.1, 9.1, 10.1],\n\n array![11, 12, 13, 14, 15],\n\n ];\n\n let df = DataFrame::from_vec(values, vec![10, 20, 30, 40, 50], vec![\"X\", \"YYY\", \"ZZ\"]);\n\n println!(\"{:?}\\n\", &df);\n\n\n\n println!(\"** Selection **\");\n\n\n\n println!(\"by multiple index labels\\n{:?}\\n\", &df.locs(&[20, 30, 40]));\n\n println!(\"by multiple index locations\\n{:?}\\n\", &df.ilocs(&[0, 2, 1]));\n\n\n\n println!(\"** GroupBy **\");\n\n let dg = df.groupby(&[\"A\", \"A\", \"B\", \"A\", \"B\"]);\n\n println!(\"get group\\n{:?}\\n\", &dg.get_group(&\"A\"));\n\n\n\n println!(\"** Reshaping **\");\n\n let values2 = vec![array![1.1, 2.1, 3.1], array![6, 7, 8]];\n\n let df2 = DataFrame::from_vec(values2, vec![20, 30, 40], vec![\"X2\", \"Y2\"]);\n\n let j = df.join_inner(&df2);\n\n println!(\"inner join\\n{:?}\\n\", &j);\n\n}\n","file_path":"examples/frame.rs","rank":90,"score":47734.42391682647},{"content":"pub trait NanMinMax<A> {\n\n fn nanmin(&self, n: A) -> A;\n\n fn nanmax(&self, n: A) -> A;\n\n fn nanmin_value() -> A;\n\n fn nanmax_value() -> A;\n\n}\n\n\n\nmacro_rules! define_int_stats {\n\n ($t:ident) => {\n\n impl NanMinMax<$t> for $t {\n\n fn nanmin(&self, n: $t) -> $t {\n\n cmp::min(*self, n)\n\n }\n\n fn nanmax(&self, n: $t) -> $t {\n\n cmp::max(*self, n)\n\n }\n\n fn nanmin_value() -> $t {\n\n $t::min_value()\n\n }\n\n fn nanmax_value() -> $t {\n","file_path":"src/algos/computation.rs","rank":91,"score":47717.02717719646},{"content":"#[test]\n\nfn test_creation() {\n\n let iarr = array![1i64, 2, 3];\n\n assert_eq!(iarr.dtype(), \"i64\");\n\n assert_eq!(iarr.len(), 3);\n\n\n\n let farr = array![1.1f64, 2.1, 3.1, 4.1];\n\n assert_eq!(farr.dtype(), \"f64\");\n\n assert_eq!(farr.len(), 4);\n\n\n\n let barr = array![true, false, true];\n\n assert_eq!(barr.dtype(), \"bool\");\n\n assert_eq!(barr.len(), 3);\n\n\n\n let sarr = array![\"a\".to_string(), \"b\".to_string()];\n\n assert_eq!(sarr.dtype(), \"str\");\n\n assert_eq!(sarr.len(), 2);\n\n}\n\n\n","file_path":"tests/array.rs","rank":92,"score":46205.811104156135},{"content":"#[test]\n\nfn test_blocs() {\n\n let iarr = array![1i64, 2, 3];\n\n assert_eq!(iarr.dtype(), \"i64\");\n\n let ires = iarr.blocs(&vec![true, false, true]);\n\n assert_eq!(ires, array![1i64, 3]);\n\n\n\n let farr = array![1.1f64, 2.1, 3.1];\n\n assert_eq!(farr.dtype(), \"f64\");\n\n let fres = farr.blocs(&vec![true, false, true]);\n\n assert_eq!(fres, array![1.1f64, 3.1]);\n\n\n\n let barr = array![true, false, true];\n\n let bres = barr.blocs(&vec![true, false, true]);\n\n assert_eq!(bres, array![true, true]);\n\n\n\n let sarr = array![\"a\".to_string(), \"b\".to_string(), \"c\".to_string()];\n\n let sres = sarr.blocs(&vec![true, false, true]);\n\n assert_eq!(sres, array![\"a\".to_string(), \"c\".to_string()]);\n\n}\n\n\n","file_path":"tests/array.rs","rank":93,"score":46205.811104156135},{"content":"#[test]\n\nfn test_ilocs() {\n\n let iarr = array![1i64, 2, 3, 4, 5];\n\n assert_eq!(iarr.dtype(), \"i64\");\n\n assert_eq!(iarr.iloc(&2), Scalar::i64(3));\n\n let ires = iarr.ilocs(&vec![1, 4, 0]);\n\n assert_eq!(ires, array![2i64, 5, 1]);\n\n\n\n let farr = array![1.1f64, 2.1, 3.1, 4.1, 5.1];\n\n assert_eq!(farr.dtype(), \"f64\");\n\n assert_eq!(farr.iloc(&2), Scalar::f64(3.1));\n\n let fres = farr.ilocs(&vec![1, 4, 0]);\n\n assert_eq!(fres, array![2.1f64, 5.1, 1.1]);\n\n\n\n let barr = array![true, false, true, true];\n\n assert_eq!(barr.iloc(&2), Scalar::bool(true));\n\n let bres = barr.ilocs(&vec![1, 2]);\n\n assert_eq!(bres, array![false, true]);\n\n\n\n let sarr = array![\"a\".to_string(), \"b\".to_string(), \"c\".to_string()];\n\n assert_eq!(sarr.iloc(&2), Scalar::String(\"c\".to_string()));\n\n let sres = sarr.ilocs(&vec![2, 0]);\n\n assert_eq!(sres, array![\"c\".to_string(), \"a\".to_string()]);\n\n}\n\n\n","file_path":"tests/array.rs","rank":94,"score":46205.811104156135},{"content":"#[test]\n\nfn test_astype() {\n\n // let iarr = array![1i64, 2, 3];\n\n // assert_eq!(iarr.astype::<f64>(), array![1.0f64, 2., 3.]);\n\n // assert_eq!(iarr.astype::<i64>(), array![1i64, 2, 3]);\n\n\n\n // let farr = array![1.1f64, 2.1, 3.1];\n\n // assert_eq!(farr.astype::<f64>(), array![1.1f64, 2.1, 3.1]);\n\n // assert_eq!(farr.astype::<i64>(), array![1i64, 2, 3]);\n\n}\n\n\n\n\n","file_path":"tests/array.rs","rank":95,"score":46205.811104156135},{"content":"#[test]\n\nfn test_container() {\n\n let iarr: Array = vec![1i32, 2, 3].into();\n\n let farr: Array = vec![1.1f64, 2.1, 3.1].into();\n\n let barr: Array = vec![true, false, true].into();\n\n let sarr: Array = vec![\"a\".to_string(), \"b\".to_string(), \"c\".to_string()].into();\n\n assert_eq!(iarr.dtype(), \"i32\");\n\n assert_eq!(farr.dtype(), \"f64\");\n\n assert_eq!(barr.dtype(), \"bool\");\n\n assert_eq!(sarr.dtype(), \"str\");\n\n\n\n let container: Vec<Array> = vec![iarr, farr, barr, sarr];\n\n assert_eq!(container.len(), 4);\n\n let dtypes: Vec<String> = container.iter().map(|ref x| x.dtype()).collect();\n\n assert_eq!(dtypes, vec![\"i32\", \"f64\", \"bool\", \"str\"]);\n\n\n\n let i64arr: Array = vec![1i64, 2, 3].into();\n\n assert_eq!(i64arr.dtype(), \"i64\");\n\n}\n\n\n","file_path":"tests/array.rs","rank":96,"score":46205.811104156135},{"content":"#[test]\n\n#[should_panic]\n\nfn test_ilocs_panic() {\n\n let iarr = array![1i64, 2, 3, 4, 5];\n\n iarr.ilocs(&vec![1, 5, 0]);\n\n}\n\n\n","file_path":"tests/array.rs","rank":97,"score":44812.89058260212},{"content":"#[test]\n\nfn test_dtype_property() {\n\n let iarr = array![1i64, 2, 3];\n\n assert_eq!(iarr.dtype(), \"i64\");\n\n assert_eq!(iarr.is_numeric(), true);\n\n\n\n let farr = array![1.1f64, 2.1, 3.1, 4.1];\n\n assert_eq!(farr.dtype(), \"f64\");\n\n assert_eq!(farr.is_numeric(), true);\n\n\n\n let barr = array![true, false, true];\n\n assert_eq!(barr.dtype(), \"bool\");\n\n assert_eq!(barr.is_numeric(), false);\n\n\n\n let sarr = array![\"a\".to_string(), \"b\".to_string()];\n\n assert_eq!(sarr.dtype(), \"str\");\n\n assert_eq!(sarr.is_numeric(), false);\n\n}\n\n\n","file_path":"tests/array.rs","rank":98,"score":44812.89058260212},{"content":"#[test]\n\nfn test_creation_macros() {\n\n let iarr = array![1i32, 2, 3];\n\n assert_eq!(iarr.dtype(), \"i32\");\n\n assert_eq!(iarr.len(), 3);\n\n\n\n let i64arr = array![1i64, 2, 3];\n\n assert_eq!(i64arr.dtype(), \"i64\");\n\n assert_eq!(i64arr.len(), 3);\n\n\n\n let farr = array![1.1f64, 2.1, 3.1, 4.1];\n\n assert_eq!(farr.dtype(), \"f64\");\n\n assert_eq!(farr.len(), 4);\n\n\n\n let barr = array![true, false, true];\n\n assert_eq!(barr.dtype(), \"bool\");\n\n assert_eq!(barr.len(), 3);\n\n\n\n let str_arr = array![\"A\".to_string(), \"B\".to_string(), \"C\".to_string()];\n\n assert_eq!(str_arr.dtype(), \"str\");\n\n assert_eq!(str_arr.len(), 3);\n\n\n\n let string_arr = array![\"A\".to_string(), \"B\".to_string(), \"C\".to_string()];\n\n assert_eq!(string_arr.dtype(), \"str\");\n\n assert_eq!(string_arr.len(), 3);\n\n}\n\n\n","file_path":"tests/array.rs","rank":99,"score":44812.89058260212}],"string":"[\n {\n \"content\": \"/// Indexing methods for Indexer\\n\\npub trait IndexerIndex: Slicer {\\n\\n type Key;\\n\\n\\n\\n fn contains(&self, label: &Self::Key) -> bool;\\n\\n fn push(&mut self, label: Self::Key);\\n\\n fn get_loc(&self, label: &Self::Key) -> usize;\\n\\n fn get_locs(&self, labels: &[Self::Key]) -> Vec<usize>;\\n\\n\\n\\n // temp\\n\\n fn init_state(&self);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/traits.rs\",\n \"rank\": 0,\n \"score\": 157291.8134599632\n },\n {\n \"content\": \"/// Get max number of characters in a vector of String\\n\\nfn get_width(values: &[String]) -> usize {\\n\\n values.iter().map(|x| x.len()).max().unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/formatting.rs\",\n \"rank\": 1,\n \"score\": 124450.86924839573\n },\n {\n \"content\": \"#[test]\\n\\nfn test_index_append() {\\n\\n let index1: Indexer<i64> = Indexer::new(vec![1, 2, 3]);\\n\\n let index2: Indexer<i64> = Indexer::new(vec![4, 5, 6]);\\n\\n let res = index1.append(&index2);\\n\\n\\n\\n let exp: Indexer<i64> = Indexer::new(vec![1, 2, 3, 4, 5, 6]);\\n\\n assert_eq!(res, exp)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/indexer.rs\",\n \"rank\": 2,\n \"score\": 116513.63204324586\n },\n {\n \"content\": \"/// Convert passed values to Vec of equally padded String\\n\\npub fn pad_string_vector<T: ToString>(values: &[T]) -> Vec<String> {\\n\\n let strs = to_string_vector(values);\\n\\n let pad = get_width(&strs);\\n\\n strs.iter().map(|x| pad_str(x, pad)).collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/formatting.rs\",\n \"rank\": 3,\n \"score\": 113888.41398575073\n },\n {\n \"content\": \"#[test]\\n\\nfn test_index_loc_str() {\\n\\n let values: Vec<&str> = vec![\\\"A\\\", \\\"B\\\", \\\"C\\\"];\\n\\n let idx = Indexer::<&str>::new(values);\\n\\n\\n\\n assert_eq!(idx.get_loc(&\\\"B\\\"), 1);\\n\\n assert_eq!(idx.get_loc(&\\\"C\\\"), 2);\\n\\n\\n\\n assert_eq!(idx.get_locs(&vec![\\\"B\\\", \\\"C\\\"]), vec![1, 2]);\\n\\n assert_eq!(idx.get_locs(&vec![\\\"A\\\", \\\"C\\\"]), vec![0, 2]);\\n\\n\\n\\n assert_eq!(idx.contains(&\\\"C\\\"), true);\\n\\n assert_eq!(idx.contains(&\\\"X\\\"), false);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/indexer.rs\",\n \"rank\": 4,\n \"score\": 112794.00298848879\n },\n {\n \"content\": \"#[test]\\n\\nfn test_index_loc_int64() {\\n\\n let values: Vec<i64> = vec![1, 2, 3];\\n\\n let idx = Indexer::<i64>::new(values);\\n\\n\\n\\n assert_eq!(idx.get_loc(&1), 0);\\n\\n assert_eq!(idx.get_loc(&3), 2);\\n\\n\\n\\n assert_eq!(idx.get_locs(&vec![1, 3]), vec![0, 2]);\\n\\n assert_eq!(idx.get_locs(&vec![3, 2]), vec![2, 1]);\\n\\n\\n\\n assert_eq!(idx.contains(&1), true);\\n\\n assert_eq!(idx.contains(&5), false);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/indexer.rs\",\n \"rank\": 5,\n \"score\": 112794.00298848879\n },\n {\n \"content\": \"#[test]\\n\\nfn test_clone() {\\n\\n let i = Scalar::i64(1);\\n\\n assert_eq!(i, i.clone());\\n\\n}\\n\",\n \"file_path\": \"tests/scalar.rs\",\n \"rank\": 6,\n \"score\": 112290.25309379966\n },\n {\n \"content\": \"/// Convert passed values and header to Vec of equally padded String\\n\\npub fn pad_string_vector_with_header<T: ToString>(values: &[T], header: String) -> Vec<String> {\\n\\n let mut strs = to_string_vector(values);\\n\\n strs.insert(0, header);\\n\\n pad_string_vector(&strs)\\n\\n}\\n\\n\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n\\n\\n #[test]\\n\\n fn test_to_string_vector_int() {\\n\\n let values: Vec<i64> = vec![1, 2, 3, 4, 5];\\n\\n let s = super::to_string_vector(&values);\\n\\n\\n\\n let exp_values: Vec<&str> = vec![\\\"1\\\", \\\"2\\\", \\\"3\\\", \\\"4\\\", \\\"5\\\"];\\n\\n assert_eq!(&s, &exp_values);\\n\\n assert_eq!(&super::get_width(&s), &1);\\n\\n\\n\\n let values: Vec<i64> = vec![10, 200, 30, 4, 50];\\n\",\n \"file_path\": \"src/formatting.rs\",\n \"rank\": 7,\n \"score\": 102691.81124462563\n },\n {\n \"content\": \"/// Concatenate along row\\n\\npub trait Append<'s>: Sized {\\n\\n fn append<'o>(&'s self, other: &'o Self) -> Self;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/traits.rs\",\n \"rank\": 8,\n \"score\": 97282.89918835193\n },\n {\n \"content\": \"fn default_columns(n: usize) -> Vec<String> {\\n\\n let columns: Vec<usize> = (0..n).collect();\\n\\n columns.into_iter().map(|x| x.to_string()).collect()\\n\\n}\\n\\n\\n\\nimpl<'a, I, C> DataFrame<'a, 'a, 'a, I, C>\\n\\nwhere\\n\\n I: Clone + Eq + Hash,\\n\\n C: Clone + Eq + Hash,\\n\\n{\\n\\n pub fn read_csv<R: Read>(\\n\\n mut reader: csv::Reader<R>,\\n\\n ) -> Result<DataFrame<'a, 'a, 'a, usize, String>, csv::Error> {\\n\\n\\n\\n // headers read 1st row regardless of has_headers property. Need to clone to avoid double\\n\\n // borrow in this function\\n\\n let header = reader.headers()?.clone();\\n\\n let columns: Vec<String> = if reader.has_headers() {\\n\\n header.iter().map(|s| s.to_string()).collect()\\n\\n } else {\\n\",\n \"file_path\": \"src/io/mod.rs\",\n \"rank\": 9,\n \"score\": 90595.34363922616\n },\n {\n \"content\": \"fn pad_str(s: &str, pad: usize) -> String {\\n\\n let len = s.len();\\n\\n // ToDo: fix, can use dynamic formatter in format! macro?\\n\\n if len < pad {\\n\\n let mut new = \\\"\\\".to_string();\\n\\n for _ in 0..(pad - len) {\\n\\n new.push(' ');\\n\\n }\\n\\n new.push_str(s);\\n\\n new\\n\\n } else {\\n\\n s.to_string()\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/formatting.rs\",\n \"rank\": 10,\n \"score\": 90393.06191062622\n },\n {\n \"content\": \"#[test]\\n\\nfn test_dataframe_format() {\\n\\n let values = vec![\\n\\n array![1, 2, 3, 4, 5],\\n\\n array![6.1, 7.1, 8.1, 9.1, 10.1],\\n\\n array![11, 12, 13, 14, 15],\\n\\n ];\\n\\n let df = DataFrame::from_vec(values, vec![10, 20, 30, 40, 50], vec![\\\"X\\\", \\\"YYY\\\", \\\"ZZ\\\"]);\\n\\n\\n\\n // better way?\\n\\n let mut buf = Vec::new();\\n\\n let _ = write!(&mut buf, \\\"{}\\\", df);\\n\\n let res = str::from_utf8(&buf).unwrap();\\n\\n assert_eq!(res, \\\"DataFrame(columns=[\\\\\\\"X\\\\\\\", \\\\\\\"YYY\\\\\\\", \\\\\\\"ZZ\\\\\\\"])\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/format.rs\",\n \"rank\": 11,\n \"score\": 85776.07296302333\n },\n {\n \"content\": \"#[test]\\n\\nfn test_series_format() {\\n\\n let s = Series::new(vec![1, 10, 100], vec![\\\"XX\\\", \\\"Y\\\", \\\"ZZ\\\"]);\\n\\n\\n\\n // better way?\\n\\n let mut buf = Vec::new();\\n\\n let _ = write!(&mut buf, \\\"{}\\\", s);\\n\\n assert_eq!(&buf, b\\\"Series([1, 10, 100])\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/format.rs\",\n \"rank\": 12,\n \"score\": 85776.07296302333\n },\n {\n \"content\": \"#[test]\\n\\nfn test_index_iter() {\\n\\n let index: Indexer<i64> = Indexer::new(vec![1, 2, 3]);\\n\\n let mut it = index.iter();\\n\\n assert_eq!(it.next(), Some(&1));\\n\\n assert_eq!(it.next(), Some(&2));\\n\\n assert_eq!(it.next(), Some(&3));\\n\\n assert_eq!(it.next(), None);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/indexer.rs\",\n \"rank\": 13,\n \"score\": 85001.64562710834\n },\n {\n \"content\": \"#[test]\\n\\nfn test_index_from_iter() {\\n\\n let index: Indexer<i64> = (3..6).collect();\\n\\n let exp: Indexer<i64> = Indexer::new(vec![3, 4, 5]);\\n\\n assert_eq!(index, exp);\\n\\n}\\n\",\n \"file_path\": \"tests/indexer.rs\",\n \"rank\": 14,\n \"score\": 85001.64562710834\n },\n {\n \"content\": \"#[test]\\n\\nfn test_index_push() {\\n\\n let values: Vec<&str> = vec![\\\"A\\\", \\\"B\\\", \\\"C\\\"];\\n\\n let mut idx = Indexer::<&str>::new(values);\\n\\n\\n\\n let exp_index: Vec<&str> = vec![\\\"A\\\", \\\"B\\\", \\\"C\\\"];\\n\\n assert_eq!(idx.values, exp_index);\\n\\n assert_eq!(idx.len(), 3);\\n\\n assert_eq!(idx.get_loc(&\\\"C\\\"), 2);\\n\\n\\n\\n idx.push(\\\"D\\\");\\n\\n assert_eq!(idx.len(), 4);\\n\\n assert_eq!(idx.get_loc(&\\\"C\\\"), 2);\\n\\n assert_eq!(idx.get_loc(&\\\"D\\\"), 3);\\n\\n\\n\\n idx.push(\\\"E\\\");\\n\\n assert_eq!(idx.len(), 5);\\n\\n assert_eq!(idx.get_loc(&\\\"D\\\"), 3);\\n\\n assert_eq!(idx.get_loc(&\\\"E\\\"), 4);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/indexer.rs\",\n \"rank\": 15,\n \"score\": 85001.64562710834\n },\n {\n \"content\": \"#[test]\\n\\nfn test_index_into_iter() {\\n\\n let index: Indexer<i64> = Indexer::new(vec![1, 2, 3]);\\n\\n let mut it = index.into_iter();\\n\\n assert_eq!(it.next(), Some(1));\\n\\n assert_eq!(it.next(), Some(2));\\n\\n assert_eq!(it.next(), Some(3));\\n\\n assert_eq!(it.next(), None);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/indexer.rs\",\n \"rank\": 16,\n \"score\": 85001.64562710834\n },\n {\n \"content\": \"/// Convert each element in a vector to String\\n\\nfn to_string_vector<T: ToString>(values: &[T]) -> Vec<String> {\\n\\n values.iter().map(|x| x.to_string()).collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/formatting.rs\",\n \"rank\": 17,\n \"score\": 83736.98946383604\n },\n {\n \"content\": \"#[test]\\n\\nfn test_series_format_debug() {\\n\\n let s = Series::new(vec![1, 10, 100], vec![\\\"XX\\\", \\\"Y\\\", \\\"ZZ\\\"]);\\n\\n\\n\\n // better way?\\n\\n let mut buf = Vec::new();\\n\\n let _ = write!(&mut buf, \\\"{:?}\\\", s);\\n\\n assert_eq!(\\n\\n &buf,\\n\\n b\\\"XX 1\\n\\n Y 10\\n\\nZZ 100\\\"\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/format.rs\",\n \"rank\": 18,\n \"score\": 83346.90997452577\n },\n {\n \"content\": \"#[test]\\n\\nfn test_dataframe_format_debug() {\\n\\n let values = vec![\\n\\n array![1, 2, 3, 4, 5],\\n\\n array![6.1, 7.1, 8.1, 9.1, 10.1],\\n\\n array![11, 12, 13, 14, 15],\\n\\n ];\\n\\n let df = DataFrame::from_vec(values, vec![10, 20, 30, 40, 50], vec![\\\"X\\\", \\\"YYY\\\", \\\"ZZ\\\"]);\\n\\n\\n\\n // better way?\\n\\n let mut buf = Vec::new();\\n\\n let _ = write!(&mut buf, \\\"{:?}\\\", df);\\n\\n let res = str::from_utf8(&buf).unwrap();\\n\\n assert_eq!(\\n\\n res,\\n\\n \\\" X YYY ZZ\\n\\n10 1 6.1 11\\n\\n20 2 7.1 12\\n\\n30 3 8.1 13\\n\\n40 4 9.1 14\\n\\n50 5 10.1 15\\\"\\n\\n );\\n\\n}\\n\",\n \"file_path\": \"tests/format.rs\",\n \"rank\": 19,\n \"score\": 83346.90997452577\n },\n {\n \"content\": \"#[test]\\n\\nfn test_index_iloc_ilocs() {\\n\\n let values: Vec<i64> = vec![1, 2, 3];\\n\\n let idx = Indexer::<i64>::new(values);\\n\\n\\n\\n assert_eq!(idx.iloc(&0), 1);\\n\\n assert_eq!(idx.iloc(&2), 3);\\n\\n\\n\\n assert_eq!(idx.ilocs(&[2, 0]), Indexer::<i64>::new(vec![3, 1]));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/indexer.rs\",\n \"rank\": 20,\n \"score\": 82594.31152828998\n },\n {\n \"content\": \"#[test]\\n\\nfn test_index_creation_string() {\\n\\n let values: Vec<String> = vec![\\\"A\\\".to_string(), \\\"B\\\".to_string(), \\\"C\\\".to_string()];\\n\\n let idx = Indexer::<String>::new(values);\\n\\n\\n\\n let exp_index: Vec<String> = vec![\\\"A\\\".to_string(), \\\"B\\\".to_string(), \\\"C\\\".to_string()];\\n\\n assert_eq!(idx.values, exp_index);\\n\\n assert_eq!(idx.len(), 3);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/indexer.rs\",\n \"rank\": 21,\n \"score\": 82594.31152828998\n },\n {\n \"content\": \"#[test]\\n\\nfn test_index_creation_str() {\\n\\n let values: Vec<&str> = vec![\\\"A\\\", \\\"B\\\", \\\"C\\\"];\\n\\n let idx = Indexer::<&str>::new(values);\\n\\n\\n\\n let exp_index: Vec<&str> = vec![\\\"A\\\", \\\"B\\\", \\\"C\\\"];\\n\\n assert_eq!(idx.values, exp_index);\\n\\n assert_eq!(idx.len(), 3);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/indexer.rs\",\n \"rank\": 22,\n \"score\": 82594.31152828998\n },\n {\n \"content\": \"#[test]\\n\\nfn test_index_creation_int64() {\\n\\n let values: Vec<i64> = vec![1, 2, 3];\\n\\n let idx = Indexer::<i64>::new(values);\\n\\n\\n\\n let exp_index: Vec<i64> = vec![1, 2, 3];\\n\\n assert_eq!(idx.values, exp_index);\\n\\n assert_eq!(idx.len(), 3);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/indexer.rs\",\n \"rank\": 23,\n \"score\": 82594.31152828998\n },\n {\n \"content\": \"#[test]\\n\\nfn test_index_creation_from_len() {\\n\\n let idx: Indexer<usize> = Indexer::<usize>::from_len(3);\\n\\n assert_eq!(idx.values, vec![0, 1, 2]);\\n\\n assert_eq!(idx.len(), 3);\\n\\n\\n\\n let idx: Indexer<usize> = Indexer::<usize>::from_len(0);\\n\\n assert_eq!(idx.values, vec![]);\\n\\n assert_eq!(idx.len(), 0);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/indexer.rs\",\n \"rank\": 24,\n \"score\": 82594.31152828998\n },\n {\n \"content\": \"fn main() {\\n\\n // cargo build --example indexer\\n\\n // ./target/debug/examples/indexer\\n\\n\\n\\n let values: Vec<i64> = vec![1, 2, 3, 4, 5];\\n\\n let indexer: Indexer<i64> = Indexer::new(values);\\n\\n // println!(\\\"{:}\\\", &s);\\n\\n println!(\\\"{:?}\\\", &indexer);\\n\\n println!(\\\"{:?}\\\", &indexer[2]);\\n\\n\\n\\n println!(\\\"{:?}\\\", &(indexer + 1));\\n\\n}\\n\",\n \"file_path\": \"examples/indexer.rs\",\n \"rank\": 25,\n \"score\": 81479.08507896558\n },\n {\n \"content\": \"#[test]\\n\\nfn test_eq() {\\n\\n let iarr1 = array![1i64, 2, 3];\\n\\n let iarr2 = array![2i64, 3, 4];\\n\\n let iarr3 = array![1i64, 2, 3, 4, 5];\\n\\n let iarr4 = array![1i64, 2, 3];\\n\\n assert_eq!(iarr1, iarr1);\\n\\n assert_eq!(iarr1 == iarr2, false);\\n\\n assert_eq!(iarr1 == iarr3, false);\\n\\n assert_eq!(iarr1, iarr4);\\n\\n\\n\\n let farr1 = array![1.0f64, 2., 3.];\\n\\n let farr2 = array![2.0f64, 3., 4.];\\n\\n let farr3 = array![1.0f64, 2., 3., 4., 5.];\\n\\n let farr4 = array![1.0f64, 2., 3.];\\n\\n assert_eq!(farr1, farr1);\\n\\n assert_eq!(farr1 == farr2, false);\\n\\n assert_eq!(farr1 == farr3, false);\\n\\n assert_eq!(farr1, farr4);\\n\\n\\n\\n // different types\\n\\n assert_eq!(iarr1 == farr1, false);\\n\\n assert_eq!(iarr2 == farr2, false);\\n\\n assert_eq!(iarr3 == farr3, false);\\n\\n assert_eq!(iarr4 == farr4, false);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/array.rs\",\n \"rank\": 26,\n \"score\": 79271.89581355159\n },\n {\n \"content\": \"#[test]\\n\\nfn test_clone() {\\n\\n let iarr1 = array![1i64, 2, 3];\\n\\n assert_eq!(iarr1, iarr1.clone());\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"tests/array.rs\",\n \"rank\": 27,\n \"score\": 79255.63667595378\n },\n {\n \"content\": \"#[test]\\n\\nfn test_creation() {\\n\\n let i = Scalar::i64(1);\\n\\n assert_eq!(i.dtype(), \\\"i64\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/scalar.rs\",\n \"rank\": 28,\n \"score\": 79240.42752200202\n },\n {\n \"content\": \"#[test]\\n\\nfn test_append() {\\n\\n let iarr1 = array![1i64, 2, 3];\\n\\n assert_eq!(iarr1.dtype(), \\\"i64\\\");\\n\\n\\n\\n let iarr2 = array![1i64, 2, 3];\\n\\n assert_eq!(iarr2.dtype(), \\\"i64\\\");\\n\\n\\n\\n let res = iarr1.append(&iarr2);\\n\\n assert_eq!(res.dtype(), \\\"i64\\\");\\n\\n\\n\\n let exp = array![1i64, 2, 3, 1, 2, 3];\\n\\n assert_eq!(res, exp);\\n\\n}\\n\",\n \"file_path\": \"tests/array.rs\",\n \"rank\": 29,\n \"score\": 79181.3898005327\n },\n {\n \"content\": \"#[test]\\n\\nfn test_copy() {\\n\\n let values: Vec<&str> = vec![\\\"A\\\", \\\"B\\\", \\\"C\\\"];\\n\\n let idx = Indexer::<&str>::new(values);\\n\\n\\n\\n // copy Indexer\\n\\n let copied = idx.clone();\\n\\n let exp_values: Vec<&str> = vec![\\\"A\\\", \\\"B\\\", \\\"C\\\"];\\n\\n assert_eq!(&copied.values, &exp_values);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/indexer.rs\",\n \"rank\": 30,\n \"score\": 78383.1821271088\n },\n {\n \"content\": \"#[test]\\n\\nfn test_reindex() {\\n\\n let idx = Indexer::<&str>::new(vec![\\\"A\\\", \\\"B\\\", \\\"C\\\"]);\\n\\n\\n\\n let res = idx.reindex(&vec![1, 0, 2]);\\n\\n assert_eq!(res, Indexer::new(vec![\\\"B\\\", \\\"A\\\", \\\"C\\\"]));\\n\\n\\n\\n let res = idx.reindex(&vec![1, 0, 2]);\\n\\n assert_eq!(res, Indexer::new(vec![\\\"B\\\", \\\"A\\\", \\\"C\\\"]));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/indexer.rs\",\n \"rank\": 31,\n \"score\": 78383.1821271088\n },\n {\n \"content\": \"#[test]\\n\\nfn test_equals() {\\n\\n let idx = Indexer::<&str>::new(vec![\\\"A\\\", \\\"B\\\", \\\"C\\\"]);\\n\\n\\n\\n let other = Indexer::<&str>::new(vec![\\\"A\\\", \\\"B\\\"]);\\n\\n assert_eq!(idx == other, false);\\n\\n\\n\\n let other = Indexer::<&str>::new(vec![\\\"A\\\", \\\"B\\\", \\\"X\\\"]);\\n\\n assert_eq!(idx == other, false);\\n\\n\\n\\n let other = Indexer::<&str>::new(vec![\\\"A\\\", \\\"B\\\", \\\"C\\\"]);\\n\\n assert_eq!(idx == other, true);\\n\\n assert_eq!(idx, other);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/indexer.rs\",\n \"rank\": 32,\n \"score\": 78383.1821271088\n },\n {\n \"content\": \"/// Indexing methods for Index(Row)\\n\\npub trait RowIndex<'s>: Sized {\\n\\n // 's: lifetime of myself\\n\\n\\n\\n type Key;\\n\\n type Row;\\n\\n\\n\\n fn len(&'s self) -> usize;\\n\\n\\n\\n fn head(&'s self, n: usize) -> Self {\\n\\n let indexer: Vec<usize> = (0..n).collect();\\n\\n self.ilocs(&indexer)\\n\\n }\\n\\n\\n\\n fn tail(&'s self, n: usize) -> Self {\\n\\n let len = self.len();\\n\\n let indexer: Vec<usize> = ((len - n)..len).collect();\\n\\n self.ilocs(&indexer)\\n\\n }\\n\\n\\n\\n fn reindex<'l>(&'s self, labels: &'l [Self::Key]) -> Self;\\n\",\n \"file_path\": \"src/traits.rs\",\n \"rank\": 33,\n \"score\": 76410.16528266536\n },\n {\n \"content\": \"/// Indexing methods for Columns\\n\\npub trait ColIndex<'s>: Sized {\\n\\n // 's: lifetime of myself\\n\\n\\n\\n type Key;\\n\\n type Column;\\n\\n\\n\\n /// Get column using label\\n\\n fn get<'l>(&'s self, label: &'l Self::Key) -> Self::Column;\\n\\n\\n\\n /// Get column using given index\\n\\n fn iget<'l>(&'s self, label: &'l usize) -> Self::Column;\\n\\n\\n\\n /// Slice columns using labels\\n\\n fn gets<'l>(&'s self, labels: &'l [Self::Key]) -> Self;\\n\\n\\n\\n /// Slice columns given indices\\n\\n fn igets<'l>(&'s self, locations: &'l [usize]) -> Self;\\n\\n\\n\\n // ToDo: Add .insert\\n\\n // ToDo bgets\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/traits.rs\",\n \"rank\": 34,\n \"score\": 76409.58082950533\n },\n {\n \"content\": \"#[test]\\n\\nfn test_series_append() {\\n\\n let values: Vec<f64> = vec![1., 2., 3., 4., 5.];\\n\\n let index: Vec<i64> = vec![10, 20, 30, 40, 50];\\n\\n\\n\\n let s1 = Series::new(values, index);\\n\\n\\n\\n let values: Vec<f64> = vec![11., 12., 13., 14., 15.];\\n\\n let index: Vec<i64> = vec![110, 120, 130, 140, 150];\\n\\n\\n\\n let s2 = Series::new(values, index);\\n\\n\\n\\n let res = s1.append(&s2);\\n\\n let exp: Series<f64, i64> = Series::new(\\n\\n vec![1., 2., 3., 4., 5., 11., 12., 13., 14., 15.],\\n\\n vec![10, 20, 30, 40, 50, 110, 120, 130, 140, 150],\\n\\n );\\n\\n assert_eq!(res, exp);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/series.rs\",\n \"rank\": 35,\n \"score\": 76324.87699873961\n },\n {\n \"content\": \"pub trait JoinOp<T> {\\n\\n fn inner(left: &[T], right: &[T]) -> (Vec<T>, Vec<usize>, Vec<usize>);\\n\\n fn left(left: &[T], right: &[T]) -> (Vec<T>, Vec<usize>, Vec<usize>);\\n\\n fn right(left: &[T], right: &[T]) -> (Vec<T>, Vec<usize>, Vec<usize>);\\n\\n fn outer(left: &[T], right: &[T]) -> (Vec<T>, Vec<usize>, Vec<usize>);\\n\\n\\n\\n fn keep_first(keep: &[T], other: &[T]) -> (Vec<T>, Vec<usize>, Vec<usize>);\\n\\n}\\n\\n\\n\\nimpl<T> JoinOp<T> for HashJoin\\n\\nwhere\\n\\n T: Clone + Hash + Eq,\\n\\n{\\n\\n fn inner(left: &[T], right: &[T]) -> (Vec<T>, Vec<usize>, Vec<usize>) {\\n\\n\\n\\n let exp_capacity = cmp::min(left.len(), right.len());\\n\\n\\n\\n let mut indexer: Vec<T> = Vec::with_capacity(exp_capacity);\\n\\n let mut lindexer: Vec<usize> = Vec::with_capacity(exp_capacity);\\n\\n let mut rindexer: Vec<usize> = Vec::with_capacity(exp_capacity);\\n\",\n \"file_path\": \"src/algos/join.rs\",\n \"rank\": 36,\n \"score\": 75944.44124600218\n },\n {\n \"content\": \"#[test]\\n\\nfn test_series_slice_locs() {\\n\\n let values: Vec<f64> = vec![1., 2., 3., 4., 5.];\\n\\n let index: Vec<i64> = vec![10, 20, 30, 40, 50];\\n\\n\\n\\n let s = Series::new(values, index);\\n\\n\\n\\n // test internal constructions\\n\\n let exp_values: Cow<Vec<f64>> = Cow::Owned(vec![1., 2., 3., 4., 5.]);\\n\\n let exp_index: Cow<Indexer<i64>> = Cow::Owned(Indexer::new(vec![10, 20, 30, 40, 50]));\\n\\n assert_eq!(s.values, exp_values);\\n\\n assert_eq!(s.index, exp_index);\\n\\n\\n\\n // test label slice\\n\\n let res = s.locs(&vec![20, 30, 50]);\\n\\n let exp: Series<f64, i64> = Series::new(vec![2., 3., 5.], vec![20, 30, 50]);\\n\\n assert_eq!(res, exp);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/series.rs\",\n \"rank\": 37,\n \"score\": 73738.05390204594\n },\n {\n \"content\": \"#[test]\\n\\nfn test_frame_slice_locs() {\\n\\n let values = vec![\\n\\n array![1i64, 2, 3, 4, 5],\\n\\n array![6.0f64, 7., 8., 9., 10.],\\n\\n array![11i64, 12, 13, 14, 15],\\n\\n ];\\n\\n let df = DataFrame::from_vec(\\n\\n values,\\n\\n vec![\\\"A\\\", \\\"BB\\\", \\\"CC\\\", \\\"D\\\", \\\"EEE\\\"],\\n\\n vec![\\\"X\\\", \\\"YYY\\\", \\\"ZZ\\\"],\\n\\n );\\n\\n assert_eq!(df.len(), 5);\\n\\n\\n\\n let res = df.locs(&vec![\\\"A\\\", \\\"D\\\", \\\"CC\\\"]);\\n\\n let exp_values = vec![\\n\\n array![1i64, 4, 3],\\n\\n array![6.0f64, 9., 8.],\\n\\n array![11i64, 14, 13],\\n\\n ];\\n\\n let exp = DataFrame::from_vec(exp_values, vec![\\\"A\\\", \\\"D\\\", \\\"CC\\\"], vec![\\\"X\\\", \\\"YYY\\\", \\\"ZZ\\\"]);\\n\\n assert_eq!(res.values, exp.values);\\n\\n assert_eq!(res.index, exp.index);\\n\\n assert_eq!(res.columns, exp.columns);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/frame.rs\",\n \"rank\": 38,\n \"score\": 73738.05390204594\n },\n {\n \"content\": \"#[test]\\n\\nfn test_dataframe_append() {\\n\\n let values1 = vec![array![1, 2, 3], array![4.1, 5.1, 6.1], array![1, 2, 3]];\\n\\n let df1 = DataFrame::from_vec(values1, vec![\\\"A\\\", \\\"B\\\", \\\"C\\\"], vec![\\\"X\\\", \\\"Y\\\", \\\"Z\\\"]);\\n\\n\\n\\n let values2 = vec![array![4, 5], array![7.1, 8.1], array![4, 5]];\\n\\n let df2 = DataFrame::from_vec(values2, vec![\\\"D\\\", \\\"E\\\"], vec![\\\"X\\\", \\\"Y\\\", \\\"Z\\\"]);\\n\\n\\n\\n let res = df1.append(&df2);\\n\\n\\n\\n let exp_values = vec![\\n\\n array![1, 2, 3, 4, 5],\\n\\n array![4.1, 5.1, 6.1, 7.1, 8.1],\\n\\n array![1, 2, 3, 4, 5],\\n\\n ];\\n\\n let exp = DataFrame::from_vec(\\n\\n exp_values,\\n\\n vec![\\\"A\\\", \\\"B\\\", \\\"C\\\", \\\"D\\\", \\\"E\\\"],\\n\\n vec![\\\"X\\\", \\\"Y\\\", \\\"Z\\\"],\\n\\n );\\n\\n assert_eq!(res, exp);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/frame_reshape.rs\",\n \"rank\": 39,\n \"score\": 73711.15576053833\n },\n {\n \"content\": \"#[test]\\n\\nfn test_series_creation_from_index() {\\n\\n let values: Vec<f64> = vec![1., 2., 3.];\\n\\n let index: Vec<i64> = vec![5, 6, 7];\\n\\n\\n\\n let s = Series::<f64, i64>::new(values, index);\\n\\n\\n\\n let exp_values: Cow<Vec<f64>> = Cow::Owned(vec![1., 2., 3.]);\\n\\n let exp_index: Cow<Indexer<i64>> = Cow::Owned(Indexer::new(vec![5, 6, 7]));\\n\\n assert_eq!(s.values, exp_values);\\n\\n assert_eq!(s.index, exp_index);\\n\\n\\n\\n assert_eq!(s.len(), 3);\\n\\n assert_eq!(s.index.len(), 3);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/series.rs\",\n \"rank\": 40,\n \"score\": 72980.79237928068\n },\n {\n \"content\": \"#[test]\\n\\nfn test_series_creation_from_into_index() {\\n\\n let values: Vec<f64> = vec![1., 2., 3.];\\n\\n let index: Indexer<i64> = Indexer::new(vec![5, 6, 7]);\\n\\n\\n\\n let s = Series::<f64, i64>::new(values, index);\\n\\n\\n\\n let exp_values: Cow<Vec<f64>> = Cow::Owned(vec![1., 2., 3.]);\\n\\n let exp_index: Cow<Indexer<i64>> = Cow::Owned(Indexer::new(vec![5, 6, 7]));\\n\\n assert_eq!(s.values, exp_values);\\n\\n assert_eq!(s.index, exp_index);\\n\\n\\n\\n assert_eq!(s.len(), 3);\\n\\n assert_eq!(s.index.len(), 3);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/series.rs\",\n \"rank\": 41,\n \"score\": 72980.79237928068\n },\n {\n \"content\": \"#[test]\\n\\nfn test_series_reindex_by_index() {\\n\\n let s: Series<&str, &str> = Series::new(vec![\\\"a\\\", \\\"b\\\", \\\"c\\\", \\\"d\\\"], vec![\\\"A\\\", \\\"B\\\", \\\"C\\\", \\\"D\\\"]);\\n\\n let res = s.reindex_by_index(&vec![1, 3, 0]);\\n\\n let exp: Series<&str, &str> = Series::new(vec![\\\"b\\\", \\\"d\\\", \\\"a\\\"], vec![\\\"B\\\", \\\"D\\\", \\\"A\\\"]);\\n\\n assert_eq!(res, exp);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/series.rs\",\n \"rank\": 42,\n \"score\": 72980.79237928068\n },\n {\n \"content\": \"#[test]\\n\\n#[should_panic]\\n\\nfn test_frame_slice_locs_panic() {\\n\\n let values = vec![\\n\\n array![1i64, 2, 3, 4, 5],\\n\\n array![6.0f64, 7., 8., 9., 10.],\\n\\n array![11i64, 12, 13, 14, 15],\\n\\n ];\\n\\n let df = DataFrame::from_vec(\\n\\n values,\\n\\n vec![\\\"A\\\", \\\"BB\\\", \\\"CC\\\", \\\"D\\\", \\\"EEE\\\"],\\n\\n vec![\\\"X\\\", \\\"YYY\\\", \\\"ZZ\\\"],\\n\\n );\\n\\n\\n\\n df.locs(&vec![\\\"A\\\", \\\"D\\\", \\\"X\\\"]);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/frame.rs\",\n \"rank\": 43,\n \"score\": 71336.33519097991\n },\n {\n \"content\": \"#[test]\\n\\n#[should_panic]\\n\\nfn test_series_reindex_by_index_panic() {\\n\\n let s: Series<&str, &str> = Series::new(vec![\\\"a\\\", \\\"b\\\", \\\"c\\\", \\\"d\\\"], vec![\\\"A\\\", \\\"B\\\", \\\"C\\\", \\\"D\\\"]);\\n\\n s.reindex_by_index(&vec![1, 3, 10]);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/series.rs\",\n \"rank\": 44,\n \"score\": 70609.94377453244\n },\n {\n \"content\": \"#[test]\\n\\nfn test_series_value_counts_str() {\\n\\n let values: Vec<&str> = vec![\\\"a\\\", \\\"bb\\\", \\\"bb\\\", \\\"c\\\", \\\"a\\\", \\\"a\\\"];\\n\\n let s = Series::<&str, usize>::from_vec(values);\\n\\n\\n\\n let d = s.value_counts();\\n\\n let exp: Series<usize, &str> = Series::new(vec![3, 2, 1], vec![\\\"a\\\", \\\"bb\\\", \\\"c\\\"]);\\n\\n assert_eq!(d, exp);\\n\\n}\\n\",\n \"file_path\": \"tests/series_aggregation.rs\",\n \"rank\": 45,\n \"score\": 69110.35904498925\n },\n {\n \"content\": \"#[test]\\n\\nfn test_series_value_counts_int() {\\n\\n let values: Vec<i64> = vec![1, 1, 3, 4, 2, 1, 1, 2, 3, 3];\\n\\n let s = Series::<i64, usize>::from_vec(values);\\n\\n\\n\\n let d = s.value_counts();\\n\\n let exp: Series<usize, i64> = Series::new(vec![4, 3, 2, 1], vec![1, 3, 2, 4]);\\n\\n assert_eq!(d, exp);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/series_aggregation.rs\",\n \"rank\": 46,\n \"score\": 69110.35904498925\n },\n {\n \"content\": \"#[test]\\n\\n#[should_panic]\\n\\nfn test_dataframe_append_different_columns() {\\n\\n // different columns\\n\\n let values1 = vec![array![1, 2, 3], array![4.1, 5.1, 6.1], array![1, 2, 3]];\\n\\n let df1 = DataFrame::from_vec(values1, vec![\\\"A\\\", \\\"B\\\", \\\"C\\\"], vec![\\\"X\\\", \\\"Y\\\", \\\"Z\\\"]);\\n\\n\\n\\n let values2 = vec![array![4, 5], array![7.1, 8.1], array![4, 5]];\\n\\n let df2 = DataFrame::from_vec(values2, vec![\\\"D\\\", \\\"E\\\"], vec![\\\"XX\\\", \\\"Y\\\", \\\"Z\\\"]);\\n\\n\\n\\n df1.append(&df2);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/frame_reshape.rs\",\n \"rank\": 47,\n \"score\": 69097.96996054036\n },\n {\n \"content\": \"#[test]\\n\\n#[should_panic]\\n\\nfn test_dataframe_append_different_dtype() {\\n\\n // different columns\\n\\n let values1 = vec![array![1, 2, 3], array![4.1, 5.1, 6.1], array![1, 2, 3]];\\n\\n let df1 = DataFrame::from_vec(values1, vec![\\\"A\\\", \\\"B\\\", \\\"C\\\"], vec![\\\"X\\\", \\\"Y\\\", \\\"Z\\\"]);\\n\\n\\n\\n let values2 = vec![array![4, 5], array![7.1, 8.1], array![4.1, 5.1]];\\n\\n let df2 = DataFrame::from_vec(values2, vec![\\\"D\\\", \\\"E\\\"], vec![\\\"X\\\", \\\"Y\\\", \\\"Z\\\"]);\\n\\n\\n\\n df1.append(&df2);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/frame_reshape.rs\",\n \"rank\": 48,\n \"score\": 69097.96996054036\n },\n {\n \"content\": \"use std::hash::Hash;\\n\\n\\n\\nuse super::Indexer;\\n\\nuse nullvec::prelude::dev::algos::Sorter;\\n\\n\\n\\n//**********************************************\\n\\n//*Soat\\n\\n//**********************************************\\n\\n\\n\\nimpl<U> Indexer<U>\\n\\nwhere\\n\\n U: Clone + Eq + Hash + Ord,\\n\\n{\\n\\n pub fn argsort(&self) -> (Vec<usize>, Self) {\\n\\n let (indexer, sorted) = Sorter::argsort(&self.values);\\n\\n let sorted = Indexer::new(sorted);\\n\\n (indexer, sorted)\\n\\n }\\n\\n\\n\\n pub fn sort(&self) -> Self {\\n\",\n \"file_path\": \"src/indexer/sort.rs\",\n \"rank\": 49,\n \"score\": 68378.31397301417\n },\n {\n \"content\": \" Indexer::new(Sorter::sort(&self.values))\\n\\n }\\n\\n}\\n\\n\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n\\n\\n use super::super::Indexer;\\n\\n\\n\\n #[test]\\n\\n fn test_index_argsort_int() {\\n\\n let idx = Indexer::new(vec![5, 4, 3, 2, 1]);\\n\\n let (indexer, sorted) = idx.argsort();\\n\\n assert_eq!(indexer, vec![4, 3, 2, 1, 0]);\\n\\n assert_eq!(sorted, Indexer::new(vec![1, 2, 3, 4, 5]));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_index_sort_int() {\\n\",\n \"file_path\": \"src/indexer/sort.rs\",\n \"rank\": 50,\n \"score\": 68361.20121356468\n },\n {\n \"content\": \" let idx = Indexer::new(vec![5, 4, 3, 2, 1]);\\n\\n let sorted = idx.sort();\\n\\n assert_eq!(sorted, Indexer::new(vec![1, 2, 3, 4, 5]));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_index_argsort_str() {\\n\\n let idx = Indexer::new(vec![\\\"d\\\", \\\"b\\\", \\\"a\\\", \\\"c\\\"]);\\n\\n let (indexer, sorted) = idx.argsort();\\n\\n assert_eq!(indexer, vec![2, 1, 3, 0]);\\n\\n assert_eq!(sorted, Indexer::new(vec![\\\"a\\\", \\\"b\\\", \\\"c\\\", \\\"d\\\"]));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_index_sort_str() {\\n\\n let idx = Indexer::new(vec![\\\"d\\\", \\\"b\\\", \\\"a\\\", \\\"c\\\"]);\\n\\n let sorted = idx.sort();\\n\\n assert_eq!(sorted, Indexer::new(vec![\\\"a\\\", \\\"b\\\", \\\"c\\\", \\\"d\\\"]));\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/indexer/sort.rs\",\n \"rank\": 51,\n \"score\": 68355.1590755059\n },\n {\n \"content\": \"use std::borrow::Cow;\\n\\nuse std::hash::Hash;\\n\\n\\n\\nuse super::Indexer;\\n\\n\\n\\n/// /////////////////////////////////////////////////////////////////////////////\\n\\n/// From / Into\\n\\n/// /////////////////////////////////////////////////////////////////////////////\\n\\n\\n\\nimpl<T: Clone + Eq + Hash> From<Vec<T>> for Indexer<T> {\\n\\n fn from(values: Vec<T>) -> Self {\\n\\n Indexer::new(values)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: Clone + Hash> Into<Vec<T>> for Indexer<T> {\\n\\n fn into(self) -> Vec<T> {\\n\\n self.values\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/indexer/convert.rs\",\n \"rank\": 52,\n \"score\": 68319.80805874459\n },\n {\n \"content\": \"\\n\\n/// /////////////////////////////////////////////////////////////////////////////\\n\\n/// Clone on Write\\n\\n/// /////////////////////////////////////////////////////////////////////////////\\n\\n\\n\\nimpl<'a, T: Clone + Hash> Into<Cow<'a, Indexer<T>>> for Indexer<T> {\\n\\n fn into(self) -> Cow<'a, Self> {\\n\\n Cow::Owned(self)\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n\\n\\n use super::super::Indexer;\\n\\n\\n\\n #[test]\\n\\n fn test_i64_vec_to_indexer() {\\n\\n let exp: Indexer<i64> = Indexer::new(vec![1, 2, 3]);\\n\\n\\n\",\n \"file_path\": \"src/indexer/convert.rs\",\n \"rank\": 53,\n \"score\": 68314.0404092785\n },\n {\n \"content\": \" let idx: Indexer<i64> = vec![1, 2, 3].into();\\n\\n assert_eq!(idx, exp);\\n\\n\\n\\n let idx: Indexer<i64> = Indexer::from(vec![1, 2, 3]);\\n\\n assert_eq!(idx, exp);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_i64_indexer_to_vec() {\\n\\n let exp: Vec<i64> = vec![1, 2, 3];\\n\\n\\n\\n let idx: Indexer<i64> = Indexer::new(vec![1, 2, 3]);\\n\\n let conv: Vec<i64> = idx.into();\\n\\n assert_eq!(conv, exp);\\n\\n\\n\\n // let idx: Indexer<i64> = Indexer::new(vec![1, 2, 3]);\\n\\n // let conv: Vec<i64> = Vec::from(idx.into());\\n\\n // assert_eq!(conv, exp);\\n\\n //\\n\\n }\\n\",\n \"file_path\": \"src/indexer/convert.rs\",\n \"rank\": 54,\n \"score\": 68303.77169829237\n },\n {\n \"content\": \"\\n\\n #[test]\\n\\n fn test_str_vec_to_indexer() {\\n\\n let exp: Indexer<&str> = Indexer::new(vec![\\\"a\\\", \\\"b\\\", \\\"c\\\"]);\\n\\n\\n\\n let idx: Indexer<&str> = vec![\\\"a\\\", \\\"b\\\", \\\"c\\\"].into();\\n\\n assert_eq!(idx, exp);\\n\\n\\n\\n let idx: Indexer<&str> = Indexer::from(vec![\\\"a\\\", \\\"b\\\", \\\"c\\\"]);\\n\\n assert_eq!(idx, exp);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_str_indexer_to_vec() {\\n\\n let exp: Vec<&str> = vec![\\\"a\\\", \\\"b\\\", \\\"c\\\"];\\n\\n\\n\\n let idx: Indexer<&str> = Indexer::new(vec![\\\"a\\\", \\\"b\\\", \\\"c\\\"]);\\n\\n let conv: Vec<&str> = idx.into();\\n\\n assert_eq!(conv, exp);\\n\\n\\n\",\n \"file_path\": \"src/indexer/convert.rs\",\n \"rank\": 55,\n \"score\": 68303.64731766502\n },\n {\n \"content\": \" // let idx: Indexer<&str> = Indexer::new(vec![\\\"a\\\", \\\"b\\\", \\\"c\\\"]);\\n\\n // let conv: Vec<&str> = Vec::from(idx.into());\\n\\n // assert_eq!(conv, exp);\\n\\n //\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_string_vec_to_indexer() {\\n\\n let exp: Indexer<String> =\\n\\n Indexer::new(vec![\\\"a\\\".to_string(), \\\"b\\\".to_string(), \\\"c\\\".to_string()]);\\n\\n\\n\\n let idx: Indexer<String> = vec![\\\"a\\\".to_string(), \\\"b\\\".to_string(), \\\"c\\\".to_string()].into();\\n\\n assert_eq!(idx, exp);\\n\\n\\n\\n let idx: Indexer<String> =\\n\\n Indexer::from(vec![\\\"a\\\".to_string(), \\\"b\\\".to_string(), \\\"c\\\".to_string()]);\\n\\n assert_eq!(idx, exp);\\n\\n }\\n\\n\\n\\n #[test]\\n\",\n \"file_path\": \"src/indexer/convert.rs\",\n \"rank\": 56,\n \"score\": 68303.49768667895\n },\n {\n \"content\": \" fn test_string_indexer_to_vec() {\\n\\n let exp: Vec<String> = vec![\\\"a\\\".to_string(), \\\"b\\\".to_string(), \\\"c\\\".to_string()];\\n\\n\\n\\n let idx: Indexer<String> =\\n\\n Indexer::new(vec![\\\"a\\\".to_string(), \\\"b\\\".to_string(), \\\"c\\\".to_string()]);\\n\\n let conv: Vec<String> = idx.into();\\n\\n assert_eq!(conv, exp);\\n\\n\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/indexer/convert.rs\",\n \"rank\": 57,\n \"score\": 68302.2684425825\n },\n {\n \"content\": \"use std::fmt;\\n\\nuse std::hash::Hash;\\n\\n\\n\\nuse super::Indexer;\\n\\n\\n\\n// Formatting\\n\\n\\n\\nimpl<U> fmt::Display for Indexer<U>\\n\\nwhere\\n\\n U: Clone + Eq + Hash + fmt::Debug,\\n\\n{\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n return write!(f, \\\"Index({:?})\\\", &self.values);\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<U> fmt::Debug for Indexer<U>\\n\\nwhere\\n\\n U: Clone + Eq + Hash + fmt::Debug,\\n\\n{\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n return write!(f, \\\"Index({:?})\\\", &self.values);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/indexer/formatting.rs\",\n \"rank\": 58,\n \"score\": 68169.9845212978\n },\n {\n \"content\": \"pub fn union<T>(a: &[T], b: &[T]) -> Vec<T>\\n\\nwhere\\n\\n T: Clone + Hash + Eq,\\n\\n{\\n\\n // Use HashMap to keep the order\\n\\n\\n\\n // Clone for result Vec\\n\\n let mut res: Vec<T> = a.to_vec();\\n\\n\\n\\n let set = CowCollections::to_hashset(a);\\n\\n\\n\\n for key in b.iter() {\\n\\n if !set.contains(&Cow::Borrowed(key)) {\\n\\n // do not clone if no need to insert\\n\\n res.push((*key).clone());\\n\\n }\\n\\n }\\n\\n res\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/algos/set.rs\",\n \"rank\": 59,\n \"score\": 68004.14272212569\n },\n {\n \"content\": \"use std::hash::Hash;\\n\\nuse std::ops::{Add, Mul, Sub, Div, Rem, BitAnd, BitOr, BitXor};\\n\\n\\n\\nuse super::Indexer;\\n\\nuse nullvec::prelude::dev::algos::Elemwise;\\n\\n\\n\\nmacro_rules! define_numeric_op {\\n\\n ($t:ident, $m:ident) => {\\n\\n\\n\\n // Broadcast\\n\\n impl<U, O> $t<U> for Indexer<U>\\n\\n where U: Clone + Eq + Hash + $t<Output=O>,\\n\\n O: Clone + Eq + Hash {\\n\\n\\n\\n type Output = Indexer<O>;\\n\\n fn $m(self, _rhs: U) -> Self::Output {\\n\\n let new_values: Vec<O> = Elemwise::broadcast_oo(self.values, _rhs, |x, y| x.$m(y));\\n\\n Indexer::new(new_values)\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/indexer/ops.rs\",\n \"rank\": 60,\n \"score\": 67499.89458388012\n },\n {\n \"content\": \"\\n\\n impl<'a, U, O> $t<&'a U> for Indexer<U>\\n\\n where U: Clone + Eq + Hash + $t<Output=O>,\\n\\n O: Clone + Eq + Hash {\\n\\n\\n\\n type Output = Indexer<O>;\\n\\n fn $m(self, _rhs: &U) -> Self::Output {\\n\\n let new_values: Vec<O> = Elemwise::broadcast_or(self.values, _rhs, |x, y| x.$m(y));\\n\\n Indexer::new(new_values)\\n\\n }\\n\\n }\\n\\n\\n\\n impl<'b, U, O> $t<U> for &'b Indexer<U>\\n\\n where U: Clone + Eq + Hash + $t<Output=O>,\\n\\n O: Clone + Eq + Hash {\\n\\n\\n\\n // can't use self as impl is for reference?\\n\\n type Output = Indexer<O>;\\n\\n fn $m(self, _rhs: U) -> Self::Output {\\n\\n let new_values: Vec<O> = Elemwise::broadcast_ro(&self.values, _rhs, |x, y| x.$m(y));\\n\",\n \"file_path\": \"src/indexer/ops.rs\",\n \"rank\": 61,\n \"score\": 67499.29751781044\n },\n {\n \"content\": \" }\\n\\n\\n\\n impl<'b, U, O> $t<Indexer<U>> for &'b Indexer<U>\\n\\n where U: Clone + Eq + Hash + $t<Output=O>,\\n\\n O: Clone + Eq + Hash {\\n\\n\\n\\n type Output = Indexer<O>;\\n\\n fn $m(self, _rhs: Indexer<U>) -> Self::Output {\\n\\n let new_values: Vec<O> = Elemwise::elemwise_ro(&self.values,\\n\\n _rhs.values,\\n\\n |x, y| x.$m(y));\\n\\n Indexer::new(new_values)\\n\\n }\\n\\n }\\n\\n\\n\\n impl<'a, 'b, U, O> $t<&'a Indexer<U>> for &'b Indexer<U>\\n\\n where U: Clone + Eq + Hash + $t<Output=O>,\\n\\n O: Clone + Eq + Hash {\\n\\n\\n\\n type Output = Indexer<O>;\\n\",\n \"file_path\": \"src/indexer/ops.rs\",\n \"rank\": 62,\n \"score\": 67497.92647918838\n },\n {\n \"content\": \" Indexer::new(new_values)\\n\\n }\\n\\n }\\n\\n\\n\\n impl<'a, 'b, U, O> $t<&'a U> for &'b Indexer<U>\\n\\n where U: Clone + Eq + Hash + $t<Output=O>,\\n\\n O: Clone + Eq + Hash {\\n\\n\\n\\n type Output = Indexer<O>;\\n\\n fn $m(self, _rhs: &U) -> Self::Output {\\n\\n let new_values: Vec<O> = Elemwise::broadcast_rr(&self.values, _rhs, |x, y| x.$m(y));\\n\\n Indexer::new(new_values)\\n\\n }\\n\\n }\\n\\n\\n\\n // Element-wise\\n\\n impl<U, O> $t<Indexer<U>> for Indexer<U>\\n\\n where U: Clone + Eq + Hash + $t<Output=O>,\\n\\n O: Clone + Eq + Hash {\\n\\n\\n\",\n \"file_path\": \"src/indexer/ops.rs\",\n \"rank\": 63,\n \"score\": 67497.6649964894\n },\n {\n \"content\": \" type Output = Indexer<O>;\\n\\n fn $m(self, _rhs: Self) -> Self::Output {\\n\\n let new_values: Vec<O> = Elemwise::elemwise_oo(self.values,\\n\\n _rhs.values,\\n\\n |x, y| x.$m(y));\\n\\n Indexer::new(new_values)\\n\\n }\\n\\n }\\n\\n\\n\\n impl<'a, U, O> $t<&'a Indexer<U>> for Indexer<U>\\n\\n where U: Clone + Eq + Hash + $t<Output=O>,\\n\\n O: Clone + Eq + Hash {\\n\\n\\n\\n type Output = Indexer<O>;\\n\\n fn $m(self, _rhs: &Self) -> Self::Output {\\n\\n let new_values: Vec<O> = Elemwise::elemwise_or(self.values,\\n\\n &_rhs.values,\\n\\n |x, y| x.$m(y));\\n\\n Indexer::new(new_values)\\n\\n }\\n\",\n \"file_path\": \"src/indexer/ops.rs\",\n \"rank\": 64,\n \"score\": 67496.82814377139\n },\n {\n \"content\": \"#[cfg(test)]\\n\\nmod tests {\\n\\n\\n\\n use super::super::Indexer;\\n\\n\\n\\n #[test]\\n\\n fn test_index_ops_i64_broadcast() {\\n\\n let idx = Indexer::<i64>::new(vec![1, 2, 3]);\\n\\n // idx moves by ops\\n\\n assert_eq!(&(idx + 3).values, &vec![4, 5, 6]);\\n\\n\\n\\n let idx = Indexer::<i64>::new(vec![1, 2, 3]);\\n\\n assert_eq!(&(idx * 2).values, &vec![2, 4, 6]);\\n\\n\\n\\n let idx = Indexer::<i64>::new(vec![1, 2, 3]);\\n\\n assert_eq!(&(idx - 3).values, &vec![-2, -1, 0]);\\n\\n\\n\\n let idx = Indexer::<i64>::new(vec![1, 2, 3]);\\n\\n assert_eq!(&(idx / 2).values, &vec![0, 1, 1]);\\n\\n\\n\",\n \"file_path\": \"src/indexer/ops.rs\",\n \"rank\": 65,\n \"score\": 67490.50944122113\n },\n {\n \"content\": \" fn $m(self, _rhs: &Indexer<U>) -> Self::Output {\\n\\n let new_values: Vec<O> = Elemwise::elemwise_rr(&self.values,\\n\\n &_rhs.values,\\n\\n |x, y| x.$m(y));\\n\\n Indexer::new(new_values)\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\ndefine_numeric_op!(Add, add);\\n\\ndefine_numeric_op!(Mul, mul);\\n\\ndefine_numeric_op!(Sub, sub);\\n\\ndefine_numeric_op!(Div, div);\\n\\ndefine_numeric_op!(Rem, rem);\\n\\ndefine_numeric_op!(BitAnd, bitand);\\n\\ndefine_numeric_op!(BitOr, bitor);\\n\\ndefine_numeric_op!(BitXor, bitxor);\\n\\n\\n\\n\\n\",\n \"file_path\": \"src/indexer/ops.rs\",\n \"rank\": 66,\n \"score\": 67486.95095419092\n },\n {\n \"content\": \" let idx = Indexer::<i64>::new(vec![1, 2, 3]);\\n\\n assert_eq!(&(idx % 2).values, &vec![1, 0, 1]);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_index_ops_i64_broadcast_refs() {\\n\\n let idx = Indexer::<i64>::new(vec![1, 2, 3]);\\n\\n assert_eq!(&(&idx + 3).values, &vec![4, 5, 6]);\\n\\n assert_eq!(&(&idx + &3).values, &vec![4, 5, 6]);\\n\\n assert_eq!(&(idx + &3).values, &vec![4, 5, 6]);\\n\\n }\\n\\n\\n\\n // ToDo\\n\\n // #[test]\\n\\n // fn test_index_ops_str_broadcast() {\\n\\n // let idx = Indexer::<String>::new(vec![\\\"a\\\".to_string(), \\\"b\\\".to_string(), \\\"c\\\".to_string()]);\\n\\n // idx moves by ops\\n\\n // let exp = Indexer::<String>::new(vec![\\\"ax\\\".to_string(), \\\"bx\\\".to_string(), \\\"cx\\\".to_string()]);\\n\\n // assert_eq!(idx + \\\"x\\\".to_string(), exp);\\n\\n // }\\n\",\n \"file_path\": \"src/indexer/ops.rs\",\n \"rank\": 67,\n \"score\": 67486.36718821581\n },\n {\n \"content\": \" //\\n\\n\\n\\n #[test]\\n\\n fn test_index_ops_i64_elemwise() {\\n\\n let idx = Indexer::<i64>::new(vec![1, 2, 3]);\\n\\n let r = Indexer::<i64>::new(vec![1, 3, 2]);\\n\\n // idx moves by ops\\n\\n assert_eq!(&(idx + r).values, &vec![2, 5, 5]);\\n\\n\\n\\n let idx = Indexer::<i64>::new(vec![1, 2, 3]);\\n\\n let r = Indexer::<i64>::new(vec![1, 3, 2]);\\n\\n assert_eq!(&(idx * r).values, &vec![1, 6, 6]);\\n\\n\\n\\n let idx = Indexer::<i64>::new(vec![1, 2, 3]);\\n\\n let r = Indexer::<i64>::new(vec![1, 3, 2]);\\n\\n assert_eq!(&(idx - r).values, &vec![0, -1, 1]);\\n\\n\\n\\n let idx = Indexer::<i64>::new(vec![1, 2, 3]);\\n\\n let r = Indexer::<i64>::new(vec![1, 3, 2]);\\n\\n assert_eq!(&(idx / r).values, &vec![1, 0, 1]);\\n\",\n \"file_path\": \"src/indexer/ops.rs\",\n \"rank\": 68,\n \"score\": 67486.21206993534\n },\n {\n \"content\": \"\\n\\n let idx = Indexer::<i64>::new(vec![1, 2, 3]);\\n\\n let r = Indexer::<i64>::new(vec![1, 3, 2]);\\n\\n assert_eq!(&(idx % r).values, &vec![0, 2, 1]);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_index_ops_i64_elemwise_refs() {\\n\\n let idx = Indexer::<i64>::new(vec![1, 2, 3]);\\n\\n let r = Indexer::<i64>::new(vec![1, 3, 2]);\\n\\n\\n\\n assert_eq!(&(&idx + r).values, &vec![2, 5, 5]);\\n\\n\\n\\n let r = Indexer::<i64>::new(vec![1, 3, 2]);\\n\\n assert_eq!(&(&idx + &r).values, &vec![2, 5, 5]);\\n\\n assert_eq!(&(idx + &r).values, &vec![2, 5, 5]);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/indexer/ops.rs\",\n \"rank\": 69,\n \"score\": 67485.94311253112\n },\n {\n \"content\": \"#[test]\\n\\nfn test_read_csv_error_different_items() {\\n\\n let data = \\\"A,B,C\\n\\n1,7,1.1\\n\\n1,3\\n\\n1,1,4.5\\\";\\n\\n let rdr = csv::ReaderBuilder::new().has_headers(true).from_reader(\\n\\n data.as_bytes(),\\n\\n );\\n\\n let res = DataFrame::<usize, String>::read_csv(rdr);\\n\\n assert!(res.is_err())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/io_csv.rs\",\n \"rank\": 80,\n \"score\": 67125.64892204807\n },\n {\n \"content\": \"pub trait Description<'s>\\n\\n : BasicAggregation<'s> + NumericAggregation<'s> + ComparisonAggregation<'s> {\\n\\n type Described;\\n\\n\\n\\n fn describe(&'s self) -> Self::Described;\\n\\n}\\n\",\n \"file_path\": \"src/traits.rs\",\n \"rank\": 81,\n \"score\": 51731.70511955398\n },\n {\n \"content\": \"/// Join by index\\n\\npub trait Join: Sized {\\n\\n fn join_inner(&self, other: &Self) -> Self;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/traits.rs\",\n \"rank\": 82,\n \"score\": 50278.756690106675\n },\n {\n \"content\": \"pub trait NumericAggregation<'s> {\\n\\n // result which is coerced (to f64 or its container)\\n\\n type Coerced;\\n\\n\\n\\n fn mean(&'s self) -> Self::Coerced;\\n\\n fn var(&'s self) -> Self::Coerced;\\n\\n fn unbiased_var(&'s self) -> Self::Coerced;\\n\\n fn std(&'s self) -> Self::Coerced;\\n\\n fn unbiased_std(&'s self) -> Self::Coerced;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/traits.rs\",\n \"rank\": 83,\n \"score\": 50274.68715438919\n },\n {\n \"content\": \"pub trait BasicAggregation<'s> {\\n\\n // result which can keep current dtype\\n\\n type Kept;\\n\\n // result for count (to usize or its container)\\n\\n type Counted;\\n\\n\\n\\n fn sum(&'s self) -> Self::Kept;\\n\\n fn count(&'s self) -> Self::Counted;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/traits.rs\",\n \"rank\": 84,\n \"score\": 50274.68715438919\n },\n {\n \"content\": \"pub trait ComparisonAggregation<'s> {\\n\\n type Kept;\\n\\n\\n\\n fn min(&'s self) -> Self::Kept;\\n\\n fn max(&'s self) -> Self::Kept;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/traits.rs\",\n \"rank\": 85,\n \"score\": 50274.68715438919\n },\n {\n \"content\": \"pub trait Grouper<T> {\\n\\n // ToDo: Implement efficient multimap\\n\\n fn groupby(key: &[T]) -> HashGrouper<T>;\\n\\n fn get(&self, key: &T) -> Option<&Vec<usize>>;\\n\\n fn keys(&self) -> Vec<T>;\\n\\n fn len(&self) -> usize;\\n\\n}\\n\\n\\n\\nimpl<T> Grouper<T> for HashGrouper<T>\\n\\nwhere\\n\\n T: Clone + Hash + Eq,\\n\\n{\\n\\n fn groupby(key: &[T]) -> HashGrouper<T> {\\n\\n\\n\\n let mut map: HashMap<T, Vec<usize>> = HashMap::new();\\n\\n\\n\\n for (i, k) in key.iter().enumerate() {\\n\\n let e = map.entry(k.clone()).or_insert_with(Vec::<usize>::new);\\n\\n e.push(i);\\n\\n }\\n\",\n \"file_path\": \"src/algos/grouper.rs\",\n \"rank\": 86,\n \"score\": 48941.50958291056\n },\n {\n \"content\": \"pub trait Apply<'s, R> {\\n\\n // R: Type function returns, dummy to avoid unconstrained lifetime parameter\\n\\n\\n\\n type In;\\n\\n type FOut;\\n\\n type Out;\\n\\n\\n\\n fn apply<'f>(&'s self, func: &'f Fn(&Self::In) -> Self::FOut) -> Self::Out;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/traits.rs\",\n \"rank\": 87,\n \"score\": 48296.33545878603\n },\n {\n \"content\": \"/// Concatenate along columns\\n\\npub trait Concatenation<'s>: Sized {\\n\\n fn concat<'o>(&'s self, other: &'o Self) -> Self;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/traits.rs\",\n \"rank\": 88,\n \"score\": 48296.33545878603\n },\n {\n \"content\": \"fn main() {\\n\\n // cargo build --example series\\n\\n // ./target/debug/examples/series\\n\\n\\n\\n println!(\\\"** Creation **\\\");\\n\\n let values: Vec<i64> = vec![1, 2, 3, 4, 3];\\n\\n let index: Vec<i64> = vec![10, 20, 30, 40, 50];\\n\\n let s = Series::<i64, i64>::new(values, index);\\n\\n\\n\\n println!(\\\"{:?}\\\\n\\\", &s);\\n\\n\\n\\n println!(\\\"** Selection **\\\");\\n\\n println!(\\\"by multiple index labels\\\\n{:?}\\\\n\\\", &s.locs(&[10, 40, 50]));\\n\\n println!(\\\"by multiple index locations\\\\n{:?}\\\\n\\\", &s.ilocs(&[2, 3, 4]));\\n\\n\\n\\n println!(\\\"** Calculation **\\\");\\n\\n println!(\\\"elemwise\\\\n{:?}\\\\n\\\", &(&s + 1));\\n\\n println!(\\\"sum\\\\n{:?}\\\\n\\\", &s.sum());\\n\\n println!(\\\"describe\\\\n{:?}\\\\n\\\", &s.describe());\\n\\n println!(\\\"histogram\\\\n{:?}\\\\n\\\", s.value_counts());\\n\\n\\n\\n println!(\\\"** Group By **\\\");\\n\\n let sg = s.groupby(&[1, 1, 1, 2, 2]);\\n\\n // println!(\\\"{:?}\\\", sg.grouper);\\n\\n println!(\\\"{:?}\\\\n\\\", sg.get_group(&1));\\n\\n println!(\\\"{:?}\\\\n\\\", sg.sum());\\n\\n}\\n\",\n \"file_path\": \"examples/series.rs\",\n \"rank\": 89,\n \"score\": 47734.42391682647\n },\n {\n \"content\": \"fn main() {\\n\\n // cargo build --example frame\\n\\n // ./target/debug/examples/frame\\n\\n\\n\\n println!(\\\"** Creation **\\\");\\n\\n let values = vec![\\n\\n array![1, 2, 3, 4, 5],\\n\\n array![6.1, 7.1, 8.1, 9.1, 10.1],\\n\\n array![11, 12, 13, 14, 15],\\n\\n ];\\n\\n let df = DataFrame::from_vec(values, vec![10, 20, 30, 40, 50], vec![\\\"X\\\", \\\"YYY\\\", \\\"ZZ\\\"]);\\n\\n println!(\\\"{:?}\\\\n\\\", &df);\\n\\n\\n\\n println!(\\\"** Selection **\\\");\\n\\n\\n\\n println!(\\\"by multiple index labels\\\\n{:?}\\\\n\\\", &df.locs(&[20, 30, 40]));\\n\\n println!(\\\"by multiple index locations\\\\n{:?}\\\\n\\\", &df.ilocs(&[0, 2, 1]));\\n\\n\\n\\n println!(\\\"** GroupBy **\\\");\\n\\n let dg = df.groupby(&[\\\"A\\\", \\\"A\\\", \\\"B\\\", \\\"A\\\", \\\"B\\\"]);\\n\\n println!(\\\"get group\\\\n{:?}\\\\n\\\", &dg.get_group(&\\\"A\\\"));\\n\\n\\n\\n println!(\\\"** Reshaping **\\\");\\n\\n let values2 = vec![array![1.1, 2.1, 3.1], array![6, 7, 8]];\\n\\n let df2 = DataFrame::from_vec(values2, vec![20, 30, 40], vec![\\\"X2\\\", \\\"Y2\\\"]);\\n\\n let j = df.join_inner(&df2);\\n\\n println!(\\\"inner join\\\\n{:?}\\\\n\\\", &j);\\n\\n}\\n\",\n \"file_path\": \"examples/frame.rs\",\n \"rank\": 90,\n \"score\": 47734.42391682647\n },\n {\n \"content\": \"pub trait NanMinMax<A> {\\n\\n fn nanmin(&self, n: A) -> A;\\n\\n fn nanmax(&self, n: A) -> A;\\n\\n fn nanmin_value() -> A;\\n\\n fn nanmax_value() -> A;\\n\\n}\\n\\n\\n\\nmacro_rules! define_int_stats {\\n\\n ($t:ident) => {\\n\\n impl NanMinMax<$t> for $t {\\n\\n fn nanmin(&self, n: $t) -> $t {\\n\\n cmp::min(*self, n)\\n\\n }\\n\\n fn nanmax(&self, n: $t) -> $t {\\n\\n cmp::max(*self, n)\\n\\n }\\n\\n fn nanmin_value() -> $t {\\n\\n $t::min_value()\\n\\n }\\n\\n fn nanmax_value() -> $t {\\n\",\n \"file_path\": \"src/algos/computation.rs\",\n \"rank\": 91,\n \"score\": 47717.02717719646\n },\n {\n \"content\": \"#[test]\\n\\nfn test_creation() {\\n\\n let iarr = array![1i64, 2, 3];\\n\\n assert_eq!(iarr.dtype(), \\\"i64\\\");\\n\\n assert_eq!(iarr.len(), 3);\\n\\n\\n\\n let farr = array![1.1f64, 2.1, 3.1, 4.1];\\n\\n assert_eq!(farr.dtype(), \\\"f64\\\");\\n\\n assert_eq!(farr.len(), 4);\\n\\n\\n\\n let barr = array![true, false, true];\\n\\n assert_eq!(barr.dtype(), \\\"bool\\\");\\n\\n assert_eq!(barr.len(), 3);\\n\\n\\n\\n let sarr = array![\\\"a\\\".to_string(), \\\"b\\\".to_string()];\\n\\n assert_eq!(sarr.dtype(), \\\"str\\\");\\n\\n assert_eq!(sarr.len(), 2);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/array.rs\",\n \"rank\": 92,\n \"score\": 46205.811104156135\n },\n {\n \"content\": \"#[test]\\n\\nfn test_blocs() {\\n\\n let iarr = array![1i64, 2, 3];\\n\\n assert_eq!(iarr.dtype(), \\\"i64\\\");\\n\\n let ires = iarr.blocs(&vec![true, false, true]);\\n\\n assert_eq!(ires, array![1i64, 3]);\\n\\n\\n\\n let farr = array![1.1f64, 2.1, 3.1];\\n\\n assert_eq!(farr.dtype(), \\\"f64\\\");\\n\\n let fres = farr.blocs(&vec![true, false, true]);\\n\\n assert_eq!(fres, array![1.1f64, 3.1]);\\n\\n\\n\\n let barr = array![true, false, true];\\n\\n let bres = barr.blocs(&vec![true, false, true]);\\n\\n assert_eq!(bres, array![true, true]);\\n\\n\\n\\n let sarr = array![\\\"a\\\".to_string(), \\\"b\\\".to_string(), \\\"c\\\".to_string()];\\n\\n let sres = sarr.blocs(&vec![true, false, true]);\\n\\n assert_eq!(sres, array![\\\"a\\\".to_string(), \\\"c\\\".to_string()]);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/array.rs\",\n \"rank\": 93,\n \"score\": 46205.811104156135\n },\n {\n \"content\": \"#[test]\\n\\nfn test_ilocs() {\\n\\n let iarr = array![1i64, 2, 3, 4, 5];\\n\\n assert_eq!(iarr.dtype(), \\\"i64\\\");\\n\\n assert_eq!(iarr.iloc(&2), Scalar::i64(3));\\n\\n let ires = iarr.ilocs(&vec![1, 4, 0]);\\n\\n assert_eq!(ires, array![2i64, 5, 1]);\\n\\n\\n\\n let farr = array![1.1f64, 2.1, 3.1, 4.1, 5.1];\\n\\n assert_eq!(farr.dtype(), \\\"f64\\\");\\n\\n assert_eq!(farr.iloc(&2), Scalar::f64(3.1));\\n\\n let fres = farr.ilocs(&vec![1, 4, 0]);\\n\\n assert_eq!(fres, array![2.1f64, 5.1, 1.1]);\\n\\n\\n\\n let barr = array![true, false, true, true];\\n\\n assert_eq!(barr.iloc(&2), Scalar::bool(true));\\n\\n let bres = barr.ilocs(&vec![1, 2]);\\n\\n assert_eq!(bres, array![false, true]);\\n\\n\\n\\n let sarr = array![\\\"a\\\".to_string(), \\\"b\\\".to_string(), \\\"c\\\".to_string()];\\n\\n assert_eq!(sarr.iloc(&2), Scalar::String(\\\"c\\\".to_string()));\\n\\n let sres = sarr.ilocs(&vec![2, 0]);\\n\\n assert_eq!(sres, array![\\\"c\\\".to_string(), \\\"a\\\".to_string()]);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/array.rs\",\n \"rank\": 94,\n \"score\": 46205.811104156135\n },\n {\n \"content\": \"#[test]\\n\\nfn test_astype() {\\n\\n // let iarr = array![1i64, 2, 3];\\n\\n // assert_eq!(iarr.astype::<f64>(), array![1.0f64, 2., 3.]);\\n\\n // assert_eq!(iarr.astype::<i64>(), array![1i64, 2, 3]);\\n\\n\\n\\n // let farr = array![1.1f64, 2.1, 3.1];\\n\\n // assert_eq!(farr.astype::<f64>(), array![1.1f64, 2.1, 3.1]);\\n\\n // assert_eq!(farr.astype::<i64>(), array![1i64, 2, 3]);\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"tests/array.rs\",\n \"rank\": 95,\n \"score\": 46205.811104156135\n },\n {\n \"content\": \"#[test]\\n\\nfn test_container() {\\n\\n let iarr: Array = vec![1i32, 2, 3].into();\\n\\n let farr: Array = vec![1.1f64, 2.1, 3.1].into();\\n\\n let barr: Array = vec![true, false, true].into();\\n\\n let sarr: Array = vec![\\\"a\\\".to_string(), \\\"b\\\".to_string(), \\\"c\\\".to_string()].into();\\n\\n assert_eq!(iarr.dtype(), \\\"i32\\\");\\n\\n assert_eq!(farr.dtype(), \\\"f64\\\");\\n\\n assert_eq!(barr.dtype(), \\\"bool\\\");\\n\\n assert_eq!(sarr.dtype(), \\\"str\\\");\\n\\n\\n\\n let container: Vec<Array> = vec![iarr, farr, barr, sarr];\\n\\n assert_eq!(container.len(), 4);\\n\\n let dtypes: Vec<String> = container.iter().map(|ref x| x.dtype()).collect();\\n\\n assert_eq!(dtypes, vec![\\\"i32\\\", \\\"f64\\\", \\\"bool\\\", \\\"str\\\"]);\\n\\n\\n\\n let i64arr: Array = vec![1i64, 2, 3].into();\\n\\n assert_eq!(i64arr.dtype(), \\\"i64\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/array.rs\",\n \"rank\": 96,\n \"score\": 46205.811104156135\n },\n {\n \"content\": \"#[test]\\n\\n#[should_panic]\\n\\nfn test_ilocs_panic() {\\n\\n let iarr = array![1i64, 2, 3, 4, 5];\\n\\n iarr.ilocs(&vec![1, 5, 0]);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/array.rs\",\n \"rank\": 97,\n \"score\": 44812.89058260212\n },\n {\n \"content\": \"#[test]\\n\\nfn test_dtype_property() {\\n\\n let iarr = array![1i64, 2, 3];\\n\\n assert_eq!(iarr.dtype(), \\\"i64\\\");\\n\\n assert_eq!(iarr.is_numeric(), true);\\n\\n\\n\\n let farr = array![1.1f64, 2.1, 3.1, 4.1];\\n\\n assert_eq!(farr.dtype(), \\\"f64\\\");\\n\\n assert_eq!(farr.is_numeric(), true);\\n\\n\\n\\n let barr = array![true, false, true];\\n\\n assert_eq!(barr.dtype(), \\\"bool\\\");\\n\\n assert_eq!(barr.is_numeric(), false);\\n\\n\\n\\n let sarr = array![\\\"a\\\".to_string(), \\\"b\\\".to_string()];\\n\\n assert_eq!(sarr.dtype(), \\\"str\\\");\\n\\n assert_eq!(sarr.is_numeric(), false);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/array.rs\",\n \"rank\": 98,\n \"score\": 44812.89058260212\n },\n {\n \"content\": \"#[test]\\n\\nfn test_creation_macros() {\\n\\n let iarr = array![1i32, 2, 3];\\n\\n assert_eq!(iarr.dtype(), \\\"i32\\\");\\n\\n assert_eq!(iarr.len(), 3);\\n\\n\\n\\n let i64arr = array![1i64, 2, 3];\\n\\n assert_eq!(i64arr.dtype(), \\\"i64\\\");\\n\\n assert_eq!(i64arr.len(), 3);\\n\\n\\n\\n let farr = array![1.1f64, 2.1, 3.1, 4.1];\\n\\n assert_eq!(farr.dtype(), \\\"f64\\\");\\n\\n assert_eq!(farr.len(), 4);\\n\\n\\n\\n let barr = array![true, false, true];\\n\\n assert_eq!(barr.dtype(), \\\"bool\\\");\\n\\n assert_eq!(barr.len(), 3);\\n\\n\\n\\n let str_arr = array![\\\"A\\\".to_string(), \\\"B\\\".to_string(), \\\"C\\\".to_string()];\\n\\n assert_eq!(str_arr.dtype(), \\\"str\\\");\\n\\n assert_eq!(str_arr.len(), 3);\\n\\n\\n\\n let string_arr = array![\\\"A\\\".to_string(), \\\"B\\\".to_string(), \\\"C\\\".to_string()];\\n\\n assert_eq!(string_arr.dtype(), \\\"str\\\");\\n\\n assert_eq!(string_arr.len(), 3);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/array.rs\",\n \"rank\": 99,\n \"score\": 44812.89058260212\n }\n]","isConversational":false}}},{"rowIdx":1397,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/overlay.rs"},"repo_name":{"kind":"string","value":"penumbra-zone/jellyfish-merkle"},"commit":{"kind":"string","value":"0f216e2dcd3219c58f1bc4a584c373416cbef5cd"},"file_code":{"kind":"string","value":"use std::collections::HashMap;\n\nuse anyhow::Result;\nuse tracing::instrument;\n\nuse crate::{\n storage::{TreeReader, TreeWriter},\n JellyfishMerkleTree, KeyHash, MissingRootError, OwnedValue, RootHash, Version,\n};\n\npub struct WriteOverlay<R> {\n reader: R,\n overlay: HashMap<KeyHash, OwnedValue>,\n version: Version,\n}\n\nimpl<R> WriteOverlay<R> {\n \n \n pub const PRE_GENESIS_VERSION: Version = u64::MAX;\n}\n\nimpl<R> WriteOverlay<R>\nwhere\n R: TreeReader + Sync,\n{\n \n \n \n \n \n \n \n \n pub fn new(reader: R, version: Version) -> Self {\n Self {\n reader,\n version,\n overlay: Default::default(),\n }\n }\n\n fn tree(&self) -> JellyfishMerkleTree<'_, R> {\n JellyfishMerkleTree::new(&self.reader)\n }\n\n \n \n \n #[instrument(name = \"WriteOverlay::get\", skip(self, key))]\n pub async fn get(&self, key: KeyHash) -> Result<Option<OwnedValue>> {\n if let Some(value) = self.overlay.get(&key) {\n tracing::trace!(?key, value = ?hex::encode(&value), \"read from cache\");\n Ok(Some(value.clone()))\n } else {\n match self.tree().get(key, self.version).await {\n Ok(Some(value)) => {\n tracing::trace!(version = ?self.version, ?key, value = ?hex::encode(&value), \"read from tree\");\n Ok(Some(value))\n }\n Ok(None) => {\n tracing::trace!(version = ?self.version, ?key, \"key not found in tree\");\n Ok(None)\n }\n \n Err(e) if e.downcast_ref::<MissingRootError>().is_some() => {\n tracing::trace!(version = ?self.version, \"no data available at this version\");\n Ok(None)\n }\n Err(e) => Err(e),\n }\n }\n }\n\n \n \n \n \n \n #[instrument(name = \"WriteOverlay::get_with_proof\", skip(self, key))]\n pub async fn get_with_proof(\n &self,\n key: Vec<u8>,\n ) -> Result<(OwnedValue, ics23::ExistenceProof)> {\n if self.overlay.contains_key(&key.clone().into()) {\n return Err(anyhow::anyhow!(\"key is not yet committed to tree\"));\n }\n let proof = self.tree().get_with_ics23_proof(key, self.version).await?;\n\n Ok((proof.value.clone(), proof))\n }\n\n \n \n \n \n #[instrument(name = \"WriteOverlay::put\", skip(self, key, value))]\n pub fn put(&mut self, key: KeyHash, value: OwnedValue) {\n tracing::trace!(?key, value = ?hex::encode(&value));\n *self.overlay.entry(key).or_default() = value;\n }\n\n \n \n \n \n #[instrument(name = \"WriteOverlay::commit\", skip(self, writer))]\n pub async fn commit<W>(&mut self, mut writer: W) -> Result<(RootHash, Version)>\n where\n W: TreeWriter + Sync,\n {\n let overlay = std::mem::replace(&mut self.overlay, Default::default());\n \n \n let new_version = self.version.wrapping_add(1);\n tracing::trace!(old_version = ?self.version, new_version, ?overlay);\n let (root_hash, batch) = self\n .tree()\n .put_value_set(overlay.into_iter().collect(), new_version)\n .await?;\n\n writer.write_node_batch(&batch.node_batch).await?;\n tracing::trace!(?root_hash, \"wrote node batch to backing store\");\n\n \n self.version = new_version;\n\n Ok((root_hash, new_version))\n }\n}\n"},"prefix":{"kind":"string","value":"use std::collections::HashMap;\n\nuse anyhow::Result;\nuse tracing::instrument;\n\nuse crate::{\n storage::{TreeReader, TreeWriter},\n JellyfishMerkleTree, KeyHash, MissingRootError, OwnedValue, RootHash, Version,\n};\n\npub struct WriteOverlay<R> {\n reader: R,\n overlay: HashMap<KeyHash, OwnedValue>,\n version: Version,\n}\n\nimpl<R> WriteOverlay<R> {\n \n \n pub const PRE_GENESIS_VERSION: Version = u64::MAX;\n}\n\nimpl<R> WriteOverlay<R>\nwhere\n R: TreeReader + Sync,\n{\n \n \n \n \n \n \n \n \n pub fn new(reader: R, version: Version) -> Self {\n Self {\n reader,\n version,\n overlay: Default::default(),\n }\n }\n\n fn tree(&self) -> JellyfishMerkleTree<'_, R> {\n JellyfishMerkleTree::new(&self.reader)\n }\n\n \n \n \n #[instrument(name = \"WriteOverlay::get\", skip(self, key))]\n pub async fn get(&self, key: KeyHash) -> Result<Option<OwnedValue>> {\n if let Some(value) = self.overlay.get(&key) {\n tracing::trace!(?key, value = ?hex::encode(&value), \"read from cache\");\n Ok(Some(value.clone()))\n } else {\n "},"suffix":{"kind":"string","value":"\n }\n }\n\n \n \n \n \n \n #[instrument(name = \"WriteOverlay::get_with_proof\", skip(self, key))]\n pub async fn get_with_proof(\n &self,\n key: Vec<u8>,\n ) -> Result<(OwnedValue, ics23::ExistenceProof)> {\n if self.overlay.contains_key(&key.clone().into()) {\n return Err(anyhow::anyhow!(\"key is not yet committed to tree\"));\n }\n let proof = self.tree().get_with_ics23_proof(key, self.version).await?;\n\n Ok((proof.value.clone(), proof))\n }\n\n \n \n \n \n #[instrument(name = \"WriteOverlay::put\", skip(self, key, value))]\n pub fn put(&mut self, key: KeyHash, value: OwnedValue) {\n tracing::trace!(?key, value = ?hex::encode(&value));\n *self.overlay.entry(key).or_default() = value;\n }\n\n \n \n \n \n #[instrument(name = \"WriteOverlay::commit\", skip(self, writer))]\n pub async fn commit<W>(&mut self, mut writer: W) -> Result<(RootHash, Version)>\n where\n W: TreeWriter + Sync,\n {\n let overlay = std::mem::replace(&mut self.overlay, Default::default());\n \n \n let new_version = self.version.wrapping_add(1);\n tracing::trace!(old_version = ?self.version, new_version, ?overlay);\n let (root_hash, batch) = self\n .tree()\n .put_value_set(overlay.into_iter().collect(), new_version)\n .await?;\n\n writer.write_node_batch(&batch.node_batch).await?;\n tracing::trace!(?root_hash, \"wrote node batch to backing store\");\n\n \n self.version = new_version;\n\n Ok((root_hash, new_version))\n }\n}\n"},"middle":{"kind":"string","value":"match self.tree().get(key, self.version).await {\n Ok(Some(value)) => {\n tracing::trace!(version = ?self.version, ?key, value = ?hex::encode(&value), \"read from tree\");\n Ok(Some(value))\n }\n Ok(None) => {\n tracing::trace!(version = ?self.version, ?key, \"key not found in tree\");\n Ok(None)\n }\n \n Err(e) if e.downcast_ref::<MissingRootError>().is_some() => {\n tracing::trace!(version = ?self.version, \"no data available at this version\");\n Ok(None)\n }\n Err(e) => Err(e),\n }"},"strategy":{"kind":"string","value":"if_condition"},"context_items":{"kind":"list like","value":[{"content":"/// Computes the key immediately after `key`.\n\npub fn plus_one(key: KeyHash) -> KeyHash {\n\n assert_ne!(key, KeyHash([0xff; 32]));\n\n\n\n let mut buf = key.0;\n\n for i in (0..32).rev() {\n\n if buf[i] == 255 {\n\n buf[i] = 0;\n\n } else {\n\n buf[i] += 1;\n\n break;\n\n }\n\n }\n\n KeyHash(buf)\n\n}\n\n\n\n/// Initializes a DB with a set of key-value pairs by inserting one key at each version.\n\npub async fn init_mock_db(kvs: &HashMap<KeyHash, OwnedValue>) -> (MockTreeStore, Version) {\n\n assert!(!kvs.is_empty());\n\n\n\n let db = MockTreeStore::default();\n","file_path":"src/tests/helper.rs","rank":0,"score":152167.96640051677},{"content":"fn random_leaf_with_key(next_version: Version) -> (Node, NodeKey) {\n\n let key: [u8; 32] = OsRng.gen();\n\n let value: [u8; 32] = OsRng.gen();\n\n let key_hash: KeyHash = key.as_ref().into();\n\n let node = Node::new_leaf(key_hash, value.to_vec());\n\n let node_key = NodeKey::new(next_version, NibblePath::new(key_hash.0.to_vec()));\n\n (node, node_key)\n\n}\n\n\n\n#[tokio::test]\n\nasync fn test_get_node() {\n\n let next_version = 0;\n\n let db = MockTreeStore::default();\n\n let cache = TreeCache::new(&db, next_version).await.unwrap();\n\n\n\n let (node, node_key) = random_leaf_with_key(next_version);\n\n db.put_node(node_key.clone(), node.clone()).await.unwrap();\n\n\n\n assert_eq!(cache.get_node(&node_key).await.unwrap(), node);\n\n}\n","file_path":"src/tests/tree_cache.rs","rank":1,"score":136313.73815072342},{"content":"/// Defines the interface between a\n\n/// [`JellyfishMerkleTree`](crate::JellyfishMerkleTree)\n\n/// and underlying storage holding nodes.\n\npub trait TreeReader: Send + Sync {\n\n /// Gets node given a node key. Returns `None` if the node does not exist.\n\n fn get_node_option<'future, 'a: 'future, 'n: 'future>(\n\n &'a self,\n\n node_key: &'n NodeKey,\n\n ) -> BoxFuture<'future, Result<Option<Node>>>;\n\n\n\n /// Gets the rightmost leaf. Note that this assumes we are in the process of restoring the tree\n\n /// and all nodes are at the same version.\n\n #[allow(clippy::type_complexity)]\n\n fn get_rightmost_leaf<'future, 'a: 'future>(\n\n &'a self,\n\n ) -> BoxFuture<'future, Result<Option<(NodeKey, LeafNode)>>>;\n\n}\n\n\n\n/// Internal helper: Gets node given a node key. Returns error if the node does not exist.\n\npub async fn get_node_async<R: TreeReader>(reader: &R, node_key: &NodeKey) -> Result<Node> {\n\n reader\n\n .get_node_option(node_key)\n\n .await?\n\n .ok_or_else(|| format_err!(\"Missing node at {:?}.\", node_key))\n\n}\n","file_path":"src/reader.rs","rank":2,"score":128036.22424887976},{"content":"fn hash_leaf(key: KeyHash, value_hash: ValueHash) -> [u8; 32] {\n\n SparseMerkleLeafNode::new(key, value_hash).hash()\n\n}\n\n\n","file_path":"src/tests/node_type.rs","rank":3,"score":121769.57178609373},{"content":"// Generate a pair of leaf node key and account key with a passed-in 63-nibble node key and the last\n\n// nibble to be appended.\n\nfn gen_leaf_keys(version: Version, nibble_path: &NibblePath, nibble: Nibble) -> (NodeKey, KeyHash) {\n\n assert_eq!(nibble_path.num_nibbles(), 63);\n\n let mut np = nibble_path.clone();\n\n np.push(nibble);\n\n let account_key = KeyHash(np.bytes().try_into().unwrap());\n\n (NodeKey::new(version, np), account_key)\n\n}\n\n\n","file_path":"src/tests/node_type.rs","rank":4,"score":119915.06299559216},{"content":"pub fn arb_existent_kvs_and_nonexistent_keys(\n\n num_kvs: usize,\n\n num_non_existing_keys: usize,\n\n) -> impl Strategy<Value = (HashMap<KeyHash, OwnedValue>, Vec<KeyHash>)> {\n\n hash_map(any::<KeyHash>(), any::<OwnedValue>(), 1..num_kvs).prop_flat_map(move |kvs| {\n\n let kvs_clone = kvs.clone();\n\n (\n\n Just(kvs),\n\n vec(\n\n any::<KeyHash>().prop_filter(\n\n \"Make sure these keys do not exist in the tree.\",\n\n move |key| !kvs_clone.contains_key(key),\n\n ),\n\n num_non_existing_keys,\n\n ),\n\n )\n\n })\n\n}\n\n\n\npub async fn test_get_with_proof(\n\n (existent_kvs, nonexistent_keys): (HashMap<KeyHash, OwnedValue>, Vec<KeyHash>),\n\n) {\n\n let (db, version) = init_mock_db(&existent_kvs).await;\n\n let tree = JellyfishMerkleTree::new(&db);\n\n\n\n test_existent_keys_impl(&tree, version, &existent_kvs).await;\n\n test_nonexistent_keys_impl(&tree, version, &nonexistent_keys).await;\n\n}\n\n\n","file_path":"src/tests/helper.rs","rank":5,"score":111722.69077869739},{"content":"/// `FrozenTreeCache` is used as a field of `TreeCache` storing all the nodes and values that\n\n/// are generated by earlier transactions so they have to be immutable. The motivation of\n\n/// `FrozenTreeCache` is to let `TreeCache` freeze intermediate results from each transaction to\n\n/// help commit more than one transaction in a row atomically.\n\nstruct FrozenTreeCache {\n\n /// Immutable node_cache.\n\n node_cache: NodeBatch,\n\n\n\n /// Immutable stale_node_index_cache.\n\n stale_node_index_cache: StaleNodeIndexBatch,\n\n\n\n /// the stats vector including the number of new nodes, new leaves, stale nodes and stale leaves.\n\n node_stats: Vec<NodeStats>,\n\n\n\n /// Frozen root hashes after each earlier transaction.\n\n root_hashes: Vec<RootHash>,\n\n}\n\n\n\nimpl FrozenTreeCache {\n\n fn new() -> Self {\n\n Self {\n\n node_cache: BTreeMap::new(),\n\n stale_node_index_cache: BTreeSet::new(),\n\n node_stats: Vec::new(),\n","file_path":"src/tree_cache.rs","rank":6,"score":91017.94989064043},{"content":"pub fn arb_tree_with_index(\n\n tree_size: usize,\n\n) -> impl Strategy<Value = (BTreeMap<KeyHash, OwnedValue>, usize)> {\n\n btree_map(any::<KeyHash>(), any::<OwnedValue>(), 1..tree_size).prop_flat_map(|btree| {\n\n let len = btree.len();\n\n (Just(btree), 0..len)\n\n })\n\n}\n\n\n\npub async fn test_get_range_proof((btree, n): (BTreeMap<KeyHash, OwnedValue>, usize)) {\n\n let (db, version) = init_mock_db(&btree.clone().into_iter().collect()).await;\n\n let tree = JellyfishMerkleTree::new(&db);\n\n\n\n let nth_key = btree.keys().nth(n).unwrap();\n\n\n\n let proof = tree.get_range_proof(*nth_key, version).await.unwrap();\n\n verify_range_proof(\n\n tree.get_root_hash(version).await.unwrap(),\n\n btree.into_iter().take(n + 1).collect(),\n\n proof,\n","file_path":"src/tests/helper.rs","rank":7,"score":90530.79015690157},{"content":"/// Defines the interface used to write a batch of updates from a\n\n/// [`JellyfishMerkleTree`](crate::JellyfishMerkleTree)\n\n/// to the underlying storage holding nodes.\n\npub trait TreeWriter: Send + Sync {\n\n /// Writes a node batch into storage.\n\n fn write_node_batch<'future, 'a: 'future, 'n: 'future>(\n\n &'a mut self,\n\n node_batch: &'n NodeBatch,\n\n ) -> BoxFuture<'future, Result<()>>;\n\n}\n\n\n\n/// Node batch that will be written into db atomically with other batches.\n\npub type NodeBatch = BTreeMap<NodeKey, Node>;\n\n/// [`StaleNodeIndex`](struct.StaleNodeIndex.html) batch that will be written into db atomically\n\n/// with other batches.\n\npub type StaleNodeIndexBatch = BTreeSet<StaleNodeIndex>;\n\n\n\n#[derive(Clone, Debug, Default, Eq, PartialEq)]\n\npub struct NodeStats {\n\n pub new_nodes: usize,\n\n pub new_leaves: usize,\n\n pub stale_nodes: usize,\n\n pub stale_leaves: usize,\n","file_path":"src/writer.rs","rank":8,"score":89754.57351693374},{"content":"fn update_nibble(original_key: &KeyHash, n: usize, nibble: u8) -> KeyHash {\n\n assert!(nibble < 16);\n\n let mut key = original_key.0;\n\n key[n / 2] = if n % 2 == 0 {\n\n key[n / 2] & 0x0f | nibble << 4\n\n } else {\n\n key[n / 2] & 0xf0 | nibble\n\n };\n\n KeyHash(key)\n\n}\n\n\n\n#[tokio::test]\n\nasync fn test_insert_to_empty_tree() {\n\n let db = MockTreeStore::default();\n\n let tree = JellyfishMerkleTree::new(&db);\n\n\n\n // Tree is initially empty. Root is a null node. We'll insert a key-value pair which creates a\n\n // leaf node.\n\n let key = b\"testkey\";\n\n let value = vec![1u8, 2u8, 3u8, 4u8];\n","file_path":"src/tests/jellyfish_merkle.rs","rank":9,"score":85914.90459483003},{"content":"pub fn arb_kv_pair_with_distinct_last_nibble(\n\n) -> impl Strategy<Value = ((KeyHash, OwnedValue), (KeyHash, OwnedValue))> {\n\n (\n\n any::<KeyHash>().prop_filter(\"Can't be 0xffffff...\", |key| *key != KeyHash([0xff; 32])),\n\n vec(any::<OwnedValue>(), 2),\n\n )\n\n .prop_map(|(key1, accounts)| {\n\n let key2 = plus_one(key1);\n\n ((key1, accounts[0].clone()), (key2, accounts[1].clone()))\n\n })\n\n}\n\n\n\npub async fn test_get_with_proof_with_distinct_last_nibble(\n\n (kv1, kv2): ((KeyHash, OwnedValue), (KeyHash, OwnedValue)),\n\n) {\n\n let mut kvs = HashMap::new();\n\n kvs.insert(kv1.0, kv1.1);\n\n kvs.insert(kv2.0, kv2.1);\n\n\n\n let (db, version) = init_mock_db(&kvs).await;\n\n let tree = JellyfishMerkleTree::new(&db);\n\n\n\n test_existent_keys_impl(&tree, version, &kvs).await;\n\n}\n\n\n","file_path":"src/tests/helper.rs","rank":10,"score":84044.98884141081},{"content":"pub fn ics23_spec() -> ics23::ProofSpec {\n\n ics23::ProofSpec {\n\n leaf_spec: Some(ics23::LeafOp {\n\n hash: ics23::HashOp::Sha256.into(),\n\n prehash_key: ics23::HashOp::Sha256.into(),\n\n prehash_value: ics23::HashOp::Sha256.into(),\n\n length: ics23::LengthOp::NoPrefix.into(),\n\n prefix: b\"JMT::LeafNode\".to_vec(),\n\n }),\n\n inner_spec: Some(ics23::InnerSpec {\n\n // This is the only field we're sure about\n\n hash: ics23::HashOp::Sha256.into(),\n\n // These fields are apparently used for neighbor tests in range proofs,\n\n // and could be wrong:\n\n child_order: vec![0, 1], //where exactly does this need to be true?\n\n min_prefix_length: 16, //what is this?\n\n max_prefix_length: 48, //and this?\n\n child_size: 32,\n\n empty_child: vec![], //check JMT repo to determine if special value used here\n\n }),\n","file_path":"src/ics23_impl.rs","rank":11,"score":80147.66093207162},{"content":"// Generate a random node key with 63 nibbles.\n\nfn random_63nibbles_node_key() -> NodeKey {\n\n let mut bytes: [u8; 32] = OsRng.gen();\n\n *bytes.last_mut().unwrap() &= 0xf0;\n\n NodeKey::new(0 /* version */, NibblePath::new_odd(bytes.to_vec()))\n\n}\n\n\n","file_path":"src/tests/node_type.rs","rank":12,"score":74632.84826568725},{"content":"/// Returns the key immediately before `key` in `btree`.\n\nfn prev_key<K, V>(btree: &BTreeMap<K, V>, key: &K) -> Option<K>\n\nwhere\n\n K: Clone + Ord,\n\n{\n\n btree\n\n .range((Bound::Unbounded, Bound::Excluded(key)))\n\n .next_back()\n\n .map(|(k, _v)| k.clone())\n\n}\n\n\n","file_path":"src/tests/helper.rs","rank":13,"score":67296.92578774039},{"content":"fn next_key<K, V>(btree: &BTreeMap<K, V>, key: &K) -> Option<K>\n\nwhere\n\n K: Clone + Ord,\n\n{\n\n btree\n\n .range((Bound::Excluded(key), Bound::Unbounded))\n\n .next()\n\n .map(|(k, _v)| k.clone())\n\n}\n\n\n","file_path":"src/tests/helper.rs","rank":14,"score":67292.64245352519},{"content":"/// Advance both iterators if their next nibbles are the same until either reaches the end or\n\n/// the find a mismatch. Return the number of matched nibbles.\n\npub fn skip_common_prefix<I1, I2>(x: &mut I1, y: &mut I2) -> usize\n\nwhere\n\n I1: Iterator + Peekable,\n\n I2: Iterator + Peekable,\n\n <I1 as Iterator>::Item: std::cmp::PartialEq<<I2 as Iterator>::Item>,\n\n{\n\n let mut count = 0;\n\n loop {\n\n let x_peek = x.peek();\n\n let y_peek = y.peek();\n\n if x_peek.is_none()\n\n || y_peek.is_none()\n\n || x_peek.expect(\"cannot be none\") != y_peek.expect(\"cannot be none\")\n\n {\n\n break;\n\n }\n\n count += 1;\n\n x.next();\n\n y.next();\n\n }\n\n count\n\n}\n","file_path":"src/types/nibble/nibble_path.rs","rank":15,"score":58095.10552090459},{"content":"fn arb_sparse_merkle_sibling() -> impl Strategy<Value = [u8; 32]> {\n\n prop_oneof![\n\n arb_non_placeholder_sparse_merkle_sibling(),\n\n Just(SPARSE_MERKLE_PLACEHOLDER_HASH),\n\n ]\n\n}\n\n\n\nimpl Arbitrary for SparseMerkleProof {\n\n type Parameters = ();\n\n type Strategy = BoxedStrategy<Self>;\n\n\n\n fn arbitrary_with(_args: Self::Parameters) -> Self::Strategy {\n\n (\n\n any::<Option<SparseMerkleLeafNode>>(),\n\n (0..=256usize).prop_flat_map(|len| {\n\n if len == 0 {\n\n Just(vec![]).boxed()\n\n } else {\n\n (\n\n arb_non_placeholder_sparse_merkle_sibling(),\n","file_path":"src/types/proof/proptest_proof.rs","rank":16,"score":54849.30601458446},{"content":"#[derive(Clone, Debug)]\n\nstruct InternalInfo {\n\n /// The node key of this internal node.\n\n node_key: NodeKey,\n\n\n\n /// The existing children. Every time a child appears, the corresponding position will be set\n\n /// to `Some`.\n\n children: [Option<ChildInfo>; 16],\n\n}\n\n\n\nimpl InternalInfo {\n\n /// Creates an empty internal node with no children.\n\n fn new_empty(node_key: NodeKey) -> Self {\n\n Self {\n\n node_key,\n\n children: Default::default(),\n\n }\n\n }\n\n\n\n fn set_child(&mut self, index: usize, child_info: ChildInfo) {\n\n precondition!(index < 16);\n","file_path":"src/restore.rs","rank":17,"score":54791.64621946222},{"content":"#[derive(Debug)]\n\nstruct NodeVisitInfo {\n\n /// The key to this node.\n\n node_key: NodeKey,\n\n\n\n /// The node itself.\n\n node: InternalNode,\n\n\n\n /// The bitmap indicating which children exist. It is generated by running\n\n /// `self.node.generate_bitmaps().0` and cached here.\n\n children_bitmap: u16,\n\n\n\n /// This integer always has exactly one 1-bit. The position of the 1-bit (from LSB) indicates\n\n /// the next child to visit in the iteration process. All the ones on the left have already\n\n /// been visited. All the chilren on the right (including this one) have not been visited yet.\n\n next_child_to_visit: u16,\n\n}\n\n\n\nimpl NodeVisitInfo {\n\n /// Constructs a new `NodeVisitInfo` with given node key and node. `next_child_to_visit` will\n\n /// be set to the leftmost child.\n","file_path":"src/iterator.rs","rank":18,"score":53235.52533924555},{"content":"fn arb_non_placeholder_sparse_merkle_sibling() -> impl Strategy<Value = [u8; 32]> {\n\n any::<[u8; 32]>().prop_filter(\"Filter out placeholder sibling.\", |x| {\n\n *x != SPARSE_MERKLE_PLACEHOLDER_HASH\n\n })\n\n}\n\n\n","file_path":"src/types/proof/proptest_proof.rs","rank":19,"score":51981.077689793216},{"content":"struct NaiveInternalNode {\n\n root: Rc<BinaryTreeNode>,\n\n}\n\n\n\nimpl NaiveInternalNode {\n\n fn from_clever_node(node: &InternalNode) -> Self {\n\n Self {\n\n root: Rc::new(Self::node_for_subtree(0, 16, node.children())),\n\n }\n\n }\n\n\n\n fn node_for_subtree(begin: u8, width: u8, children: &Children) -> BinaryTreeNode {\n\n if width == 1 {\n\n return children\n\n .get(&begin.into())\n\n .map_or(BinaryTreeNode::Null, |child| {\n\n BinaryTreeNode::new_child(begin, child)\n\n });\n\n }\n\n\n","file_path":"src/tests/node_type.rs","rank":20,"score":50534.346717707325},{"content":"/// An internal node in a binary tree corresponding to a `InternalNode` being tested.\n\n///\n\n/// To describe its position in the binary tree, we use a range of level 0 (children level)\n\n/// positions expressed by (`begin`, `width`)\n\n///\n\n/// For example, in the below graph, node A has (begin:0, width:4), while node B has\n\n/// (begin:2, width: 2):\n\n/// ...\n\n/// /\n\n/// [A] ...\n\n/// / \\\n\n/// * [B] ...\n\n/// / \\ / \\\n\n/// 0 1 2 3 ... 15\n\nstruct BinaryTreeInternalNode {\n\n begin: u8,\n\n width: u8,\n\n left: Rc<BinaryTreeNode>,\n\n right: Rc<BinaryTreeNode>,\n\n hash: [u8; 32],\n\n}\n\n\n\nimpl BinaryTreeInternalNode {\n\n fn in_left_subtree(&self, n: u8) -> bool {\n\n assert!(n >= self.begin);\n\n assert!(n < self.begin + self.width);\n\n\n\n n < self.begin + self.width / 2\n\n }\n\n}\n\n\n\n/// A child node, corresponding to one that is in the corresponding `InternalNode` being tested.\n\n///\n\n/// `index` is its key in `InternalNode::children`.\n\n/// N.B. when `is_leaf` is true, in the binary tree represented by a `NaiveInternalNode`, the child\n\n/// node will be brought up to the root of the highest subtree that has only that leaf.\n","file_path":"src/tests/node_type.rs","rank":21,"score":49357.705364455425},{"content":"#[derive(Clone, Copy)]\n\nstruct BinaryTreeChildNode {\n\n version: Version,\n\n index: u8,\n\n hash: [u8; 32],\n\n is_leaf: bool,\n\n}\n\n\n","file_path":"src/tests/node_type.rs","rank":22,"score":49354.62000392258},{"content":"/// The interface used with [`JellyfishMerkleRestore`], taken from the Diem `storage-interface` crate.\n\npub trait StateSnapshotReceiver {\n\n fn add_chunk<'future, 'a: 'future>(\n\n &'a mut self,\n\n chunk: Vec<(KeyHash, OwnedValue)>,\n\n proof: SparseMerkleRangeProof,\n\n ) -> BoxFuture<'future, Result<()>>;\n\n\n\n fn finish(self) -> BoxFuture<'static, Result<()>>;\n\n\n\n fn finish_box(self: Box<Self>) -> BoxFuture<'static, Result<()>>;\n\n}\n\n\n\nimpl StateSnapshotReceiver for JellyfishMerkleRestore {\n\n fn add_chunk<'future, 'a: 'future>(\n\n &'a mut self,\n\n chunk: Vec<(KeyHash, OwnedValue)>,\n\n proof: SparseMerkleRangeProof,\n\n ) -> BoxFuture<'future, Result<()>> {\n\n self.add_chunk_impl(chunk, proof).boxed()\n\n }\n\n\n\n fn finish(self) -> BoxFuture<'static, Result<()>> {\n\n self.finish_impl().boxed()\n\n }\n\n\n\n fn finish_box(self: Box<Self>) -> BoxFuture<'static, Result<()>> {\n\n self.finish_impl().boxed()\n\n }\n\n}\n","file_path":"src/restore.rs","rank":23,"score":48985.97798208194},{"content":"struct EscapedByteSlice<'a>(&'a [u8]);\n\n\n\nimpl<'a> std::fmt::Debug for EscapedByteSlice<'a> {\n\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\n\n write!(f, \"b\\\"\")?;\n\n for &b in self.0 {\n\n // https://doc.rust-lang.org/reference/tokens.html#byte-escapes\n\n if b == b'\\n' {\n\n write!(f, \"\\\\n\")?;\n\n } else if b == b'\\r' {\n\n write!(f, \"\\\\r\")?;\n\n } else if b == b'\\t' {\n\n write!(f, \"\\\\t\")?;\n\n } else if b == b'\\\\' || b == b'\"' {\n\n write!(f, \"\\\\{}\", b as char)?;\n\n } else if b == b'\\0' {\n\n write!(f, \"\\\\0\")?;\n\n // ASCII printable\n\n } else if b >= 0x20 && b < 0x7f {\n\n write!(f, \"{}\", b as char)?;\n\n } else {\n\n write!(f, \"\\\\x{:02x}\", b)?;\n\n }\n\n }\n\n write!(f, \"\\\"\")?;\n\n Ok(())\n\n }\n\n}\n","file_path":"src/lib.rs","rank":24,"score":46123.94359335159},{"content":"/// Checks if we can construct the expected root hash using the entries in the btree and the proof.\n\nfn verify_range_proof(\n\n expected_root_hash: RootHash,\n\n btree: BTreeMap<KeyHash, OwnedValue>,\n\n proof: SparseMerkleRangeProof,\n\n) {\n\n // For example, given the following sparse Merkle tree:\n\n //\n\n // root\n\n // / \\\n\n // / \\\n\n // / \\\n\n // o o\n\n // / \\ / \\\n\n // a o o h\n\n // / \\ / \\\n\n // o d e X\n\n // / \\ / \\\n\n // b c f g\n\n //\n\n // we transform the keys as follows:\n","file_path":"src/tests/helper.rs","rank":25,"score":45826.809026759496},{"content":"pub trait Peekable: Iterator {\n\n /// Returns the `next()` value without advancing the iterator.\n\n fn peek(&self) -> Option<Self::Item>;\n\n}\n\n\n\n/// BitIterator iterates a nibble path by bit.\n\npub struct BitIterator<'a> {\n\n nibble_path: &'a NibblePath,\n\n pos: std::ops::Range<usize>,\n\n}\n\n\n\nimpl<'a> Peekable for BitIterator<'a> {\n\n /// Returns the `next()` value without advancing the iterator.\n\n fn peek(&self) -> Option<Self::Item> {\n\n if self.pos.start < self.pos.end {\n\n Some(self.nibble_path.get_bit(self.pos.start))\n\n } else {\n\n None\n\n }\n\n }\n","file_path":"src/types/nibble/nibble_path.rs","rank":26,"score":44696.96976882307},{"content":"#[test]\n\nfn test_leaf_hash() {\n\n {\n\n let address = KeyHash(OsRng.gen());\n\n let blob = vec![0x02];\n\n let value_hash: ValueHash = blob.as_slice().into();\n\n let hash = hash_leaf(address, value_hash);\n\n let leaf_node = Node::new_leaf(address, blob);\n\n assert_eq!(leaf_node.hash(), hash);\n\n }\n\n}\n\n\n\nproptest! {\n\n #[test]\n\n fn two_leaves_test1(index1 in (0..8u8).prop_map(Nibble::from), index2 in (8..16u8).prop_map(Nibble::from)) {\n\n let internal_node_key = random_63nibbles_node_key();\n\n let mut children = Children::default();\n\n\n\n let leaf1_node_key = gen_leaf_keys(0 /* version */, internal_node_key.nibble_path(), index1).0;\n\n let leaf2_node_key = gen_leaf_keys(1 /* version */, internal_node_key.nibble_path(), index2).0;\n\n let hash1 = OsRng.gen();\n","file_path":"src/tests/node_type.rs","rank":27,"score":44549.014821985504},{"content":"#[test]\n\n#[allow(clippy::bool_assert_comparison)]\n\nfn test_get_bit() {\n\n let bytes = vec![0x01, 0x02];\n\n let nibble_path = NibblePath::new(bytes);\n\n assert_eq!(nibble_path.get_bit(0), false);\n\n assert_eq!(nibble_path.get_bit(1), false);\n\n assert_eq!(nibble_path.get_bit(2), false);\n\n assert_eq!(nibble_path.get_bit(7), true);\n\n assert_eq!(nibble_path.get_bit(8), false);\n\n assert_eq!(nibble_path.get_bit(14), true);\n\n}\n\n\n","file_path":"src/tests/nibble_path.rs","rank":28,"score":44549.014821985504},{"content":"#[test]\n\nfn test_encode_decode() {\n\n let internal_node_key = random_63nibbles_node_key();\n\n\n\n let leaf1_keys = gen_leaf_keys(0, internal_node_key.nibble_path(), Nibble::from(1));\n\n let leaf1_node = Node::new_leaf(leaf1_keys.1, vec![0x00]);\n\n let leaf2_keys = gen_leaf_keys(0, internal_node_key.nibble_path(), Nibble::from(2));\n\n let leaf2_node = Node::new_leaf(leaf2_keys.1, vec![0x01]);\n\n\n\n let mut children = Children::default();\n\n children.insert(\n\n Nibble::from(1),\n\n Child::new(leaf1_node.hash(), 0 /* version */, NodeType::Leaf),\n\n );\n\n children.insert(\n\n Nibble::from(2),\n\n Child::new(leaf2_node.hash(), 0 /* version */, NodeType::Leaf),\n\n );\n\n\n\n let account_key = KeyHash(OsRng.gen());\n\n let nodes = vec![\n","file_path":"src/tests/node_type.rs","rank":29,"score":44549.014821985504},{"content":"#[test]\n\nfn test_internal_validity() {\n\n let result = panic::catch_unwind(|| {\n\n let children = Children::default();\n\n InternalNode::new(children)\n\n });\n\n assert!(result.is_err());\n\n\n\n let result = panic::catch_unwind(|| {\n\n let mut children = Children::default();\n\n children.insert(\n\n Nibble::from(1),\n\n Child::new(OsRng.gen(), 0 /* version */, NodeType::Leaf),\n\n );\n\n InternalNode::new(children);\n\n });\n\n assert!(result.is_err());\n\n}\n\n\n","file_path":"src/tests/node_type.rs","rank":30,"score":44549.014821985504},{"content":"#[test]\n\nfn test_get_nibble() {\n\n let bytes = vec![0x12, 0x34];\n\n let nibble_path = NibblePath::new(bytes);\n\n assert_eq!(nibble_path.get_nibble(0), Nibble::from(0x01));\n\n assert_eq!(nibble_path.get_nibble(1), Nibble::from(0x02));\n\n assert_eq!(nibble_path.get_nibble(2), Nibble::from(0x03));\n\n assert_eq!(nibble_path.get_nibble(3), Nibble::from(0x04));\n\n}\n\n\n","file_path":"src/tests/nibble_path.rs","rank":31,"score":44549.014821985504},{"content":"#[test]\n\nfn test_bit_iter() {\n\n let bytes = vec![0xc3, 0xa0];\n\n let nibble_path = NibblePath::new_odd(bytes);\n\n let mut iter = nibble_path.bits();\n\n // c: 0b1100\n\n assert_eq!(iter.next(), Some(true));\n\n assert_eq!(iter.next(), Some(true));\n\n assert_eq!(iter.next(), Some(false));\n\n assert_eq!(iter.next(), Some(false));\n\n // 3: 0b0011\n\n assert_eq!(iter.next(), Some(false));\n\n assert_eq!(iter.next(), Some(false));\n\n assert_eq!(iter.next(), Some(true));\n\n assert_eq!(iter.next(), Some(true));\n\n // a: 0b1010\n\n assert_eq!(iter.next_back(), Some(false));\n\n assert_eq!(iter.next_back(), Some(true));\n\n assert_eq!(iter.next_back(), Some(false));\n\n assert_eq!(iter.next_back(), Some(true));\n\n\n\n assert_eq!(iter.next(), None);\n\n}\n\n\n","file_path":"src/tests/nibble_path.rs","rank":32,"score":44549.014821985504},{"content":"#[test]\n\nfn test_nibble_iterator() {\n\n let bytes = vec![0x12, 0x30];\n\n let nibble_path = NibblePath::new_odd(bytes);\n\n let mut iter = nibble_path.nibbles();\n\n assert_eq!(iter.next().unwrap(), Nibble::from(0x01));\n\n assert_eq!(iter.next().unwrap(), Nibble::from(0x02));\n\n assert_eq!(iter.next().unwrap(), Nibble::from(0x03));\n\n assert_eq!(iter.next(), None);\n\n}\n\n\n","file_path":"src/tests/nibble_path.rs","rank":33,"score":44549.014821985504},{"content":"/// Computes the root hash of a sparse Merkle tree. `kvs` consists of the entire set of key-value\n\n/// pairs stored in the tree.\n\nfn compute_root_hash(kvs: Vec<(Vec<bool>, [u8; 32])>) -> RootHash {\n\n let mut kv_ref = vec![];\n\n for (key, value) in &kvs {\n\n kv_ref.push((&key[..], *value));\n\n }\n\n RootHash(compute_root_hash_impl(kv_ref))\n\n}\n\n\n","file_path":"src/tests/helper.rs","rank":34,"score":44384.221928185434},{"content":"#[test]\n\n#[should_panic(expected = \"Should have odd number of nibbles.\")]\n\nfn test_empty_nibble_path() {\n\n NibblePath::new_odd(vec![]);\n\n}\n\n\n","file_path":"src/tests/nibble_path.rs","rank":35,"score":43382.553861390516},{"content":"#[test]\n\nfn test_skip_common_prefix() {\n\n {\n\n let nibble_path1 = NibblePath::new(vec![0x12, 0x34, 0x56]);\n\n let nibble_path2 = NibblePath::new(vec![0x12, 0x34, 0x56]);\n\n let mut iter1 = nibble_path1.nibbles();\n\n let mut iter2 = nibble_path2.nibbles();\n\n assert_eq!(skip_common_prefix(&mut iter1, &mut iter2), 6);\n\n assert!(iter1.is_finished());\n\n assert!(iter2.is_finished());\n\n }\n\n {\n\n let nibble_path1 = NibblePath::new(vec![0x12, 0x35]);\n\n let nibble_path2 = NibblePath::new(vec![0x12, 0x34, 0x56]);\n\n let mut iter1 = nibble_path1.nibbles();\n\n let mut iter2 = nibble_path2.nibbles();\n\n assert_eq!(skip_common_prefix(&mut iter1, &mut iter2), 3);\n\n assert_eq!(\n\n iter1.visited_nibbles().get_nibble_path(),\n\n iter2.visited_nibbles().get_nibble_path()\n\n );\n","file_path":"src/tests/nibble_path.rs","rank":36,"score":43382.553861390516},{"content":"#[test]\n\nfn test_visited_nibble_iter() {\n\n let bytes = vec![0x12, 0x34, 0x56];\n\n let nibble_path = NibblePath::new(bytes);\n\n let mut iter = nibble_path.nibbles();\n\n assert_eq!(iter.next().unwrap(), 0x01.into());\n\n assert_eq!(iter.next().unwrap(), 0x02.into());\n\n assert_eq!(iter.next().unwrap(), 0x03.into());\n\n let mut visited_nibble_iter = iter.visited_nibbles();\n\n assert_eq!(visited_nibble_iter.next().unwrap(), 0x01.into());\n\n assert_eq!(visited_nibble_iter.next().unwrap(), 0x02.into());\n\n assert_eq!(visited_nibble_iter.next().unwrap(), 0x03.into());\n\n}\n\n\n","file_path":"src/tests/nibble_path.rs","rank":37,"score":43382.553861390516},{"content":"#[test]\n\nfn test_internal_hash_and_proof() {\n\n // non-leaf case 1\n\n {\n\n let internal_node_key = random_63nibbles_node_key();\n\n let mut children = Children::default();\n\n\n\n let index1 = Nibble::from(4);\n\n let index2 = Nibble::from(15);\n\n let hash1 = OsRng.gen();\n\n let hash2 = OsRng.gen();\n\n let child1_node_key = gen_leaf_keys(\n\n 0, /* version */\n\n internal_node_key.nibble_path(),\n\n index1,\n\n )\n\n .0;\n\n let child2_node_key = gen_leaf_keys(\n\n 1, /* version */\n\n internal_node_key.nibble_path(),\n\n index2,\n","file_path":"src/tests/node_type.rs","rank":38,"score":43382.553861390516},{"content":"#[test]\n\nfn test_nibble_path_fmt() {\n\n let nibble_path = NibblePath::new(vec![0x12, 0x34, 0x56]);\n\n assert_eq!(format!(\"{:?}\", nibble_path), \"123456\");\n\n\n\n let nibble_path = NibblePath::new(vec![0x12, 0x34, 0x50]);\n\n assert_eq!(format!(\"{:?}\", nibble_path), \"123450\");\n\n\n\n let nibble_path = NibblePath::new_odd(vec![0x12, 0x34, 0x50]);\n\n assert_eq!(format!(\"{:?}\", nibble_path), \"12345\");\n\n}\n\n\n","file_path":"src/tests/nibble_path.rs","rank":39,"score":43382.553861390516},{"content":"#[test]\n\n#[should_panic(expected = \"Last nibble must be 0.\")]\n\nfn test_create_nibble_path_failure() {\n\n let bytes = vec![0x12, 0x34, 0x56];\n\n let _nibble_path = NibblePath::new_odd(bytes);\n\n}\n\n\n","file_path":"src/tests/nibble_path.rs","rank":40,"score":42310.491190025714},{"content":"#[test]\n\nfn test_create_nibble_path_success() {\n\n let nibble_path = NibblePath::new(vec![0x12, 0x34, 0x56]);\n\n assert_eq!(nibble_path.num_nibbles(), 6);\n\n\n\n let nibble_path = NibblePath::new(vec![0x12, 0x34, 0x50]);\n\n assert_eq!(nibble_path.num_nibbles(), 6);\n\n\n\n let nibble_path = NibblePath::new_odd(vec![0x12, 0x34, 0x50]);\n\n assert_eq!(nibble_path.num_nibbles(), 5);\n\n\n\n let nibble_path = NibblePath::new(vec![]);\n\n assert_eq!(nibble_path.num_nibbles(), 0);\n\n}\n\n\n","file_path":"src/tests/nibble_path.rs","rank":41,"score":42310.491190025714},{"content":"pub trait Bytes32Ext: Index<usize> + Sized {\n\n /// Returns the `index`-th nibble.\n\n fn get_nibble(&self, index: usize) -> crate::types::nibble::Nibble;\n\n /// Returns the length of common prefix of `self` and `other` in bits.\n\n fn common_prefix_bits_len(&self, other: &[u8; 32]) -> usize;\n\n /// Returns a `HashValueBitIterator` over all the bits that represent this hash value.\n\n fn iter_bits(&self) -> HashValueBitIterator<'_>;\n\n /// Returns the `index`-th nibble in the bytes.\n\n fn nibble(&self, index: usize) -> u8;\n\n /// Returns the length of common prefix of `self` and `other` in nibbles.\n\n fn common_prefix_nibbles_len(&self, other: &[u8; 32]) -> usize {\n\n self.common_prefix_bits_len(other) / 4\n\n }\n\n /// Constructs a `HashValue` from an iterator of bits.\n\n fn from_bit_iter(iter: impl ExactSizeIterator<Item = bool>) -> Option<Self>;\n\n}\n\n\n\nimpl Bytes32Ext for [u8; 32] {\n\n fn get_nibble(&self, index: usize) -> crate::types::nibble::Nibble {\n\n crate::types::nibble::Nibble::from(if index % 2 == 0 {\n","file_path":"src/bytes32ext.rs","rank":42,"score":41909.569394826474},{"content":"use anyhow::{format_err, Result};\n\nuse futures::future::BoxFuture;\n\n\n\nuse crate::node_type::{LeafNode, Node, NodeKey};\n\n\n\n/// Defines the interface between a\n\n/// [`JellyfishMerkleTree`](crate::JellyfishMerkleTree)\n\n/// and underlying storage holding nodes.\n","file_path":"src/reader.rs","rank":43,"score":35957.033764471744},{"content":" stale_node_index_cache: HashSet<NodeKey>,\n\n\n\n /// # of leaves in the `stale_node_index_cache`,\n\n num_stale_leaves: usize,\n\n\n\n /// The immutable part of this cache, which will be committed to the underlying storage.\n\n frozen_cache: FrozenTreeCache,\n\n\n\n /// The underlying persistent storage.\n\n reader: &'a R,\n\n}\n\n\n\nimpl<'a, R> TreeCache<'a, R>\n\nwhere\n\n R: 'a + TreeReader,\n\n{\n\n /// Constructs a new `TreeCache` instance.\n\n pub async fn new(reader: &'a R, next_version: Version) -> Result<TreeCache<'a, R>> {\n\n let mut node_cache = HashMap::new();\n\n let root_node_key = if next_version == 0 {\n","file_path":"src/tree_cache.rs","rank":51,"score":33798.79493024573},{"content":" };\n\n Ok(Self {\n\n node_cache,\n\n stale_node_index_cache: HashSet::new(),\n\n frozen_cache: FrozenTreeCache::new(),\n\n root_node_key,\n\n next_version,\n\n reader,\n\n num_stale_leaves: 0,\n\n num_new_leaves: 0,\n\n })\n\n }\n\n\n\n /// Gets a node with given node key. If it doesn't exist in node cache, read from `reader`.\n\n pub async fn get_node(&self, node_key: &NodeKey) -> Result<Node> {\n\n Ok(if let Some(node) = self.node_cache.get(node_key) {\n\n node.clone()\n\n } else if let Some(node) = self.frozen_cache.node_cache.get(node_key) {\n\n node.clone()\n\n } else {\n","file_path":"src/tree_cache.rs","rank":52,"score":33797.80948252679},{"content":" root_hashes: Vec::new(),\n\n }\n\n }\n\n}\n\n\n\n/// `TreeCache` is a in-memory cache for per-transaction updates of sparse Merkle nodes and values.\n\npub struct TreeCache<'a, R> {\n\n /// `NodeKey` of the current root node in cache.\n\n root_node_key: NodeKey,\n\n\n\n /// The version of the transaction to which the upcoming `put`s will be related.\n\n next_version: Version,\n\n\n\n /// Intermediate nodes keyed by node hash\n\n node_cache: HashMap<NodeKey, Node>,\n\n\n\n /// # of leaves in the `node_cache`,\n\n num_new_leaves: usize,\n\n\n\n /// Partial stale log. `NodeKey` to identify the stale record.\n","file_path":"src/tree_cache.rs","rank":53,"score":33793.62830457237},{"content":"//! - Delete a node.\n\n//! When we apply these operations on a multi-version tree:\n\n//! 1) Put a new node.\n\n//! 2) When we remove a node, if the node is in the previous on-disk version, we don't need to do\n\n//! anything. Otherwise we delete it from the tree cache.\n\n//! Updating node could be operated as deletion of the node followed by insertion of the updated\n\n//! node.\n\n\n\nuse std::collections::{hash_map::Entry, BTreeMap, BTreeSet, HashMap, HashSet};\n\n\n\nuse anyhow::{bail, Result};\n\n\n\nuse crate::{\n\n metrics::DIEM_JELLYFISH_STORAGE_READS,\n\n node_type::{Node, NodeKey},\n\n storage::{\n\n NodeBatch, NodeStats, StaleNodeIndex, StaleNodeIndexBatch, TreeReader, TreeUpdateBatch,\n\n },\n\n types::{Version, PRE_GENESIS_VERSION},\n\n RootHash,\n\n};\n\n\n\n/// `FrozenTreeCache` is used as a field of `TreeCache` storing all the nodes and values that\n\n/// are generated by earlier transactions so they have to be immutable. The motivation of\n\n/// `FrozenTreeCache` is to let `TreeCache` freeze intermediate results from each transaction to\n\n/// help commit more than one transaction in a row atomically.\n","file_path":"src/tree_cache.rs","rank":54,"score":33793.55668183459},{"content":" DIEM_JELLYFISH_STORAGE_READS.inc();\n\n self.reader.get_node_option(node_key).await?.unwrap()\n\n })\n\n }\n\n\n\n /// Gets the current root node key.\n\n pub fn get_root_node_key(&self) -> &NodeKey {\n\n &self.root_node_key\n\n }\n\n\n\n /// Set roots `node_key`.\n\n pub fn set_root_node_key(&mut self, root_node_key: NodeKey) {\n\n self.root_node_key = root_node_key;\n\n }\n\n\n\n /// Puts the node with given hash as key into node_cache.\n\n pub fn put_node(&mut self, node_key: NodeKey, new_node: Node) -> Result<()> {\n\n match self.node_cache.entry(node_key) {\n\n Entry::Vacant(o) => {\n\n if new_node.is_leaf() {\n","file_path":"src/tree_cache.rs","rank":55,"score":33790.004302972535},{"content":"}\n\n\n\nimpl<'a, R> From<TreeCache<'a, R>> for (Vec<RootHash>, TreeUpdateBatch)\n\nwhere\n\n R: 'a + TreeReader,\n\n{\n\n fn from(tree_cache: TreeCache<'a, R>) -> Self {\n\n (\n\n tree_cache.frozen_cache.root_hashes,\n\n TreeUpdateBatch {\n\n node_batch: tree_cache.frozen_cache.node_cache,\n\n stale_node_index_batch: tree_cache.frozen_cache.stale_node_index_cache,\n\n node_stats: tree_cache.frozen_cache.node_stats,\n\n },\n\n )\n\n }\n\n}\n","file_path":"src/tree_cache.rs","rank":56,"score":33789.14293691721},{"content":" self.frozen_cache.node_cache.extend(self.node_cache.drain());\n\n let stale_since_version = self.next_version;\n\n self.frozen_cache\n\n .stale_node_index_cache\n\n .extend(\n\n self.stale_node_index_cache\n\n .drain()\n\n .map(|node_key| StaleNodeIndex {\n\n stale_since_version,\n\n node_key,\n\n }),\n\n );\n\n\n\n // Clean up\n\n self.num_stale_leaves = 0;\n\n self.num_new_leaves = 0;\n\n\n\n // Prepare for the next version after freezing\n\n self.next_version += 1;\n\n }\n","file_path":"src/tree_cache.rs","rank":57,"score":33786.89824902712},{"content":" self.num_new_leaves -= 1;\n\n }\n\n }\n\n\n\n /// Freezes all the contents in cache to be immutable and clear `node_cache`.\n\n pub async fn freeze(&mut self) {\n\n let root_node_key = self.get_root_node_key();\n\n let root_hash = self\n\n .get_node(root_node_key)\n\n .await\n\n .unwrap_or_else(|_| unreachable!(\"Root node with key {:?} must exist\", root_node_key))\n\n .hash();\n\n self.frozen_cache.root_hashes.push(RootHash(root_hash));\n\n let node_stats = NodeStats {\n\n new_nodes: self.node_cache.len(),\n\n new_leaves: self.num_new_leaves,\n\n stale_nodes: self.stale_node_index_cache.len(),\n\n stale_leaves: self.num_stale_leaves,\n\n };\n\n self.frozen_cache.node_stats.push(node_stats);\n","file_path":"src/tree_cache.rs","rank":58,"score":33786.74423016439},{"content":" self.num_new_leaves += 1\n\n }\n\n o.insert(new_node);\n\n }\n\n Entry::Occupied(o) => bail!(\"Node with key {:?} already exists in NodeBatch\", o.key()),\n\n };\n\n Ok(())\n\n }\n\n\n\n /// Deletes a node with given hash.\n\n pub fn delete_node(&mut self, old_node_key: &NodeKey, is_leaf: bool) {\n\n // If node cache doesn't have this node, it means the node is in the previous version of\n\n // the tree on the disk.\n\n if self.node_cache.remove(old_node_key).is_none() {\n\n let is_new_entry = self.stale_node_index_cache.insert(old_node_key.clone());\n\n assert!(is_new_entry, \"Node gets stale twice unexpectedly.\");\n\n if is_leaf {\n\n self.num_stale_leaves += 1;\n\n }\n\n } else if is_leaf {\n","file_path":"src/tree_cache.rs","rank":59,"score":33786.439865756955},{"content":" let pre_genesis_root_key = NodeKey::new_empty_path(PRE_GENESIS_VERSION);\n\n let pre_genesis_root = reader.get_node_option(&pre_genesis_root_key).await?;\n\n\n\n match pre_genesis_root {\n\n Some(_) => {\n\n // This is to support the extreme case where things really went wild,\n\n // and we need to ditch the transaction history and apply a new\n\n // genesis on top of an existing state db.\n\n pre_genesis_root_key\n\n }\n\n None => {\n\n // Hack: We need to start from an empty tree, so we insert\n\n // a null node beforehand deliberately to deal with this corner case.\n\n let genesis_root_key = NodeKey::new_empty_path(0);\n\n node_cache.insert(genesis_root_key.clone(), Node::new_null());\n\n genesis_root_key\n\n }\n\n }\n\n } else {\n\n NodeKey::new_empty_path(next_version - 1)\n","file_path":"src/tree_cache.rs","rank":60,"score":33785.26404284956},{"content":"// Copyright (c) The Diem Core Contributors\n\n// SPDX-License-Identifier: Apache-2.0\n\n\n\n//! A transaction can have multiple operations on state. For example, it might update values\n\n//! for a few existing keys. Imagine that we have the following tree.\n\n//!\n\n//! ```text\n\n//! root0\n\n//! / \\\n\n//! / \\\n\n//! key1 => value11 key2 => value21\n\n//! ```\n\n//!\n\n//! The next transaction updates `key1`'s value to `value12` and `key2`'s value to `value22`.\n\n//! Let's assume we update key2 first. Then the tree becomes:\n\n//!\n\n//! ```text\n\n//! (on disk) (in memory)\n\n//! root0 root1'\n\n//! / \\ / \\\n","file_path":"src/tree_cache.rs","rank":61,"score":33783.44427481527},{"content":"//! ```text\n\n//! (on disk) (in memory)\n\n//! root0 root1''\n\n//! / \\ / \\\n\n//! / \\ / \\\n\n//! / \\ / \\\n\n//! / \\ / \\\n\n//! / \\ / \\\n\n//! key1 => value11 key2 => value21 key1 => value12 key2 => value22\n\n//! (on disk) (on disk) (in memory) (in memory)\n\n//! ```\n\n//!\n\n//! This means that we need to be able to tell whether to create a new version of a node or to\n\n//! update an existing node by deleting it and creating a new node directly. `TreeCache` provides\n\n//! APIs to cache intermediate nodes and values in memory and simplify the actual tree\n\n//! implementation.\n\n//!\n\n//! If we are dealing with a single-version tree, any complex tree operation can be seen as a\n\n//! collection of the following operations:\n\n//! - Put a new node.\n","file_path":"src/tree_cache.rs","rank":62,"score":33783.26754669364},{"content":"//! / ___ \\ _____________/ \\\n\n//! / _/ \\ \\\n\n//! / _/ \\ \\\n\n//! / / \\ \\\n\n//! key1 => value11 key2 => value21 key2 => value22\n\n//! (on disk) (on disk) (in memory)\n\n//! ```\n\n//!\n\n//! Note that\n\n//! 1) we created a new version of the tree with `root1'` and the new `key2` node generated;\n\n//! 2) both `root1'` and the new `key2` node are still held in memory within a batch of nodes\n\n//! that will be written into db atomically.\n\n//!\n\n//! Next, we need to update `key1`'s value. This time we are dealing with the tree starting from\n\n//! the new root. Part of the tree is in memory and the rest of it is in database. We'll update the\n\n//! left child and the new root. We should\n\n//! 1) create a new version for `key1` child.\n\n//! 2) update `root1'` directly instead of making another version.\n\n//! The resulting tree should look like:\n\n//!\n","file_path":"src/tree_cache.rs","rank":63,"score":33780.10330761305},{"content":"fn hash_internal(left: [u8; 32], right: [u8; 32]) -> [u8; 32] {\n\n SparseMerkleInternalNode::new(left, right).hash()\n\n}\n\n\n","file_path":"src/tests/node_type.rs","rank":64,"score":32401.24642622741},{"content":"fn compute_root_hash_impl(kvs: Vec<(&[bool], [u8; 32])>) -> [u8; 32] {\n\n assert!(!kvs.is_empty());\n\n\n\n // If there is only one entry, it is the root.\n\n if kvs.len() == 1 {\n\n return kvs[0].1;\n\n }\n\n\n\n // Otherwise the tree has more than one leaves, which means we can find which ones are in the\n\n // left subtree and which ones are in the right subtree. So we find the first key that starts\n\n // with a 1-bit.\n\n let left_hash;\n\n let right_hash;\n\n match kvs.iter().position(|(key, _value)| key[0]) {\n\n Some(0) => {\n\n // Every key starts with a 1-bit, i.e., they are all in the right subtree.\n\n left_hash = SPARSE_MERKLE_PLACEHOLDER_HASH;\n\n right_hash = compute_root_hash_impl(reduce(&kvs));\n\n }\n\n Some(index) => {\n","file_path":"src/tests/helper.rs","rank":65,"score":32112.080526055666},{"content":"// Copyright (c) The Diem Core Contributors\n\n// SPDX-License-Identifier: Apache-2.0\n\n\n\nuse rand::{rngs::OsRng, Rng};\n\n\n\nuse crate::{\n\n mock::MockTreeStore,\n\n node_type::{Node, NodeKey},\n\n tree_cache::TreeCache,\n\n types::{nibble::nibble_path::NibblePath, Version, PRE_GENESIS_VERSION},\n\n KeyHash,\n\n};\n\n\n","file_path":"src/tests/tree_cache.rs","rank":66,"score":32078.65538945547},{"content":"\n\n#[tokio::test]\n\nasync fn test_root_node() {\n\n let next_version = 0;\n\n let db = MockTreeStore::default();\n\n let mut cache = TreeCache::new(&db, next_version).await.unwrap();\n\n assert_eq!(*cache.get_root_node_key(), NodeKey::new_empty_path(0));\n\n\n\n let (node, node_key) = random_leaf_with_key(next_version);\n\n db.put_node(node_key.clone(), node).await.unwrap();\n\n cache.set_root_node_key(node_key.clone());\n\n\n\n assert_eq!(*cache.get_root_node_key(), node_key);\n\n}\n\n\n\n#[tokio::test]\n\nasync fn test_pre_genesis() {\n\n let next_version = 0;\n\n let db = MockTreeStore::default();\n\n let pre_genesis_root_key = NodeKey::new_empty_path(PRE_GENESIS_VERSION);\n","file_path":"src/tests/tree_cache.rs","rank":67,"score":32076.423889660575},{"content":" let (pre_genesis_only_node, _) = random_leaf_with_key(PRE_GENESIS_VERSION);\n\n db.put_node(pre_genesis_root_key.clone(), pre_genesis_only_node)\n\n .await\n\n .unwrap();\n\n\n\n let cache = TreeCache::new(&db, next_version).await.unwrap();\n\n assert_eq!(*cache.get_root_node_key(), pre_genesis_root_key);\n\n}\n\n\n\n#[tokio::test]\n\nasync fn test_freeze_with_delete() {\n\n let next_version = 0;\n\n let db = MockTreeStore::default();\n\n let mut cache = TreeCache::new(&db, next_version).await.unwrap();\n\n\n\n assert_eq!(*cache.get_root_node_key(), NodeKey::new_empty_path(0));\n\n\n\n let (node1, node1_key) = random_leaf_with_key(next_version);\n\n cache.put_node(node1_key.clone(), node1.clone()).unwrap();\n\n let (node2, node2_key) = random_leaf_with_key(next_version);\n","file_path":"src/tests/tree_cache.rs","rank":68,"score":32075.742009499212},{"content":" cache.put_node(node2_key.clone(), node2.clone()).unwrap();\n\n assert_eq!(cache.get_node(&node1_key).await.unwrap(), node1);\n\n assert_eq!(cache.get_node(&node2_key).await.unwrap(), node2);\n\n cache.freeze().await;\n\n assert_eq!(cache.get_node(&node1_key).await.unwrap(), node1);\n\n assert_eq!(cache.get_node(&node2_key).await.unwrap(), node2);\n\n\n\n cache.delete_node(&node1_key, true /* is_leaf */);\n\n cache.freeze().await;\n\n let (_, update_batch) = cache.into();\n\n assert_eq!(update_batch.node_batch.len(), 3);\n\n assert_eq!(update_batch.stale_node_index_batch.len(), 1);\n\n}\n","file_path":"src/tests/tree_cache.rs","rank":69,"score":32070.016525561336},{"content":"/// Reduces the problem by removing the first bit of every key.\n\nfn reduce<'a>(kvs: &'a [(&[bool], [u8; 32])]) -> Vec<(&'a [bool], [u8; 32])> {\n\n kvs.iter().map(|(key, value)| (&key[1..], *value)).collect()\n\n}\n\n\n","file_path":"src/tests/helper.rs","rank":70,"score":31978.82939507071},{"content":"# Penumbra's Jellyfish Merkle Tree\n\n\n\nThis repository is a fork of the [Diem Jellyfish Merkle Tree](https://github.com/diem/diem/tree/main/storage/jellyfish-merkle)\n\ncrate, modified to inline dependencies and trim the parts not needed for Penumbra's uses.\n","file_path":"README.md","rank":71,"score":21277.444807220905},{"content":"use anyhow::{anyhow, Result};\n\n\n\nuse crate::{storage::TreeReader, JellyfishMerkleTree, Version};\n\n\n\nimpl<'a, R> JellyfishMerkleTree<'a, R>\n\nwhere\n\n R: 'a + TreeReader + Sync,\n\n{\n\n /// Returns the value and an [`ics23::ExistenceProof`].\n\n pub async fn get_with_ics23_proof(\n\n &self,\n\n key: Vec<u8>,\n\n version: Version,\n\n ) -> Result<ics23::ExistenceProof> {\n\n let key_hash = key.as_slice().into();\n\n let (value, proof) = self.get_with_proof(key_hash, version).await?;\n\n let value = value.ok_or_else(|| {\n\n anyhow!(\n\n \"Requested proof of inclusion for non-existent key {:?}\",\n\n key\n","file_path":"src/ics23_impl.rs","rank":72,"score":31.864502597823495},{"content":" },\n\n KeyHash, MissingRootError, OwnedValue, RootHash,\n\n};\n\n\n\n/// The Jellyfish Merkle tree data structure. See [`crate`] for description.\n\npub struct JellyfishMerkleTree<'a, R> {\n\n reader: &'a R,\n\n leaf_count_migration: bool,\n\n}\n\n\n\nimpl<'a, R> JellyfishMerkleTree<'a, R>\n\nwhere\n\n R: 'a + TreeReader + Sync,\n\n{\n\n /// Creates a `JellyfishMerkleTree` backed by the given [`TreeReader`](trait.TreeReader.html).\n\n pub fn new(reader: &'a R) -> Self {\n\n Self {\n\n reader,\n\n leaf_count_migration: true,\n\n }\n","file_path":"src/tree.rs","rank":73,"score":25.49231084712353},{"content":" /// `self.parent_stack` is empty. But in case of a tree with a single leaf, we need this\n\n /// additional bit.\n\n done: bool,\n\n\n\n /// The future, if any, of a node lookup needed for the next call to `poll_next`.\n\n future: Option<BoxFuture<'static, (NodeKey, Result<Node>)>>,\n\n}\n\n\n\nimpl<R> JellyfishMerkleStream<R>\n\nwhere\n\n R: TreeReader + Send + Sync,\n\n{\n\n /// Constructs a new iterator. This puts the internal state in the correct position, so the\n\n /// following `next` call will yield the smallest key that is greater or equal to\n\n /// `starting_key`.\n\n pub async fn new(reader: Arc<R>, version: Version, starting_key: KeyHash) -> Result<Self> {\n\n let mut parent_stack = vec![];\n\n let mut done = false;\n\n\n\n let mut current_node_key = NodeKey::new_empty_path(version);\n","file_path":"src/iterator.rs","rank":74,"score":22.07939941048869},{"content":" .await?;\n\n\n\n tree_cache.set_root_node_key(new_root_node_key);\n\n Ok(())\n\n }\n\n\n\n /// Helper function for recursive insertion into the subtree that starts from the current\n\n /// [`NodeKey`](node_type/struct.NodeKey.html). Returns the newly inserted node.\n\n /// It is safe to use recursion here because the max depth is limited by the key length which\n\n /// for this tree is the length of the hash of account addresses.\n\n #[async_recursion::async_recursion]\n\n async fn insert_at<'future, 'cache: 'future>(\n\n &'future self,\n\n node_key: NodeKey,\n\n version: Version,\n\n nibble_iter: &mut NibbleIterator<'future>,\n\n value: OwnedValue,\n\n tree_cache: &mut TreeCache<'cache, R>,\n\n ) -> Result<(NodeKey, Node)> {\n\n let node = tree_cache.get_node(&node_key).await?;\n","file_path":"src/tree.rs","rank":75,"score":21.886112508665633},{"content":" let mut tree_cache = TreeCache::new(self.reader, first_version).await?;\n\n for (idx, value_set) in value_sets.into_iter().enumerate() {\n\n assert!(\n\n !value_set.is_empty(),\n\n \"Transactions that output empty write set should not be included.\",\n\n );\n\n let version = first_version + idx as u64;\n\n for (key, value) in value_set {\n\n self.put(key, value, version, &mut tree_cache).await?;\n\n }\n\n // Freezes the current cache to make all contents in the current cache immutable.\n\n tree_cache.freeze().await;\n\n }\n\n\n\n Ok(tree_cache.into())\n\n }\n\n\n\n async fn put(\n\n &self,\n\n key: KeyHash,\n","file_path":"src/tree.rs","rank":76,"score":21.78778788951723},{"content":"mod overlay;\n\nmod reader;\n\nmod tree;\n\nmod tree_cache;\n\nmod types;\n\nmod writer;\n\n\n\npub mod mock;\n\npub mod restore;\n\n\n\nuse bytes32ext::Bytes32Ext;\n\nuse types::nibble::ROOT_NIBBLE_HEIGHT;\n\n\n\n#[cfg(feature = \"ics23\")]\n\npub use ics23_impl::ics23_spec;\n\npub use iterator::JellyfishMerkleStream;\n\npub use overlay::WriteOverlay;\n\npub use tree::JellyfishMerkleTree;\n\npub use types::proof;\n\npub use types::Version;\n","file_path":"src/lib.rs","rank":77,"score":21.034984385127007},{"content":" )\n\n .await?;\n\n tree_cache.set_root_node_key(new_root_node_key);\n\n\n\n // Freezes the current cache to make all contents in the current cache immutable.\n\n tree_cache.freeze().await;\n\n }\n\n\n\n Ok(tree_cache.into())\n\n }\n\n\n\n #[async_recursion::async_recursion]\n\n async fn batch_insert_at(\n\n &self,\n\n mut node_key: NodeKey,\n\n version: Version,\n\n kvs: &[(KeyHash, OwnedValue)],\n\n depth: usize,\n\n hash_cache: &Option<&HashMap<NibblePath, [u8; 32]>>,\n\n tree_cache: &mut TreeCache<R>,\n","file_path":"src/tree.rs","rank":78,"score":20.903607064346968},{"content":" }\n\n\n\n pub fn new_migration(reader: &'a R, leaf_count_migration: bool) -> Self {\n\n Self {\n\n reader,\n\n leaf_count_migration,\n\n }\n\n }\n\n\n\n /// Get the node hash from the cache if exists, otherwise compute it.\n\n fn get_hash(\n\n node_key: &NodeKey,\n\n node: &Node,\n\n hash_cache: &Option<&HashMap<NibblePath, [u8; 32]>>,\n\n ) -> [u8; 32] {\n\n if let Some(cache) = hash_cache {\n\n match cache.get(node_key.nibble_path()) {\n\n Some(hash) => *hash,\n\n None => unreachable!(\"{:?} can not be found in hash cache\", node_key),\n\n }\n","file_path":"src/tree.rs","rank":79,"score":20.2963749017721},{"content":"// Copyright (c) The Diem Core Contributors\n\n// SPDX-License-Identifier: Apache-2.0\n\n\n\n//! This module implements `JellyfishMerkleIterator`. Initialized with a version and a key, the\n\n//! iterator generates all the key-value pairs in this version of the tree, starting from the\n\n//! smallest key that is greater or equal to the given key, by performing a depth first traversal\n\n//! on the tree.\n\n\n\nuse std::{\n\n pin::Pin,\n\n sync::Arc,\n\n task::{Context, Poll},\n\n};\n\n\n\nuse anyhow::{bail, ensure, format_err, Result};\n\nuse futures::{future::BoxFuture, ready};\n\n\n\nuse crate::{\n\n node_type::{Child, InternalNode, Node, NodeKey},\n\n storage::TreeReader,\n","file_path":"src/iterator.rs","rank":80,"score":20.098485210174108},{"content":"#[derive(Clone, Copy, Debug, Eq, PartialEq, Serialize, Deserialize)]\n\n#[cfg_attr(any(test, feature = \"fuzzing\"), derive(Arbitrary))]\n\npub struct SparseMerkleLeafNode {\n\n key_hash: KeyHash,\n\n value_hash: ValueHash,\n\n}\n\n\n\nimpl SparseMerkleLeafNode {\n\n pub(crate) fn new(key_hash: KeyHash, value_hash: ValueHash) -> Self {\n\n SparseMerkleLeafNode {\n\n key_hash,\n\n value_hash,\n\n }\n\n }\n\n\n\n pub(crate) fn key_hash(&self) -> KeyHash {\n\n self.key_hash\n\n }\n\n\n\n pub(crate) fn hash(&self) -> [u8; 32] {\n\n use sha2::Digest;\n\n let mut hasher = sha2::Sha256::new();\n\n hasher.update(b\"JMT::LeafNode\");\n\n hasher.update(&self.key_hash.0);\n\n hasher.update(&self.value_hash.0);\n\n *hasher.finalize().as_ref()\n\n }\n\n}\n","file_path":"src/types/proof.rs","rank":81,"score":19.62682264747564},{"content":" }\n\n }\n\n }\n\n\n\n match crate::reader::get_node_async(&*reader, ¤t_node_key).await? {\n\n Node::Internal(_) => unreachable!(\"Should have reached the bottom of the tree.\"),\n\n Node::Leaf(leaf_node) => {\n\n if leaf_node.key_hash() < starting_key {\n\n Self::cleanup_stack(&mut parent_stack);\n\n if parent_stack.is_empty() {\n\n done = true;\n\n }\n\n }\n\n }\n\n Node::Null => done = true,\n\n }\n\n\n\n Ok(Self {\n\n reader,\n\n version,\n","file_path":"src/iterator.rs","rank":82,"score":19.574010569981517},{"content":"// Copyright (c) The Diem Core Contributors\n\n// SPDX-License-Identifier: Apache-2.0\n\n\n\nuse std::{collections::BTreeMap, sync::Arc};\n\n\n\nuse anyhow::Result;\n\nuse futures::StreamExt;\n\nuse rand::{rngs::StdRng, Rng, SeedableRng};\n\n\n\nuse super::helper::plus_one;\n\nuse crate::{\n\n iterator::JellyfishMerkleStream, mock::MockTreeStore, types::Version, JellyfishMerkleTree,\n\n KeyHash, OwnedValue,\n\n};\n\n\n\n#[tokio::test]\n\nasync fn test_iterator_same_version() {\n\n for i in (1..100).step_by(11) {\n\n test_n_leaves_same_version(i).await;\n\n }\n","file_path":"src/tests/iterator.rs","rank":83,"score":19.55614369560492},{"content":" Child::new(\n\n Self::get_hash(&new_child_node_key, &new_child_node, hash_cache),\n\n version,\n\n new_child_node.node_type(),\n\n ),\n\n );\n\n }\n\n let new_internal_node =\n\n InternalNode::new_migration(children, self.leaf_count_migration);\n\n\n\n tree_cache.put_node(node_key.clone(), new_internal_node.clone().into())?;\n\n Ok((node_key, new_internal_node.into()))\n\n }\n\n }\n\n\n\n /// This is a convenient function that calls\n\n /// [`put_value_sets`](struct.JellyfishMerkleTree.html#method.put_value_sets) with a single\n\n /// `keyed_value_set`.\n\n pub async fn put_value_set(\n\n &self,\n","file_path":"src/tree.rs","rank":84,"score":19.548872181444462},{"content":" .collect();\n\n Ok(SparseMerkleRangeProof::new(siblings))\n\n }\n\n\n\n pub async fn get(&self, key: KeyHash, version: Version) -> Result<Option<OwnedValue>> {\n\n Ok(self.get_with_proof(key, version).await?.0)\n\n }\n\n\n\n async fn get_root_node(&self, version: Version) -> Result<Node> {\n\n self.get_root_node_option(version)\n\n .await?\n\n .ok_or_else(|| format_err!(\"Root node not found for version {}.\", version))\n\n }\n\n\n\n async fn get_root_node_option(&self, version: Version) -> Result<Option<Node>> {\n\n let root_node_key = NodeKey::new_empty_path(version);\n\n self.reader.get_node_option(&root_node_key).await\n\n }\n\n\n\n pub async fn get_root_hash(&self, version: Version) -> Result<RootHash> {\n","file_path":"src/tree.rs","rank":85,"score":19.479524685936056},{"content":" Self::new(version, NibblePath::new(vec![]))\n\n }\n\n\n\n /// Gets the version.\n\n pub fn version(&self) -> Version {\n\n self.version\n\n }\n\n\n\n /// Gets the nibble path.\n\n pub(crate) fn nibble_path(&self) -> &NibblePath {\n\n &self.nibble_path\n\n }\n\n\n\n /// Generates a child node key based on this node key.\n\n pub(crate) fn gen_child_node_key(&self, version: Version, n: Nibble) -> Self {\n\n let mut node_nibble_path = self.nibble_path().clone();\n\n node_nibble_path.push(n);\n\n Self::new(version, node_nibble_path)\n\n }\n\n\n","file_path":"src/node_type.rs","rank":86,"score":19.478656732379132},{"content":" fn advance(&mut self) {\n\n assert!(!self.is_rightmost(), \"Advancing past rightmost child.\");\n\n self.next_child_to_visit <<= 1;\n\n while self.next_child_to_visit & self.children_bitmap == 0 {\n\n self.next_child_to_visit <<= 1;\n\n }\n\n }\n\n}\n\n/// The `JellyfishMerkleStream` implementation.\n\npub struct JellyfishMerkleStream<R> {\n\n /// The storage engine from which we can read nodes using node keys.\n\n reader: Arc<R>,\n\n\n\n /// The version of the tree this iterator is running on.\n\n version: Version,\n\n\n\n /// The stack used for depth first traversal.\n\n parent_stack: Vec<NodeVisitInfo>,\n\n\n\n /// Whether the iteration has finished. Usually this can be determined by checking whether\n","file_path":"src/iterator.rs","rank":87,"score":19.467072727799913},{"content":" } else {\n\n node.hash()\n\n }\n\n }\n\n\n\n /// The batch version of `put_value_sets`.\n\n pub async fn batch_put_value_sets(\n\n &self,\n\n value_sets: Vec<Vec<(KeyHash, OwnedValue)>>,\n\n node_hashes: Option<Vec<&HashMap<NibblePath, [u8; 32]>>>,\n\n first_version: Version,\n\n ) -> Result<(Vec<RootHash>, TreeUpdateBatch)> {\n\n let mut tree_cache = TreeCache::new(self.reader, first_version).await?;\n\n let hash_sets: Vec<_> = match node_hashes {\n\n Some(hashes) => hashes.into_iter().map(Some).collect(),\n\n None => (0..value_sets.len()).map(|_| None).collect(),\n\n };\n\n\n\n for (idx, (value_set, hash_set)) in\n\n itertools::zip_eq(value_sets.into_iter(), hash_sets.into_iter()).enumerate()\n","file_path":"src/tree.rs","rank":88,"score":19.124078305685508},{"content":"#[derive(Clone, Debug, Hash, Eq, PartialEq, Ord, PartialOrd)]\n\n#[cfg_attr(any(test, feature = \"fuzzing\"), derive(Arbitrary))]\n\npub struct NodeKey {\n\n // The version at which the node is created.\n\n version: Version,\n\n // The nibble path this node represents in the tree.\n\n nibble_path: NibblePath,\n\n}\n\n\n\nimpl NodeKey {\n\n /// Creates a new `NodeKey`.\n\n pub(crate) fn new(version: Version, nibble_path: NibblePath) -> Self {\n\n Self {\n\n version,\n\n nibble_path,\n\n }\n\n }\n\n\n\n /// A shortcut to generate a node key consisting of a version and an empty nibble path.\n\n pub(crate) fn new_empty_path(version: Version) -> Self {\n","file_path":"src/node_type.rs","rank":89,"score":18.877859654707212},{"content":" /// / \\ | / \\\n\n /// / x | / x'\n\n /// o<-------------+- / \\\n\n /// / \\ | C D\n\n /// A B |\n\n /// storage (disk) | cache (memory)\n\n /// ```\n\n ///\n\n /// With this design, we are able to query the global state in persistent storage and\n\n /// generate the proposed tree delta based on a specific root hash and `value_set`. For\n\n /// example, if we want to execute another transaction `T_{i+1}'`, we can use the tree `S_i` in\n\n /// storage and apply the `value_set` of transaction `T_{i+1}`. Then if the storage commits\n\n /// the returned batch, the state `S_{i+1}` is ready to be read from the tree by calling\n\n /// [`get_with_proof`](struct.JellyfishMerkleTree.html#method.get_with_proof). Anything inside\n\n /// the batch is not reachable from public interfaces before being committed.\n\n pub async fn put_value_sets(\n\n &self,\n\n value_sets: Vec<Vec<(KeyHash, OwnedValue)>>,\n\n first_version: Version,\n\n ) -> Result<(Vec<RootHash>, TreeUpdateBatch)> {\n","file_path":"src/tree.rs","rank":90,"score":18.554161553092868},{"content":" tree_cache.put_node(node_key.clone(), new_leaf_node.clone())?;\n\n Ok((node_key, new_leaf_node))\n\n }\n\n\n\n /// Returns the value (if applicable) and the corresponding merkle proof.\n\n pub async fn get_with_proof(\n\n &self,\n\n key: KeyHash,\n\n version: Version,\n\n ) -> Result<(Option<OwnedValue>, SparseMerkleProof)> {\n\n // Empty tree just returns proof with no sibling hash.\n\n let mut next_node_key = NodeKey::new_empty_path(version);\n\n let mut siblings = vec![];\n\n let nibble_path = NibblePath::new(key.0.to_vec());\n\n let mut nibble_iter = nibble_path.nibbles();\n\n\n\n // We limit the number of loops here deliberately to avoid potential cyclic graph bugs\n\n // in the tree structure.\n\n for nibble_depth in 0..=ROOT_NIBBLE_HEIGHT {\n\n let next_node = get_node_async(self.reader, &next_node_key)\n","file_path":"src/tree.rs","rank":91,"score":18.532802688431275},{"content":"// Copyright (c) The Diem Core Contributors\n\n// SPDX-License-Identifier: Apache-2.0\n\n\n\nuse std::{collections::BTreeMap, sync::Arc};\n\n\n\nuse proptest::{collection::btree_map, prelude::*};\n\nuse tokio::{runtime::Runtime, sync::RwLock};\n\n\n\nuse crate::{\n\n mock::MockTreeStore,\n\n restore::{JellyfishMerkleRestore, StateSnapshotReceiver},\n\n storage::TreeReader,\n\n tests::helper::init_mock_db,\n\n JellyfishMerkleTree, KeyHash, OwnedValue, RootHash, Version,\n\n};\n\n\n\nproptest! {\n\n #![proptest_config(ProptestConfig::with_cases(10))]\n\n\n\n #[test]\n","file_path":"src/tests/restore.rs","rank":92,"score":18.502114788268134},{"content":" expected_root_hash: RootHash,\n\n\n\n /// Whether to use the new internal node format where leaf counts are written.\n\n leaf_count_migration: bool,\n\n}\n\n\n\nimpl JellyfishMerkleRestore {\n\n pub async fn new<D: 'static + TreeReader + TreeWriter>(\n\n store: Arc<RwLock<D>>,\n\n version: Version,\n\n expected_root_hash: RootHash,\n\n leaf_count_migration: bool,\n\n ) -> Result<Self> {\n\n let tree_reader = Arc::clone(&store);\n\n let (partial_nodes, previous_leaf) = if let Some((node_key, leaf_node)) =\n\n tree_reader.read().await.get_rightmost_leaf().await?\n\n {\n\n // TODO: confirm rightmost leaf is at the desired version\n\n // If the system crashed in the middle of the previous restoration attempt, we need\n\n // to recover the partial nodes to the state right before the crash.\n","file_path":"src/restore.rs","rank":93,"score":18.443841129450607},{"content":"use std::{\n\n collections::{BTreeMap, HashMap},\n\n convert::TryInto,\n\n};\n\n\n\nuse anyhow::{bail, ensure, format_err, Result};\n\n\n\nuse crate::{\n\n bytes32ext::Bytes32Ext,\n\n node_type::{Child, Children, InternalNode, LeafNode, Node, NodeKey, NodeType},\n\n reader::get_node_async,\n\n storage::{TreeReader, TreeUpdateBatch},\n\n tree_cache::TreeCache,\n\n types::{\n\n nibble::{\n\n nibble_path::{skip_common_prefix, NibbleIterator, NibblePath},\n\n NibbleRangeIterator, ROOT_NIBBLE_HEIGHT,\n\n },\n\n proof::{SparseMerkleProof, SparseMerkleRangeProof},\n\n Version,\n","file_path":"src/tree.rs","rank":94,"score":18.443768700823178},{"content":"\n\n/// Contains types used to bridge a [`JellyfishMerkleTree`](crate::JellyfishMerkleTree)\n\n/// to the backing storage recording the tree's internal data.\n\npub mod storage {\n\n pub use node_type::{LeafNode, Node, NodeDecodeError, NodeKey};\n\n pub use reader::TreeReader;\n\n pub use writer::{\n\n NodeBatch, NodeStats, StaleNodeIndex, StaleNodeIndexBatch, TreeUpdateBatch, TreeWriter,\n\n };\n\n\n\n use super::*;\n\n}\n\n\n\n#[cfg(any(test, feature = \"fuzzing\"))]\n\nmod tests;\n\n\n\n/// An error that occurs when the state root for a requested version is missing (e.g., because it was pruned).\n\n#[derive(Error, Debug)]\n\n#[error(\"Missing state root node at version {version}, probably pruned.\")]\n\npub struct MissingRootError {\n","file_path":"src/lib.rs","rank":95,"score":18.394999183861156},{"content":" }\n\n Poll::Pending => {\n\n self.future = Some(future); // Put the future back into `self.future`\n\n Poll::Pending\n\n }\n\n }\n\n }\n\n}\n\n\n\nimpl<R> futures::Stream for JellyfishMerkleStream<R>\n\nwhere\n\n R: TreeReader + Send + Sync + 'static,\n\n{\n\n type Item = Result<(KeyHash, OwnedValue)>;\n\n\n\n fn poll_next(mut self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Option<Self::Item>> {\n\n if self.done {\n\n return Poll::Ready(None);\n\n }\n\n\n","file_path":"src/iterator.rs","rank":96,"score":18.300790573548824},{"content":" /// Generates parent node key at the same version based on this node key.\n\n pub(crate) fn gen_parent_node_key(&self) -> Self {\n\n let mut node_nibble_path = self.nibble_path().clone();\n\n assert!(\n\n node_nibble_path.pop().is_some(),\n\n \"Current node key is root.\",\n\n );\n\n Self::new(self.version, node_nibble_path)\n\n }\n\n\n\n /// Sets the version to the given version.\n\n pub(crate) fn set_version(&mut self, version: Version) {\n\n self.version = version;\n\n }\n\n\n\n /// Serializes to bytes for physical storage enforcing the same order as that in memory.\n\n pub fn encode(&self) -> Result<Vec<u8>> {\n\n let mut out = vec![];\n\n out.write_u64::<BigEndian>(self.version())?;\n\n out.write_u8(self.nibble_path().num_nibbles() as u8)?;\n","file_path":"src/node_type.rs","rank":97,"score":18.126696752709602},{"content":" }\n\n\n\n /// Creates the [`Internal`](Node::Internal) variant.\n\n #[cfg(any(test, feature = \"fuzzing\"))]\n\n pub(crate) fn new_internal(children: Children) -> Self {\n\n Node::Internal(InternalNode::new(children))\n\n }\n\n\n\n /// Creates the [`Leaf`](Node::Leaf) variant.\n\n pub(crate) fn new_leaf(key_hash: KeyHash, value: Vec<u8>) -> Self {\n\n Node::Leaf(LeafNode::new(key_hash, value))\n\n }\n\n\n\n /// Returns `true` if the node is a leaf node.\n\n pub(crate) fn is_leaf(&self) -> bool {\n\n matches!(self, Node::Leaf(_))\n\n }\n\n\n\n /// Returns `NodeType`\n\n pub(crate) fn node_type(&self) -> NodeType {\n","file_path":"src/node_type.rs","rank":98,"score":18.03482036665063},{"content":"// Copyright (c) The Diem Core Contributors\n\n// SPDX-License-Identifier: Apache-2.0\n\n\n\n//! This module implements the functionality to restore a\n\n//! [`JellyfishMerkleTree`](crate::JellyfishMerkleTree) from small chunks of\n\n//! key/value pairs.\n\n\n\nuse std::sync::Arc;\n\n\n\nuse anyhow::{bail, ensure, Result};\n\nuse futures::future::{BoxFuture, FutureExt};\n\nuse mirai_annotations::*;\n\nuse tokio::sync::RwLock;\n\n\n\nuse crate::{\n\n node_type::{\n\n get_child_and_sibling_half_start, Child, Children, InternalNode, LeafNode, Node, NodeKey,\n\n NodeType,\n\n },\n\n storage::{NodeBatch, TreeReader, TreeWriter},\n","file_path":"src/restore.rs","rank":99,"score":18.032498053578994}],"string":"[\n {\n \"content\": \"/// Computes the key immediately after `key`.\\n\\npub fn plus_one(key: KeyHash) -> KeyHash {\\n\\n assert_ne!(key, KeyHash([0xff; 32]));\\n\\n\\n\\n let mut buf = key.0;\\n\\n for i in (0..32).rev() {\\n\\n if buf[i] == 255 {\\n\\n buf[i] = 0;\\n\\n } else {\\n\\n buf[i] += 1;\\n\\n break;\\n\\n }\\n\\n }\\n\\n KeyHash(buf)\\n\\n}\\n\\n\\n\\n/// Initializes a DB with a set of key-value pairs by inserting one key at each version.\\n\\npub async fn init_mock_db(kvs: &HashMap<KeyHash, OwnedValue>) -> (MockTreeStore, Version) {\\n\\n assert!(!kvs.is_empty());\\n\\n\\n\\n let db = MockTreeStore::default();\\n\",\n \"file_path\": \"src/tests/helper.rs\",\n \"rank\": 0,\n \"score\": 152167.96640051677\n },\n {\n \"content\": \"fn random_leaf_with_key(next_version: Version) -> (Node, NodeKey) {\\n\\n let key: [u8; 32] = OsRng.gen();\\n\\n let value: [u8; 32] = OsRng.gen();\\n\\n let key_hash: KeyHash = key.as_ref().into();\\n\\n let node = Node::new_leaf(key_hash, value.to_vec());\\n\\n let node_key = NodeKey::new(next_version, NibblePath::new(key_hash.0.to_vec()));\\n\\n (node, node_key)\\n\\n}\\n\\n\\n\\n#[tokio::test]\\n\\nasync fn test_get_node() {\\n\\n let next_version = 0;\\n\\n let db = MockTreeStore::default();\\n\\n let cache = TreeCache::new(&db, next_version).await.unwrap();\\n\\n\\n\\n let (node, node_key) = random_leaf_with_key(next_version);\\n\\n db.put_node(node_key.clone(), node.clone()).await.unwrap();\\n\\n\\n\\n assert_eq!(cache.get_node(&node_key).await.unwrap(), node);\\n\\n}\\n\",\n \"file_path\": \"src/tests/tree_cache.rs\",\n \"rank\": 1,\n \"score\": 136313.73815072342\n },\n {\n \"content\": \"/// Defines the interface between a\\n\\n/// [`JellyfishMerkleTree`](crate::JellyfishMerkleTree)\\n\\n/// and underlying storage holding nodes.\\n\\npub trait TreeReader: Send + Sync {\\n\\n /// Gets node given a node key. Returns `None` if the node does not exist.\\n\\n fn get_node_option<'future, 'a: 'future, 'n: 'future>(\\n\\n &'a self,\\n\\n node_key: &'n NodeKey,\\n\\n ) -> BoxFuture<'future, Result<Option<Node>>>;\\n\\n\\n\\n /// Gets the rightmost leaf. Note that this assumes we are in the process of restoring the tree\\n\\n /// and all nodes are at the same version.\\n\\n #[allow(clippy::type_complexity)]\\n\\n fn get_rightmost_leaf<'future, 'a: 'future>(\\n\\n &'a self,\\n\\n ) -> BoxFuture<'future, Result<Option<(NodeKey, LeafNode)>>>;\\n\\n}\\n\\n\\n\\n/// Internal helper: Gets node given a node key. Returns error if the node does not exist.\\n\\npub async fn get_node_async<R: TreeReader>(reader: &R, node_key: &NodeKey) -> Result<Node> {\\n\\n reader\\n\\n .get_node_option(node_key)\\n\\n .await?\\n\\n .ok_or_else(|| format_err!(\\\"Missing node at {:?}.\\\", node_key))\\n\\n}\\n\",\n \"file_path\": \"src/reader.rs\",\n \"rank\": 2,\n \"score\": 128036.22424887976\n },\n {\n \"content\": \"fn hash_leaf(key: KeyHash, value_hash: ValueHash) -> [u8; 32] {\\n\\n SparseMerkleLeafNode::new(key, value_hash).hash()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/node_type.rs\",\n \"rank\": 3,\n \"score\": 121769.57178609373\n },\n {\n \"content\": \"// Generate a pair of leaf node key and account key with a passed-in 63-nibble node key and the last\\n\\n// nibble to be appended.\\n\\nfn gen_leaf_keys(version: Version, nibble_path: &NibblePath, nibble: Nibble) -> (NodeKey, KeyHash) {\\n\\n assert_eq!(nibble_path.num_nibbles(), 63);\\n\\n let mut np = nibble_path.clone();\\n\\n np.push(nibble);\\n\\n let account_key = KeyHash(np.bytes().try_into().unwrap());\\n\\n (NodeKey::new(version, np), account_key)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/node_type.rs\",\n \"rank\": 4,\n \"score\": 119915.06299559216\n },\n {\n \"content\": \"pub fn arb_existent_kvs_and_nonexistent_keys(\\n\\n num_kvs: usize,\\n\\n num_non_existing_keys: usize,\\n\\n) -> impl Strategy<Value = (HashMap<KeyHash, OwnedValue>, Vec<KeyHash>)> {\\n\\n hash_map(any::<KeyHash>(), any::<OwnedValue>(), 1..num_kvs).prop_flat_map(move |kvs| {\\n\\n let kvs_clone = kvs.clone();\\n\\n (\\n\\n Just(kvs),\\n\\n vec(\\n\\n any::<KeyHash>().prop_filter(\\n\\n \\\"Make sure these keys do not exist in the tree.\\\",\\n\\n move |key| !kvs_clone.contains_key(key),\\n\\n ),\\n\\n num_non_existing_keys,\\n\\n ),\\n\\n )\\n\\n })\\n\\n}\\n\\n\\n\\npub async fn test_get_with_proof(\\n\\n (existent_kvs, nonexistent_keys): (HashMap<KeyHash, OwnedValue>, Vec<KeyHash>),\\n\\n) {\\n\\n let (db, version) = init_mock_db(&existent_kvs).await;\\n\\n let tree = JellyfishMerkleTree::new(&db);\\n\\n\\n\\n test_existent_keys_impl(&tree, version, &existent_kvs).await;\\n\\n test_nonexistent_keys_impl(&tree, version, &nonexistent_keys).await;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/helper.rs\",\n \"rank\": 5,\n \"score\": 111722.69077869739\n },\n {\n \"content\": \"/// `FrozenTreeCache` is used as a field of `TreeCache` storing all the nodes and values that\\n\\n/// are generated by earlier transactions so they have to be immutable. The motivation of\\n\\n/// `FrozenTreeCache` is to let `TreeCache` freeze intermediate results from each transaction to\\n\\n/// help commit more than one transaction in a row atomically.\\n\\nstruct FrozenTreeCache {\\n\\n /// Immutable node_cache.\\n\\n node_cache: NodeBatch,\\n\\n\\n\\n /// Immutable stale_node_index_cache.\\n\\n stale_node_index_cache: StaleNodeIndexBatch,\\n\\n\\n\\n /// the stats vector including the number of new nodes, new leaves, stale nodes and stale leaves.\\n\\n node_stats: Vec<NodeStats>,\\n\\n\\n\\n /// Frozen root hashes after each earlier transaction.\\n\\n root_hashes: Vec<RootHash>,\\n\\n}\\n\\n\\n\\nimpl FrozenTreeCache {\\n\\n fn new() -> Self {\\n\\n Self {\\n\\n node_cache: BTreeMap::new(),\\n\\n stale_node_index_cache: BTreeSet::new(),\\n\\n node_stats: Vec::new(),\\n\",\n \"file_path\": \"src/tree_cache.rs\",\n \"rank\": 6,\n \"score\": 91017.94989064043\n },\n {\n \"content\": \"pub fn arb_tree_with_index(\\n\\n tree_size: usize,\\n\\n) -> impl Strategy<Value = (BTreeMap<KeyHash, OwnedValue>, usize)> {\\n\\n btree_map(any::<KeyHash>(), any::<OwnedValue>(), 1..tree_size).prop_flat_map(|btree| {\\n\\n let len = btree.len();\\n\\n (Just(btree), 0..len)\\n\\n })\\n\\n}\\n\\n\\n\\npub async fn test_get_range_proof((btree, n): (BTreeMap<KeyHash, OwnedValue>, usize)) {\\n\\n let (db, version) = init_mock_db(&btree.clone().into_iter().collect()).await;\\n\\n let tree = JellyfishMerkleTree::new(&db);\\n\\n\\n\\n let nth_key = btree.keys().nth(n).unwrap();\\n\\n\\n\\n let proof = tree.get_range_proof(*nth_key, version).await.unwrap();\\n\\n verify_range_proof(\\n\\n tree.get_root_hash(version).await.unwrap(),\\n\\n btree.into_iter().take(n + 1).collect(),\\n\\n proof,\\n\",\n \"file_path\": \"src/tests/helper.rs\",\n \"rank\": 7,\n \"score\": 90530.79015690157\n },\n {\n \"content\": \"/// Defines the interface used to write a batch of updates from a\\n\\n/// [`JellyfishMerkleTree`](crate::JellyfishMerkleTree)\\n\\n/// to the underlying storage holding nodes.\\n\\npub trait TreeWriter: Send + Sync {\\n\\n /// Writes a node batch into storage.\\n\\n fn write_node_batch<'future, 'a: 'future, 'n: 'future>(\\n\\n &'a mut self,\\n\\n node_batch: &'n NodeBatch,\\n\\n ) -> BoxFuture<'future, Result<()>>;\\n\\n}\\n\\n\\n\\n/// Node batch that will be written into db atomically with other batches.\\n\\npub type NodeBatch = BTreeMap<NodeKey, Node>;\\n\\n/// [`StaleNodeIndex`](struct.StaleNodeIndex.html) batch that will be written into db atomically\\n\\n/// with other batches.\\n\\npub type StaleNodeIndexBatch = BTreeSet<StaleNodeIndex>;\\n\\n\\n\\n#[derive(Clone, Debug, Default, Eq, PartialEq)]\\n\\npub struct NodeStats {\\n\\n pub new_nodes: usize,\\n\\n pub new_leaves: usize,\\n\\n pub stale_nodes: usize,\\n\\n pub stale_leaves: usize,\\n\",\n \"file_path\": \"src/writer.rs\",\n \"rank\": 8,\n \"score\": 89754.57351693374\n },\n {\n \"content\": \"fn update_nibble(original_key: &KeyHash, n: usize, nibble: u8) -> KeyHash {\\n\\n assert!(nibble < 16);\\n\\n let mut key = original_key.0;\\n\\n key[n / 2] = if n % 2 == 0 {\\n\\n key[n / 2] & 0x0f | nibble << 4\\n\\n } else {\\n\\n key[n / 2] & 0xf0 | nibble\\n\\n };\\n\\n KeyHash(key)\\n\\n}\\n\\n\\n\\n#[tokio::test]\\n\\nasync fn test_insert_to_empty_tree() {\\n\\n let db = MockTreeStore::default();\\n\\n let tree = JellyfishMerkleTree::new(&db);\\n\\n\\n\\n // Tree is initially empty. Root is a null node. We'll insert a key-value pair which creates a\\n\\n // leaf node.\\n\\n let key = b\\\"testkey\\\";\\n\\n let value = vec![1u8, 2u8, 3u8, 4u8];\\n\",\n \"file_path\": \"src/tests/jellyfish_merkle.rs\",\n \"rank\": 9,\n \"score\": 85914.90459483003\n },\n {\n \"content\": \"pub fn arb_kv_pair_with_distinct_last_nibble(\\n\\n) -> impl Strategy<Value = ((KeyHash, OwnedValue), (KeyHash, OwnedValue))> {\\n\\n (\\n\\n any::<KeyHash>().prop_filter(\\\"Can't be 0xffffff...\\\", |key| *key != KeyHash([0xff; 32])),\\n\\n vec(any::<OwnedValue>(), 2),\\n\\n )\\n\\n .prop_map(|(key1, accounts)| {\\n\\n let key2 = plus_one(key1);\\n\\n ((key1, accounts[0].clone()), (key2, accounts[1].clone()))\\n\\n })\\n\\n}\\n\\n\\n\\npub async fn test_get_with_proof_with_distinct_last_nibble(\\n\\n (kv1, kv2): ((KeyHash, OwnedValue), (KeyHash, OwnedValue)),\\n\\n) {\\n\\n let mut kvs = HashMap::new();\\n\\n kvs.insert(kv1.0, kv1.1);\\n\\n kvs.insert(kv2.0, kv2.1);\\n\\n\\n\\n let (db, version) = init_mock_db(&kvs).await;\\n\\n let tree = JellyfishMerkleTree::new(&db);\\n\\n\\n\\n test_existent_keys_impl(&tree, version, &kvs).await;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/helper.rs\",\n \"rank\": 10,\n \"score\": 84044.98884141081\n },\n {\n \"content\": \"pub fn ics23_spec() -> ics23::ProofSpec {\\n\\n ics23::ProofSpec {\\n\\n leaf_spec: Some(ics23::LeafOp {\\n\\n hash: ics23::HashOp::Sha256.into(),\\n\\n prehash_key: ics23::HashOp::Sha256.into(),\\n\\n prehash_value: ics23::HashOp::Sha256.into(),\\n\\n length: ics23::LengthOp::NoPrefix.into(),\\n\\n prefix: b\\\"JMT::LeafNode\\\".to_vec(),\\n\\n }),\\n\\n inner_spec: Some(ics23::InnerSpec {\\n\\n // This is the only field we're sure about\\n\\n hash: ics23::HashOp::Sha256.into(),\\n\\n // These fields are apparently used for neighbor tests in range proofs,\\n\\n // and could be wrong:\\n\\n child_order: vec![0, 1], //where exactly does this need to be true?\\n\\n min_prefix_length: 16, //what is this?\\n\\n max_prefix_length: 48, //and this?\\n\\n child_size: 32,\\n\\n empty_child: vec![], //check JMT repo to determine if special value used here\\n\\n }),\\n\",\n \"file_path\": \"src/ics23_impl.rs\",\n \"rank\": 11,\n \"score\": 80147.66093207162\n },\n {\n \"content\": \"// Generate a random node key with 63 nibbles.\\n\\nfn random_63nibbles_node_key() -> NodeKey {\\n\\n let mut bytes: [u8; 32] = OsRng.gen();\\n\\n *bytes.last_mut().unwrap() &= 0xf0;\\n\\n NodeKey::new(0 /* version */, NibblePath::new_odd(bytes.to_vec()))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/node_type.rs\",\n \"rank\": 12,\n \"score\": 74632.84826568725\n },\n {\n \"content\": \"/// Returns the key immediately before `key` in `btree`.\\n\\nfn prev_key<K, V>(btree: &BTreeMap<K, V>, key: &K) -> Option<K>\\n\\nwhere\\n\\n K: Clone + Ord,\\n\\n{\\n\\n btree\\n\\n .range((Bound::Unbounded, Bound::Excluded(key)))\\n\\n .next_back()\\n\\n .map(|(k, _v)| k.clone())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/helper.rs\",\n \"rank\": 13,\n \"score\": 67296.92578774039\n },\n {\n \"content\": \"fn next_key<K, V>(btree: &BTreeMap<K, V>, key: &K) -> Option<K>\\n\\nwhere\\n\\n K: Clone + Ord,\\n\\n{\\n\\n btree\\n\\n .range((Bound::Excluded(key), Bound::Unbounded))\\n\\n .next()\\n\\n .map(|(k, _v)| k.clone())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/helper.rs\",\n \"rank\": 14,\n \"score\": 67292.64245352519\n },\n {\n \"content\": \"/// Advance both iterators if their next nibbles are the same until either reaches the end or\\n\\n/// the find a mismatch. Return the number of matched nibbles.\\n\\npub fn skip_common_prefix<I1, I2>(x: &mut I1, y: &mut I2) -> usize\\n\\nwhere\\n\\n I1: Iterator + Peekable,\\n\\n I2: Iterator + Peekable,\\n\\n <I1 as Iterator>::Item: std::cmp::PartialEq<<I2 as Iterator>::Item>,\\n\\n{\\n\\n let mut count = 0;\\n\\n loop {\\n\\n let x_peek = x.peek();\\n\\n let y_peek = y.peek();\\n\\n if x_peek.is_none()\\n\\n || y_peek.is_none()\\n\\n || x_peek.expect(\\\"cannot be none\\\") != y_peek.expect(\\\"cannot be none\\\")\\n\\n {\\n\\n break;\\n\\n }\\n\\n count += 1;\\n\\n x.next();\\n\\n y.next();\\n\\n }\\n\\n count\\n\\n}\\n\",\n \"file_path\": \"src/types/nibble/nibble_path.rs\",\n \"rank\": 15,\n \"score\": 58095.10552090459\n },\n {\n \"content\": \"fn arb_sparse_merkle_sibling() -> impl Strategy<Value = [u8; 32]> {\\n\\n prop_oneof![\\n\\n arb_non_placeholder_sparse_merkle_sibling(),\\n\\n Just(SPARSE_MERKLE_PLACEHOLDER_HASH),\\n\\n ]\\n\\n}\\n\\n\\n\\nimpl Arbitrary for SparseMerkleProof {\\n\\n type Parameters = ();\\n\\n type Strategy = BoxedStrategy<Self>;\\n\\n\\n\\n fn arbitrary_with(_args: Self::Parameters) -> Self::Strategy {\\n\\n (\\n\\n any::<Option<SparseMerkleLeafNode>>(),\\n\\n (0..=256usize).prop_flat_map(|len| {\\n\\n if len == 0 {\\n\\n Just(vec![]).boxed()\\n\\n } else {\\n\\n (\\n\\n arb_non_placeholder_sparse_merkle_sibling(),\\n\",\n \"file_path\": \"src/types/proof/proptest_proof.rs\",\n \"rank\": 16,\n \"score\": 54849.30601458446\n },\n {\n \"content\": \"#[derive(Clone, Debug)]\\n\\nstruct InternalInfo {\\n\\n /// The node key of this internal node.\\n\\n node_key: NodeKey,\\n\\n\\n\\n /// The existing children. Every time a child appears, the corresponding position will be set\\n\\n /// to `Some`.\\n\\n children: [Option<ChildInfo>; 16],\\n\\n}\\n\\n\\n\\nimpl InternalInfo {\\n\\n /// Creates an empty internal node with no children.\\n\\n fn new_empty(node_key: NodeKey) -> Self {\\n\\n Self {\\n\\n node_key,\\n\\n children: Default::default(),\\n\\n }\\n\\n }\\n\\n\\n\\n fn set_child(&mut self, index: usize, child_info: ChildInfo) {\\n\\n precondition!(index < 16);\\n\",\n \"file_path\": \"src/restore.rs\",\n \"rank\": 17,\n \"score\": 54791.64621946222\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct NodeVisitInfo {\\n\\n /// The key to this node.\\n\\n node_key: NodeKey,\\n\\n\\n\\n /// The node itself.\\n\\n node: InternalNode,\\n\\n\\n\\n /// The bitmap indicating which children exist. It is generated by running\\n\\n /// `self.node.generate_bitmaps().0` and cached here.\\n\\n children_bitmap: u16,\\n\\n\\n\\n /// This integer always has exactly one 1-bit. The position of the 1-bit (from LSB) indicates\\n\\n /// the next child to visit in the iteration process. All the ones on the left have already\\n\\n /// been visited. All the chilren on the right (including this one) have not been visited yet.\\n\\n next_child_to_visit: u16,\\n\\n}\\n\\n\\n\\nimpl NodeVisitInfo {\\n\\n /// Constructs a new `NodeVisitInfo` with given node key and node. `next_child_to_visit` will\\n\\n /// be set to the leftmost child.\\n\",\n \"file_path\": \"src/iterator.rs\",\n \"rank\": 18,\n \"score\": 53235.52533924555\n },\n {\n \"content\": \"fn arb_non_placeholder_sparse_merkle_sibling() -> impl Strategy<Value = [u8; 32]> {\\n\\n any::<[u8; 32]>().prop_filter(\\\"Filter out placeholder sibling.\\\", |x| {\\n\\n *x != SPARSE_MERKLE_PLACEHOLDER_HASH\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/types/proof/proptest_proof.rs\",\n \"rank\": 19,\n \"score\": 51981.077689793216\n },\n {\n \"content\": \"struct NaiveInternalNode {\\n\\n root: Rc<BinaryTreeNode>,\\n\\n}\\n\\n\\n\\nimpl NaiveInternalNode {\\n\\n fn from_clever_node(node: &InternalNode) -> Self {\\n\\n Self {\\n\\n root: Rc::new(Self::node_for_subtree(0, 16, node.children())),\\n\\n }\\n\\n }\\n\\n\\n\\n fn node_for_subtree(begin: u8, width: u8, children: &Children) -> BinaryTreeNode {\\n\\n if width == 1 {\\n\\n return children\\n\\n .get(&begin.into())\\n\\n .map_or(BinaryTreeNode::Null, |child| {\\n\\n BinaryTreeNode::new_child(begin, child)\\n\\n });\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/tests/node_type.rs\",\n \"rank\": 20,\n \"score\": 50534.346717707325\n },\n {\n \"content\": \"/// An internal node in a binary tree corresponding to a `InternalNode` being tested.\\n\\n///\\n\\n/// To describe its position in the binary tree, we use a range of level 0 (children level)\\n\\n/// positions expressed by (`begin`, `width`)\\n\\n///\\n\\n/// For example, in the below graph, node A has (begin:0, width:4), while node B has\\n\\n/// (begin:2, width: 2):\\n\\n/// ...\\n\\n/// /\\n\\n/// [A] ...\\n\\n/// / \\\\\\n\\n/// * [B] ...\\n\\n/// / \\\\ / \\\\\\n\\n/// 0 1 2 3 ... 15\\n\\nstruct BinaryTreeInternalNode {\\n\\n begin: u8,\\n\\n width: u8,\\n\\n left: Rc<BinaryTreeNode>,\\n\\n right: Rc<BinaryTreeNode>,\\n\\n hash: [u8; 32],\\n\\n}\\n\\n\\n\\nimpl BinaryTreeInternalNode {\\n\\n fn in_left_subtree(&self, n: u8) -> bool {\\n\\n assert!(n >= self.begin);\\n\\n assert!(n < self.begin + self.width);\\n\\n\\n\\n n < self.begin + self.width / 2\\n\\n }\\n\\n}\\n\\n\\n\\n/// A child node, corresponding to one that is in the corresponding `InternalNode` being tested.\\n\\n///\\n\\n/// `index` is its key in `InternalNode::children`.\\n\\n/// N.B. when `is_leaf` is true, in the binary tree represented by a `NaiveInternalNode`, the child\\n\\n/// node will be brought up to the root of the highest subtree that has only that leaf.\\n\",\n \"file_path\": \"src/tests/node_type.rs\",\n \"rank\": 21,\n \"score\": 49357.705364455425\n },\n {\n \"content\": \"#[derive(Clone, Copy)]\\n\\nstruct BinaryTreeChildNode {\\n\\n version: Version,\\n\\n index: u8,\\n\\n hash: [u8; 32],\\n\\n is_leaf: bool,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/node_type.rs\",\n \"rank\": 22,\n \"score\": 49354.62000392258\n },\n {\n \"content\": \"/// The interface used with [`JellyfishMerkleRestore`], taken from the Diem `storage-interface` crate.\\n\\npub trait StateSnapshotReceiver {\\n\\n fn add_chunk<'future, 'a: 'future>(\\n\\n &'a mut self,\\n\\n chunk: Vec<(KeyHash, OwnedValue)>,\\n\\n proof: SparseMerkleRangeProof,\\n\\n ) -> BoxFuture<'future, Result<()>>;\\n\\n\\n\\n fn finish(self) -> BoxFuture<'static, Result<()>>;\\n\\n\\n\\n fn finish_box(self: Box<Self>) -> BoxFuture<'static, Result<()>>;\\n\\n}\\n\\n\\n\\nimpl StateSnapshotReceiver for JellyfishMerkleRestore {\\n\\n fn add_chunk<'future, 'a: 'future>(\\n\\n &'a mut self,\\n\\n chunk: Vec<(KeyHash, OwnedValue)>,\\n\\n proof: SparseMerkleRangeProof,\\n\\n ) -> BoxFuture<'future, Result<()>> {\\n\\n self.add_chunk_impl(chunk, proof).boxed()\\n\\n }\\n\\n\\n\\n fn finish(self) -> BoxFuture<'static, Result<()>> {\\n\\n self.finish_impl().boxed()\\n\\n }\\n\\n\\n\\n fn finish_box(self: Box<Self>) -> BoxFuture<'static, Result<()>> {\\n\\n self.finish_impl().boxed()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/restore.rs\",\n \"rank\": 23,\n \"score\": 48985.97798208194\n },\n {\n \"content\": \"struct EscapedByteSlice<'a>(&'a [u8]);\\n\\n\\n\\nimpl<'a> std::fmt::Debug for EscapedByteSlice<'a> {\\n\\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\\n\\n write!(f, \\\"b\\\\\\\"\\\")?;\\n\\n for &b in self.0 {\\n\\n // https://doc.rust-lang.org/reference/tokens.html#byte-escapes\\n\\n if b == b'\\\\n' {\\n\\n write!(f, \\\"\\\\\\\\n\\\")?;\\n\\n } else if b == b'\\\\r' {\\n\\n write!(f, \\\"\\\\\\\\r\\\")?;\\n\\n } else if b == b'\\\\t' {\\n\\n write!(f, \\\"\\\\\\\\t\\\")?;\\n\\n } else if b == b'\\\\\\\\' || b == b'\\\"' {\\n\\n write!(f, \\\"\\\\\\\\{}\\\", b as char)?;\\n\\n } else if b == b'\\\\0' {\\n\\n write!(f, \\\"\\\\\\\\0\\\")?;\\n\\n // ASCII printable\\n\\n } else if b >= 0x20 && b < 0x7f {\\n\\n write!(f, \\\"{}\\\", b as char)?;\\n\\n } else {\\n\\n write!(f, \\\"\\\\\\\\x{:02x}\\\", b)?;\\n\\n }\\n\\n }\\n\\n write!(f, \\\"\\\\\\\"\\\")?;\\n\\n Ok(())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 24,\n \"score\": 46123.94359335159\n },\n {\n \"content\": \"/// Checks if we can construct the expected root hash using the entries in the btree and the proof.\\n\\nfn verify_range_proof(\\n\\n expected_root_hash: RootHash,\\n\\n btree: BTreeMap<KeyHash, OwnedValue>,\\n\\n proof: SparseMerkleRangeProof,\\n\\n) {\\n\\n // For example, given the following sparse Merkle tree:\\n\\n //\\n\\n // root\\n\\n // / \\\\\\n\\n // / \\\\\\n\\n // / \\\\\\n\\n // o o\\n\\n // / \\\\ / \\\\\\n\\n // a o o h\\n\\n // / \\\\ / \\\\\\n\\n // o d e X\\n\\n // / \\\\ / \\\\\\n\\n // b c f g\\n\\n //\\n\\n // we transform the keys as follows:\\n\",\n \"file_path\": \"src/tests/helper.rs\",\n \"rank\": 25,\n \"score\": 45826.809026759496\n },\n {\n \"content\": \"pub trait Peekable: Iterator {\\n\\n /// Returns the `next()` value without advancing the iterator.\\n\\n fn peek(&self) -> Option<Self::Item>;\\n\\n}\\n\\n\\n\\n/// BitIterator iterates a nibble path by bit.\\n\\npub struct BitIterator<'a> {\\n\\n nibble_path: &'a NibblePath,\\n\\n pos: std::ops::Range<usize>,\\n\\n}\\n\\n\\n\\nimpl<'a> Peekable for BitIterator<'a> {\\n\\n /// Returns the `next()` value without advancing the iterator.\\n\\n fn peek(&self) -> Option<Self::Item> {\\n\\n if self.pos.start < self.pos.end {\\n\\n Some(self.nibble_path.get_bit(self.pos.start))\\n\\n } else {\\n\\n None\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/types/nibble/nibble_path.rs\",\n \"rank\": 26,\n \"score\": 44696.96976882307\n },\n {\n \"content\": \"#[test]\\n\\nfn test_leaf_hash() {\\n\\n {\\n\\n let address = KeyHash(OsRng.gen());\\n\\n let blob = vec![0x02];\\n\\n let value_hash: ValueHash = blob.as_slice().into();\\n\\n let hash = hash_leaf(address, value_hash);\\n\\n let leaf_node = Node::new_leaf(address, blob);\\n\\n assert_eq!(leaf_node.hash(), hash);\\n\\n }\\n\\n}\\n\\n\\n\\nproptest! {\\n\\n #[test]\\n\\n fn two_leaves_test1(index1 in (0..8u8).prop_map(Nibble::from), index2 in (8..16u8).prop_map(Nibble::from)) {\\n\\n let internal_node_key = random_63nibbles_node_key();\\n\\n let mut children = Children::default();\\n\\n\\n\\n let leaf1_node_key = gen_leaf_keys(0 /* version */, internal_node_key.nibble_path(), index1).0;\\n\\n let leaf2_node_key = gen_leaf_keys(1 /* version */, internal_node_key.nibble_path(), index2).0;\\n\\n let hash1 = OsRng.gen();\\n\",\n \"file_path\": \"src/tests/node_type.rs\",\n \"rank\": 27,\n \"score\": 44549.014821985504\n },\n {\n \"content\": \"#[test]\\n\\n#[allow(clippy::bool_assert_comparison)]\\n\\nfn test_get_bit() {\\n\\n let bytes = vec![0x01, 0x02];\\n\\n let nibble_path = NibblePath::new(bytes);\\n\\n assert_eq!(nibble_path.get_bit(0), false);\\n\\n assert_eq!(nibble_path.get_bit(1), false);\\n\\n assert_eq!(nibble_path.get_bit(2), false);\\n\\n assert_eq!(nibble_path.get_bit(7), true);\\n\\n assert_eq!(nibble_path.get_bit(8), false);\\n\\n assert_eq!(nibble_path.get_bit(14), true);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/nibble_path.rs\",\n \"rank\": 28,\n \"score\": 44549.014821985504\n },\n {\n \"content\": \"#[test]\\n\\nfn test_encode_decode() {\\n\\n let internal_node_key = random_63nibbles_node_key();\\n\\n\\n\\n let leaf1_keys = gen_leaf_keys(0, internal_node_key.nibble_path(), Nibble::from(1));\\n\\n let leaf1_node = Node::new_leaf(leaf1_keys.1, vec![0x00]);\\n\\n let leaf2_keys = gen_leaf_keys(0, internal_node_key.nibble_path(), Nibble::from(2));\\n\\n let leaf2_node = Node::new_leaf(leaf2_keys.1, vec![0x01]);\\n\\n\\n\\n let mut children = Children::default();\\n\\n children.insert(\\n\\n Nibble::from(1),\\n\\n Child::new(leaf1_node.hash(), 0 /* version */, NodeType::Leaf),\\n\\n );\\n\\n children.insert(\\n\\n Nibble::from(2),\\n\\n Child::new(leaf2_node.hash(), 0 /* version */, NodeType::Leaf),\\n\\n );\\n\\n\\n\\n let account_key = KeyHash(OsRng.gen());\\n\\n let nodes = vec![\\n\",\n \"file_path\": \"src/tests/node_type.rs\",\n \"rank\": 29,\n \"score\": 44549.014821985504\n },\n {\n \"content\": \"#[test]\\n\\nfn test_internal_validity() {\\n\\n let result = panic::catch_unwind(|| {\\n\\n let children = Children::default();\\n\\n InternalNode::new(children)\\n\\n });\\n\\n assert!(result.is_err());\\n\\n\\n\\n let result = panic::catch_unwind(|| {\\n\\n let mut children = Children::default();\\n\\n children.insert(\\n\\n Nibble::from(1),\\n\\n Child::new(OsRng.gen(), 0 /* version */, NodeType::Leaf),\\n\\n );\\n\\n InternalNode::new(children);\\n\\n });\\n\\n assert!(result.is_err());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/node_type.rs\",\n \"rank\": 30,\n \"score\": 44549.014821985504\n },\n {\n \"content\": \"#[test]\\n\\nfn test_get_nibble() {\\n\\n let bytes = vec![0x12, 0x34];\\n\\n let nibble_path = NibblePath::new(bytes);\\n\\n assert_eq!(nibble_path.get_nibble(0), Nibble::from(0x01));\\n\\n assert_eq!(nibble_path.get_nibble(1), Nibble::from(0x02));\\n\\n assert_eq!(nibble_path.get_nibble(2), Nibble::from(0x03));\\n\\n assert_eq!(nibble_path.get_nibble(3), Nibble::from(0x04));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/nibble_path.rs\",\n \"rank\": 31,\n \"score\": 44549.014821985504\n },\n {\n \"content\": \"#[test]\\n\\nfn test_bit_iter() {\\n\\n let bytes = vec![0xc3, 0xa0];\\n\\n let nibble_path = NibblePath::new_odd(bytes);\\n\\n let mut iter = nibble_path.bits();\\n\\n // c: 0b1100\\n\\n assert_eq!(iter.next(), Some(true));\\n\\n assert_eq!(iter.next(), Some(true));\\n\\n assert_eq!(iter.next(), Some(false));\\n\\n assert_eq!(iter.next(), Some(false));\\n\\n // 3: 0b0011\\n\\n assert_eq!(iter.next(), Some(false));\\n\\n assert_eq!(iter.next(), Some(false));\\n\\n assert_eq!(iter.next(), Some(true));\\n\\n assert_eq!(iter.next(), Some(true));\\n\\n // a: 0b1010\\n\\n assert_eq!(iter.next_back(), Some(false));\\n\\n assert_eq!(iter.next_back(), Some(true));\\n\\n assert_eq!(iter.next_back(), Some(false));\\n\\n assert_eq!(iter.next_back(), Some(true));\\n\\n\\n\\n assert_eq!(iter.next(), None);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/nibble_path.rs\",\n \"rank\": 32,\n \"score\": 44549.014821985504\n },\n {\n \"content\": \"#[test]\\n\\nfn test_nibble_iterator() {\\n\\n let bytes = vec![0x12, 0x30];\\n\\n let nibble_path = NibblePath::new_odd(bytes);\\n\\n let mut iter = nibble_path.nibbles();\\n\\n assert_eq!(iter.next().unwrap(), Nibble::from(0x01));\\n\\n assert_eq!(iter.next().unwrap(), Nibble::from(0x02));\\n\\n assert_eq!(iter.next().unwrap(), Nibble::from(0x03));\\n\\n assert_eq!(iter.next(), None);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/nibble_path.rs\",\n \"rank\": 33,\n \"score\": 44549.014821985504\n },\n {\n \"content\": \"/// Computes the root hash of a sparse Merkle tree. `kvs` consists of the entire set of key-value\\n\\n/// pairs stored in the tree.\\n\\nfn compute_root_hash(kvs: Vec<(Vec<bool>, [u8; 32])>) -> RootHash {\\n\\n let mut kv_ref = vec![];\\n\\n for (key, value) in &kvs {\\n\\n kv_ref.push((&key[..], *value));\\n\\n }\\n\\n RootHash(compute_root_hash_impl(kv_ref))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/helper.rs\",\n \"rank\": 34,\n \"score\": 44384.221928185434\n },\n {\n \"content\": \"#[test]\\n\\n#[should_panic(expected = \\\"Should have odd number of nibbles.\\\")]\\n\\nfn test_empty_nibble_path() {\\n\\n NibblePath::new_odd(vec![]);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/nibble_path.rs\",\n \"rank\": 35,\n \"score\": 43382.553861390516\n },\n {\n \"content\": \"#[test]\\n\\nfn test_skip_common_prefix() {\\n\\n {\\n\\n let nibble_path1 = NibblePath::new(vec![0x12, 0x34, 0x56]);\\n\\n let nibble_path2 = NibblePath::new(vec![0x12, 0x34, 0x56]);\\n\\n let mut iter1 = nibble_path1.nibbles();\\n\\n let mut iter2 = nibble_path2.nibbles();\\n\\n assert_eq!(skip_common_prefix(&mut iter1, &mut iter2), 6);\\n\\n assert!(iter1.is_finished());\\n\\n assert!(iter2.is_finished());\\n\\n }\\n\\n {\\n\\n let nibble_path1 = NibblePath::new(vec![0x12, 0x35]);\\n\\n let nibble_path2 = NibblePath::new(vec![0x12, 0x34, 0x56]);\\n\\n let mut iter1 = nibble_path1.nibbles();\\n\\n let mut iter2 = nibble_path2.nibbles();\\n\\n assert_eq!(skip_common_prefix(&mut iter1, &mut iter2), 3);\\n\\n assert_eq!(\\n\\n iter1.visited_nibbles().get_nibble_path(),\\n\\n iter2.visited_nibbles().get_nibble_path()\\n\\n );\\n\",\n \"file_path\": \"src/tests/nibble_path.rs\",\n \"rank\": 36,\n \"score\": 43382.553861390516\n },\n {\n \"content\": \"#[test]\\n\\nfn test_visited_nibble_iter() {\\n\\n let bytes = vec![0x12, 0x34, 0x56];\\n\\n let nibble_path = NibblePath::new(bytes);\\n\\n let mut iter = nibble_path.nibbles();\\n\\n assert_eq!(iter.next().unwrap(), 0x01.into());\\n\\n assert_eq!(iter.next().unwrap(), 0x02.into());\\n\\n assert_eq!(iter.next().unwrap(), 0x03.into());\\n\\n let mut visited_nibble_iter = iter.visited_nibbles();\\n\\n assert_eq!(visited_nibble_iter.next().unwrap(), 0x01.into());\\n\\n assert_eq!(visited_nibble_iter.next().unwrap(), 0x02.into());\\n\\n assert_eq!(visited_nibble_iter.next().unwrap(), 0x03.into());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/nibble_path.rs\",\n \"rank\": 37,\n \"score\": 43382.553861390516\n },\n {\n \"content\": \"#[test]\\n\\nfn test_internal_hash_and_proof() {\\n\\n // non-leaf case 1\\n\\n {\\n\\n let internal_node_key = random_63nibbles_node_key();\\n\\n let mut children = Children::default();\\n\\n\\n\\n let index1 = Nibble::from(4);\\n\\n let index2 = Nibble::from(15);\\n\\n let hash1 = OsRng.gen();\\n\\n let hash2 = OsRng.gen();\\n\\n let child1_node_key = gen_leaf_keys(\\n\\n 0, /* version */\\n\\n internal_node_key.nibble_path(),\\n\\n index1,\\n\\n )\\n\\n .0;\\n\\n let child2_node_key = gen_leaf_keys(\\n\\n 1, /* version */\\n\\n internal_node_key.nibble_path(),\\n\\n index2,\\n\",\n \"file_path\": \"src/tests/node_type.rs\",\n \"rank\": 38,\n \"score\": 43382.553861390516\n },\n {\n \"content\": \"#[test]\\n\\nfn test_nibble_path_fmt() {\\n\\n let nibble_path = NibblePath::new(vec![0x12, 0x34, 0x56]);\\n\\n assert_eq!(format!(\\\"{:?}\\\", nibble_path), \\\"123456\\\");\\n\\n\\n\\n let nibble_path = NibblePath::new(vec![0x12, 0x34, 0x50]);\\n\\n assert_eq!(format!(\\\"{:?}\\\", nibble_path), \\\"123450\\\");\\n\\n\\n\\n let nibble_path = NibblePath::new_odd(vec![0x12, 0x34, 0x50]);\\n\\n assert_eq!(format!(\\\"{:?}\\\", nibble_path), \\\"12345\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/nibble_path.rs\",\n \"rank\": 39,\n \"score\": 43382.553861390516\n },\n {\n \"content\": \"#[test]\\n\\n#[should_panic(expected = \\\"Last nibble must be 0.\\\")]\\n\\nfn test_create_nibble_path_failure() {\\n\\n let bytes = vec![0x12, 0x34, 0x56];\\n\\n let _nibble_path = NibblePath::new_odd(bytes);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/nibble_path.rs\",\n \"rank\": 40,\n \"score\": 42310.491190025714\n },\n {\n \"content\": \"#[test]\\n\\nfn test_create_nibble_path_success() {\\n\\n let nibble_path = NibblePath::new(vec![0x12, 0x34, 0x56]);\\n\\n assert_eq!(nibble_path.num_nibbles(), 6);\\n\\n\\n\\n let nibble_path = NibblePath::new(vec![0x12, 0x34, 0x50]);\\n\\n assert_eq!(nibble_path.num_nibbles(), 6);\\n\\n\\n\\n let nibble_path = NibblePath::new_odd(vec![0x12, 0x34, 0x50]);\\n\\n assert_eq!(nibble_path.num_nibbles(), 5);\\n\\n\\n\\n let nibble_path = NibblePath::new(vec![]);\\n\\n assert_eq!(nibble_path.num_nibbles(), 0);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/nibble_path.rs\",\n \"rank\": 41,\n \"score\": 42310.491190025714\n },\n {\n \"content\": \"pub trait Bytes32Ext: Index<usize> + Sized {\\n\\n /// Returns the `index`-th nibble.\\n\\n fn get_nibble(&self, index: usize) -> crate::types::nibble::Nibble;\\n\\n /// Returns the length of common prefix of `self` and `other` in bits.\\n\\n fn common_prefix_bits_len(&self, other: &[u8; 32]) -> usize;\\n\\n /// Returns a `HashValueBitIterator` over all the bits that represent this hash value.\\n\\n fn iter_bits(&self) -> HashValueBitIterator<'_>;\\n\\n /// Returns the `index`-th nibble in the bytes.\\n\\n fn nibble(&self, index: usize) -> u8;\\n\\n /// Returns the length of common prefix of `self` and `other` in nibbles.\\n\\n fn common_prefix_nibbles_len(&self, other: &[u8; 32]) -> usize {\\n\\n self.common_prefix_bits_len(other) / 4\\n\\n }\\n\\n /// Constructs a `HashValue` from an iterator of bits.\\n\\n fn from_bit_iter(iter: impl ExactSizeIterator<Item = bool>) -> Option<Self>;\\n\\n}\\n\\n\\n\\nimpl Bytes32Ext for [u8; 32] {\\n\\n fn get_nibble(&self, index: usize) -> crate::types::nibble::Nibble {\\n\\n crate::types::nibble::Nibble::from(if index % 2 == 0 {\\n\",\n \"file_path\": \"src/bytes32ext.rs\",\n \"rank\": 42,\n \"score\": 41909.569394826474\n },\n {\n \"content\": \"use anyhow::{format_err, Result};\\n\\nuse futures::future::BoxFuture;\\n\\n\\n\\nuse crate::node_type::{LeafNode, Node, NodeKey};\\n\\n\\n\\n/// Defines the interface between a\\n\\n/// [`JellyfishMerkleTree`](crate::JellyfishMerkleTree)\\n\\n/// and underlying storage holding nodes.\\n\",\n \"file_path\": \"src/reader.rs\",\n \"rank\": 43,\n \"score\": 35957.033764471744\n },\n {\n \"content\": \" stale_node_index_cache: HashSet<NodeKey>,\\n\\n\\n\\n /// # of leaves in the `stale_node_index_cache`,\\n\\n num_stale_leaves: usize,\\n\\n\\n\\n /// The immutable part of this cache, which will be committed to the underlying storage.\\n\\n frozen_cache: FrozenTreeCache,\\n\\n\\n\\n /// The underlying persistent storage.\\n\\n reader: &'a R,\\n\\n}\\n\\n\\n\\nimpl<'a, R> TreeCache<'a, R>\\n\\nwhere\\n\\n R: 'a + TreeReader,\\n\\n{\\n\\n /// Constructs a new `TreeCache` instance.\\n\\n pub async fn new(reader: &'a R, next_version: Version) -> Result<TreeCache<'a, R>> {\\n\\n let mut node_cache = HashMap::new();\\n\\n let root_node_key = if next_version == 0 {\\n\",\n \"file_path\": \"src/tree_cache.rs\",\n \"rank\": 51,\n \"score\": 33798.79493024573\n },\n {\n \"content\": \" };\\n\\n Ok(Self {\\n\\n node_cache,\\n\\n stale_node_index_cache: HashSet::new(),\\n\\n frozen_cache: FrozenTreeCache::new(),\\n\\n root_node_key,\\n\\n next_version,\\n\\n reader,\\n\\n num_stale_leaves: 0,\\n\\n num_new_leaves: 0,\\n\\n })\\n\\n }\\n\\n\\n\\n /// Gets a node with given node key. If it doesn't exist in node cache, read from `reader`.\\n\\n pub async fn get_node(&self, node_key: &NodeKey) -> Result<Node> {\\n\\n Ok(if let Some(node) = self.node_cache.get(node_key) {\\n\\n node.clone()\\n\\n } else if let Some(node) = self.frozen_cache.node_cache.get(node_key) {\\n\\n node.clone()\\n\\n } else {\\n\",\n \"file_path\": \"src/tree_cache.rs\",\n \"rank\": 52,\n \"score\": 33797.80948252679\n },\n {\n \"content\": \" root_hashes: Vec::new(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// `TreeCache` is a in-memory cache for per-transaction updates of sparse Merkle nodes and values.\\n\\npub struct TreeCache<'a, R> {\\n\\n /// `NodeKey` of the current root node in cache.\\n\\n root_node_key: NodeKey,\\n\\n\\n\\n /// The version of the transaction to which the upcoming `put`s will be related.\\n\\n next_version: Version,\\n\\n\\n\\n /// Intermediate nodes keyed by node hash\\n\\n node_cache: HashMap<NodeKey, Node>,\\n\\n\\n\\n /// # of leaves in the `node_cache`,\\n\\n num_new_leaves: usize,\\n\\n\\n\\n /// Partial stale log. `NodeKey` to identify the stale record.\\n\",\n \"file_path\": \"src/tree_cache.rs\",\n \"rank\": 53,\n \"score\": 33793.62830457237\n },\n {\n \"content\": \"//! - Delete a node.\\n\\n//! When we apply these operations on a multi-version tree:\\n\\n//! 1) Put a new node.\\n\\n//! 2) When we remove a node, if the node is in the previous on-disk version, we don't need to do\\n\\n//! anything. Otherwise we delete it from the tree cache.\\n\\n//! Updating node could be operated as deletion of the node followed by insertion of the updated\\n\\n//! node.\\n\\n\\n\\nuse std::collections::{hash_map::Entry, BTreeMap, BTreeSet, HashMap, HashSet};\\n\\n\\n\\nuse anyhow::{bail, Result};\\n\\n\\n\\nuse crate::{\\n\\n metrics::DIEM_JELLYFISH_STORAGE_READS,\\n\\n node_type::{Node, NodeKey},\\n\\n storage::{\\n\\n NodeBatch, NodeStats, StaleNodeIndex, StaleNodeIndexBatch, TreeReader, TreeUpdateBatch,\\n\\n },\\n\\n types::{Version, PRE_GENESIS_VERSION},\\n\\n RootHash,\\n\\n};\\n\\n\\n\\n/// `FrozenTreeCache` is used as a field of `TreeCache` storing all the nodes and values that\\n\\n/// are generated by earlier transactions so they have to be immutable. The motivation of\\n\\n/// `FrozenTreeCache` is to let `TreeCache` freeze intermediate results from each transaction to\\n\\n/// help commit more than one transaction in a row atomically.\\n\",\n \"file_path\": \"src/tree_cache.rs\",\n \"rank\": 54,\n \"score\": 33793.55668183459\n },\n {\n \"content\": \" DIEM_JELLYFISH_STORAGE_READS.inc();\\n\\n self.reader.get_node_option(node_key).await?.unwrap()\\n\\n })\\n\\n }\\n\\n\\n\\n /// Gets the current root node key.\\n\\n pub fn get_root_node_key(&self) -> &NodeKey {\\n\\n &self.root_node_key\\n\\n }\\n\\n\\n\\n /// Set roots `node_key`.\\n\\n pub fn set_root_node_key(&mut self, root_node_key: NodeKey) {\\n\\n self.root_node_key = root_node_key;\\n\\n }\\n\\n\\n\\n /// Puts the node with given hash as key into node_cache.\\n\\n pub fn put_node(&mut self, node_key: NodeKey, new_node: Node) -> Result<()> {\\n\\n match self.node_cache.entry(node_key) {\\n\\n Entry::Vacant(o) => {\\n\\n if new_node.is_leaf() {\\n\",\n \"file_path\": \"src/tree_cache.rs\",\n \"rank\": 55,\n \"score\": 33790.004302972535\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl<'a, R> From<TreeCache<'a, R>> for (Vec<RootHash>, TreeUpdateBatch)\\n\\nwhere\\n\\n R: 'a + TreeReader,\\n\\n{\\n\\n fn from(tree_cache: TreeCache<'a, R>) -> Self {\\n\\n (\\n\\n tree_cache.frozen_cache.root_hashes,\\n\\n TreeUpdateBatch {\\n\\n node_batch: tree_cache.frozen_cache.node_cache,\\n\\n stale_node_index_batch: tree_cache.frozen_cache.stale_node_index_cache,\\n\\n node_stats: tree_cache.frozen_cache.node_stats,\\n\\n },\\n\\n )\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/tree_cache.rs\",\n \"rank\": 56,\n \"score\": 33789.14293691721\n },\n {\n \"content\": \" self.frozen_cache.node_cache.extend(self.node_cache.drain());\\n\\n let stale_since_version = self.next_version;\\n\\n self.frozen_cache\\n\\n .stale_node_index_cache\\n\\n .extend(\\n\\n self.stale_node_index_cache\\n\\n .drain()\\n\\n .map(|node_key| StaleNodeIndex {\\n\\n stale_since_version,\\n\\n node_key,\\n\\n }),\\n\\n );\\n\\n\\n\\n // Clean up\\n\\n self.num_stale_leaves = 0;\\n\\n self.num_new_leaves = 0;\\n\\n\\n\\n // Prepare for the next version after freezing\\n\\n self.next_version += 1;\\n\\n }\\n\",\n \"file_path\": \"src/tree_cache.rs\",\n \"rank\": 57,\n \"score\": 33786.89824902712\n },\n {\n \"content\": \" self.num_new_leaves -= 1;\\n\\n }\\n\\n }\\n\\n\\n\\n /// Freezes all the contents in cache to be immutable and clear `node_cache`.\\n\\n pub async fn freeze(&mut self) {\\n\\n let root_node_key = self.get_root_node_key();\\n\\n let root_hash = self\\n\\n .get_node(root_node_key)\\n\\n .await\\n\\n .unwrap_or_else(|_| unreachable!(\\\"Root node with key {:?} must exist\\\", root_node_key))\\n\\n .hash();\\n\\n self.frozen_cache.root_hashes.push(RootHash(root_hash));\\n\\n let node_stats = NodeStats {\\n\\n new_nodes: self.node_cache.len(),\\n\\n new_leaves: self.num_new_leaves,\\n\\n stale_nodes: self.stale_node_index_cache.len(),\\n\\n stale_leaves: self.num_stale_leaves,\\n\\n };\\n\\n self.frozen_cache.node_stats.push(node_stats);\\n\",\n \"file_path\": \"src/tree_cache.rs\",\n \"rank\": 58,\n \"score\": 33786.74423016439\n },\n {\n \"content\": \" self.num_new_leaves += 1\\n\\n }\\n\\n o.insert(new_node);\\n\\n }\\n\\n Entry::Occupied(o) => bail!(\\\"Node with key {:?} already exists in NodeBatch\\\", o.key()),\\n\\n };\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n /// Deletes a node with given hash.\\n\\n pub fn delete_node(&mut self, old_node_key: &NodeKey, is_leaf: bool) {\\n\\n // If node cache doesn't have this node, it means the node is in the previous version of\\n\\n // the tree on the disk.\\n\\n if self.node_cache.remove(old_node_key).is_none() {\\n\\n let is_new_entry = self.stale_node_index_cache.insert(old_node_key.clone());\\n\\n assert!(is_new_entry, \\\"Node gets stale twice unexpectedly.\\\");\\n\\n if is_leaf {\\n\\n self.num_stale_leaves += 1;\\n\\n }\\n\\n } else if is_leaf {\\n\",\n \"file_path\": \"src/tree_cache.rs\",\n \"rank\": 59,\n \"score\": 33786.439865756955\n },\n {\n \"content\": \" let pre_genesis_root_key = NodeKey::new_empty_path(PRE_GENESIS_VERSION);\\n\\n let pre_genesis_root = reader.get_node_option(&pre_genesis_root_key).await?;\\n\\n\\n\\n match pre_genesis_root {\\n\\n Some(_) => {\\n\\n // This is to support the extreme case where things really went wild,\\n\\n // and we need to ditch the transaction history and apply a new\\n\\n // genesis on top of an existing state db.\\n\\n pre_genesis_root_key\\n\\n }\\n\\n None => {\\n\\n // Hack: We need to start from an empty tree, so we insert\\n\\n // a null node beforehand deliberately to deal with this corner case.\\n\\n let genesis_root_key = NodeKey::new_empty_path(0);\\n\\n node_cache.insert(genesis_root_key.clone(), Node::new_null());\\n\\n genesis_root_key\\n\\n }\\n\\n }\\n\\n } else {\\n\\n NodeKey::new_empty_path(next_version - 1)\\n\",\n \"file_path\": \"src/tree_cache.rs\",\n \"rank\": 60,\n \"score\": 33785.26404284956\n },\n {\n \"content\": \"// Copyright (c) The Diem Core Contributors\\n\\n// SPDX-License-Identifier: Apache-2.0\\n\\n\\n\\n//! A transaction can have multiple operations on state. For example, it might update values\\n\\n//! for a few existing keys. Imagine that we have the following tree.\\n\\n//!\\n\\n//! ```text\\n\\n//! root0\\n\\n//! / \\\\\\n\\n//! / \\\\\\n\\n//! key1 => value11 key2 => value21\\n\\n//! ```\\n\\n//!\\n\\n//! The next transaction updates `key1`'s value to `value12` and `key2`'s value to `value22`.\\n\\n//! Let's assume we update key2 first. Then the tree becomes:\\n\\n//!\\n\\n//! ```text\\n\\n//! (on disk) (in memory)\\n\\n//! root0 root1'\\n\\n//! / \\\\ / \\\\\\n\",\n \"file_path\": \"src/tree_cache.rs\",\n \"rank\": 61,\n \"score\": 33783.44427481527\n },\n {\n \"content\": \"//! ```text\\n\\n//! (on disk) (in memory)\\n\\n//! root0 root1''\\n\\n//! / \\\\ / \\\\\\n\\n//! / \\\\ / \\\\\\n\\n//! / \\\\ / \\\\\\n\\n//! / \\\\ / \\\\\\n\\n//! / \\\\ / \\\\\\n\\n//! key1 => value11 key2 => value21 key1 => value12 key2 => value22\\n\\n//! (on disk) (on disk) (in memory) (in memory)\\n\\n//! ```\\n\\n//!\\n\\n//! This means that we need to be able to tell whether to create a new version of a node or to\\n\\n//! update an existing node by deleting it and creating a new node directly. `TreeCache` provides\\n\\n//! APIs to cache intermediate nodes and values in memory and simplify the actual tree\\n\\n//! implementation.\\n\\n//!\\n\\n//! If we are dealing with a single-version tree, any complex tree operation can be seen as a\\n\\n//! collection of the following operations:\\n\\n//! - Put a new node.\\n\",\n \"file_path\": \"src/tree_cache.rs\",\n \"rank\": 62,\n \"score\": 33783.26754669364\n },\n {\n \"content\": \"//! / ___ \\\\ _____________/ \\\\\\n\\n//! / _/ \\\\ \\\\\\n\\n//! / _/ \\\\ \\\\\\n\\n//! / / \\\\ \\\\\\n\\n//! key1 => value11 key2 => value21 key2 => value22\\n\\n//! (on disk) (on disk) (in memory)\\n\\n//! ```\\n\\n//!\\n\\n//! Note that\\n\\n//! 1) we created a new version of the tree with `root1'` and the new `key2` node generated;\\n\\n//! 2) both `root1'` and the new `key2` node are still held in memory within a batch of nodes\\n\\n//! that will be written into db atomically.\\n\\n//!\\n\\n//! Next, we need to update `key1`'s value. This time we are dealing with the tree starting from\\n\\n//! the new root. Part of the tree is in memory and the rest of it is in database. We'll update the\\n\\n//! left child and the new root. We should\\n\\n//! 1) create a new version for `key1` child.\\n\\n//! 2) update `root1'` directly instead of making another version.\\n\\n//! The resulting tree should look like:\\n\\n//!\\n\",\n \"file_path\": \"src/tree_cache.rs\",\n \"rank\": 63,\n \"score\": 33780.10330761305\n },\n {\n \"content\": \"fn hash_internal(left: [u8; 32], right: [u8; 32]) -> [u8; 32] {\\n\\n SparseMerkleInternalNode::new(left, right).hash()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/node_type.rs\",\n \"rank\": 64,\n \"score\": 32401.24642622741\n },\n {\n \"content\": \"fn compute_root_hash_impl(kvs: Vec<(&[bool], [u8; 32])>) -> [u8; 32] {\\n\\n assert!(!kvs.is_empty());\\n\\n\\n\\n // If there is only one entry, it is the root.\\n\\n if kvs.len() == 1 {\\n\\n return kvs[0].1;\\n\\n }\\n\\n\\n\\n // Otherwise the tree has more than one leaves, which means we can find which ones are in the\\n\\n // left subtree and which ones are in the right subtree. So we find the first key that starts\\n\\n // with a 1-bit.\\n\\n let left_hash;\\n\\n let right_hash;\\n\\n match kvs.iter().position(|(key, _value)| key[0]) {\\n\\n Some(0) => {\\n\\n // Every key starts with a 1-bit, i.e., they are all in the right subtree.\\n\\n left_hash = SPARSE_MERKLE_PLACEHOLDER_HASH;\\n\\n right_hash = compute_root_hash_impl(reduce(&kvs));\\n\\n }\\n\\n Some(index) => {\\n\",\n \"file_path\": \"src/tests/helper.rs\",\n \"rank\": 65,\n \"score\": 32112.080526055666\n },\n {\n \"content\": \"// Copyright (c) The Diem Core Contributors\\n\\n// SPDX-License-Identifier: Apache-2.0\\n\\n\\n\\nuse rand::{rngs::OsRng, Rng};\\n\\n\\n\\nuse crate::{\\n\\n mock::MockTreeStore,\\n\\n node_type::{Node, NodeKey},\\n\\n tree_cache::TreeCache,\\n\\n types::{nibble::nibble_path::NibblePath, Version, PRE_GENESIS_VERSION},\\n\\n KeyHash,\\n\\n};\\n\\n\\n\",\n \"file_path\": \"src/tests/tree_cache.rs\",\n \"rank\": 66,\n \"score\": 32078.65538945547\n },\n {\n \"content\": \"\\n\\n#[tokio::test]\\n\\nasync fn test_root_node() {\\n\\n let next_version = 0;\\n\\n let db = MockTreeStore::default();\\n\\n let mut cache = TreeCache::new(&db, next_version).await.unwrap();\\n\\n assert_eq!(*cache.get_root_node_key(), NodeKey::new_empty_path(0));\\n\\n\\n\\n let (node, node_key) = random_leaf_with_key(next_version);\\n\\n db.put_node(node_key.clone(), node).await.unwrap();\\n\\n cache.set_root_node_key(node_key.clone());\\n\\n\\n\\n assert_eq!(*cache.get_root_node_key(), node_key);\\n\\n}\\n\\n\\n\\n#[tokio::test]\\n\\nasync fn test_pre_genesis() {\\n\\n let next_version = 0;\\n\\n let db = MockTreeStore::default();\\n\\n let pre_genesis_root_key = NodeKey::new_empty_path(PRE_GENESIS_VERSION);\\n\",\n \"file_path\": \"src/tests/tree_cache.rs\",\n \"rank\": 67,\n \"score\": 32076.423889660575\n },\n {\n \"content\": \" let (pre_genesis_only_node, _) = random_leaf_with_key(PRE_GENESIS_VERSION);\\n\\n db.put_node(pre_genesis_root_key.clone(), pre_genesis_only_node)\\n\\n .await\\n\\n .unwrap();\\n\\n\\n\\n let cache = TreeCache::new(&db, next_version).await.unwrap();\\n\\n assert_eq!(*cache.get_root_node_key(), pre_genesis_root_key);\\n\\n}\\n\\n\\n\\n#[tokio::test]\\n\\nasync fn test_freeze_with_delete() {\\n\\n let next_version = 0;\\n\\n let db = MockTreeStore::default();\\n\\n let mut cache = TreeCache::new(&db, next_version).await.unwrap();\\n\\n\\n\\n assert_eq!(*cache.get_root_node_key(), NodeKey::new_empty_path(0));\\n\\n\\n\\n let (node1, node1_key) = random_leaf_with_key(next_version);\\n\\n cache.put_node(node1_key.clone(), node1.clone()).unwrap();\\n\\n let (node2, node2_key) = random_leaf_with_key(next_version);\\n\",\n \"file_path\": \"src/tests/tree_cache.rs\",\n \"rank\": 68,\n \"score\": 32075.742009499212\n },\n {\n \"content\": \" cache.put_node(node2_key.clone(), node2.clone()).unwrap();\\n\\n assert_eq!(cache.get_node(&node1_key).await.unwrap(), node1);\\n\\n assert_eq!(cache.get_node(&node2_key).await.unwrap(), node2);\\n\\n cache.freeze().await;\\n\\n assert_eq!(cache.get_node(&node1_key).await.unwrap(), node1);\\n\\n assert_eq!(cache.get_node(&node2_key).await.unwrap(), node2);\\n\\n\\n\\n cache.delete_node(&node1_key, true /* is_leaf */);\\n\\n cache.freeze().await;\\n\\n let (_, update_batch) = cache.into();\\n\\n assert_eq!(update_batch.node_batch.len(), 3);\\n\\n assert_eq!(update_batch.stale_node_index_batch.len(), 1);\\n\\n}\\n\",\n \"file_path\": \"src/tests/tree_cache.rs\",\n \"rank\": 69,\n \"score\": 32070.016525561336\n },\n {\n \"content\": \"/// Reduces the problem by removing the first bit of every key.\\n\\nfn reduce<'a>(kvs: &'a [(&[bool], [u8; 32])]) -> Vec<(&'a [bool], [u8; 32])> {\\n\\n kvs.iter().map(|(key, value)| (&key[1..], *value)).collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/tests/helper.rs\",\n \"rank\": 70,\n \"score\": 31978.82939507071\n },\n {\n \"content\": \"# Penumbra's Jellyfish Merkle Tree\\n\\n\\n\\nThis repository is a fork of the [Diem Jellyfish Merkle Tree](https://github.com/diem/diem/tree/main/storage/jellyfish-merkle)\\n\\ncrate, modified to inline dependencies and trim the parts not needed for Penumbra's uses.\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 71,\n \"score\": 21277.444807220905\n },\n {\n \"content\": \"use anyhow::{anyhow, Result};\\n\\n\\n\\nuse crate::{storage::TreeReader, JellyfishMerkleTree, Version};\\n\\n\\n\\nimpl<'a, R> JellyfishMerkleTree<'a, R>\\n\\nwhere\\n\\n R: 'a + TreeReader + Sync,\\n\\n{\\n\\n /// Returns the value and an [`ics23::ExistenceProof`].\\n\\n pub async fn get_with_ics23_proof(\\n\\n &self,\\n\\n key: Vec<u8>,\\n\\n version: Version,\\n\\n ) -> Result<ics23::ExistenceProof> {\\n\\n let key_hash = key.as_slice().into();\\n\\n let (value, proof) = self.get_with_proof(key_hash, version).await?;\\n\\n let value = value.ok_or_else(|| {\\n\\n anyhow!(\\n\\n \\\"Requested proof of inclusion for non-existent key {:?}\\\",\\n\\n key\\n\",\n \"file_path\": \"src/ics23_impl.rs\",\n \"rank\": 72,\n \"score\": 31.864502597823495\n },\n {\n \"content\": \" },\\n\\n KeyHash, MissingRootError, OwnedValue, RootHash,\\n\\n};\\n\\n\\n\\n/// The Jellyfish Merkle tree data structure. See [`crate`] for description.\\n\\npub struct JellyfishMerkleTree<'a, R> {\\n\\n reader: &'a R,\\n\\n leaf_count_migration: bool,\\n\\n}\\n\\n\\n\\nimpl<'a, R> JellyfishMerkleTree<'a, R>\\n\\nwhere\\n\\n R: 'a + TreeReader + Sync,\\n\\n{\\n\\n /// Creates a `JellyfishMerkleTree` backed by the given [`TreeReader`](trait.TreeReader.html).\\n\\n pub fn new(reader: &'a R) -> Self {\\n\\n Self {\\n\\n reader,\\n\\n leaf_count_migration: true,\\n\\n }\\n\",\n \"file_path\": \"src/tree.rs\",\n \"rank\": 73,\n \"score\": 25.49231084712353\n },\n {\n \"content\": \" /// `self.parent_stack` is empty. But in case of a tree with a single leaf, we need this\\n\\n /// additional bit.\\n\\n done: bool,\\n\\n\\n\\n /// The future, if any, of a node lookup needed for the next call to `poll_next`.\\n\\n future: Option<BoxFuture<'static, (NodeKey, Result<Node>)>>,\\n\\n}\\n\\n\\n\\nimpl<R> JellyfishMerkleStream<R>\\n\\nwhere\\n\\n R: TreeReader + Send + Sync,\\n\\n{\\n\\n /// Constructs a new iterator. This puts the internal state in the correct position, so the\\n\\n /// following `next` call will yield the smallest key that is greater or equal to\\n\\n /// `starting_key`.\\n\\n pub async fn new(reader: Arc<R>, version: Version, starting_key: KeyHash) -> Result<Self> {\\n\\n let mut parent_stack = vec![];\\n\\n let mut done = false;\\n\\n\\n\\n let mut current_node_key = NodeKey::new_empty_path(version);\\n\",\n \"file_path\": \"src/iterator.rs\",\n \"rank\": 74,\n \"score\": 22.07939941048869\n },\n {\n \"content\": \" .await?;\\n\\n\\n\\n tree_cache.set_root_node_key(new_root_node_key);\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n /// Helper function for recursive insertion into the subtree that starts from the current\\n\\n /// [`NodeKey`](node_type/struct.NodeKey.html). Returns the newly inserted node.\\n\\n /// It is safe to use recursion here because the max depth is limited by the key length which\\n\\n /// for this tree is the length of the hash of account addresses.\\n\\n #[async_recursion::async_recursion]\\n\\n async fn insert_at<'future, 'cache: 'future>(\\n\\n &'future self,\\n\\n node_key: NodeKey,\\n\\n version: Version,\\n\\n nibble_iter: &mut NibbleIterator<'future>,\\n\\n value: OwnedValue,\\n\\n tree_cache: &mut TreeCache<'cache, R>,\\n\\n ) -> Result<(NodeKey, Node)> {\\n\\n let node = tree_cache.get_node(&node_key).await?;\\n\",\n \"file_path\": \"src/tree.rs\",\n \"rank\": 75,\n \"score\": 21.886112508665633\n },\n {\n \"content\": \" let mut tree_cache = TreeCache::new(self.reader, first_version).await?;\\n\\n for (idx, value_set) in value_sets.into_iter().enumerate() {\\n\\n assert!(\\n\\n !value_set.is_empty(),\\n\\n \\\"Transactions that output empty write set should not be included.\\\",\\n\\n );\\n\\n let version = first_version + idx as u64;\\n\\n for (key, value) in value_set {\\n\\n self.put(key, value, version, &mut tree_cache).await?;\\n\\n }\\n\\n // Freezes the current cache to make all contents in the current cache immutable.\\n\\n tree_cache.freeze().await;\\n\\n }\\n\\n\\n\\n Ok(tree_cache.into())\\n\\n }\\n\\n\\n\\n async fn put(\\n\\n &self,\\n\\n key: KeyHash,\\n\",\n \"file_path\": \"src/tree.rs\",\n \"rank\": 76,\n \"score\": 21.78778788951723\n },\n {\n \"content\": \"mod overlay;\\n\\nmod reader;\\n\\nmod tree;\\n\\nmod tree_cache;\\n\\nmod types;\\n\\nmod writer;\\n\\n\\n\\npub mod mock;\\n\\npub mod restore;\\n\\n\\n\\nuse bytes32ext::Bytes32Ext;\\n\\nuse types::nibble::ROOT_NIBBLE_HEIGHT;\\n\\n\\n\\n#[cfg(feature = \\\"ics23\\\")]\\n\\npub use ics23_impl::ics23_spec;\\n\\npub use iterator::JellyfishMerkleStream;\\n\\npub use overlay::WriteOverlay;\\n\\npub use tree::JellyfishMerkleTree;\\n\\npub use types::proof;\\n\\npub use types::Version;\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 77,\n \"score\": 21.034984385127007\n },\n {\n \"content\": \" )\\n\\n .await?;\\n\\n tree_cache.set_root_node_key(new_root_node_key);\\n\\n\\n\\n // Freezes the current cache to make all contents in the current cache immutable.\\n\\n tree_cache.freeze().await;\\n\\n }\\n\\n\\n\\n Ok(tree_cache.into())\\n\\n }\\n\\n\\n\\n #[async_recursion::async_recursion]\\n\\n async fn batch_insert_at(\\n\\n &self,\\n\\n mut node_key: NodeKey,\\n\\n version: Version,\\n\\n kvs: &[(KeyHash, OwnedValue)],\\n\\n depth: usize,\\n\\n hash_cache: &Option<&HashMap<NibblePath, [u8; 32]>>,\\n\\n tree_cache: &mut TreeCache<R>,\\n\",\n \"file_path\": \"src/tree.rs\",\n \"rank\": 78,\n \"score\": 20.903607064346968\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub fn new_migration(reader: &'a R, leaf_count_migration: bool) -> Self {\\n\\n Self {\\n\\n reader,\\n\\n leaf_count_migration,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Get the node hash from the cache if exists, otherwise compute it.\\n\\n fn get_hash(\\n\\n node_key: &NodeKey,\\n\\n node: &Node,\\n\\n hash_cache: &Option<&HashMap<NibblePath, [u8; 32]>>,\\n\\n ) -> [u8; 32] {\\n\\n if let Some(cache) = hash_cache {\\n\\n match cache.get(node_key.nibble_path()) {\\n\\n Some(hash) => *hash,\\n\\n None => unreachable!(\\\"{:?} can not be found in hash cache\\\", node_key),\\n\\n }\\n\",\n \"file_path\": \"src/tree.rs\",\n \"rank\": 79,\n \"score\": 20.2963749017721\n },\n {\n \"content\": \"// Copyright (c) The Diem Core Contributors\\n\\n// SPDX-License-Identifier: Apache-2.0\\n\\n\\n\\n//! This module implements `JellyfishMerkleIterator`. Initialized with a version and a key, the\\n\\n//! iterator generates all the key-value pairs in this version of the tree, starting from the\\n\\n//! smallest key that is greater or equal to the given key, by performing a depth first traversal\\n\\n//! on the tree.\\n\\n\\n\\nuse std::{\\n\\n pin::Pin,\\n\\n sync::Arc,\\n\\n task::{Context, Poll},\\n\\n};\\n\\n\\n\\nuse anyhow::{bail, ensure, format_err, Result};\\n\\nuse futures::{future::BoxFuture, ready};\\n\\n\\n\\nuse crate::{\\n\\n node_type::{Child, InternalNode, Node, NodeKey},\\n\\n storage::TreeReader,\\n\",\n \"file_path\": \"src/iterator.rs\",\n \"rank\": 80,\n \"score\": 20.098485210174108\n },\n {\n \"content\": \"#[derive(Clone, Copy, Debug, Eq, PartialEq, Serialize, Deserialize)]\\n\\n#[cfg_attr(any(test, feature = \\\"fuzzing\\\"), derive(Arbitrary))]\\n\\npub struct SparseMerkleLeafNode {\\n\\n key_hash: KeyHash,\\n\\n value_hash: ValueHash,\\n\\n}\\n\\n\\n\\nimpl SparseMerkleLeafNode {\\n\\n pub(crate) fn new(key_hash: KeyHash, value_hash: ValueHash) -> Self {\\n\\n SparseMerkleLeafNode {\\n\\n key_hash,\\n\\n value_hash,\\n\\n }\\n\\n }\\n\\n\\n\\n pub(crate) fn key_hash(&self) -> KeyHash {\\n\\n self.key_hash\\n\\n }\\n\\n\\n\\n pub(crate) fn hash(&self) -> [u8; 32] {\\n\\n use sha2::Digest;\\n\\n let mut hasher = sha2::Sha256::new();\\n\\n hasher.update(b\\\"JMT::LeafNode\\\");\\n\\n hasher.update(&self.key_hash.0);\\n\\n hasher.update(&self.value_hash.0);\\n\\n *hasher.finalize().as_ref()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/types/proof.rs\",\n \"rank\": 81,\n \"score\": 19.62682264747564\n },\n {\n \"content\": \" }\\n\\n }\\n\\n }\\n\\n\\n\\n match crate::reader::get_node_async(&*reader, ¤t_node_key).await? {\\n\\n Node::Internal(_) => unreachable!(\\\"Should have reached the bottom of the tree.\\\"),\\n\\n Node::Leaf(leaf_node) => {\\n\\n if leaf_node.key_hash() < starting_key {\\n\\n Self::cleanup_stack(&mut parent_stack);\\n\\n if parent_stack.is_empty() {\\n\\n done = true;\\n\\n }\\n\\n }\\n\\n }\\n\\n Node::Null => done = true,\\n\\n }\\n\\n\\n\\n Ok(Self {\\n\\n reader,\\n\\n version,\\n\",\n \"file_path\": \"src/iterator.rs\",\n \"rank\": 82,\n \"score\": 19.574010569981517\n },\n {\n \"content\": \"// Copyright (c) The Diem Core Contributors\\n\\n// SPDX-License-Identifier: Apache-2.0\\n\\n\\n\\nuse std::{collections::BTreeMap, sync::Arc};\\n\\n\\n\\nuse anyhow::Result;\\n\\nuse futures::StreamExt;\\n\\nuse rand::{rngs::StdRng, Rng, SeedableRng};\\n\\n\\n\\nuse super::helper::plus_one;\\n\\nuse crate::{\\n\\n iterator::JellyfishMerkleStream, mock::MockTreeStore, types::Version, JellyfishMerkleTree,\\n\\n KeyHash, OwnedValue,\\n\\n};\\n\\n\\n\\n#[tokio::test]\\n\\nasync fn test_iterator_same_version() {\\n\\n for i in (1..100).step_by(11) {\\n\\n test_n_leaves_same_version(i).await;\\n\\n }\\n\",\n \"file_path\": \"src/tests/iterator.rs\",\n \"rank\": 83,\n \"score\": 19.55614369560492\n },\n {\n \"content\": \" Child::new(\\n\\n Self::get_hash(&new_child_node_key, &new_child_node, hash_cache),\\n\\n version,\\n\\n new_child_node.node_type(),\\n\\n ),\\n\\n );\\n\\n }\\n\\n let new_internal_node =\\n\\n InternalNode::new_migration(children, self.leaf_count_migration);\\n\\n\\n\\n tree_cache.put_node(node_key.clone(), new_internal_node.clone().into())?;\\n\\n Ok((node_key, new_internal_node.into()))\\n\\n }\\n\\n }\\n\\n\\n\\n /// This is a convenient function that calls\\n\\n /// [`put_value_sets`](struct.JellyfishMerkleTree.html#method.put_value_sets) with a single\\n\\n /// `keyed_value_set`.\\n\\n pub async fn put_value_set(\\n\\n &self,\\n\",\n \"file_path\": \"src/tree.rs\",\n \"rank\": 84,\n \"score\": 19.548872181444462\n },\n {\n \"content\": \" .collect();\\n\\n Ok(SparseMerkleRangeProof::new(siblings))\\n\\n }\\n\\n\\n\\n pub async fn get(&self, key: KeyHash, version: Version) -> Result<Option<OwnedValue>> {\\n\\n Ok(self.get_with_proof(key, version).await?.0)\\n\\n }\\n\\n\\n\\n async fn get_root_node(&self, version: Version) -> Result<Node> {\\n\\n self.get_root_node_option(version)\\n\\n .await?\\n\\n .ok_or_else(|| format_err!(\\\"Root node not found for version {}.\\\", version))\\n\\n }\\n\\n\\n\\n async fn get_root_node_option(&self, version: Version) -> Result<Option<Node>> {\\n\\n let root_node_key = NodeKey::new_empty_path(version);\\n\\n self.reader.get_node_option(&root_node_key).await\\n\\n }\\n\\n\\n\\n pub async fn get_root_hash(&self, version: Version) -> Result<RootHash> {\\n\",\n \"file_path\": \"src/tree.rs\",\n \"rank\": 85,\n \"score\": 19.479524685936056\n },\n {\n \"content\": \" Self::new(version, NibblePath::new(vec![]))\\n\\n }\\n\\n\\n\\n /// Gets the version.\\n\\n pub fn version(&self) -> Version {\\n\\n self.version\\n\\n }\\n\\n\\n\\n /// Gets the nibble path.\\n\\n pub(crate) fn nibble_path(&self) -> &NibblePath {\\n\\n &self.nibble_path\\n\\n }\\n\\n\\n\\n /// Generates a child node key based on this node key.\\n\\n pub(crate) fn gen_child_node_key(&self, version: Version, n: Nibble) -> Self {\\n\\n let mut node_nibble_path = self.nibble_path().clone();\\n\\n node_nibble_path.push(n);\\n\\n Self::new(version, node_nibble_path)\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/node_type.rs\",\n \"rank\": 86,\n \"score\": 19.478656732379132\n },\n {\n \"content\": \" fn advance(&mut self) {\\n\\n assert!(!self.is_rightmost(), \\\"Advancing past rightmost child.\\\");\\n\\n self.next_child_to_visit <<= 1;\\n\\n while self.next_child_to_visit & self.children_bitmap == 0 {\\n\\n self.next_child_to_visit <<= 1;\\n\\n }\\n\\n }\\n\\n}\\n\\n/// The `JellyfishMerkleStream` implementation.\\n\\npub struct JellyfishMerkleStream<R> {\\n\\n /// The storage engine from which we can read nodes using node keys.\\n\\n reader: Arc<R>,\\n\\n\\n\\n /// The version of the tree this iterator is running on.\\n\\n version: Version,\\n\\n\\n\\n /// The stack used for depth first traversal.\\n\\n parent_stack: Vec<NodeVisitInfo>,\\n\\n\\n\\n /// Whether the iteration has finished. Usually this can be determined by checking whether\\n\",\n \"file_path\": \"src/iterator.rs\",\n \"rank\": 87,\n \"score\": 19.467072727799913\n },\n {\n \"content\": \" } else {\\n\\n node.hash()\\n\\n }\\n\\n }\\n\\n\\n\\n /// The batch version of `put_value_sets`.\\n\\n pub async fn batch_put_value_sets(\\n\\n &self,\\n\\n value_sets: Vec<Vec<(KeyHash, OwnedValue)>>,\\n\\n node_hashes: Option<Vec<&HashMap<NibblePath, [u8; 32]>>>,\\n\\n first_version: Version,\\n\\n ) -> Result<(Vec<RootHash>, TreeUpdateBatch)> {\\n\\n let mut tree_cache = TreeCache::new(self.reader, first_version).await?;\\n\\n let hash_sets: Vec<_> = match node_hashes {\\n\\n Some(hashes) => hashes.into_iter().map(Some).collect(),\\n\\n None => (0..value_sets.len()).map(|_| None).collect(),\\n\\n };\\n\\n\\n\\n for (idx, (value_set, hash_set)) in\\n\\n itertools::zip_eq(value_sets.into_iter(), hash_sets.into_iter()).enumerate()\\n\",\n \"file_path\": \"src/tree.rs\",\n \"rank\": 88,\n \"score\": 19.124078305685508\n },\n {\n \"content\": \"#[derive(Clone, Debug, Hash, Eq, PartialEq, Ord, PartialOrd)]\\n\\n#[cfg_attr(any(test, feature = \\\"fuzzing\\\"), derive(Arbitrary))]\\n\\npub struct NodeKey {\\n\\n // The version at which the node is created.\\n\\n version: Version,\\n\\n // The nibble path this node represents in the tree.\\n\\n nibble_path: NibblePath,\\n\\n}\\n\\n\\n\\nimpl NodeKey {\\n\\n /// Creates a new `NodeKey`.\\n\\n pub(crate) fn new(version: Version, nibble_path: NibblePath) -> Self {\\n\\n Self {\\n\\n version,\\n\\n nibble_path,\\n\\n }\\n\\n }\\n\\n\\n\\n /// A shortcut to generate a node key consisting of a version and an empty nibble path.\\n\\n pub(crate) fn new_empty_path(version: Version) -> Self {\\n\",\n \"file_path\": \"src/node_type.rs\",\n \"rank\": 89,\n \"score\": 18.877859654707212\n },\n {\n \"content\": \" /// / \\\\ | / \\\\\\n\\n /// / x | / x'\\n\\n /// o<-------------+- / \\\\\\n\\n /// / \\\\ | C D\\n\\n /// A B |\\n\\n /// storage (disk) | cache (memory)\\n\\n /// ```\\n\\n ///\\n\\n /// With this design, we are able to query the global state in persistent storage and\\n\\n /// generate the proposed tree delta based on a specific root hash and `value_set`. For\\n\\n /// example, if we want to execute another transaction `T_{i+1}'`, we can use the tree `S_i` in\\n\\n /// storage and apply the `value_set` of transaction `T_{i+1}`. Then if the storage commits\\n\\n /// the returned batch, the state `S_{i+1}` is ready to be read from the tree by calling\\n\\n /// [`get_with_proof`](struct.JellyfishMerkleTree.html#method.get_with_proof). Anything inside\\n\\n /// the batch is not reachable from public interfaces before being committed.\\n\\n pub async fn put_value_sets(\\n\\n &self,\\n\\n value_sets: Vec<Vec<(KeyHash, OwnedValue)>>,\\n\\n first_version: Version,\\n\\n ) -> Result<(Vec<RootHash>, TreeUpdateBatch)> {\\n\",\n \"file_path\": \"src/tree.rs\",\n \"rank\": 90,\n \"score\": 18.554161553092868\n },\n {\n \"content\": \" tree_cache.put_node(node_key.clone(), new_leaf_node.clone())?;\\n\\n Ok((node_key, new_leaf_node))\\n\\n }\\n\\n\\n\\n /// Returns the value (if applicable) and the corresponding merkle proof.\\n\\n pub async fn get_with_proof(\\n\\n &self,\\n\\n key: KeyHash,\\n\\n version: Version,\\n\\n ) -> Result<(Option<OwnedValue>, SparseMerkleProof)> {\\n\\n // Empty tree just returns proof with no sibling hash.\\n\\n let mut next_node_key = NodeKey::new_empty_path(version);\\n\\n let mut siblings = vec![];\\n\\n let nibble_path = NibblePath::new(key.0.to_vec());\\n\\n let mut nibble_iter = nibble_path.nibbles();\\n\\n\\n\\n // We limit the number of loops here deliberately to avoid potential cyclic graph bugs\\n\\n // in the tree structure.\\n\\n for nibble_depth in 0..=ROOT_NIBBLE_HEIGHT {\\n\\n let next_node = get_node_async(self.reader, &next_node_key)\\n\",\n \"file_path\": \"src/tree.rs\",\n \"rank\": 91,\n \"score\": 18.532802688431275\n },\n {\n \"content\": \"// Copyright (c) The Diem Core Contributors\\n\\n// SPDX-License-Identifier: Apache-2.0\\n\\n\\n\\nuse std::{collections::BTreeMap, sync::Arc};\\n\\n\\n\\nuse proptest::{collection::btree_map, prelude::*};\\n\\nuse tokio::{runtime::Runtime, sync::RwLock};\\n\\n\\n\\nuse crate::{\\n\\n mock::MockTreeStore,\\n\\n restore::{JellyfishMerkleRestore, StateSnapshotReceiver},\\n\\n storage::TreeReader,\\n\\n tests::helper::init_mock_db,\\n\\n JellyfishMerkleTree, KeyHash, OwnedValue, RootHash, Version,\\n\\n};\\n\\n\\n\\nproptest! {\\n\\n #![proptest_config(ProptestConfig::with_cases(10))]\\n\\n\\n\\n #[test]\\n\",\n \"file_path\": \"src/tests/restore.rs\",\n \"rank\": 92,\n \"score\": 18.502114788268134\n },\n {\n \"content\": \" expected_root_hash: RootHash,\\n\\n\\n\\n /// Whether to use the new internal node format where leaf counts are written.\\n\\n leaf_count_migration: bool,\\n\\n}\\n\\n\\n\\nimpl JellyfishMerkleRestore {\\n\\n pub async fn new<D: 'static + TreeReader + TreeWriter>(\\n\\n store: Arc<RwLock<D>>,\\n\\n version: Version,\\n\\n expected_root_hash: RootHash,\\n\\n leaf_count_migration: bool,\\n\\n ) -> Result<Self> {\\n\\n let tree_reader = Arc::clone(&store);\\n\\n let (partial_nodes, previous_leaf) = if let Some((node_key, leaf_node)) =\\n\\n tree_reader.read().await.get_rightmost_leaf().await?\\n\\n {\\n\\n // TODO: confirm rightmost leaf is at the desired version\\n\\n // If the system crashed in the middle of the previous restoration attempt, we need\\n\\n // to recover the partial nodes to the state right before the crash.\\n\",\n \"file_path\": \"src/restore.rs\",\n \"rank\": 93,\n \"score\": 18.443841129450607\n },\n {\n \"content\": \"use std::{\\n\\n collections::{BTreeMap, HashMap},\\n\\n convert::TryInto,\\n\\n};\\n\\n\\n\\nuse anyhow::{bail, ensure, format_err, Result};\\n\\n\\n\\nuse crate::{\\n\\n bytes32ext::Bytes32Ext,\\n\\n node_type::{Child, Children, InternalNode, LeafNode, Node, NodeKey, NodeType},\\n\\n reader::get_node_async,\\n\\n storage::{TreeReader, TreeUpdateBatch},\\n\\n tree_cache::TreeCache,\\n\\n types::{\\n\\n nibble::{\\n\\n nibble_path::{skip_common_prefix, NibbleIterator, NibblePath},\\n\\n NibbleRangeIterator, ROOT_NIBBLE_HEIGHT,\\n\\n },\\n\\n proof::{SparseMerkleProof, SparseMerkleRangeProof},\\n\\n Version,\\n\",\n \"file_path\": \"src/tree.rs\",\n \"rank\": 94,\n \"score\": 18.443768700823178\n },\n {\n \"content\": \"\\n\\n/// Contains types used to bridge a [`JellyfishMerkleTree`](crate::JellyfishMerkleTree)\\n\\n/// to the backing storage recording the tree's internal data.\\n\\npub mod storage {\\n\\n pub use node_type::{LeafNode, Node, NodeDecodeError, NodeKey};\\n\\n pub use reader::TreeReader;\\n\\n pub use writer::{\\n\\n NodeBatch, NodeStats, StaleNodeIndex, StaleNodeIndexBatch, TreeUpdateBatch, TreeWriter,\\n\\n };\\n\\n\\n\\n use super::*;\\n\\n}\\n\\n\\n\\n#[cfg(any(test, feature = \\\"fuzzing\\\"))]\\n\\nmod tests;\\n\\n\\n\\n/// An error that occurs when the state root for a requested version is missing (e.g., because it was pruned).\\n\\n#[derive(Error, Debug)]\\n\\n#[error(\\\"Missing state root node at version {version}, probably pruned.\\\")]\\n\\npub struct MissingRootError {\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 95,\n \"score\": 18.394999183861156\n },\n {\n \"content\": \" }\\n\\n Poll::Pending => {\\n\\n self.future = Some(future); // Put the future back into `self.future`\\n\\n Poll::Pending\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<R> futures::Stream for JellyfishMerkleStream<R>\\n\\nwhere\\n\\n R: TreeReader + Send + Sync + 'static,\\n\\n{\\n\\n type Item = Result<(KeyHash, OwnedValue)>;\\n\\n\\n\\n fn poll_next(mut self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Option<Self::Item>> {\\n\\n if self.done {\\n\\n return Poll::Ready(None);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/iterator.rs\",\n \"rank\": 96,\n \"score\": 18.300790573548824\n },\n {\n \"content\": \" /// Generates parent node key at the same version based on this node key.\\n\\n pub(crate) fn gen_parent_node_key(&self) -> Self {\\n\\n let mut node_nibble_path = self.nibble_path().clone();\\n\\n assert!(\\n\\n node_nibble_path.pop().is_some(),\\n\\n \\\"Current node key is root.\\\",\\n\\n );\\n\\n Self::new(self.version, node_nibble_path)\\n\\n }\\n\\n\\n\\n /// Sets the version to the given version.\\n\\n pub(crate) fn set_version(&mut self, version: Version) {\\n\\n self.version = version;\\n\\n }\\n\\n\\n\\n /// Serializes to bytes for physical storage enforcing the same order as that in memory.\\n\\n pub fn encode(&self) -> Result<Vec<u8>> {\\n\\n let mut out = vec![];\\n\\n out.write_u64::<BigEndian>(self.version())?;\\n\\n out.write_u8(self.nibble_path().num_nibbles() as u8)?;\\n\",\n \"file_path\": \"src/node_type.rs\",\n \"rank\": 97,\n \"score\": 18.126696752709602\n },\n {\n \"content\": \" }\\n\\n\\n\\n /// Creates the [`Internal`](Node::Internal) variant.\\n\\n #[cfg(any(test, feature = \\\"fuzzing\\\"))]\\n\\n pub(crate) fn new_internal(children: Children) -> Self {\\n\\n Node::Internal(InternalNode::new(children))\\n\\n }\\n\\n\\n\\n /// Creates the [`Leaf`](Node::Leaf) variant.\\n\\n pub(crate) fn new_leaf(key_hash: KeyHash, value: Vec<u8>) -> Self {\\n\\n Node::Leaf(LeafNode::new(key_hash, value))\\n\\n }\\n\\n\\n\\n /// Returns `true` if the node is a leaf node.\\n\\n pub(crate) fn is_leaf(&self) -> bool {\\n\\n matches!(self, Node::Leaf(_))\\n\\n }\\n\\n\\n\\n /// Returns `NodeType`\\n\\n pub(crate) fn node_type(&self) -> NodeType {\\n\",\n \"file_path\": \"src/node_type.rs\",\n \"rank\": 98,\n \"score\": 18.03482036665063\n },\n {\n \"content\": \"// Copyright (c) The Diem Core Contributors\\n\\n// SPDX-License-Identifier: Apache-2.0\\n\\n\\n\\n//! This module implements the functionality to restore a\\n\\n//! [`JellyfishMerkleTree`](crate::JellyfishMerkleTree) from small chunks of\\n\\n//! key/value pairs.\\n\\n\\n\\nuse std::sync::Arc;\\n\\n\\n\\nuse anyhow::{bail, ensure, Result};\\n\\nuse futures::future::{BoxFuture, FutureExt};\\n\\nuse mirai_annotations::*;\\n\\nuse tokio::sync::RwLock;\\n\\n\\n\\nuse crate::{\\n\\n node_type::{\\n\\n get_child_and_sibling_half_start, Child, Children, InternalNode, LeafNode, Node, NodeKey,\\n\\n NodeType,\\n\\n },\\n\\n storage::{NodeBatch, TreeReader, TreeWriter},\\n\",\n \"file_path\": \"src/restore.rs\",\n \"rank\": 99,\n \"score\": 18.032498053578994\n }\n]","isConversational":false}}},{"rowIdx":1398,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"engine/src/types.rs"},"repo_name":{"kind":"string","value":"ivankabestwill/wirefilter"},"commit":{"kind":"string","value":"294292f53db18a5a3261118e93fad30bd9498b09"},"file_code":{"kind":"string","value":"use lex::{expect, skip_space, Lex, LexResult, LexWith};\nuse rhs_types::{Bytes, IpRange, UninhabitedBool};\nuse serde::{Deserialize, Serialize};\nuse std::{\n cmp::Ordering,\n fmt::{self, Debug, Formatter},\n net::IpAddr,\n ops::RangeInclusive,\n};\nuse strict_partial_ord::StrictPartialOrd;\n\nfn lex_rhs_values<'i, T: Lex<'i>>(input: &'i str) -> LexResult<'i, Vec<T>> {\n let mut input = expect(input, \"{\")?;\n let mut res = Vec::new();\n loop {\n input = skip_space(input);\n if let Ok(rest) = expect(input, \"}\") {\n input = rest;\n return Ok((res, input));\n } else {\n let (item, rest) = T::lex(input)?;\n res.push(item);\n input = rest;\n }\n }\n}\n\nmacro_rules! declare_types {\n ($(# $attrs:tt)* enum $name:ident $(<$lt:tt>)* { $($(# $vattrs:tt)* $variant:ident ( $ty:ty ) , )* }) => {\n $(# $attrs)*\n #[repr(u8)]\n pub enum $name $(<$lt>)* {\n $($(# $vattrs)* $variant($ty),)*\n }\n\n impl $(<$lt>)* GetType for $name $(<$lt>)* {\n fn get_type(&self) -> Type {\n match self {\n $($name::$variant(_) => Type::$variant,)*\n }\n }\n }\n\n impl $(<$lt>)* Debug for $name $(<$lt>)* {\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\n match self {\n $($name::$variant(inner) => Debug::fmt(inner, f),)*\n }\n }\n }\n };\n\n ($($(# $attrs:tt)* $name:ident ( $lhs_ty:ty | $rhs_ty:ty | $multi_rhs_ty:ty ) , )*) => {\n \n #[derive(Debug, Clone, Copy, PartialEq, Eq, Deserialize)]\n #[repr(u8)]\n pub enum Type {\n $($(# $attrs)* $name,)*\n }\n\n \n pub trait GetType {\n \n fn get_type(&self) -> Type;\n }\n\n impl GetType for Type {\n fn get_type(&self) -> Type {\n *self\n }\n }\n\n declare_types! {\n \n \n \n \n \n #[derive(PartialEq, Eq, Clone, Deserialize)]\n #[serde(untagged)]\n enum LhsValue<'a> {\n $($(# $attrs)* $name($lhs_ty),)*\n }\n }\n\n $(impl<'a> From<$lhs_ty> for LhsValue<'a> {\n fn from(value: $lhs_ty) -> Self {\n LhsValue::$name(value)\n }\n })*\n\n declare_types! {\n \n #[derive(PartialEq, Eq, Clone, Serialize)]\n #[serde(untagged)]\n enum RhsValue {\n $($(# $attrs)* $name($rhs_ty),)*\n }\n }\n\n impl<'i> LexWith<'i, Type> for RhsValue {\n fn lex_with(input: &str, ty: Type) -> LexResult<'_, Self> {\n Ok(match ty {\n $(Type::$name => {\n let (value, input) = <$rhs_ty>::lex(input)?;\n (RhsValue::$name(value), input)\n })*\n })\n }\n }\n\n impl<'a> PartialOrd<RhsValue> for LhsValue<'a> {\n fn partial_cmp(&self, other: &RhsValue) -> Option<Ordering> {\n match (self, other) {\n $((LhsValue::$name(lhs), RhsValue::$name(rhs)) => {\n lhs.strict_partial_cmp(rhs)\n },)*\n _ => None,\n }\n }\n }\n\n impl<'a> StrictPartialOrd<RhsValue> for LhsValue<'a> {}\n\n impl<'a> PartialEq<RhsValue> for LhsValue<'a> {\n fn eq(&self, other: &RhsValue) -> bool {\n self.strict_partial_cmp(other) == Some(Ordering::Equal)\n }\n }\n\n declare_types! {\n \n \n \n \n #[derive(PartialEq, Eq, Clone, Serialize)]\n #[serde(untagged)]\n enum RhsValues {\n $($(# $attrs)* $name(Vec<$multi_rhs_ty>),)*\n }\n }\n\n impl<'i> LexWith<'i, Type> for RhsValues {\n fn lex_with(input: &str, ty: Type) -> LexResult<'_, Self> {\n Ok(match ty {\n $(Type::$name => {\n let (value, input) = lex_rhs_values(input)?;\n (RhsValues::$name(value), input)\n })*\n })\n }\n }\n };\n}\n\nimpl<'a> From<&'a str> for LhsValue<'a> {\n fn from(s: &'a str) -> Self {\n s.as_bytes().into()\n }\n}\n\ndeclare_types!(\n \n \n \n Ip(IpAddr | IpAddr | IpRange),\n\n \n \n \n \n Bytes(&'a [u8] | Bytes | Bytes),\n\n \n Int(i32 | i32 | RangeInclusive<i32>),\n\n \n Bool(bool | UninhabitedBool | UninhabitedBool),\n);\n\n#[test]\nfn test_lhs_value_deserialize() {\n use std::str::FromStr;\n\n let ipv4: LhsValue<'_> = serde_json::from_str(\"\\\"127.0.0.1\\\"\").unwrap();\n assert_eq!(ipv4, LhsValue::Ip(IpAddr::from_str(\"127.0.0.1\").unwrap()));\n\n let ipv6: LhsValue<'_> = serde_json::from_str(\"\\\"::1\\\"\").unwrap();\n assert_eq!(ipv6, LhsValue::Ip(IpAddr::from_str(\"::1\").unwrap()));\n\n let bytes: LhsValue<'_> = serde_json::from_str(\"\\\"a JSON string with unicode ❤\\\"\").unwrap();\n assert_eq!(\n bytes,\n LhsValue::Bytes(b\"a JSON string with unicode \\xE2\\x9D\\xA4\")\n );\n\n \n \n \n \n assert!(\n serde_json::from_str::<LhsValue<'_>>(\"\\\"a JSON string with escaped-unicode \\\\u2764\\\"\")\n .is_err(),\n \"LhsValue can only handle borrowed bytes\"\n );\n\n let bytes: LhsValue<'_> = serde_json::from_str(\"\\\"1337\\\"\").unwrap();\n assert_eq!(bytes, LhsValue::Bytes(b\"1337\"));\n\n let integer: LhsValue<'_> = serde_json::from_str(\"1337\").unwrap();\n assert_eq!(integer, LhsValue::Int(1337));\n\n let b: LhsValue<'_> = serde_json::from_str(\"false\").unwrap();\n assert_eq!(b, LhsValue::Bool(false));\n}\n"},"prefix":{"kind":"string","value":"use lex::{expect, skip_space, Lex, LexResult, LexWith};\nuse rhs_types::{Bytes, IpRange, UninhabitedBool};\nuse serde::{Deserialize, Serialize};\nuse std::{\n cmp::Ordering,\n fmt::{self, Debug, Formatter},\n net::IpAddr,\n ops::RangeInclusive,\n};\nuse strict_partial_ord::StrictPartialOrd;\n\nfn lex_rhs_values<'i, T: Lex<'i>>(input: &'i str) -> LexResult<'i, Vec<T>> {\n let mut input = expect(input, \"{\")?;\n let mut res = Vec::new();\n loop {\n input = skip_space(input);\n "},"suffix":{"kind":"string","value":"\n }\n}\n\nmacro_rules! declare_types {\n ($(# $attrs:tt)* enum $name:ident $(<$lt:tt>)* { $($(# $vattrs:tt)* $variant:ident ( $ty:ty ) , )* }) => {\n $(# $attrs)*\n #[repr(u8)]\n pub enum $name $(<$lt>)* {\n $($(# $vattrs)* $variant($ty),)*\n }\n\n impl $(<$lt>)* GetType for $name $(<$lt>)* {\n fn get_type(&self) -> Type {\n match self {\n $($name::$variant(_) => Type::$variant,)*\n }\n }\n }\n\n impl $(<$lt>)* Debug for $name $(<$lt>)* {\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\n match self {\n $($name::$variant(inner) => Debug::fmt(inner, f),)*\n }\n }\n }\n };\n\n ($($(# $attrs:tt)* $name:ident ( $lhs_ty:ty | $rhs_ty:ty | $multi_rhs_ty:ty ) , )*) => {\n \n #[derive(Debug, Clone, Copy, PartialEq, Eq, Deserialize)]\n #[repr(u8)]\n pub enum Type {\n $($(# $attrs)* $name,)*\n }\n\n \n pub trait GetType {\n \n fn get_type(&self) -> Type;\n }\n\n impl GetType for Type {\n fn get_type(&self) -> Type {\n *self\n }\n }\n\n declare_types! {\n \n \n \n \n \n #[derive(PartialEq, Eq, Clone, Deserialize)]\n #[serde(untagged)]\n enum LhsValue<'a> {\n $($(# $attrs)* $name($lhs_ty),)*\n }\n }\n\n $(impl<'a> From<$lhs_ty> for LhsValue<'a> {\n fn from(value: $lhs_ty) -> Self {\n LhsValue::$name(value)\n }\n })*\n\n declare_types! {\n \n #[derive(PartialEq, Eq, Clone, Serialize)]\n #[serde(untagged)]\n enum RhsValue {\n $($(# $attrs)* $name($rhs_ty),)*\n }\n }\n\n impl<'i> LexWith<'i, Type> for RhsValue {\n fn lex_with(input: &str, ty: Type) -> LexResult<'_, Self> {\n Ok(match ty {\n $(Type::$name => {\n let (value, input) = <$rhs_ty>::lex(input)?;\n (RhsValue::$name(value), input)\n })*\n })\n }\n }\n\n impl<'a> PartialOrd<RhsValue> for LhsValue<'a> {\n fn partial_cmp(&self, other: &RhsValue) -> Option<Ordering> {\n match (self, other) {\n $((LhsValue::$name(lhs), RhsValue::$name(rhs)) => {\n lhs.strict_partial_cmp(rhs)\n },)*\n _ => None,\n }\n }\n }\n\n impl<'a> StrictPartialOrd<RhsValue> for LhsValue<'a> {}\n\n impl<'a> PartialEq<RhsValue> for LhsValue<'a> {\n fn eq(&self, other: &RhsValue) -> bool {\n self.strict_partial_cmp(other) == Some(Ordering::Equal)\n }\n }\n\n declare_types! {\n \n \n \n \n #[derive(PartialEq, Eq, Clone, Serialize)]\n #[serde(untagged)]\n enum RhsValues {\n $($(# $attrs)* $name(Vec<$multi_rhs_ty>),)*\n }\n }\n\n impl<'i> LexWith<'i, Type> for RhsValues {\n fn lex_with(input: &str, ty: Type) -> LexResult<'_, Self> {\n Ok(match ty {\n $(Type::$name => {\n let (value, input) = lex_rhs_values(input)?;\n (RhsValues::$name(value), input)\n })*\n })\n }\n }\n };\n}\n\nimpl<'a> From<&'a str> for LhsValue<'a> {\n fn from(s: &'a str) -> Self {\n s.as_bytes().into()\n }\n}\n\ndeclare_types!(\n \n \n \n Ip(IpAddr | IpAddr | IpRange),\n\n \n \n \n \n Bytes(&'a [u8] | Bytes | Bytes),\n\n \n Int(i32 | i32 | RangeInclusive<i32>),\n\n \n Bool(bool | UninhabitedBool | UninhabitedBool),\n);\n\n#[test]\nfn test_lhs_value_deserialize() {\n use std::str::FromStr;\n\n let ipv4: LhsValue<'_> = serde_json::from_str(\"\\\"127.0.0.1\\\"\").unwrap();\n assert_eq!(ipv4, LhsValue::Ip(IpAddr::from_str(\"127.0.0.1\").unwrap()));\n\n let ipv6: LhsValue<'_> = serde_json::from_str(\"\\\"::1\\\"\").unwrap();\n assert_eq!(ipv6, LhsValue::Ip(IpAddr::from_str(\"::1\").unwrap()));\n\n let bytes: LhsValue<'_> = serde_json::from_str(\"\\\"a JSON string with unicode ❤\\\"\").unwrap();\n assert_eq!(\n bytes,\n LhsValue::Bytes(b\"a JSON string with unicode \\xE2\\x9D\\xA4\")\n );\n\n \n \n \n \n assert!(\n serde_json::from_str::<LhsValue<'_>>(\"\\\"a JSON string with escaped-unicode \\\\u2764\\\"\")\n .is_err(),\n \"LhsValue can only handle borrowed bytes\"\n );\n\n let bytes: LhsValue<'_> = serde_json::from_str(\"\\\"1337\\\"\").unwrap();\n assert_eq!(bytes, LhsValue::Bytes(b\"1337\"));\n\n let integer: LhsValue<'_> = serde_json::from_str(\"1337\").unwrap();\n assert_eq!(integer, LhsValue::Int(1337));\n\n let b: LhsValue<'_> = serde_json::from_str(\"false\").unwrap();\n assert_eq!(b, LhsValue::Bool(false));\n}\n"},"middle":{"kind":"string","value":"if let Ok(rest) = expect(input, \"}\") {\n input = rest;\n return Ok((res, input));\n } else {\n let (item, rest) = T::lex(input)?;\n res.push(item);\n input = rest;\n }"},"strategy":{"kind":"string","value":"if_condition"},"context_items":{"kind":"list like","value":[{"content":"fn lex_digits(input: &str) -> LexResult<'_, &str> {\n\n // Lex any supported digits (up to radix 16) for better error locations.\n\n take_while(input, \"digit\", |c| c.is_digit(16))\n\n}\n\n\n","file_path":"engine/src/rhs_types/int.rs","rank":0,"score":184976.2941145299},{"content":"pub fn take(input: &str, expected: usize) -> LexResult<'_, &str> {\n\n let mut chars = input.chars();\n\n for i in 0..expected {\n\n chars.next().ok_or_else(|| {\n\n (\n\n LexErrorKind::CountMismatch {\n\n name: \"character\",\n\n actual: i,\n\n expected,\n\n },\n\n input,\n\n )\n\n })?;\n\n }\n\n let rest = chars.as_str();\n\n Ok((span(input, rest), rest))\n\n}\n\n\n","file_path":"engine/src/lex.rs","rank":1,"score":175939.4041827986},{"content":"fn match_addr_or_cidr(input: &str) -> LexResult<'_, &str> {\n\n take_while(input, \"IP address character\", |c| match c {\n\n '0'..='9' | 'a'..='f' | 'A'..='F' | ':' | '.' | '/' => true,\n\n _ => false,\n\n })\n\n}\n\n\n","file_path":"engine/src/rhs_types/ip.rs","rank":2,"score":173145.4763350632},{"content":"pub fn skip_space(input: &str) -> &str {\n\n input.trim_start_matches(SPACE_CHARS)\n\n}\n\n\n\n/// This macro generates enum declaration + lexer implementation.\n\n///\n\n/// It works by recursively processing variants one by one, while passing\n\n/// around intermediate state (partial declaration and lexer bodies).\n\nmacro_rules! lex_enum {\n\n // Branch for handling `SomeType => VariantName`.\n\n //\n\n // Creates a newtype variant `VariantName(SomeType)`.\n\n //\n\n // On the parser side, tries to parse `SomeType` and wraps into the variant\n\n // on success.\n\n (@decl $preamble:tt $name:ident $input:ident { $($decl:tt)* } { $($expr:tt)* } {\n\n $ty:ty => $item:ident,\n\n $($rest:tt)*\n\n }) => {\n\n lex_enum!(@decl $preamble $name $input {\n","file_path":"engine/src/lex.rs","rank":3,"score":170599.38602478488},{"content":"pub fn span<'i>(input: &'i str, rest: &'i str) -> &'i str {\n\n &input[..input.len() - rest.len()]\n\n}\n\n\n","file_path":"engine/src/lex.rs","rank":5,"score":162954.3854636584},{"content":"fn hex_byte(input: &str) -> LexResult<'_, u8> {\n\n fixed_byte(input, 2, 16)\n\n}\n\n\n","file_path":"engine/src/rhs_types/bytes.rs","rank":6,"score":160462.79750794952},{"content":"fn oct_byte(input: &str) -> LexResult<'_, u8> {\n\n fixed_byte(input, 3, 8)\n\n}\n\n\n\nlex_enum!(ByteSeparator {\n\n \":\" => Colon,\n\n \"-\" => Dash,\n\n \".\" => Dot,\n\n});\n\n\n\nimpl<'i> Lex<'i> for Bytes {\n\n fn lex(mut input: &str) -> LexResult<'_, Self> {\n\n if let Ok(input) = expect(input, \"\\\"\") {\n\n let full_input = input;\n\n let mut res = String::new();\n\n let mut iter = input.chars();\n\n loop {\n\n match iter\n\n .next()\n\n .ok_or_else(|| (LexErrorKind::MissingEndingQuote, full_input))?\n","file_path":"engine/src/rhs_types/bytes.rs","rank":7,"score":160462.79750794952},{"content":"pub fn expect<'i>(input: &'i str, s: &'static str) -> Result<&'i str, LexError<'i>> {\n\n if input.starts_with(s) {\n\n Ok(&input[s.len()..])\n\n } else {\n\n Err((LexErrorKind::ExpectedLiteral(s), input))\n\n }\n\n}\n\n\n\n// Tabs are harder to format as part of the error message because they have\n\n// a different printable width than other characters, and so become a common\n\n// source of issues in different compilers.\n\n//\n\n// It's not impossible to work around that limitation, but let's not bother\n\n// for now until someone really needs them (tabs vs spaces all the way down...).\n\nconst SPACE_CHARS: &[char] = &[' ', '\\r', '\\n'];\n\n\n","file_path":"engine/src/lex.rs","rank":8,"score":159593.33380547096},{"content":"fn parse_number<'i>((input, rest): (&'i str, &'i str), radix: u32) -> LexResult<'_, i32> {\n\n match i32::from_str_radix(input, radix) {\n\n Ok(res) => Ok((res, rest)),\n\n Err(err) => Err((LexErrorKind::ParseInt { err, radix }, input)),\n\n }\n\n}\n\n\n\nimpl<'i> Lex<'i> for i32 {\n\n fn lex(input: &str) -> LexResult<'_, Self> {\n\n if let Ok(input) = expect(input, \"0x\") {\n\n parse_number(lex_digits(input)?, 16)\n\n } else if input.starts_with('0') {\n\n // not using `expect` because we want to include `0` too\n\n parse_number(lex_digits(input)?, 8)\n\n } else {\n\n let without_neg = match expect(input, \"-\") {\n\n Ok(input) => input,\n\n Err(_) => input,\n\n };\n\n\n","file_path":"engine/src/rhs_types/int.rs","rank":9,"score":147936.4133737964},{"content":"fn fixed_byte(input: &str, digits: usize, radix: u32) -> LexResult<'_, u8> {\n\n let (digits, rest) = take(input, digits)?;\n\n match u8::from_str_radix(digits, radix) {\n\n Ok(b) => Ok((b, rest)),\n\n Err(err) => Err((LexErrorKind::ParseInt { err, radix }, digits)),\n\n }\n\n}\n\n\n","file_path":"engine/src/rhs_types/bytes.rs","rank":10,"score":138772.6915829843},{"content":"fn parse_addr(input: &str) -> Result<IpAddr, LexError<'_>> {\n\n IpAddr::from_str(input).map_err(|err| {\n\n (\n\n LexErrorKind::ParseNetwork(NetworkParseError::AddrParseError(err)),\n\n input,\n\n )\n\n })\n\n}\n\n\n\nimpl<'i> Lex<'i> for IpAddr {\n\n fn lex(input: &str) -> LexResult<'_, Self> {\n\n let (input, rest) = match_addr_or_cidr(input)?;\n\n parse_addr(input).map(|res| (res, rest))\n\n }\n\n}\n\n\n\n#[derive(PartialEq, Eq, Clone, Serialize, Debug)]\n\n#[serde(untagged)]\n\npub enum ExplicitIpRange {\n\n V4(RangeInclusive<Ipv4Addr>),\n","file_path":"engine/src/rhs_types/ip.rs","rank":11,"score":135694.85099885243},{"content":"trait Expr<'s>: Sized + Eq + Debug + for<'i> LexWith<'i, &'s Scheme> + Serialize {\n\n fn uses(&self, field: Field<'s>) -> bool;\n\n fn compile(self) -> CompiledExpr<'s>;\n\n}\n\n\n\n/// A parsed filter AST.\n\n///\n\n/// It's attached to its corresponding [`Scheme`](struct@Scheme) because all\n\n/// parsed fields are represented as indices and are valid only when\n\n/// [`ExecutionContext`](::ExecutionContext) is created from the same scheme.\n\n#[derive(PartialEq, Eq, Serialize, Clone)]\n\n#[serde(transparent)]\n\npub struct FilterAst<'s> {\n\n #[serde(skip)]\n\n scheme: &'s Scheme,\n\n\n\n op: CombinedExpr<'s>,\n\n}\n\n\n\nimpl<'s> Debug for FilterAst<'s> {\n","file_path":"engine/src/ast/mod.rs","rank":12,"score":103760.22092051001},{"content":"fn bench_string_comparisons(c: &mut Criterion) {\n\n FieldBench {\n\n field: \"ip.geoip.country\",\n\n filters: &[\n\n r#\"ip.geoip.country == \"GB\"\"#,\n\n r#\"ip.geoip.country in { \"AT\" \"BE\" \"BG\" \"HR\" \"CY\" \"CZ\" \"DK\" \"EE\" \"FI\" \"FR\" \"DE\" \"GR\" \"HU\" \"IE\" \"IT\" \"LV\" \"LT\" \"LU\" \"MT\" \"NL\" \"PL\" \"PT\" \"RO\" \"SK\" \"SI\" \"ES\" \"SE\" \"GB\" \"GF\" \"GP\" \"MQ\" \"ME\" \"YT\" \"RE\" \"MF\" \"GI\" \"AX\" \"PM\" \"GL\" \"BL\" \"SX\" \"AW\" \"CW\" \"WF\" \"PF\" \"NC\" \"TF\" \"AI\" \"BM\" \"IO\" \"VG\" \"KY\" \"FK\" \"MS\" \"PN\" \"SH\" \"GS\" \"TC\" \"AD\" \"LI\" \"MC\" \"SM\" \"VA\" \"JE\" \"GG\" \"GI\" \"CH\" }\"#,\n\n ],\n\n values: &[\"GB\", \"T1\"],\n\n }.run(c)\n\n}\n\n\n","file_path":"engine/benches/bench.rs","rank":13,"score":88261.08435656843},{"content":"fn bench_int_comparisons(c: &mut Criterion) {\n\n FieldBench {\n\n field: \"tcp.port\",\n\n filters: &[\n\n \"tcp.port == 80\",\n\n \"tcp.port >= 1024\",\n\n \"tcp.port in { 80 8080 8880 2052 2082 2086 2095 }\",\n\n ],\n\n values: &[80, 8081],\n\n }\n\n .run(c)\n\n}\n\n\n","file_path":"engine/benches/bench.rs","rank":14,"score":88261.08435656843},{"content":"fn bench_string_matches(c: &mut Criterion) {\n\n FieldBench {\n\n field: \"http.user_agent\",\n\n filters: &[\n\n r#\"http.user_agent ~ \"(?i)googlebot/\\d+\\.\\d+\"\"#,\n\n r#\"http.user_agent ~ \"Googlebot\"\"#,\n\n r#\"http.user_agent contains \"Googlebot\"\"#\n\n ],\n\n values: &[\n\n \"Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; Googlebot/2.1; +http://www.google.com/bot.html) Safari/537.36\",\n\n \"Mozilla/5.0 (X11; Linux x86_64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/51.0.2704.103 Safari/537.36\"\n\n ]\n\n }.run(c)\n\n}\n\n\n\ncriterion_group! {\n\n name = field_benchmarks;\n\n config = Criterion::default();\n\n targets =\n\n bench_ip_comparisons,\n\n bench_int_comparisons,\n\n bench_string_comparisons,\n\n bench_string_matches,\n\n}\n\n\n\ncriterion_main!(field_benchmarks);\n","file_path":"engine/benches/bench.rs","rank":15,"score":88261.08435656843},{"content":"fn bench_ip_comparisons(c: &mut Criterion) {\n\n FieldBench {\n\n field: \"ip.addr\",\n\n filters: &[\n\n \"ip.addr == 173.245.48.1\",\n\n \"ip.addr == 2606:4700:4700::1111\",\n\n \"ip.addr >= 173.245.48.0 && ip.addr < 173.245.49.0\",\n\n \"ip.addr >= 2606:4700:: && ip.addr < 2606:4701::\",\n\n \"ip.addr in { 103.21.244.0/22 2405:8100::/32 104.16.0.0/12 2803:f800::/32 131.0.72.0/22 173.245.48.0/20 2405:b500::/32 172.64.0.0/13 190.93.240.0/20 103.22.200.0/22 2606:4700::/32 198.41.128.0/17 197.234.240.0/22 162.158.0.0/15 108.162.192.0/18 2c0f:f248::/32 2400:cb00::/32 103.31.4.0/22 2a06:98c0::/29 141.101.64.0/18 188.114.96.0/20 }\"\n\n ],\n\n values: &[\n\n IpAddr::from([127, 0, 0, 1]),\n\n IpAddr::from([0x2001, 0x0db8, 0x85a3, 0x0000, 0x0000, 0x8a2e, 0x0370, 0x7334]),\n\n IpAddr::from([173, 245, 48, 1]),\n\n IpAddr::from([0x2606, 0x4700, 0x4700, 0x0000, 0x0000, 0x0000, 0x0000, 0x1111]),\n\n ]\n\n }.run(c)\n\n}\n\n\n","file_path":"engine/benches/bench.rs","rank":16,"score":88261.08435656843},{"content":"pub fn complete<T>(res: LexResult<'_, T>) -> Result<T, LexError<'_>> {\n\n let (res, input) = res?;\n\n if input.is_empty() {\n\n Ok(res)\n\n } else {\n\n Err((LexErrorKind::EOF, input))\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmacro_rules! assert_ok {\n\n ($s:expr, $res:expr, $rest:expr) => {{\n\n let expr = $s.unwrap();\n\n assert_eq!(expr, ($res, $rest));\n\n expr.0\n\n }};\n\n\n\n ($s:expr, $res:expr) => {\n\n assert_ok!($s, $res, \"\")\n\n };\n","file_path":"engine/src/lex.rs","rank":17,"score":82302.68504805892},{"content":"pub fn take_while<'i, F: Fn(char) -> bool>(\n\n input: &'i str,\n\n name: &'static str,\n\n f: F,\n\n) -> LexResult<'i, &'i str> {\n\n let mut iter = input.chars();\n\n loop {\n\n let rest = iter.as_str();\n\n match iter.next() {\n\n Some(c) if f(c) => {}\n\n _ => {\n\n return if rest.len() != input.len() {\n\n Ok((span(input, rest), rest))\n\n } else {\n\n Err((LexErrorKind::ExpectedName(name), input))\n\n };\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"engine/src/lex.rs","rank":18,"score":77085.62932928359},{"content":"#[allow(clippy::needless_pass_by_value)]\n\nfn into_js_error(err: impl std::error::Error) -> JsValue {\n\n js_sys::Error::new(&err.to_string()).into()\n\n}\n\n\n\n#[wasm_bindgen]\n\nimpl Scheme {\n\n #[wasm_bindgen(constructor)]\n\n pub fn try_from(fields: &JsValue) -> Result<Scheme, JsValue> {\n\n fields.into_serde().map(Scheme).map_err(into_js_error)\n\n }\n\n\n\n pub fn parse(&self, s: &str) -> Result<JsValue, JsValue> {\n\n let filter = self.0.parse(s).map_err(into_js_error)?;\n\n JsValue::from_serde(&filter).map_err(into_js_error)\n\n }\n\n}\n","file_path":"wasm/src/lib.rs","rank":19,"score":76923.48239341736},{"content":"fn serialize_op_rhs<T: Serialize, S: Serializer>(\n\n op: &'static str,\n\n rhs: &T,\n\n ser: S,\n\n) -> Result<S::Ok, S::Error> {\n\n use serde::ser::SerializeStruct;\n\n\n\n let mut out = ser.serialize_struct(\"FieldOp\", 2)?;\n\n out.serialize_field(\"op\", op)?;\n\n out.serialize_field(\"rhs\", rhs)?;\n\n out.end()\n\n}\n\n\n","file_path":"engine/src/ast/field_expr.rs","rank":20,"score":75321.71912049808},{"content":"#[test]\n\nfn test_lex() {\n\n fn addr<A: Into<IpAddr>>(addr: A) -> IpRange {\n\n IpRange::Cidr(IpCidr::new_host(addr.into()))\n\n }\n\n\n\n fn range<A: Into<IpAddr>>(range: RangeInclusive<A>) -> IpRange {\n\n let (first, last) = range.into_inner();\n\n match (first.into(), last.into()) {\n\n (IpAddr::V4(first), IpAddr::V4(last)) => {\n\n IpRange::Explicit(ExplicitIpRange::V4(first..=last))\n\n }\n\n (IpAddr::V6(first), IpAddr::V6(last)) => {\n\n IpRange::Explicit(ExplicitIpRange::V6(first..=last))\n\n }\n\n _ => panic!(\"Invalid inputs\"),\n\n }\n\n }\n\n\n\n fn cidr<A: Into<IpAddr>>(addr: A, len: u8) -> IpRange {\n\n IpRange::Cidr(IpCidr::new(addr.into(), len).unwrap())\n","file_path":"engine/src/rhs_types/ip.rs","rank":21,"score":72841.96810310514},{"content":"fn serialize_is_true<S: Serializer>(ser: S) -> Result<S::Ok, S::Error> {\n\n use serde::ser::SerializeStruct;\n\n\n\n let mut out = ser.serialize_struct(\"FieldOp\", 1)?;\n\n out.serialize_field(\"op\", \"IsTrue\")?;\n\n out.end()\n\n}\n\n\n","file_path":"engine/src/ast/field_expr.rs","rank":22,"score":62770.02439707256},{"content":"fn serialize_contains<S: Serializer>(rhs: &Bytes, ser: S) -> Result<S::Ok, S::Error> {\n\n serialize_op_rhs(\"Contains\", rhs, ser)\n\n}\n\n\n","file_path":"engine/src/ast/field_expr.rs","rank":23,"score":59818.84096205355},{"content":"fn serialize_matches<S: Serializer>(rhs: &Regex, ser: S) -> Result<S::Ok, S::Error> {\n\n serialize_op_rhs(\"Matches\", rhs, ser)\n\n}\n\n\n","file_path":"engine/src/ast/field_expr.rs","rank":24,"score":59818.84096205355},{"content":"fn serialize_one_of<S: Serializer>(rhs: &RhsValues, ser: S) -> Result<S::Ok, S::Error> {\n\n serialize_op_rhs(\"OneOf\", rhs, ser)\n\n}\n\n\n\n#[derive(Debug, PartialEq, Eq, Clone, Serialize)]\n\npub struct FieldExpr<'s> {\n\n field: Field<'s>,\n\n\n\n #[serde(flatten)]\n\n op: FieldOp,\n\n}\n\n\n\nimpl<'i, 's> LexWith<'i, &'s Scheme> for FieldExpr<'s> {\n\n fn lex_with(input: &'i str, scheme: &'s Scheme) -> LexResult<'i, Self> {\n\n let initial_input = input;\n\n\n\n let (field, input) = Field::lex_with(input, scheme)?;\n\n let field_type = field.get_type();\n\n\n\n let (op, input) = if field_type == Type::Bool {\n","file_path":"engine/src/ast/field_expr.rs","rank":25,"score":58793.05190549428},{"content":"pub trait Lex<'i>: Sized {\n\n fn lex(input: &'i str) -> LexResult<'i, Self>;\n\n}\n\n\n","file_path":"engine/src/lex.rs","rank":26,"score":58413.430141427474},{"content":"pub trait LexWith<'i, E>: Sized {\n\n fn lex_with(input: &'i str, extra: E) -> LexResult<'i, Self>;\n\n}\n\n\n\nimpl<'i, T: Lex<'i>, E> LexWith<'i, E> for T {\n\n fn lex_with(input: &'i str, _extra: E) -> LexResult<'i, Self> {\n\n Self::lex(input)\n\n }\n\n}\n\n\n","file_path":"engine/src/lex.rs","rank":27,"score":56350.38567420839},{"content":"fn main() {\n\n let filter = args()\n\n .nth(1)\n\n .expect(\"Expected an input as a command-line argument\");\n\n\n\n let scheme = Scheme! {\n\n ip: Ip,\n\n str: Bytes,\n\n int: Int,\n\n bool: Bool,\n\n };\n\n\n\n match scheme.parse(&filter) {\n\n Ok(res) => println!(\"{:#?}\", res),\n\n Err(err) => println!(\"{}\", err),\n\n }\n\n}\n","file_path":"engine/examples/cli.rs","rank":28,"score":47124.06571350734},{"content":"#[test]\n\nfn test_field() {\n\n let scheme = &Scheme! {\n\n x: Bytes,\n\n x.y.z0: Int,\n\n is_TCP: Bool,\n\n };\n\n\n\n assert_ok!(\n\n Field::lex_with(\"x;\", scheme),\n\n scheme.get_field_index(\"x\").unwrap(),\n\n \";\"\n\n );\n\n\n\n assert_ok!(\n\n Field::lex_with(\"x.y.z0-\", scheme),\n\n scheme.get_field_index(\"x.y.z0\").unwrap(),\n\n \"-\"\n\n );\n\n\n\n assert_ok!(\n","file_path":"engine/src/scheme.rs","rank":29,"score":45993.93634581908},{"content":"#[test]\n\nfn test() {\n\n use std::str::FromStr;\n\n\n\n assert_ok!(i32::lex(\"0\"), 0i32, \"\");\n\n assert_ok!(i32::lex(\"0-\"), 0i32, \"-\");\n\n assert_ok!(i32::lex(\"0x1f5+\"), 501i32, \"+\");\n\n assert_ok!(i32::lex(\"0123;\"), 83i32, \";\");\n\n assert_ok!(i32::lex(\"78!\"), 78i32, \"!\");\n\n assert_ok!(i32::lex(\"0xefg\"), 239i32, \"g\");\n\n assert_ok!(i32::lex(\"-12-\"), -12i32, \"-\");\n\n assert_err!(\n\n i32::lex(\"-2147483649!\"),\n\n LexErrorKind::ParseInt {\n\n err: i32::from_str(\"-2147483649\").unwrap_err(),\n\n radix: 10\n\n },\n\n \"-2147483649\"\n\n );\n\n assert_err!(\n\n i32::lex(\"2147483648!\"),\n","file_path":"engine/src/rhs_types/int.rs","rank":30,"score":44941.658834066984},{"content":"#[test]\n\nfn test() {\n\n use super::field_expr::FieldExpr;\n\n use execution_context::ExecutionContext;\n\n use lex::complete;\n\n\n\n let scheme = &Scheme! {\n\n t: Bool,\n\n f: Bool,\n\n };\n\n\n\n let ctx = &mut ExecutionContext::new(scheme);\n\n\n\n let t_expr = CombinedExpr::Simple(SimpleExpr::Field(\n\n complete(FieldExpr::lex_with(\"t\", scheme)).unwrap(),\n\n ));\n\n\n\n let t_expr = || t_expr.clone();\n\n\n\n let f_expr = CombinedExpr::Simple(SimpleExpr::Field(\n\n complete(FieldExpr::lex_with(\"f\", scheme)).unwrap(),\n","file_path":"engine/src/ast/combined_expr.rs","rank":31,"score":44941.658834066984},{"content":"#[test]\n\nfn test_parse_error() {\n\n use indoc::indoc;\n\n\n\n let scheme = &Scheme! { num: Int };\n\n\n\n {\n\n let err = scheme.parse(\"xyz\").unwrap_err();\n\n assert_eq!(\n\n err,\n\n ParseError {\n\n kind: LexErrorKind::UnknownField(UnknownFieldError),\n\n input: \"xyz\",\n\n line_number: 0,\n\n span_start: 0,\n\n span_len: 3\n\n }\n\n );\n\n assert_eq!(\n\n err.to_string(),\n\n indoc!(\n","file_path":"engine/src/scheme.rs","rank":32,"score":44941.658834066984},{"content":"#[test]\n\nfn test() {\n\n assert_ok!(\n\n Bytes::lex(\"01:2e:f3-77.12;\"),\n\n Bytes::from(vec![0x01, 0x2E, 0xF3, 0x77, 0x12]),\n\n \";\"\n\n );\n\n\n\n assert_ok!(\n\n Bytes::lex(r#\"\"s\\\\t\\\"r\\x0A\\000t\"\"#),\n\n Bytes::from(\"s\\\\t\\\"r\\n\\0t\".to_owned())\n\n );\n\n\n\n assert_err!(\n\n Bytes::lex(\"01:4x;\"),\n\n LexErrorKind::ParseInt {\n\n err: u8::from_str_radix(\"4x\", 16).unwrap_err(),\n\n radix: 16,\n\n },\n\n \"4x\"\n\n );\n","file_path":"engine/src/rhs_types/bytes.rs","rank":33,"score":44941.658834066984},{"content":"#[test]\n\nfn test() {\n\n use execution_context::ExecutionContext;\n\n use lex::complete;\n\n\n\n let scheme = &Scheme! { t: Bool };\n\n\n\n let ctx = &mut ExecutionContext::new(scheme);\n\n ctx.set_field_value(\"t\", true).unwrap();\n\n\n\n let t_expr = SimpleExpr::Field(complete(FieldExpr::lex_with(\"t\", scheme)).unwrap());\n\n let t_expr = || t_expr.clone();\n\n\n\n {\n\n let expr = assert_ok!(SimpleExpr::lex_with(\"t\", scheme), t_expr());\n\n\n\n assert_json!(\n\n expr,\n\n {\n\n \"field\": \"t\",\n\n \"op\": \"IsTrue\"\n","file_path":"engine/src/ast/simple_expr.rs","rank":34,"score":44941.658834066984},{"content":"#[test]\n\nfn test_field_type_override() {\n\n let mut scheme = Scheme! { foo: Int };\n\n\n\n assert_eq!(\n\n scheme.add_field(\"foo\".into(), Type::Bytes),\n\n Err(FieldRedefinitionError(\"foo\".into()))\n\n )\n\n}\n","file_path":"engine/src/scheme.rs","rank":35,"score":43959.456499728796},{"content":"#[test]\n\nfn test() {\n\n let expr = assert_ok!(\n\n Regex::lex(r#\"\"[a-z\"\\]]+\\d{1,10}\\\"\";\"#),\n\n Regex::from_str(r#\"[a-z\"\\]]+\\d{1,10}\"\"#).unwrap(),\n\n \";\"\n\n );\n\n\n\n assert_json!(expr, r#\"[a-z\"\\]]+\\d{1,10}\"\"#);\n\n\n\n assert_err!(\n\n Regex::lex(r#\"\"abcd\\\"#),\n\n LexErrorKind::MissingEndingQuote,\n\n \"abcd\\\\\"\n\n );\n\n}\n","file_path":"engine/src/rhs_types/regex/mod.rs","rank":36,"score":43959.456499728796},{"content":"#[test]\n\n#[should_panic(expected = \"attempt to redefine field foo\")]\n\nfn test_static_field_type_override() {\n\n Scheme! { foo: Int, foo: Int };\n\n}\n\n\n","file_path":"engine/src/scheme.rs","rank":38,"score":43040.5550455182},{"content":"#[test]\n\nfn test_strict_partial_ord() {\n\n let ips = &[\n\n IpAddr::from([10, 0, 0, 0]),\n\n IpAddr::from([127, 0, 0, 1]),\n\n IpAddr::from([0, 0, 0, 0, 0, 0, 0, 1]),\n\n IpAddr::from([0, 0, 0, 0, 0, 0, 0, 2]),\n\n ];\n\n\n\n for lhs in ips {\n\n for rhs in ips {\n\n if lhs.is_ipv4() == rhs.is_ipv4() {\n\n assert_eq!(lhs.strict_partial_cmp(rhs), lhs.partial_cmp(rhs));\n\n } else {\n\n assert_eq!(lhs.strict_partial_cmp(rhs), None);\n\n }\n\n }\n\n }\n\n}\n","file_path":"engine/src/rhs_types/ip.rs","rank":39,"score":42179.026093776105},{"content":"#[test]\n\nfn test_field_value_type_mismatch() {\n\n let scheme = Scheme! { foo: Int };\n\n\n\n let mut ctx = ExecutionContext::new(&scheme);\n\n\n\n assert_eq!(\n\n ctx.set_field_value(\"foo\", LhsValue::Bool(false)),\n\n Err(FieldValueTypeMismatchError {\n\n field_type: Type::Int,\n\n value_type: Type::Bool\n\n })\n\n );\n\n}\n","file_path":"engine/src/execution_context.rs","rank":40,"score":42179.026093776105},{"content":"use cidr::NetworkParseError;\n\nuse failure::Fail;\n\nuse rhs_types::RegexError;\n\nuse scheme::UnknownFieldError;\n\nuse std::num::ParseIntError;\n\nuse types::Type;\n\n\n\n#[derive(Debug, PartialEq, Fail)]\n\npub enum LexErrorKind {\n\n #[fail(display = \"expected {}\", _0)]\n\n ExpectedName(&'static str),\n\n\n\n #[fail(display = \"expected literal {:?}\", _0)]\n\n ExpectedLiteral(&'static str),\n\n\n\n #[fail(display = \"{} while parsing with radix {}\", err, radix)]\n\n ParseInt {\n\n #[cause]\n\n err: ParseIntError,\n\n radix: u32,\n","file_path":"engine/src/lex.rs","rank":41,"score":33332.49017032207},{"content":"\n\n #[fail(display = \"{}\", _0)]\n\n UnknownField(#[cause] UnknownFieldError),\n\n\n\n #[fail(display = \"cannot use this operation type {:?}\", field_type)]\n\n UnsupportedOp { field_type: Type },\n\n\n\n #[fail(display = \"incompatible range bounds\")]\n\n IncompatibleRangeBounds,\n\n\n\n #[fail(display = \"unrecognised input\")]\n\n EOF,\n\n}\n\n\n\npub type LexError<'i> = (LexErrorKind, &'i str);\n\n\n\npub type LexResult<'i, T> = Result<(T, &'i str), LexError<'i>>;\n\n\n","file_path":"engine/src/lex.rs","rank":42,"score":33331.239215580856},{"content":" }) => {\n\n lex_enum!(@decl $preamble $name $input {\n\n $($decl)*\n\n $item $(= $value)*,\n\n } {\n\n $($expr)*\n\n $(if let Ok($input) = $crate::lex::expect($input, $s) {\n\n return Ok(($name::$item, $input));\n\n })+\n\n } { $($rest)* });\n\n };\n\n\n\n // Internal finish point for declaration + lexer generation.\n\n //\n\n // This is invoked when no more variants are left to process.\n\n // At this point declaration and lexer body are considered complete.\n\n (@decl { $($preamble:tt)* } $name:ident $input:ident $decl:tt { $($expr:stmt)* } {}) => {\n\n #[derive(Debug, PartialEq, Eq, Clone, Copy, Serialize)]\n\n $($preamble)*\n\n pub enum $name $decl\n","file_path":"engine/src/lex.rs","rank":43,"score":33330.88086814959},{"content":"\n\n impl<'i> $crate::lex::Lex<'i> for $name {\n\n fn lex($input: &'i str) -> $crate::lex::LexResult<'_, Self> {\n\n $($expr)*\n\n Err((\n\n $crate::lex::LexErrorKind::ExpectedName(stringify!($name)),\n\n $input\n\n ))\n\n }\n\n }\n\n };\n\n\n\n // The public entry point to the macro.\n\n ($(# $attrs:tt)* $name:ident $items:tt) => {\n\n lex_enum!(@decl {\n\n $(# $attrs)*\n\n } $name input {} {} $items);\n\n };\n\n}\n\n\n","file_path":"engine/src/lex.rs","rank":44,"score":33330.501358503076},{"content":" $($decl)*\n\n $item($ty),\n\n } {\n\n $($expr)*\n\n if let Ok((res, $input)) = $crate::lex::Lex::lex($input) {\n\n return Ok(($name::$item(res), $input));\n\n }\n\n } { $($rest)* });\n\n };\n\n\n\n // Branch for handling `\"some_string\" | \"other_string\" => VariantName`.\n\n // (also supports optional constant value via `... => VariantName = 42`)\n\n //\n\n // Creates a unit variant `VariantName`.\n\n //\n\n // On the parser side, tries to parse either of the given string values,\n\n // and returns the variant if any of them succeeded.\n\n (@decl $preamble:tt $name:ident $input:ident { $($decl:tt)* } { $($expr:tt)* } {\n\n $($s:tt)|+ => $item:ident $(= $value:expr)*,\n\n $($rest:tt)*\n","file_path":"engine/src/lex.rs","rank":45,"score":33327.02137458014},{"content":" },\n\n\n\n #[fail(display = \"{}\", _0)]\n\n ParseNetwork(#[cause] NetworkParseError),\n\n\n\n #[fail(display = \"{}\", _0)]\n\n ParseRegex(#[cause] RegexError),\n\n\n\n #[fail(display = \"expected \\\", xHH or OOO after \\\\\")]\n\n InvalidCharacterEscape,\n\n\n\n #[fail(display = \"could not find an ending quote\")]\n\n MissingEndingQuote,\n\n\n\n #[fail(display = \"expected {} {}s, but found {}\", expected, name, actual)]\n\n CountMismatch {\n\n name: &'static str,\n\n actual: usize,\n\n expected: usize,\n\n },\n","file_path":"engine/src/lex.rs","rank":46,"score":33322.48760916161},{"content":"}\n\n\n\n#[cfg(test)]\n\nmacro_rules! assert_err {\n\n ($s:expr, $kind:expr, $span:expr) => {\n\n assert_eq!($s, Err(($kind, $span)))\n\n };\n\n}\n\n\n\n#[cfg(test)]\n\nmacro_rules! assert_json {\n\n ($expr:expr, $json:tt) => {\n\n assert_eq!(\n\n ::serde_json::to_value(&$expr).unwrap(),\n\n ::serde_json::json!($json)\n\n );\n\n };\n\n}\n","file_path":"engine/src/lex.rs","rank":47,"score":33320.373384820086},{"content":"fn unwrap_json_result<T>(filter_ast: &FilterAst<'_>, result: serde_json::Result<T>) -> T {\n\n // Filter serialisation must never fail.\n\n result.unwrap_or_else(|err| panic!(\"{} while serializing filter {:#?}\", err, filter_ast))\n\n}\n\n\n\n#[no_mangle]\n\npub extern \"C\" fn wirefilter_get_filter_hash(filter_ast: &FilterAst<'_>) -> u64 {\n\n let mut hasher = FnvHasher::default();\n\n // Serialize JSON to our Write-compatible wrapper around FnvHasher,\n\n // effectively calculating a hash for our filter in a streaming fashion\n\n // that is as stable as the JSON representation itself\n\n // (instead of relying on #[derive(Hash)] which would be tied to impl details).\n\n let result = serde_json::to_writer(HasherWrite(&mut hasher), filter_ast);\n\n unwrap_json_result(filter_ast, result);\n\n hasher.finish()\n\n}\n\n\n\n#[no_mangle]\n\npub extern \"C\" fn wirefilter_serialize_filter_to_json(\n\n filter_ast: &FilterAst<'_>,\n","file_path":"ffi/src/lib.rs","rank":48,"score":30298.17645577532},{"content":"use super::{ExternPtrRepr, ExternSliceRepr};\n\nuse std::str;\n\n\n\n/// This structure provides FFI-safe representation for Rust string slice\n\n/// pointers.\n\n///\n\n/// The representation is guaranteed to be the same as [`ExternSliceRepr`]\n\n/// for regular bytes ([`u8`]), but adds extra conversion checks for UTF-8.\n\n///\n\n/// Example C definition:\n\n/// ```\n\n/// struct Str {\n\n/// const uint8_t *data;\n\n/// size_t length;\n\n/// };\n\n/// ```\n\n#[repr(transparent)]\n\n#[derive(Clone, Copy)]\n\npub struct ExternStrRepr(ExternSliceRepr<u8>);\n\n\n","file_path":"ffi/src/transfer_types/raw_ptr_repr/str.rs","rank":49,"score":28222.91397195327},{"content":"impl From<*mut str> for ExternStrRepr {\n\n #[allow(clippy::not_unsafe_ptr_arg_deref)]\n\n fn from(ptr: *mut str) -> Self {\n\n let bytes: *mut [u8] = unsafe { (*ptr).as_bytes_mut() };\n\n ExternStrRepr(bytes.into())\n\n }\n\n}\n\n\n\nimpl ExternPtrRepr for str {\n\n type Repr = ExternStrRepr;\n\n\n\n unsafe fn from_extern_repr_unchecked(repr: Self::Repr) -> *mut str {\n\n let bytes = ExternPtrRepr::from_extern_repr_unchecked(repr.0);\n\n str::from_utf8_unchecked_mut(&mut *bytes)\n\n }\n\n\n\n fn from_extern_repr(repr: Self::Repr) -> *mut str {\n\n let bytes = ExternPtrRepr::from_extern_repr(repr.0);\n\n // Make sure that strings coming via FFI are UTF-8 compatible.\n\n str::from_utf8_mut(unsafe { &mut *bytes }).unwrap()\n\n }\n\n}\n","file_path":"ffi/src/transfer_types/raw_ptr_repr/str.rs","rank":50,"score":28222.81035424664},{"content":"impl<'s> Serialize for Field<'s> {\n\n fn serialize<S: Serializer>(&self, ser: S) -> Result<S::Ok, S::Error> {\n\n self.name().serialize(ser)\n\n }\n\n}\n\n\n\nimpl<'s> Debug for Field<'s> {\n\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\n\n write!(f, \"{}\", self.name())\n\n }\n\n}\n\n\n\nimpl<'i, 's> LexWith<'i, &'s Scheme> for Field<'s> {\n\n fn lex_with(mut input: &'i str, scheme: &'s Scheme) -> LexResult<'i, Self> {\n\n let initial_input = input;\n\n\n\n loop {\n\n input = take_while(input, \"identifier character\", |c| {\n\n c.is_ascii_alphanumeric() || c == '_'\n\n })?\n","file_path":"engine/src/scheme.rs","rank":51,"score":22.739758563089417},{"content":" self.as_str() == other.as_str()\n\n }\n\n}\n\n\n\nimpl Eq for Regex {}\n\n\n\nimpl Debug for Regex {\n\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\n\n f.write_str(self.as_str())\n\n }\n\n}\n\n\n\nimpl<'i> Lex<'i> for Regex {\n\n fn lex(input: &str) -> LexResult<'_, Self> {\n\n let input = expect(input, \"\\\"\")?;\n\n let mut regex_buf = String::new();\n\n let mut in_char_class = false;\n\n let (regex_str, input) = {\n\n let mut iter = input.chars();\n\n loop {\n","file_path":"engine/src/rhs_types/regex/mod.rs","rank":52,"score":22.220664372355714},{"content":"use cfg_if::cfg_if;\n\nuse lex::{expect, span, Lex, LexErrorKind, LexResult};\n\nuse serde::{Serialize, Serializer};\n\nuse std::{\n\n fmt::{self, Debug, Formatter},\n\n str::FromStr,\n\n};\n\n\n\ncfg_if! {\n\n if #[cfg(feature = \"regex\")] {\n\n mod imp_real;\n\n pub use self::imp_real::*;\n\n } else {\n\n mod imp_stub;\n\n pub use self::imp_stub::*;\n\n }\n\n}\n\n\n\nimpl PartialEq for Regex {\n\n fn eq(&self, other: &Regex) -> bool {\n","file_path":"engine/src/rhs_types/regex/mod.rs","rank":53,"score":20.290089732779133},{"content":"use lex::{expect, take, Lex, LexErrorKind, LexResult};\n\nuse serde::Serialize;\n\nuse std::{\n\n borrow::Borrow,\n\n fmt::{self, Debug, Formatter},\n\n hash::{Hash, Hasher},\n\n ops::Deref,\n\n str,\n\n};\n\nuse strict_partial_ord::StrictPartialOrd;\n\n\n\n#[derive(PartialEq, Eq, Clone, Serialize)]\n\n#[serde(untagged)]\n\npub enum Bytes {\n\n Str(Box<str>),\n\n Raw(Box<[u8]>),\n\n}\n\n\n\n// We need custom `Hash` consistent with `Borrow` invariants.\n\n// We can get away with `Eq` invariant though because we do want\n","file_path":"engine/src/rhs_types/bytes.rs","rank":54,"score":18.861654694135982},{"content":"use std::fmt;\n\nuse failure::Fail;\n\nuse std::str::FromStr;\n\n\n\n#[derive(Debug, PartialEq, Fail)]\n\npub enum Error {}\n\n\n\nimpl fmt::Display for Error {\n\n fn fmt(&self, _f: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n match *self {}\n\n }\n\n}\n\n\n\n#[derive(Clone)]\n\npub struct Regex(String);\n\n\n\nimpl FromStr for Regex {\n\n type Err = Error;\n\n\n\n fn from_str(s: &str) -> Result<Self, Error> {\n","file_path":"engine/src/rhs_types/regex/imp_stub.rs","rank":55,"score":17.60109968604162},{"content":"use ast::FilterAst;\n\nuse failure::Fail;\n\nuse fnv::FnvBuildHasher;\n\nuse indexmap::map::{Entry, IndexMap};\n\nuse lex::{complete, expect, span, take_while, LexErrorKind, LexResult, LexWith};\n\nuse serde::{Deserialize, Serialize, Serializer};\n\nuse std::{\n\n cmp::{max, min},\n\n error::Error,\n\n fmt::{self, Debug, Display, Formatter},\n\n ptr,\n\n};\n\nuse types::{GetType, Type};\n\n\n\n#[derive(PartialEq, Eq, Clone, Copy)]\n\npub(crate) struct Field<'s> {\n\n scheme: &'s Scheme,\n\n index: usize,\n\n}\n\n\n","file_path":"engine/src/scheme.rs","rank":57,"score":16.208989798201017},{"content":" fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n self.op.fmt(f)\n\n }\n\n}\n\n\n\nimpl<'i, 's> LexWith<'i, &'s Scheme> for FilterAst<'s> {\n\n fn lex_with(input: &'i str, scheme: &'s Scheme) -> LexResult<'i, Self> {\n\n let (op, input) = CombinedExpr::lex_with(input, scheme)?;\n\n Ok((FilterAst { scheme, op }, input))\n\n }\n\n}\n\n\n\nimpl<'s> FilterAst<'s> {\n\n /// Recursively checks whether a [`FilterAst`] uses a given field name.\n\n ///\n\n /// This is useful to lazily initialise expensive fields only if necessary.\n\n pub fn uses(&self, field_name: &str) -> Result<bool, UnknownFieldError> {\n\n self.scheme\n\n .get_field_index(field_name)\n\n .map(|field| self.op.uses(field))\n\n }\n\n\n\n /// Compiles a [`FilterAst`] into a [`Filter`].\n\n pub fn compile(self) -> Filter<'s> {\n\n Filter::new(self.op.compile(), self.scheme)\n\n }\n\n}\n","file_path":"engine/src/ast/mod.rs","rank":58,"score":15.307466324799751},{"content":"mod combined_expr;\n\nmod field_expr;\n\nmod simple_expr;\n\n\n\nuse self::combined_expr::CombinedExpr;\n\nuse filter::{CompiledExpr, Filter};\n\nuse lex::{LexResult, LexWith};\n\nuse scheme::{Field, Scheme, UnknownFieldError};\n\nuse serde::Serialize;\n\nuse std::fmt::{self, Debug};\n\n\n","file_path":"engine/src/ast/mod.rs","rank":59,"score":15.055890668444004},{"content":"use cidr::{Cidr, IpCidr, Ipv4Cidr, Ipv6Cidr, NetworkParseError};\n\nuse lex::{take_while, Lex, LexError, LexErrorKind, LexResult};\n\nuse serde::Serialize;\n\nuse std::{\n\n cmp::Ordering,\n\n net::{IpAddr, Ipv4Addr, Ipv6Addr},\n\n ops::RangeInclusive,\n\n str::FromStr,\n\n};\n\nuse strict_partial_ord::StrictPartialOrd;\n\n\n","file_path":"engine/src/rhs_types/ip.rs","rank":60,"score":15.049710684039098},{"content":" _ => {\n\n return Err((\n\n LexErrorKind::InvalidCharacterEscape,\n\n &input[..c.len_utf8()],\n\n ));\n\n }\n\n });\n\n }\n\n '\"' => return Ok((res.into(), iter.as_str())),\n\n c => res.push(c),\n\n };\n\n }\n\n } else {\n\n let mut res = Vec::new();\n\n loop {\n\n let (b, rest) = hex_byte(input)?;\n\n res.push(b);\n\n input = rest;\n\n if let Ok((_, rest)) = ByteSeparator::lex(input) {\n\n input = rest;\n","file_path":"engine/src/rhs_types/bytes.rs","rank":61,"score":14.519254634798783},{"content":"\n\nimpl<'s> CombinedExpr<'s> {\n\n fn lex_combining_op(input: &str) -> (Option<CombiningOp>, &str) {\n\n match CombiningOp::lex(skip_space(input)) {\n\n Ok((op, input)) => (Some(op), skip_space(input)),\n\n Err(_) => (None, input),\n\n }\n\n }\n\n\n\n fn lex_more_with_precedence<'i>(\n\n self,\n\n scheme: &'s Scheme,\n\n min_prec: Option<CombiningOp>,\n\n mut lookahead: (Option<CombiningOp>, &'i str),\n\n ) -> LexResult<'i, Self> {\n\n let mut lhs = self;\n\n\n\n while let Some(op) = lookahead.0 {\n\n let mut rhs = SimpleExpr::lex_with(lookahead.1, scheme)\n\n .map(|(op, input)| (CombinedExpr::Simple(op), input))?;\n","file_path":"engine/src/ast/combined_expr.rs","rank":62,"score":13.985088915080864},{"content":"use lex::{Lex, LexResult};\n\nuse serde::Serialize;\n\nuse std::{borrow::Borrow, cmp::Ordering};\n\nuse strict_partial_ord::StrictPartialOrd;\n\n\n\n/// [Uninhabited / empty type](https://doc.rust-lang.org/nomicon/exotic-sizes.html#empty-types)\n\n/// for `bool` with traits we need for RHS values.\n\n#[derive(Debug, PartialEq, Eq, Clone, Hash, Serialize)]\n\npub enum UninhabitedBool {}\n\n\n\nimpl Borrow<bool> for UninhabitedBool {\n\n fn borrow(&self) -> &bool {\n\n match *self {}\n\n }\n\n}\n\n\n\nimpl PartialEq<UninhabitedBool> for bool {\n\n fn eq(&self, other: &UninhabitedBool) -> bool {\n\n match *other {}\n\n }\n","file_path":"engine/src/rhs_types/bool.rs","rank":63,"score":13.022325675209263},{"content":"use super::{simple_expr::SimpleExpr, CompiledExpr, Expr};\n\nuse lex::{skip_space, Lex, LexResult, LexWith};\n\nuse scheme::{Field, Scheme};\n\nuse serde::Serialize;\n\n\n\nlex_enum!(#[derive(PartialOrd, Ord)] CombiningOp {\n\n \"or\" | \"||\" => Or,\n\n \"xor\" | \"^^\" => Xor,\n\n \"and\" | \"&&\" => And,\n\n});\n\n\n\n#[derive(Debug, PartialEq, Eq, Clone, Serialize)]\n\n#[serde(untagged)]\n\npub enum CombinedExpr<'s> {\n\n Simple(SimpleExpr<'s>),\n\n Combining {\n\n op: CombiningOp,\n\n items: Vec<CombinedExpr<'s>>,\n\n },\n\n}\n","file_path":"engine/src/ast/combined_expr.rs","rank":64,"score":12.290207064979448},{"content":"use super::{combined_expr::CombinedExpr, field_expr::FieldExpr, CompiledExpr, Expr};\n\nuse lex::{expect, skip_space, Lex, LexResult, LexWith};\n\nuse scheme::{Field, Scheme};\n\nuse serde::Serialize;\n\n\n\nlex_enum!(UnaryOp {\n\n \"not\" | \"!\" => Not,\n\n});\n\n\n\n#[derive(Debug, PartialEq, Eq, Clone, Serialize)]\n\n#[serde(untagged)]\n\npub enum SimpleExpr<'s> {\n\n Field(FieldExpr<'s>),\n\n Parenthesized(Box<CombinedExpr<'s>>),\n\n Unary {\n\n op: UnaryOp,\n\n arg: Box<SimpleExpr<'s>>,\n\n },\n\n}\n\n\n","file_path":"engine/src/ast/simple_expr.rs","rank":65,"score":12.10417228831787},{"content":"use super::{CompiledExpr, Expr};\n\nuse fnv::FnvBuildHasher;\n\nuse heap_searcher::HeapSearcher;\n\nuse indexmap::IndexSet;\n\nuse lex::{skip_space, span, Lex, LexErrorKind, LexResult, LexWith};\n\nuse memmem::Searcher;\n\nuse range_set::RangeSet;\n\nuse rhs_types::{Bytes, ExplicitIpRange, Regex};\n\nuse scheme::{Field, Scheme};\n\nuse serde::{Serialize, Serializer};\n\nuse std::{cmp::Ordering, net::IpAddr};\n\nuse strict_partial_ord::StrictPartialOrd;\n\nuse types::{GetType, LhsValue, RhsValue, RhsValues, Type};\n\n\n\nconst LESS: u8 = 0b001;\n\nconst GREATER: u8 = 0b010;\n\nconst EQUAL: u8 = 0b100;\n\n\n\nlex_enum!(#[repr(u8)] OrderingOp {\n\n \"eq\" | \"==\" => Equal = EQUAL,\n","file_path":"engine/src/ast/field_expr.rs","rank":66,"score":11.580996182936047},{"content":" V6(RangeInclusive<Ipv6Addr>),\n\n}\n\n\n\n#[derive(PartialEq, Eq, Clone, Serialize, Debug)]\n\n#[serde(untagged)]\n\npub enum IpRange {\n\n Explicit(ExplicitIpRange),\n\n Cidr(IpCidr),\n\n}\n\n\n\nimpl<'i> Lex<'i> for IpRange {\n\n fn lex(input: &str) -> LexResult<'_, Self> {\n\n let (chunk, rest) = match_addr_or_cidr(input)?;\n\n\n\n // check for \"..\" before trying to lex an address\n\n let range = if let Some(split_pos) = chunk.find(\"..\") {\n\n let first = parse_addr(&chunk[..split_pos])?;\n\n let last = parse_addr(&chunk[split_pos + \"..\".len()..])?;\n\n\n\n IpRange::Explicit(match (first, last) {\n","file_path":"engine/src/rhs_types/ip.rs","rank":67,"score":11.51351987349307},{"content":" ']' if in_char_class => {\n\n in_char_class = false;\n\n regex_buf.push(']');\n\n }\n\n c => {\n\n regex_buf.push(c);\n\n }\n\n };\n\n }\n\n };\n\n match Regex::from_str(®ex_buf) {\n\n Ok(regex) => Ok((regex, input)),\n\n Err(err) => Err((LexErrorKind::ParseRegex(err), regex_str)),\n\n }\n\n }\n\n}\n\n\n\nimpl Serialize for Regex {\n\n fn serialize<S: Serializer>(&self, ser: S) -> Result<S::Ok, S::Error> {\n\n self.as_str().serialize(ser)\n\n }\n\n}\n\n\n\n#[test]\n","file_path":"engine/src/rhs_types/regex/mod.rs","rank":68,"score":11.45761371861143},{"content":"\n\nimpl<'i> Error for ParseError<'i> {}\n\n\n\nimpl<'i> ParseError<'i> {\n\n pub(crate) fn new(mut input: &'i str, (kind, span): (LexErrorKind, &'i str)) -> Self {\n\n let mut span_start = span.as_ptr() as usize - input.as_ptr() as usize;\n\n\n\n let (line_number, line_start) = input[..span_start]\n\n .match_indices('\\n')\n\n .map(|(pos, _)| pos + 1)\n\n .scan(0, |line_number, line_start| {\n\n *line_number += 1;\n\n Some((*line_number, line_start))\n\n })\n\n .last()\n\n .unwrap_or_default();\n\n\n\n input = &input[line_start..];\n\n\n\n span_start -= line_start;\n","file_path":"engine/src/scheme.rs","rank":70,"score":11.028459724049627},{"content":"use lex::{expect, span, take_while, Lex, LexErrorKind, LexResult};\n\nuse std::ops::RangeInclusive;\n\nuse strict_partial_ord::StrictPartialOrd;\n\n\n","file_path":"engine/src/rhs_types/int.rs","rank":71,"score":10.895283045597253},{"content":"use std::alloc::System;\n\n\n\n// Most of our usage will be via FFI as a dynamic library, so we're interested\n\n// in performance with system allocator and not jemalloc.\n\n#[global_allocator]\n\nstatic A: System = System;\n\n\n\nextern crate criterion;\n\nextern crate wirefilter;\n\n\n\nuse criterion::{\n\n criterion_group, criterion_main, Bencher, Benchmark, Criterion, ParameterizedBenchmark,\n\n};\n\nuse std::{fmt::Debug, net::IpAddr};\n\nuse wirefilter::{ExecutionContext, GetType, LhsValue, Scheme};\n\n\n","file_path":"engine/benches/bench.rs","rank":72,"score":10.849952569494253},{"content":"\n\nimpl From<Bytes> for Box<[u8]> {\n\n fn from(bytes: Bytes) -> Self {\n\n match bytes {\n\n Bytes::Str(s) => s.into_boxed_bytes(),\n\n Bytes::Raw(b) => b,\n\n }\n\n }\n\n}\n\n\n\nimpl Debug for Bytes {\n\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\n\n match self {\n\n Bytes::Str(s) => s.fmt(f),\n\n Bytes::Raw(b) => {\n\n for (i, b) in b.iter().cloned().enumerate() {\n\n if i != 0 {\n\n write!(f, \":\")?;\n\n }\n\n write!(f, \"{:02X}\", b)?;\n","file_path":"engine/src/rhs_types/bytes.rs","rank":73,"score":10.695678643866891},{"content":" let (_, rest) = lex_digits(without_neg)?;\n\n\n\n parse_number((span(input, rest), rest), 10)\n\n }\n\n }\n\n}\n\n\n\nimpl<'i> Lex<'i> for RangeInclusive<i32> {\n\n fn lex(input: &str) -> LexResult<'_, Self> {\n\n let initial_input = input;\n\n let (first, input) = i32::lex(input)?;\n\n let (last, input) = if let Ok(input) = expect(input, \"..\") {\n\n i32::lex(input)?\n\n } else {\n\n (first, input)\n\n };\n\n if last < first {\n\n return Err((\n\n LexErrorKind::IncompatibleRangeBounds,\n\n span(initial_input, input),\n\n ));\n\n }\n\n Ok((first..=last, input))\n\n }\n\n}\n\n\n\nimpl StrictPartialOrd for i32 {}\n\n\n","file_path":"engine/src/rhs_types/int.rs","rank":74,"score":10.331178518624867},{"content":" drop(s);\n\n}\n\n\n\n#[no_mangle]\n\npub extern \"C\" fn wirefilter_parse_filter<'s, 'i>(\n\n scheme: &'s Scheme,\n\n input: ExternallyAllocatedStr<'i>,\n\n) -> ParsingResult<'s> {\n\n match scheme.parse(input.into_ref()) {\n\n Ok(filter) => ParsingResult::from(filter),\n\n Err(err) => ParsingResult::from(err),\n\n }\n\n}\n\n\n\n/// Wrapper for Hasher that allows using Write API (e.g. with serializer).\n\n#[derive(Default)]\n","file_path":"ffi/src/lib.rs","rank":75,"score":10.168287781577332},{"content":"impl<'i, 's> LexWith<'i, &'s Scheme> for SimpleExpr<'s> {\n\n fn lex_with(input: &'i str, scheme: &'s Scheme) -> LexResult<'i, Self> {\n\n Ok(if let Ok(input) = expect(input, \"(\") {\n\n let input = skip_space(input);\n\n let (op, input) = CombinedExpr::lex_with(input, scheme)?;\n\n let input = skip_space(input);\n\n let input = expect(input, \")\")?;\n\n (SimpleExpr::Parenthesized(Box::new(op)), input)\n\n } else if let Ok((op, input)) = UnaryOp::lex(input) {\n\n let input = skip_space(input);\n\n let (arg, input) = SimpleExpr::lex_with(input, scheme)?;\n\n (\n\n SimpleExpr::Unary {\n\n op,\n\n arg: Box::new(arg),\n\n },\n\n input,\n\n )\n\n } else {\n\n let (op, input) = FieldExpr::lex_with(input, scheme)?;\n","file_path":"engine/src/ast/simple_expr.rs","rank":76,"score":10.1127520911776},{"content":" {\n\n '\\\\' => {\n\n let input = iter.as_str();\n\n\n\n let c = iter\n\n .next()\n\n .ok_or_else(|| (LexErrorKind::MissingEndingQuote, full_input))?;\n\n\n\n res.push(match c {\n\n '\"' | '\\\\' => c,\n\n 'x' => {\n\n let (b, input) = hex_byte(iter.as_str())?;\n\n iter = input.chars();\n\n b as char\n\n }\n\n '0'..='7' => {\n\n let (b, input) = oct_byte(input)?;\n\n iter = input.chars();\n\n b as char\n\n }\n","file_path":"engine/src/rhs_types/bytes.rs","rank":77,"score":10.013854440348531},{"content":" ExternallyAllocatedStr::from(\"num1\"),\n\n 42,\n\n );\n\n\n\n wirefilter_add_int_value_to_execution_context(\n\n &mut exec_context,\n\n ExternallyAllocatedStr::from(\"num2\"),\n\n 1337,\n\n );\n\n\n\n exec_context\n\n }\n\n\n\n fn parse_filter<'s>(scheme: &'s Scheme, input: &'static str) -> ParsingResult<'s> {\n\n wirefilter_parse_filter(scheme, ExternallyAllocatedStr::from(input))\n\n }\n\n\n\n fn match_filter(\n\n input: &'static str,\n\n scheme: &Scheme,\n","file_path":"ffi/src/lib.rs","rank":78,"score":9.814869563253833},{"content":" op,\n\n items: vec![lhs, rhs.0],\n\n };\n\n }\n\n }\n\n\n\n if lookahead.0 < min_prec {\n\n // pretend we haven't seen an operator if its precedence is\n\n // outside of our limits\n\n lookahead = (None, rhs.1);\n\n }\n\n }\n\n\n\n Ok((lhs, lookahead.1))\n\n }\n\n}\n\n\n\nimpl<'i, 's> LexWith<'i, &'s Scheme> for CombinedExpr<'s> {\n\n fn lex_with(input: &'i str, scheme: &'s Scheme) -> LexResult<'i, Self> {\n\n let (lhs, input) = SimpleExpr::lex_with(input, scheme)?;\n","file_path":"engine/src/ast/combined_expr.rs","rank":79,"score":9.634532941251187},{"content":"#[derive(Debug, PartialEq, Fail)]\n\n#[fail(display = \"unknown field\")]\n\npub struct UnknownFieldError;\n\n\n\n/// An error that occurs when previously defined field gets redefined.\n\n#[derive(Debug, PartialEq, Fail)]\n\n#[fail(display = \"attempt to redefine field {}\", _0)]\n\npub struct FieldRedefinitionError(String);\n\n\n\n/// An opaque filter parsing error associated with the original input.\n\n///\n\n/// For now, you can just print it in a debug or a human-readable fashion.\n\n#[derive(Debug, PartialEq)]\n\npub struct ParseError<'i> {\n\n kind: LexErrorKind,\n\n input: &'i str,\n\n line_number: usize,\n\n span_start: usize,\n\n span_len: usize,\n\n}\n","file_path":"engine/src/scheme.rs","rank":80,"score":9.548293588677325},{"content":"use std::str::FromStr;\n\n\n\npub use regex::Error;\n\n\n\n#[derive(Clone)]\n\npub struct Regex(regex::bytes::Regex);\n\n\n\nimpl FromStr for Regex {\n\n type Err = Error;\n\n\n\n fn from_str(s: &str) -> Result<Self, Error> {\n\n ::regex::bytes::RegexBuilder::new(s)\n\n .unicode(false)\n\n .build()\n\n .map(Regex)\n\n }\n\n}\n\n\n\nimpl Regex {\n\n pub fn is_match(&self, text: &[u8]) -> bool {\n\n self.0.is_match(text)\n\n }\n\n\n\n pub fn as_str(&self) -> &str {\n\n self.0.as_str()\n\n }\n\n}\n","file_path":"engine/src/rhs_types/regex/imp_real.rs","rank":81,"score":9.432224044801089},{"content":" let mut span_len = span.len();\n\n\n\n if let Some(line_end) = input.find('\\n') {\n\n input = &input[..line_end];\n\n span_len = min(span_len, line_end - span_start);\n\n }\n\n\n\n ParseError {\n\n kind,\n\n input,\n\n line_number,\n\n span_start,\n\n span_len,\n\n }\n\n }\n\n}\n\n\n\nimpl<'i> Display for ParseError<'i> {\n\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\n\n writeln!(\n","file_path":"engine/src/scheme.rs","rank":82,"score":9.397730586761272},{"content":" use rhs_types::IpRange;\n\n use std::net::IpAddr;\n\n\n\n lazy_static! {\n\n static ref SCHEME: Scheme = Scheme! {\n\n http.host: Bytes,\n\n ip.addr: Ip,\n\n ssl: Bool,\n\n tcp.port: Int,\n\n };\n\n }\n\n\n\n fn field(name: &'static str) -> Field<'static> {\n\n SCHEME.get_field_index(name).unwrap()\n\n }\n\n\n\n #[test]\n\n fn test_is_true() {\n\n let expr = assert_ok!(\n\n FieldExpr::lex_with(\"ssl\", &SCHEME),\n","file_path":"engine/src/ast/field_expr.rs","rank":83,"score":9.106336360456845},{"content":" .1;\n\n\n\n match expect(input, \".\") {\n\n Ok(rest) => input = rest,\n\n Err(_) => break,\n\n };\n\n }\n\n\n\n let name = span(initial_input, input);\n\n\n\n let field = scheme\n\n .get_field_index(name)\n\n .map_err(|err| (LexErrorKind::UnknownField(err), name))?;\n\n\n\n Ok((field, input))\n\n }\n\n}\n\n\n\nimpl<'s> Field<'s> {\n\n pub fn name(&self) -> &'s str {\n","file_path":"engine/src/scheme.rs","rank":85,"score":8.75607097275675},{"content":"}\n\n\n\nimpl PartialOrd<UninhabitedBool> for bool {\n\n fn partial_cmp(&self, other: &UninhabitedBool) -> Option<Ordering> {\n\n match *other {}\n\n }\n\n}\n\n\n\nimpl StrictPartialOrd<UninhabitedBool> for bool {}\n\n\n\nimpl<'i> Lex<'i> for UninhabitedBool {\n\n fn lex(_input: &str) -> LexResult<'_, Self> {\n\n unreachable!()\n\n }\n\n}\n","file_path":"engine/src/rhs_types/bool.rs","rank":86,"score":8.733453755354713},{"content":"\n\n assert!(re.is_match(version.into_ref()));\n\n }\n\n\n\n #[test]\n\n fn filter_uses() {\n\n let scheme = create_scheme();\n\n\n\n {\n\n let filter = parse_filter(\n\n &scheme,\n\n r#\"num1 > 41 && num2 == 1337 && ip1 != 192.168.0.1 && str2 ~ \"yo\\d+\"\"#,\n\n )\n\n .unwrap();\n\n\n\n assert!(wirefilter_filter_uses(\n\n &filter,\n\n ExternallyAllocatedStr::from(\"num1\")\n\n ));\n\n\n","file_path":"ffi/src/lib.rs","rank":87,"score":8.621461123201446},{"content":" let before_char = iter.as_str();\n\n match iter\n\n .next()\n\n .ok_or_else(|| (LexErrorKind::MissingEndingQuote, input))?\n\n {\n\n '\\\\' => {\n\n if let Some(c) = iter.next() {\n\n if in_char_class || c != '\"' {\n\n regex_buf.push('\\\\');\n\n }\n\n regex_buf.push(c);\n\n }\n\n }\n\n '\"' if !in_char_class => {\n\n break (span(input, before_char), iter.as_str());\n\n }\n\n '[' if !in_char_class => {\n\n in_char_class = true;\n\n regex_buf.push('[');\n\n }\n","file_path":"engine/src/rhs_types/regex/mod.rs","rank":88,"score":8.483060275868079},{"content":"}\n\n\n\n#[no_mangle]\n\npub extern \"C\" fn wirefilter_get_version() -> StaticRustAllocatedString {\n\n StaticRustAllocatedString::from(VERSION)\n\n}\n\n\n\n#[cfg(test)]\n\nmod ffi_test {\n\n use super::*;\n\n use regex::Regex;\n\n\n\n fn create_scheme() -> RustBox<Scheme> {\n\n let mut scheme = wirefilter_create_scheme();\n\n\n\n wirefilter_add_type_field_to_scheme(\n\n &mut scheme,\n\n ExternallyAllocatedStr::from(\"ip1\"),\n\n Type::Ip,\n\n );\n","file_path":"ffi/src/lib.rs","rank":89,"score":8.01632862130547},{"content":" Some(ordering) => self.matches(ordering),\n\n // only `!=` should be true for incomparable types\n\n None => self == OrderingOp::NotEqual,\n\n }\n\n }\n\n}\n\n\n\nlex_enum!(IntOp {\n\n \"&\" | \"bitwise_and\" => BitwiseAnd,\n\n});\n\n\n\nlex_enum!(BytesOp {\n\n \"contains\" => Contains,\n\n \"~\" | \"matches\" => Matches,\n\n});\n\n\n\nlex_enum!(ComparisonOp {\n\n \"in\" => In,\n\n OrderingOp => Ordering,\n\n IntOp => Int,\n\n BytesOp => Bytes,\n\n});\n\n\n\n#[derive(Debug, PartialEq, Eq, Clone, Serialize)]\n\n#[serde(untagged)]\n","file_path":"engine/src/ast/field_expr.rs","rank":90,"score":7.936023558075213},{"content":"\n\n loop {\n\n lookahead = Self::lex_combining_op(rhs.1);\n\n if lookahead.0 <= Some(op) {\n\n break;\n\n }\n\n rhs = rhs\n\n .0\n\n .lex_more_with_precedence(scheme, lookahead.0, lookahead)?;\n\n }\n\n\n\n match lhs {\n\n CombinedExpr::Combining {\n\n op: lhs_op,\n\n ref mut items,\n\n } if lhs_op == op => {\n\n items.push(rhs.0);\n\n }\n\n _ => {\n\n lhs = CombinedExpr::Combining {\n","file_path":"engine/src/ast/combined_expr.rs","rank":91,"score":7.918928105872222},{"content":" (FieldOp::IsTrue, input)\n\n } else {\n\n let (op, input) = ComparisonOp::lex(skip_space(input))?;\n\n\n\n let input_after_op = input;\n\n\n\n let input = skip_space(input);\n\n\n\n match (field_type, op) {\n\n (_, ComparisonOp::In) => {\n\n let (rhs, input) = RhsValues::lex_with(input, field_type)?;\n\n (FieldOp::OneOf(rhs), input)\n\n }\n\n (_, ComparisonOp::Ordering(op)) => {\n\n let (rhs, input) = RhsValue::lex_with(input, field_type)?;\n\n (FieldOp::Ordering { op, rhs }, input)\n\n }\n\n (Type::Int, ComparisonOp::Int(op)) => {\n\n let (rhs, input) = i32::lex(input)?;\n\n (FieldOp::Int { op, rhs }, input)\n","file_path":"engine/src/ast/field_expr.rs","rank":92,"score":7.870027807350461},{"content":"use super::ExternPtrRepr;\n\nuse libc::size_t;\n\nuse std::slice;\n\n\n\n/// This structure provides FFI-safe representation for Rust slice pointers\n\n/// by splitting them into data and length parts.\n\n///\n\n/// Example C definition for `ExternSliceRepr<u8>`:\n\n/// ```\n\n/// struct ByteSlice {\n\n/// const uint8_t *data;\n\n/// size_t length;\n\n/// };\n\n/// ```\n\n#[repr(C)]\n\npub struct ExternSliceRepr<T> {\n\n data: *mut T,\n\n length: size_t,\n\n}\n\n\n","file_path":"ffi/src/transfer_types/raw_ptr_repr/slice.rs","rank":93,"score":7.785183624151369},{"content":" }\n\n (Type::Bytes, ComparisonOp::Bytes(op)) => match op {\n\n BytesOp::Contains => {\n\n let (bytes, input) = Bytes::lex(input)?;\n\n (FieldOp::Contains(bytes), input)\n\n }\n\n BytesOp::Matches => {\n\n let (regex, input) = Regex::lex(input)?;\n\n (FieldOp::Matches(regex), input)\n\n }\n\n },\n\n _ => {\n\n return Err((\n\n LexErrorKind::UnsupportedOp { field_type },\n\n span(initial_input, input_after_op),\n\n ));\n\n }\n\n }\n\n };\n\n\n","file_path":"engine/src/ast/field_expr.rs","rank":94,"score":7.755722414656348},{"content":" let lookahead = Self::lex_combining_op(input);\n\n CombinedExpr::Simple(lhs).lex_more_with_precedence(scheme, None, lookahead)\n\n }\n\n}\n\n\n\nimpl<'s> Expr<'s> for CombinedExpr<'s> {\n\n fn uses(&self, field: Field<'s>) -> bool {\n\n match self {\n\n CombinedExpr::Simple(op) => op.uses(field),\n\n CombinedExpr::Combining { items, .. } => items.iter().any(|op| op.uses(field)),\n\n }\n\n }\n\n\n\n fn compile(self) -> CompiledExpr<'s> {\n\n match self {\n\n CombinedExpr::Simple(op) => op.compile(),\n\n CombinedExpr::Combining { op, items } => {\n\n let items = items\n\n .into_iter()\n\n .map(|item| item.compile())\n","file_path":"engine/src/ast/combined_expr.rs","rank":95,"score":7.7391618269210625},{"content":" assert!(wirefilter_filter_uses(\n\n &filter,\n\n ExternallyAllocatedStr::from(\"ip1\")\n\n ));\n\n\n\n assert!(wirefilter_filter_uses(\n\n &filter,\n\n ExternallyAllocatedStr::from(\"str2\")\n\n ));\n\n\n\n assert!(!wirefilter_filter_uses(\n\n &filter,\n\n ExternallyAllocatedStr::from(\"str1\")\n\n ));\n\n\n\n assert!(!wirefilter_filter_uses(\n\n &filter,\n\n ExternallyAllocatedStr::from(\"ip2\")\n\n ));\n\n\n\n wirefilter_free_parsed_filter(filter);\n\n }\n\n\n\n wirefilter_free_scheme(scheme);\n\n }\n\n}\n","file_path":"ffi/src/lib.rs","rank":96,"score":7.548741501634594},{"content":" Some((index, ..)) => Ok(Field {\n\n scheme: self,\n\n index,\n\n }),\n\n None => Err(UnknownFieldError),\n\n }\n\n }\n\n\n\n pub(crate) fn get_field_count(&self) -> usize {\n\n self.fields.len()\n\n }\n\n\n\n /// Parses a filter into an AST form.\n\n pub fn parse<'i>(&'s self, input: &'i str) -> Result<FilterAst<'s>, ParseError<'i>> {\n\n complete(FilterAst::lex_with(input.trim(), self)).map_err(|err| ParseError::new(input, err))\n\n }\n\n}\n\n\n\n/// A convenience macro for constructing a [`Scheme`](struct@Scheme) with static\n\n/// contents.\n","file_path":"engine/src/scheme.rs","rank":97,"score":7.504822190122187},{"content":"extern crate wirefilter;\n\n\n\nuse std::env::args;\n\nuse wirefilter::Scheme;\n\n\n","file_path":"engine/examples/cli.rs","rank":98,"score":7.423652439772343},{"content":" Bytes::lex(r#\"\"\\01😢\"\"#),\n\n LexErrorKind::ParseInt {\n\n err: u8::from_str_radix(\"01😢\", 8).unwrap_err(),\n\n radix: 8,\n\n },\n\n \"01😢\"\n\n );\n\n\n\n assert_err!(\n\n Bytes::lex(r#\"\"\\x3😢\"\"#),\n\n LexErrorKind::ParseInt {\n\n err: u8::from_str_radix(\"3😢\", 16).unwrap_err(),\n\n radix: 16,\n\n },\n\n \"3😢\"\n\n );\n\n\n\n assert_err!(\n\n Bytes::lex(\"12:3😢\"),\n\n LexErrorKind::ParseInt {\n\n err: u8::from_str_radix(\"3😢\", 16).unwrap_err(),\n\n radix: 16,\n\n },\n\n \"3😢\"\n\n );\n\n}\n","file_path":"engine/src/rhs_types/bytes.rs","rank":99,"score":7.406381839017225}],"string":"[\n {\n \"content\": \"fn lex_digits(input: &str) -> LexResult<'_, &str> {\\n\\n // Lex any supported digits (up to radix 16) for better error locations.\\n\\n take_while(input, \\\"digit\\\", |c| c.is_digit(16))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"engine/src/rhs_types/int.rs\",\n \"rank\": 0,\n \"score\": 184976.2941145299\n },\n {\n \"content\": \"pub fn take(input: &str, expected: usize) -> LexResult<'_, &str> {\\n\\n let mut chars = input.chars();\\n\\n for i in 0..expected {\\n\\n chars.next().ok_or_else(|| {\\n\\n (\\n\\n LexErrorKind::CountMismatch {\\n\\n name: \\\"character\\\",\\n\\n actual: i,\\n\\n expected,\\n\\n },\\n\\n input,\\n\\n )\\n\\n })?;\\n\\n }\\n\\n let rest = chars.as_str();\\n\\n Ok((span(input, rest), rest))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"engine/src/lex.rs\",\n \"rank\": 1,\n \"score\": 175939.4041827986\n },\n {\n \"content\": \"fn match_addr_or_cidr(input: &str) -> LexResult<'_, &str> {\\n\\n take_while(input, \\\"IP address character\\\", |c| match c {\\n\\n '0'..='9' | 'a'..='f' | 'A'..='F' | ':' | '.' | '/' => true,\\n\\n _ => false,\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"engine/src/rhs_types/ip.rs\",\n \"rank\": 2,\n \"score\": 173145.4763350632\n },\n {\n \"content\": \"pub fn skip_space(input: &str) -> &str {\\n\\n input.trim_start_matches(SPACE_CHARS)\\n\\n}\\n\\n\\n\\n/// This macro generates enum declaration + lexer implementation.\\n\\n///\\n\\n/// It works by recursively processing variants one by one, while passing\\n\\n/// around intermediate state (partial declaration and lexer bodies).\\n\\nmacro_rules! lex_enum {\\n\\n // Branch for handling `SomeType => VariantName`.\\n\\n //\\n\\n // Creates a newtype variant `VariantName(SomeType)`.\\n\\n //\\n\\n // On the parser side, tries to parse `SomeType` and wraps into the variant\\n\\n // on success.\\n\\n (@decl $preamble:tt $name:ident $input:ident { $($decl:tt)* } { $($expr:tt)* } {\\n\\n $ty:ty => $item:ident,\\n\\n $($rest:tt)*\\n\\n }) => {\\n\\n lex_enum!(@decl $preamble $name $input {\\n\",\n \"file_path\": \"engine/src/lex.rs\",\n \"rank\": 3,\n \"score\": 170599.38602478488\n },\n {\n \"content\": \"pub fn span<'i>(input: &'i str, rest: &'i str) -> &'i str {\\n\\n &input[..input.len() - rest.len()]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"engine/src/lex.rs\",\n \"rank\": 5,\n \"score\": 162954.3854636584\n },\n {\n \"content\": \"fn hex_byte(input: &str) -> LexResult<'_, u8> {\\n\\n fixed_byte(input, 2, 16)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"engine/src/rhs_types/bytes.rs\",\n \"rank\": 6,\n \"score\": 160462.79750794952\n },\n {\n \"content\": \"fn oct_byte(input: &str) -> LexResult<'_, u8> {\\n\\n fixed_byte(input, 3, 8)\\n\\n}\\n\\n\\n\\nlex_enum!(ByteSeparator {\\n\\n \\\":\\\" => Colon,\\n\\n \\\"-\\\" => Dash,\\n\\n \\\".\\\" => Dot,\\n\\n});\\n\\n\\n\\nimpl<'i> Lex<'i> for Bytes {\\n\\n fn lex(mut input: &str) -> LexResult<'_, Self> {\\n\\n if let Ok(input) = expect(input, \\\"\\\\\\\"\\\") {\\n\\n let full_input = input;\\n\\n let mut res = String::new();\\n\\n let mut iter = input.chars();\\n\\n loop {\\n\\n match iter\\n\\n .next()\\n\\n .ok_or_else(|| (LexErrorKind::MissingEndingQuote, full_input))?\\n\",\n \"file_path\": \"engine/src/rhs_types/bytes.rs\",\n \"rank\": 7,\n \"score\": 160462.79750794952\n },\n {\n \"content\": \"pub fn expect<'i>(input: &'i str, s: &'static str) -> Result<&'i str, LexError<'i>> {\\n\\n if input.starts_with(s) {\\n\\n Ok(&input[s.len()..])\\n\\n } else {\\n\\n Err((LexErrorKind::ExpectedLiteral(s), input))\\n\\n }\\n\\n}\\n\\n\\n\\n// Tabs are harder to format as part of the error message because they have\\n\\n// a different printable width than other characters, and so become a common\\n\\n// source of issues in different compilers.\\n\\n//\\n\\n// It's not impossible to work around that limitation, but let's not bother\\n\\n// for now until someone really needs them (tabs vs spaces all the way down...).\\n\\nconst SPACE_CHARS: &[char] = &[' ', '\\\\r', '\\\\n'];\\n\\n\\n\",\n \"file_path\": \"engine/src/lex.rs\",\n \"rank\": 8,\n \"score\": 159593.33380547096\n },\n {\n \"content\": \"fn parse_number<'i>((input, rest): (&'i str, &'i str), radix: u32) -> LexResult<'_, i32> {\\n\\n match i32::from_str_radix(input, radix) {\\n\\n Ok(res) => Ok((res, rest)),\\n\\n Err(err) => Err((LexErrorKind::ParseInt { err, radix }, input)),\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'i> Lex<'i> for i32 {\\n\\n fn lex(input: &str) -> LexResult<'_, Self> {\\n\\n if let Ok(input) = expect(input, \\\"0x\\\") {\\n\\n parse_number(lex_digits(input)?, 16)\\n\\n } else if input.starts_with('0') {\\n\\n // not using `expect` because we want to include `0` too\\n\\n parse_number(lex_digits(input)?, 8)\\n\\n } else {\\n\\n let without_neg = match expect(input, \\\"-\\\") {\\n\\n Ok(input) => input,\\n\\n Err(_) => input,\\n\\n };\\n\\n\\n\",\n \"file_path\": \"engine/src/rhs_types/int.rs\",\n \"rank\": 9,\n \"score\": 147936.4133737964\n },\n {\n \"content\": \"fn fixed_byte(input: &str, digits: usize, radix: u32) -> LexResult<'_, u8> {\\n\\n let (digits, rest) = take(input, digits)?;\\n\\n match u8::from_str_radix(digits, radix) {\\n\\n Ok(b) => Ok((b, rest)),\\n\\n Err(err) => Err((LexErrorKind::ParseInt { err, radix }, digits)),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"engine/src/rhs_types/bytes.rs\",\n \"rank\": 10,\n \"score\": 138772.6915829843\n },\n {\n \"content\": \"fn parse_addr(input: &str) -> Result<IpAddr, LexError<'_>> {\\n\\n IpAddr::from_str(input).map_err(|err| {\\n\\n (\\n\\n LexErrorKind::ParseNetwork(NetworkParseError::AddrParseError(err)),\\n\\n input,\\n\\n )\\n\\n })\\n\\n}\\n\\n\\n\\nimpl<'i> Lex<'i> for IpAddr {\\n\\n fn lex(input: &str) -> LexResult<'_, Self> {\\n\\n let (input, rest) = match_addr_or_cidr(input)?;\\n\\n parse_addr(input).map(|res| (res, rest))\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(PartialEq, Eq, Clone, Serialize, Debug)]\\n\\n#[serde(untagged)]\\n\\npub enum ExplicitIpRange {\\n\\n V4(RangeInclusive<Ipv4Addr>),\\n\",\n \"file_path\": \"engine/src/rhs_types/ip.rs\",\n \"rank\": 11,\n \"score\": 135694.85099885243\n },\n {\n \"content\": \"trait Expr<'s>: Sized + Eq + Debug + for<'i> LexWith<'i, &'s Scheme> + Serialize {\\n\\n fn uses(&self, field: Field<'s>) -> bool;\\n\\n fn compile(self) -> CompiledExpr<'s>;\\n\\n}\\n\\n\\n\\n/// A parsed filter AST.\\n\\n///\\n\\n/// It's attached to its corresponding [`Scheme`](struct@Scheme) because all\\n\\n/// parsed fields are represented as indices and are valid only when\\n\\n/// [`ExecutionContext`](::ExecutionContext) is created from the same scheme.\\n\\n#[derive(PartialEq, Eq, Serialize, Clone)]\\n\\n#[serde(transparent)]\\n\\npub struct FilterAst<'s> {\\n\\n #[serde(skip)]\\n\\n scheme: &'s Scheme,\\n\\n\\n\\n op: CombinedExpr<'s>,\\n\\n}\\n\\n\\n\\nimpl<'s> Debug for FilterAst<'s> {\\n\",\n \"file_path\": \"engine/src/ast/mod.rs\",\n \"rank\": 12,\n \"score\": 103760.22092051001\n },\n {\n \"content\": \"fn bench_string_comparisons(c: &mut Criterion) {\\n\\n FieldBench {\\n\\n field: \\\"ip.geoip.country\\\",\\n\\n filters: &[\\n\\n r#\\\"ip.geoip.country == \\\"GB\\\"\\\"#,\\n\\n r#\\\"ip.geoip.country in { \\\"AT\\\" \\\"BE\\\" \\\"BG\\\" \\\"HR\\\" \\\"CY\\\" \\\"CZ\\\" \\\"DK\\\" \\\"EE\\\" \\\"FI\\\" \\\"FR\\\" \\\"DE\\\" \\\"GR\\\" \\\"HU\\\" \\\"IE\\\" \\\"IT\\\" \\\"LV\\\" \\\"LT\\\" \\\"LU\\\" \\\"MT\\\" \\\"NL\\\" \\\"PL\\\" \\\"PT\\\" \\\"RO\\\" \\\"SK\\\" \\\"SI\\\" \\\"ES\\\" \\\"SE\\\" \\\"GB\\\" \\\"GF\\\" \\\"GP\\\" \\\"MQ\\\" \\\"ME\\\" \\\"YT\\\" \\\"RE\\\" \\\"MF\\\" \\\"GI\\\" \\\"AX\\\" \\\"PM\\\" \\\"GL\\\" \\\"BL\\\" \\\"SX\\\" \\\"AW\\\" \\\"CW\\\" \\\"WF\\\" \\\"PF\\\" \\\"NC\\\" \\\"TF\\\" \\\"AI\\\" \\\"BM\\\" \\\"IO\\\" \\\"VG\\\" \\\"KY\\\" \\\"FK\\\" \\\"MS\\\" \\\"PN\\\" \\\"SH\\\" \\\"GS\\\" \\\"TC\\\" \\\"AD\\\" \\\"LI\\\" \\\"MC\\\" \\\"SM\\\" \\\"VA\\\" \\\"JE\\\" \\\"GG\\\" \\\"GI\\\" \\\"CH\\\" }\\\"#,\\n\\n ],\\n\\n values: &[\\\"GB\\\", \\\"T1\\\"],\\n\\n }.run(c)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"engine/benches/bench.rs\",\n \"rank\": 13,\n \"score\": 88261.08435656843\n },\n {\n \"content\": \"fn bench_int_comparisons(c: &mut Criterion) {\\n\\n FieldBench {\\n\\n field: \\\"tcp.port\\\",\\n\\n filters: &[\\n\\n \\\"tcp.port == 80\\\",\\n\\n \\\"tcp.port >= 1024\\\",\\n\\n \\\"tcp.port in { 80 8080 8880 2052 2082 2086 2095 }\\\",\\n\\n ],\\n\\n values: &[80, 8081],\\n\\n }\\n\\n .run(c)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"engine/benches/bench.rs\",\n \"rank\": 14,\n \"score\": 88261.08435656843\n },\n {\n \"content\": \"fn bench_string_matches(c: &mut Criterion) {\\n\\n FieldBench {\\n\\n field: \\\"http.user_agent\\\",\\n\\n filters: &[\\n\\n r#\\\"http.user_agent ~ \\\"(?i)googlebot/\\\\d+\\\\.\\\\d+\\\"\\\"#,\\n\\n r#\\\"http.user_agent ~ \\\"Googlebot\\\"\\\"#,\\n\\n r#\\\"http.user_agent contains \\\"Googlebot\\\"\\\"#\\n\\n ],\\n\\n values: &[\\n\\n \\\"Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; Googlebot/2.1; +http://www.google.com/bot.html) Safari/537.36\\\",\\n\\n \\\"Mozilla/5.0 (X11; Linux x86_64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/51.0.2704.103 Safari/537.36\\\"\\n\\n ]\\n\\n }.run(c)\\n\\n}\\n\\n\\n\\ncriterion_group! {\\n\\n name = field_benchmarks;\\n\\n config = Criterion::default();\\n\\n targets =\\n\\n bench_ip_comparisons,\\n\\n bench_int_comparisons,\\n\\n bench_string_comparisons,\\n\\n bench_string_matches,\\n\\n}\\n\\n\\n\\ncriterion_main!(field_benchmarks);\\n\",\n \"file_path\": \"engine/benches/bench.rs\",\n \"rank\": 15,\n \"score\": 88261.08435656843\n },\n {\n \"content\": \"fn bench_ip_comparisons(c: &mut Criterion) {\\n\\n FieldBench {\\n\\n field: \\\"ip.addr\\\",\\n\\n filters: &[\\n\\n \\\"ip.addr == 173.245.48.1\\\",\\n\\n \\\"ip.addr == 2606:4700:4700::1111\\\",\\n\\n \\\"ip.addr >= 173.245.48.0 && ip.addr < 173.245.49.0\\\",\\n\\n \\\"ip.addr >= 2606:4700:: && ip.addr < 2606:4701::\\\",\\n\\n \\\"ip.addr in { 103.21.244.0/22 2405:8100::/32 104.16.0.0/12 2803:f800::/32 131.0.72.0/22 173.245.48.0/20 2405:b500::/32 172.64.0.0/13 190.93.240.0/20 103.22.200.0/22 2606:4700::/32 198.41.128.0/17 197.234.240.0/22 162.158.0.0/15 108.162.192.0/18 2c0f:f248::/32 2400:cb00::/32 103.31.4.0/22 2a06:98c0::/29 141.101.64.0/18 188.114.96.0/20 }\\\"\\n\\n ],\\n\\n values: &[\\n\\n IpAddr::from([127, 0, 0, 1]),\\n\\n IpAddr::from([0x2001, 0x0db8, 0x85a3, 0x0000, 0x0000, 0x8a2e, 0x0370, 0x7334]),\\n\\n IpAddr::from([173, 245, 48, 1]),\\n\\n IpAddr::from([0x2606, 0x4700, 0x4700, 0x0000, 0x0000, 0x0000, 0x0000, 0x1111]),\\n\\n ]\\n\\n }.run(c)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"engine/benches/bench.rs\",\n \"rank\": 16,\n \"score\": 88261.08435656843\n },\n {\n \"content\": \"pub fn complete<T>(res: LexResult<'_, T>) -> Result<T, LexError<'_>> {\\n\\n let (res, input) = res?;\\n\\n if input.is_empty() {\\n\\n Ok(res)\\n\\n } else {\\n\\n Err((LexErrorKind::EOF, input))\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmacro_rules! assert_ok {\\n\\n ($s:expr, $res:expr, $rest:expr) => {{\\n\\n let expr = $s.unwrap();\\n\\n assert_eq!(expr, ($res, $rest));\\n\\n expr.0\\n\\n }};\\n\\n\\n\\n ($s:expr, $res:expr) => {\\n\\n assert_ok!($s, $res, \\\"\\\")\\n\\n };\\n\",\n \"file_path\": \"engine/src/lex.rs\",\n \"rank\": 17,\n \"score\": 82302.68504805892\n },\n {\n \"content\": \"pub fn take_while<'i, F: Fn(char) -> bool>(\\n\\n input: &'i str,\\n\\n name: &'static str,\\n\\n f: F,\\n\\n) -> LexResult<'i, &'i str> {\\n\\n let mut iter = input.chars();\\n\\n loop {\\n\\n let rest = iter.as_str();\\n\\n match iter.next() {\\n\\n Some(c) if f(c) => {}\\n\\n _ => {\\n\\n return if rest.len() != input.len() {\\n\\n Ok((span(input, rest), rest))\\n\\n } else {\\n\\n Err((LexErrorKind::ExpectedName(name), input))\\n\\n };\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"engine/src/lex.rs\",\n \"rank\": 18,\n \"score\": 77085.62932928359\n },\n {\n \"content\": \"#[allow(clippy::needless_pass_by_value)]\\n\\nfn into_js_error(err: impl std::error::Error) -> JsValue {\\n\\n js_sys::Error::new(&err.to_string()).into()\\n\\n}\\n\\n\\n\\n#[wasm_bindgen]\\n\\nimpl Scheme {\\n\\n #[wasm_bindgen(constructor)]\\n\\n pub fn try_from(fields: &JsValue) -> Result<Scheme, JsValue> {\\n\\n fields.into_serde().map(Scheme).map_err(into_js_error)\\n\\n }\\n\\n\\n\\n pub fn parse(&self, s: &str) -> Result<JsValue, JsValue> {\\n\\n let filter = self.0.parse(s).map_err(into_js_error)?;\\n\\n JsValue::from_serde(&filter).map_err(into_js_error)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"wasm/src/lib.rs\",\n \"rank\": 19,\n \"score\": 76923.48239341736\n },\n {\n \"content\": \"fn serialize_op_rhs<T: Serialize, S: Serializer>(\\n\\n op: &'static str,\\n\\n rhs: &T,\\n\\n ser: S,\\n\\n) -> Result<S::Ok, S::Error> {\\n\\n use serde::ser::SerializeStruct;\\n\\n\\n\\n let mut out = ser.serialize_struct(\\\"FieldOp\\\", 2)?;\\n\\n out.serialize_field(\\\"op\\\", op)?;\\n\\n out.serialize_field(\\\"rhs\\\", rhs)?;\\n\\n out.end()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"engine/src/ast/field_expr.rs\",\n \"rank\": 20,\n \"score\": 75321.71912049808\n },\n {\n \"content\": \"#[test]\\n\\nfn test_lex() {\\n\\n fn addr<A: Into<IpAddr>>(addr: A) -> IpRange {\\n\\n IpRange::Cidr(IpCidr::new_host(addr.into()))\\n\\n }\\n\\n\\n\\n fn range<A: Into<IpAddr>>(range: RangeInclusive<A>) -> IpRange {\\n\\n let (first, last) = range.into_inner();\\n\\n match (first.into(), last.into()) {\\n\\n (IpAddr::V4(first), IpAddr::V4(last)) => {\\n\\n IpRange::Explicit(ExplicitIpRange::V4(first..=last))\\n\\n }\\n\\n (IpAddr::V6(first), IpAddr::V6(last)) => {\\n\\n IpRange::Explicit(ExplicitIpRange::V6(first..=last))\\n\\n }\\n\\n _ => panic!(\\\"Invalid inputs\\\"),\\n\\n }\\n\\n }\\n\\n\\n\\n fn cidr<A: Into<IpAddr>>(addr: A, len: u8) -> IpRange {\\n\\n IpRange::Cidr(IpCidr::new(addr.into(), len).unwrap())\\n\",\n \"file_path\": \"engine/src/rhs_types/ip.rs\",\n \"rank\": 21,\n \"score\": 72841.96810310514\n },\n {\n \"content\": \"fn serialize_is_true<S: Serializer>(ser: S) -> Result<S::Ok, S::Error> {\\n\\n use serde::ser::SerializeStruct;\\n\\n\\n\\n let mut out = ser.serialize_struct(\\\"FieldOp\\\", 1)?;\\n\\n out.serialize_field(\\\"op\\\", \\\"IsTrue\\\")?;\\n\\n out.end()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"engine/src/ast/field_expr.rs\",\n \"rank\": 22,\n \"score\": 62770.02439707256\n },\n {\n \"content\": \"fn serialize_contains<S: Serializer>(rhs: &Bytes, ser: S) -> Result<S::Ok, S::Error> {\\n\\n serialize_op_rhs(\\\"Contains\\\", rhs, ser)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"engine/src/ast/field_expr.rs\",\n \"rank\": 23,\n \"score\": 59818.84096205355\n },\n {\n \"content\": \"fn serialize_matches<S: Serializer>(rhs: &Regex, ser: S) -> Result<S::Ok, S::Error> {\\n\\n serialize_op_rhs(\\\"Matches\\\", rhs, ser)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"engine/src/ast/field_expr.rs\",\n \"rank\": 24,\n \"score\": 59818.84096205355\n },\n {\n \"content\": \"fn serialize_one_of<S: Serializer>(rhs: &RhsValues, ser: S) -> Result<S::Ok, S::Error> {\\n\\n serialize_op_rhs(\\\"OneOf\\\", rhs, ser)\\n\\n}\\n\\n\\n\\n#[derive(Debug, PartialEq, Eq, Clone, Serialize)]\\n\\npub struct FieldExpr<'s> {\\n\\n field: Field<'s>,\\n\\n\\n\\n #[serde(flatten)]\\n\\n op: FieldOp,\\n\\n}\\n\\n\\n\\nimpl<'i, 's> LexWith<'i, &'s Scheme> for FieldExpr<'s> {\\n\\n fn lex_with(input: &'i str, scheme: &'s Scheme) -> LexResult<'i, Self> {\\n\\n let initial_input = input;\\n\\n\\n\\n let (field, input) = Field::lex_with(input, scheme)?;\\n\\n let field_type = field.get_type();\\n\\n\\n\\n let (op, input) = if field_type == Type::Bool {\\n\",\n \"file_path\": \"engine/src/ast/field_expr.rs\",\n \"rank\": 25,\n \"score\": 58793.05190549428\n },\n {\n \"content\": \"pub trait Lex<'i>: Sized {\\n\\n fn lex(input: &'i str) -> LexResult<'i, Self>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"engine/src/lex.rs\",\n \"rank\": 26,\n \"score\": 58413.430141427474\n },\n {\n \"content\": \"pub trait LexWith<'i, E>: Sized {\\n\\n fn lex_with(input: &'i str, extra: E) -> LexResult<'i, Self>;\\n\\n}\\n\\n\\n\\nimpl<'i, T: Lex<'i>, E> LexWith<'i, E> for T {\\n\\n fn lex_with(input: &'i str, _extra: E) -> LexResult<'i, Self> {\\n\\n Self::lex(input)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"engine/src/lex.rs\",\n \"rank\": 27,\n \"score\": 56350.38567420839\n },\n {\n \"content\": \"fn main() {\\n\\n let filter = args()\\n\\n .nth(1)\\n\\n .expect(\\\"Expected an input as a command-line argument\\\");\\n\\n\\n\\n let scheme = Scheme! {\\n\\n ip: Ip,\\n\\n str: Bytes,\\n\\n int: Int,\\n\\n bool: Bool,\\n\\n };\\n\\n\\n\\n match scheme.parse(&filter) {\\n\\n Ok(res) => println!(\\\"{:#?}\\\", res),\\n\\n Err(err) => println!(\\\"{}\\\", err),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"engine/examples/cli.rs\",\n \"rank\": 28,\n \"score\": 47124.06571350734\n },\n {\n \"content\": \"#[test]\\n\\nfn test_field() {\\n\\n let scheme = &Scheme! {\\n\\n x: Bytes,\\n\\n x.y.z0: Int,\\n\\n is_TCP: Bool,\\n\\n };\\n\\n\\n\\n assert_ok!(\\n\\n Field::lex_with(\\\"x;\\\", scheme),\\n\\n scheme.get_field_index(\\\"x\\\").unwrap(),\\n\\n \\\";\\\"\\n\\n );\\n\\n\\n\\n assert_ok!(\\n\\n Field::lex_with(\\\"x.y.z0-\\\", scheme),\\n\\n scheme.get_field_index(\\\"x.y.z0\\\").unwrap(),\\n\\n \\\"-\\\"\\n\\n );\\n\\n\\n\\n assert_ok!(\\n\",\n \"file_path\": \"engine/src/scheme.rs\",\n \"rank\": 29,\n \"score\": 45993.93634581908\n },\n {\n \"content\": \"#[test]\\n\\nfn test() {\\n\\n use std::str::FromStr;\\n\\n\\n\\n assert_ok!(i32::lex(\\\"0\\\"), 0i32, \\\"\\\");\\n\\n assert_ok!(i32::lex(\\\"0-\\\"), 0i32, \\\"-\\\");\\n\\n assert_ok!(i32::lex(\\\"0x1f5+\\\"), 501i32, \\\"+\\\");\\n\\n assert_ok!(i32::lex(\\\"0123;\\\"), 83i32, \\\";\\\");\\n\\n assert_ok!(i32::lex(\\\"78!\\\"), 78i32, \\\"!\\\");\\n\\n assert_ok!(i32::lex(\\\"0xefg\\\"), 239i32, \\\"g\\\");\\n\\n assert_ok!(i32::lex(\\\"-12-\\\"), -12i32, \\\"-\\\");\\n\\n assert_err!(\\n\\n i32::lex(\\\"-2147483649!\\\"),\\n\\n LexErrorKind::ParseInt {\\n\\n err: i32::from_str(\\\"-2147483649\\\").unwrap_err(),\\n\\n radix: 10\\n\\n },\\n\\n \\\"-2147483649\\\"\\n\\n );\\n\\n assert_err!(\\n\\n i32::lex(\\\"2147483648!\\\"),\\n\",\n \"file_path\": \"engine/src/rhs_types/int.rs\",\n \"rank\": 30,\n \"score\": 44941.658834066984\n },\n {\n \"content\": \"#[test]\\n\\nfn test() {\\n\\n use super::field_expr::FieldExpr;\\n\\n use execution_context::ExecutionContext;\\n\\n use lex::complete;\\n\\n\\n\\n let scheme = &Scheme! {\\n\\n t: Bool,\\n\\n f: Bool,\\n\\n };\\n\\n\\n\\n let ctx = &mut ExecutionContext::new(scheme);\\n\\n\\n\\n let t_expr = CombinedExpr::Simple(SimpleExpr::Field(\\n\\n complete(FieldExpr::lex_with(\\\"t\\\", scheme)).unwrap(),\\n\\n ));\\n\\n\\n\\n let t_expr = || t_expr.clone();\\n\\n\\n\\n let f_expr = CombinedExpr::Simple(SimpleExpr::Field(\\n\\n complete(FieldExpr::lex_with(\\\"f\\\", scheme)).unwrap(),\\n\",\n \"file_path\": \"engine/src/ast/combined_expr.rs\",\n \"rank\": 31,\n \"score\": 44941.658834066984\n },\n {\n \"content\": \"#[test]\\n\\nfn test_parse_error() {\\n\\n use indoc::indoc;\\n\\n\\n\\n let scheme = &Scheme! { num: Int };\\n\\n\\n\\n {\\n\\n let err = scheme.parse(\\\"xyz\\\").unwrap_err();\\n\\n assert_eq!(\\n\\n err,\\n\\n ParseError {\\n\\n kind: LexErrorKind::UnknownField(UnknownFieldError),\\n\\n input: \\\"xyz\\\",\\n\\n line_number: 0,\\n\\n span_start: 0,\\n\\n span_len: 3\\n\\n }\\n\\n );\\n\\n assert_eq!(\\n\\n err.to_string(),\\n\\n indoc!(\\n\",\n \"file_path\": \"engine/src/scheme.rs\",\n \"rank\": 32,\n \"score\": 44941.658834066984\n },\n {\n \"content\": \"#[test]\\n\\nfn test() {\\n\\n assert_ok!(\\n\\n Bytes::lex(\\\"01:2e:f3-77.12;\\\"),\\n\\n Bytes::from(vec![0x01, 0x2E, 0xF3, 0x77, 0x12]),\\n\\n \\\";\\\"\\n\\n );\\n\\n\\n\\n assert_ok!(\\n\\n Bytes::lex(r#\\\"\\\"s\\\\\\\\t\\\\\\\"r\\\\x0A\\\\000t\\\"\\\"#),\\n\\n Bytes::from(\\\"s\\\\\\\\t\\\\\\\"r\\\\n\\\\0t\\\".to_owned())\\n\\n );\\n\\n\\n\\n assert_err!(\\n\\n Bytes::lex(\\\"01:4x;\\\"),\\n\\n LexErrorKind::ParseInt {\\n\\n err: u8::from_str_radix(\\\"4x\\\", 16).unwrap_err(),\\n\\n radix: 16,\\n\\n },\\n\\n \\\"4x\\\"\\n\\n );\\n\",\n \"file_path\": \"engine/src/rhs_types/bytes.rs\",\n \"rank\": 33,\n \"score\": 44941.658834066984\n },\n {\n \"content\": \"#[test]\\n\\nfn test() {\\n\\n use execution_context::ExecutionContext;\\n\\n use lex::complete;\\n\\n\\n\\n let scheme = &Scheme! { t: Bool };\\n\\n\\n\\n let ctx = &mut ExecutionContext::new(scheme);\\n\\n ctx.set_field_value(\\\"t\\\", true).unwrap();\\n\\n\\n\\n let t_expr = SimpleExpr::Field(complete(FieldExpr::lex_with(\\\"t\\\", scheme)).unwrap());\\n\\n let t_expr = || t_expr.clone();\\n\\n\\n\\n {\\n\\n let expr = assert_ok!(SimpleExpr::lex_with(\\\"t\\\", scheme), t_expr());\\n\\n\\n\\n assert_json!(\\n\\n expr,\\n\\n {\\n\\n \\\"field\\\": \\\"t\\\",\\n\\n \\\"op\\\": \\\"IsTrue\\\"\\n\",\n \"file_path\": \"engine/src/ast/simple_expr.rs\",\n \"rank\": 34,\n \"score\": 44941.658834066984\n },\n {\n \"content\": \"#[test]\\n\\nfn test_field_type_override() {\\n\\n let mut scheme = Scheme! { foo: Int };\\n\\n\\n\\n assert_eq!(\\n\\n scheme.add_field(\\\"foo\\\".into(), Type::Bytes),\\n\\n Err(FieldRedefinitionError(\\\"foo\\\".into()))\\n\\n )\\n\\n}\\n\",\n \"file_path\": \"engine/src/scheme.rs\",\n \"rank\": 35,\n \"score\": 43959.456499728796\n },\n {\n \"content\": \"#[test]\\n\\nfn test() {\\n\\n let expr = assert_ok!(\\n\\n Regex::lex(r#\\\"\\\"[a-z\\\"\\\\]]+\\\\d{1,10}\\\\\\\"\\\";\\\"#),\\n\\n Regex::from_str(r#\\\"[a-z\\\"\\\\]]+\\\\d{1,10}\\\"\\\"#).unwrap(),\\n\\n \\\";\\\"\\n\\n );\\n\\n\\n\\n assert_json!(expr, r#\\\"[a-z\\\"\\\\]]+\\\\d{1,10}\\\"\\\"#);\\n\\n\\n\\n assert_err!(\\n\\n Regex::lex(r#\\\"\\\"abcd\\\\\\\"#),\\n\\n LexErrorKind::MissingEndingQuote,\\n\\n \\\"abcd\\\\\\\\\\\"\\n\\n );\\n\\n}\\n\",\n \"file_path\": \"engine/src/rhs_types/regex/mod.rs\",\n \"rank\": 36,\n \"score\": 43959.456499728796\n },\n {\n \"content\": \"#[test]\\n\\n#[should_panic(expected = \\\"attempt to redefine field foo\\\")]\\n\\nfn test_static_field_type_override() {\\n\\n Scheme! { foo: Int, foo: Int };\\n\\n}\\n\\n\\n\",\n \"file_path\": \"engine/src/scheme.rs\",\n \"rank\": 38,\n \"score\": 43040.5550455182\n },\n {\n \"content\": \"#[test]\\n\\nfn test_strict_partial_ord() {\\n\\n let ips = &[\\n\\n IpAddr::from([10, 0, 0, 0]),\\n\\n IpAddr::from([127, 0, 0, 1]),\\n\\n IpAddr::from([0, 0, 0, 0, 0, 0, 0, 1]),\\n\\n IpAddr::from([0, 0, 0, 0, 0, 0, 0, 2]),\\n\\n ];\\n\\n\\n\\n for lhs in ips {\\n\\n for rhs in ips {\\n\\n if lhs.is_ipv4() == rhs.is_ipv4() {\\n\\n assert_eq!(lhs.strict_partial_cmp(rhs), lhs.partial_cmp(rhs));\\n\\n } else {\\n\\n assert_eq!(lhs.strict_partial_cmp(rhs), None);\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"engine/src/rhs_types/ip.rs\",\n \"rank\": 39,\n \"score\": 42179.026093776105\n },\n {\n \"content\": \"#[test]\\n\\nfn test_field_value_type_mismatch() {\\n\\n let scheme = Scheme! { foo: Int };\\n\\n\\n\\n let mut ctx = ExecutionContext::new(&scheme);\\n\\n\\n\\n assert_eq!(\\n\\n ctx.set_field_value(\\\"foo\\\", LhsValue::Bool(false)),\\n\\n Err(FieldValueTypeMismatchError {\\n\\n field_type: Type::Int,\\n\\n value_type: Type::Bool\\n\\n })\\n\\n );\\n\\n}\\n\",\n \"file_path\": \"engine/src/execution_context.rs\",\n \"rank\": 40,\n \"score\": 42179.026093776105\n },\n {\n \"content\": \"use cidr::NetworkParseError;\\n\\nuse failure::Fail;\\n\\nuse rhs_types::RegexError;\\n\\nuse scheme::UnknownFieldError;\\n\\nuse std::num::ParseIntError;\\n\\nuse types::Type;\\n\\n\\n\\n#[derive(Debug, PartialEq, Fail)]\\n\\npub enum LexErrorKind {\\n\\n #[fail(display = \\\"expected {}\\\", _0)]\\n\\n ExpectedName(&'static str),\\n\\n\\n\\n #[fail(display = \\\"expected literal {:?}\\\", _0)]\\n\\n ExpectedLiteral(&'static str),\\n\\n\\n\\n #[fail(display = \\\"{} while parsing with radix {}\\\", err, radix)]\\n\\n ParseInt {\\n\\n #[cause]\\n\\n err: ParseIntError,\\n\\n radix: u32,\\n\",\n \"file_path\": \"engine/src/lex.rs\",\n \"rank\": 41,\n \"score\": 33332.49017032207\n },\n {\n \"content\": \"\\n\\n #[fail(display = \\\"{}\\\", _0)]\\n\\n UnknownField(#[cause] UnknownFieldError),\\n\\n\\n\\n #[fail(display = \\\"cannot use this operation type {:?}\\\", field_type)]\\n\\n UnsupportedOp { field_type: Type },\\n\\n\\n\\n #[fail(display = \\\"incompatible range bounds\\\")]\\n\\n IncompatibleRangeBounds,\\n\\n\\n\\n #[fail(display = \\\"unrecognised input\\\")]\\n\\n EOF,\\n\\n}\\n\\n\\n\\npub type LexError<'i> = (LexErrorKind, &'i str);\\n\\n\\n\\npub type LexResult<'i, T> = Result<(T, &'i str), LexError<'i>>;\\n\\n\\n\",\n \"file_path\": \"engine/src/lex.rs\",\n \"rank\": 42,\n \"score\": 33331.239215580856\n },\n {\n \"content\": \" }) => {\\n\\n lex_enum!(@decl $preamble $name $input {\\n\\n $($decl)*\\n\\n $item $(= $value)*,\\n\\n } {\\n\\n $($expr)*\\n\\n $(if let Ok($input) = $crate::lex::expect($input, $s) {\\n\\n return Ok(($name::$item, $input));\\n\\n })+\\n\\n } { $($rest)* });\\n\\n };\\n\\n\\n\\n // Internal finish point for declaration + lexer generation.\\n\\n //\\n\\n // This is invoked when no more variants are left to process.\\n\\n // At this point declaration and lexer body are considered complete.\\n\\n (@decl { $($preamble:tt)* } $name:ident $input:ident $decl:tt { $($expr:stmt)* } {}) => {\\n\\n #[derive(Debug, PartialEq, Eq, Clone, Copy, Serialize)]\\n\\n $($preamble)*\\n\\n pub enum $name $decl\\n\",\n \"file_path\": \"engine/src/lex.rs\",\n \"rank\": 43,\n \"score\": 33330.88086814959\n },\n {\n \"content\": \"\\n\\n impl<'i> $crate::lex::Lex<'i> for $name {\\n\\n fn lex($input: &'i str) -> $crate::lex::LexResult<'_, Self> {\\n\\n $($expr)*\\n\\n Err((\\n\\n $crate::lex::LexErrorKind::ExpectedName(stringify!($name)),\\n\\n $input\\n\\n ))\\n\\n }\\n\\n }\\n\\n };\\n\\n\\n\\n // The public entry point to the macro.\\n\\n ($(# $attrs:tt)* $name:ident $items:tt) => {\\n\\n lex_enum!(@decl {\\n\\n $(# $attrs)*\\n\\n } $name input {} {} $items);\\n\\n };\\n\\n}\\n\\n\\n\",\n \"file_path\": \"engine/src/lex.rs\",\n \"rank\": 44,\n \"score\": 33330.501358503076\n },\n {\n \"content\": \" $($decl)*\\n\\n $item($ty),\\n\\n } {\\n\\n $($expr)*\\n\\n if let Ok((res, $input)) = $crate::lex::Lex::lex($input) {\\n\\n return Ok(($name::$item(res), $input));\\n\\n }\\n\\n } { $($rest)* });\\n\\n };\\n\\n\\n\\n // Branch for handling `\\\"some_string\\\" | \\\"other_string\\\" => VariantName`.\\n\\n // (also supports optional constant value via `... => VariantName = 42`)\\n\\n //\\n\\n // Creates a unit variant `VariantName`.\\n\\n //\\n\\n // On the parser side, tries to parse either of the given string values,\\n\\n // and returns the variant if any of them succeeded.\\n\\n (@decl $preamble:tt $name:ident $input:ident { $($decl:tt)* } { $($expr:tt)* } {\\n\\n $($s:tt)|+ => $item:ident $(= $value:expr)*,\\n\\n $($rest:tt)*\\n\",\n \"file_path\": \"engine/src/lex.rs\",\n \"rank\": 45,\n \"score\": 33327.02137458014\n },\n {\n \"content\": \" },\\n\\n\\n\\n #[fail(display = \\\"{}\\\", _0)]\\n\\n ParseNetwork(#[cause] NetworkParseError),\\n\\n\\n\\n #[fail(display = \\\"{}\\\", _0)]\\n\\n ParseRegex(#[cause] RegexError),\\n\\n\\n\\n #[fail(display = \\\"expected \\\\\\\", xHH or OOO after \\\\\\\\\\\")]\\n\\n InvalidCharacterEscape,\\n\\n\\n\\n #[fail(display = \\\"could not find an ending quote\\\")]\\n\\n MissingEndingQuote,\\n\\n\\n\\n #[fail(display = \\\"expected {} {}s, but found {}\\\", expected, name, actual)]\\n\\n CountMismatch {\\n\\n name: &'static str,\\n\\n actual: usize,\\n\\n expected: usize,\\n\\n },\\n\",\n \"file_path\": \"engine/src/lex.rs\",\n \"rank\": 46,\n \"score\": 33322.48760916161\n },\n {\n \"content\": \"}\\n\\n\\n\\n#[cfg(test)]\\n\\nmacro_rules! assert_err {\\n\\n ($s:expr, $kind:expr, $span:expr) => {\\n\\n assert_eq!($s, Err(($kind, $span)))\\n\\n };\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmacro_rules! assert_json {\\n\\n ($expr:expr, $json:tt) => {\\n\\n assert_eq!(\\n\\n ::serde_json::to_value(&$expr).unwrap(),\\n\\n ::serde_json::json!($json)\\n\\n );\\n\\n };\\n\\n}\\n\",\n \"file_path\": \"engine/src/lex.rs\",\n \"rank\": 47,\n \"score\": 33320.373384820086\n },\n {\n \"content\": \"fn unwrap_json_result<T>(filter_ast: &FilterAst<'_>, result: serde_json::Result<T>) -> T {\\n\\n // Filter serialisation must never fail.\\n\\n result.unwrap_or_else(|err| panic!(\\\"{} while serializing filter {:#?}\\\", err, filter_ast))\\n\\n}\\n\\n\\n\\n#[no_mangle]\\n\\npub extern \\\"C\\\" fn wirefilter_get_filter_hash(filter_ast: &FilterAst<'_>) -> u64 {\\n\\n let mut hasher = FnvHasher::default();\\n\\n // Serialize JSON to our Write-compatible wrapper around FnvHasher,\\n\\n // effectively calculating a hash for our filter in a streaming fashion\\n\\n // that is as stable as the JSON representation itself\\n\\n // (instead of relying on #[derive(Hash)] which would be tied to impl details).\\n\\n let result = serde_json::to_writer(HasherWrite(&mut hasher), filter_ast);\\n\\n unwrap_json_result(filter_ast, result);\\n\\n hasher.finish()\\n\\n}\\n\\n\\n\\n#[no_mangle]\\n\\npub extern \\\"C\\\" fn wirefilter_serialize_filter_to_json(\\n\\n filter_ast: &FilterAst<'_>,\\n\",\n \"file_path\": \"ffi/src/lib.rs\",\n \"rank\": 48,\n \"score\": 30298.17645577532\n },\n {\n \"content\": \"use super::{ExternPtrRepr, ExternSliceRepr};\\n\\nuse std::str;\\n\\n\\n\\n/// This structure provides FFI-safe representation for Rust string slice\\n\\n/// pointers.\\n\\n///\\n\\n/// The representation is guaranteed to be the same as [`ExternSliceRepr`]\\n\\n/// for regular bytes ([`u8`]), but adds extra conversion checks for UTF-8.\\n\\n///\\n\\n/// Example C definition:\\n\\n/// ```\\n\\n/// struct Str {\\n\\n/// const uint8_t *data;\\n\\n/// size_t length;\\n\\n/// };\\n\\n/// ```\\n\\n#[repr(transparent)]\\n\\n#[derive(Clone, Copy)]\\n\\npub struct ExternStrRepr(ExternSliceRepr<u8>);\\n\\n\\n\",\n \"file_path\": \"ffi/src/transfer_types/raw_ptr_repr/str.rs\",\n \"rank\": 49,\n \"score\": 28222.91397195327\n },\n {\n \"content\": \"impl From<*mut str> for ExternStrRepr {\\n\\n #[allow(clippy::not_unsafe_ptr_arg_deref)]\\n\\n fn from(ptr: *mut str) -> Self {\\n\\n let bytes: *mut [u8] = unsafe { (*ptr).as_bytes_mut() };\\n\\n ExternStrRepr(bytes.into())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl ExternPtrRepr for str {\\n\\n type Repr = ExternStrRepr;\\n\\n\\n\\n unsafe fn from_extern_repr_unchecked(repr: Self::Repr) -> *mut str {\\n\\n let bytes = ExternPtrRepr::from_extern_repr_unchecked(repr.0);\\n\\n str::from_utf8_unchecked_mut(&mut *bytes)\\n\\n }\\n\\n\\n\\n fn from_extern_repr(repr: Self::Repr) -> *mut str {\\n\\n let bytes = ExternPtrRepr::from_extern_repr(repr.0);\\n\\n // Make sure that strings coming via FFI are UTF-8 compatible.\\n\\n str::from_utf8_mut(unsafe { &mut *bytes }).unwrap()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"ffi/src/transfer_types/raw_ptr_repr/str.rs\",\n \"rank\": 50,\n \"score\": 28222.81035424664\n },\n {\n \"content\": \"impl<'s> Serialize for Field<'s> {\\n\\n fn serialize<S: Serializer>(&self, ser: S) -> Result<S::Ok, S::Error> {\\n\\n self.name().serialize(ser)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'s> Debug for Field<'s> {\\n\\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\\n\\n write!(f, \\\"{}\\\", self.name())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'i, 's> LexWith<'i, &'s Scheme> for Field<'s> {\\n\\n fn lex_with(mut input: &'i str, scheme: &'s Scheme) -> LexResult<'i, Self> {\\n\\n let initial_input = input;\\n\\n\\n\\n loop {\\n\\n input = take_while(input, \\\"identifier character\\\", |c| {\\n\\n c.is_ascii_alphanumeric() || c == '_'\\n\\n })?\\n\",\n \"file_path\": \"engine/src/scheme.rs\",\n \"rank\": 51,\n \"score\": 22.739758563089417\n },\n {\n \"content\": \" self.as_str() == other.as_str()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Eq for Regex {}\\n\\n\\n\\nimpl Debug for Regex {\\n\\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\\n\\n f.write_str(self.as_str())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'i> Lex<'i> for Regex {\\n\\n fn lex(input: &str) -> LexResult<'_, Self> {\\n\\n let input = expect(input, \\\"\\\\\\\"\\\")?;\\n\\n let mut regex_buf = String::new();\\n\\n let mut in_char_class = false;\\n\\n let (regex_str, input) = {\\n\\n let mut iter = input.chars();\\n\\n loop {\\n\",\n \"file_path\": \"engine/src/rhs_types/regex/mod.rs\",\n \"rank\": 52,\n \"score\": 22.220664372355714\n },\n {\n \"content\": \"use cfg_if::cfg_if;\\n\\nuse lex::{expect, span, Lex, LexErrorKind, LexResult};\\n\\nuse serde::{Serialize, Serializer};\\n\\nuse std::{\\n\\n fmt::{self, Debug, Formatter},\\n\\n str::FromStr,\\n\\n};\\n\\n\\n\\ncfg_if! {\\n\\n if #[cfg(feature = \\\"regex\\\")] {\\n\\n mod imp_real;\\n\\n pub use self::imp_real::*;\\n\\n } else {\\n\\n mod imp_stub;\\n\\n pub use self::imp_stub::*;\\n\\n }\\n\\n}\\n\\n\\n\\nimpl PartialEq for Regex {\\n\\n fn eq(&self, other: &Regex) -> bool {\\n\",\n \"file_path\": \"engine/src/rhs_types/regex/mod.rs\",\n \"rank\": 53,\n \"score\": 20.290089732779133\n },\n {\n \"content\": \"use lex::{expect, take, Lex, LexErrorKind, LexResult};\\n\\nuse serde::Serialize;\\n\\nuse std::{\\n\\n borrow::Borrow,\\n\\n fmt::{self, Debug, Formatter},\\n\\n hash::{Hash, Hasher},\\n\\n ops::Deref,\\n\\n str,\\n\\n};\\n\\nuse strict_partial_ord::StrictPartialOrd;\\n\\n\\n\\n#[derive(PartialEq, Eq, Clone, Serialize)]\\n\\n#[serde(untagged)]\\n\\npub enum Bytes {\\n\\n Str(Box<str>),\\n\\n Raw(Box<[u8]>),\\n\\n}\\n\\n\\n\\n// We need custom `Hash` consistent with `Borrow` invariants.\\n\\n// We can get away with `Eq` invariant though because we do want\\n\",\n \"file_path\": \"engine/src/rhs_types/bytes.rs\",\n \"rank\": 54,\n \"score\": 18.861654694135982\n },\n {\n \"content\": \"use std::fmt;\\n\\nuse failure::Fail;\\n\\nuse std::str::FromStr;\\n\\n\\n\\n#[derive(Debug, PartialEq, Fail)]\\n\\npub enum Error {}\\n\\n\\n\\nimpl fmt::Display for Error {\\n\\n fn fmt(&self, _f: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n match *self {}\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Clone)]\\n\\npub struct Regex(String);\\n\\n\\n\\nimpl FromStr for Regex {\\n\\n type Err = Error;\\n\\n\\n\\n fn from_str(s: &str) -> Result<Self, Error> {\\n\",\n \"file_path\": \"engine/src/rhs_types/regex/imp_stub.rs\",\n \"rank\": 55,\n \"score\": 17.60109968604162\n },\n {\n \"content\": \"use ast::FilterAst;\\n\\nuse failure::Fail;\\n\\nuse fnv::FnvBuildHasher;\\n\\nuse indexmap::map::{Entry, IndexMap};\\n\\nuse lex::{complete, expect, span, take_while, LexErrorKind, LexResult, LexWith};\\n\\nuse serde::{Deserialize, Serialize, Serializer};\\n\\nuse std::{\\n\\n cmp::{max, min},\\n\\n error::Error,\\n\\n fmt::{self, Debug, Display, Formatter},\\n\\n ptr,\\n\\n};\\n\\nuse types::{GetType, Type};\\n\\n\\n\\n#[derive(PartialEq, Eq, Clone, Copy)]\\n\\npub(crate) struct Field<'s> {\\n\\n scheme: &'s Scheme,\\n\\n index: usize,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"engine/src/scheme.rs\",\n \"rank\": 57,\n \"score\": 16.208989798201017\n },\n {\n \"content\": \" fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n self.op.fmt(f)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'i, 's> LexWith<'i, &'s Scheme> for FilterAst<'s> {\\n\\n fn lex_with(input: &'i str, scheme: &'s Scheme) -> LexResult<'i, Self> {\\n\\n let (op, input) = CombinedExpr::lex_with(input, scheme)?;\\n\\n Ok((FilterAst { scheme, op }, input))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'s> FilterAst<'s> {\\n\\n /// Recursively checks whether a [`FilterAst`] uses a given field name.\\n\\n ///\\n\\n /// This is useful to lazily initialise expensive fields only if necessary.\\n\\n pub fn uses(&self, field_name: &str) -> Result<bool, UnknownFieldError> {\\n\\n self.scheme\\n\\n .get_field_index(field_name)\\n\\n .map(|field| self.op.uses(field))\\n\\n }\\n\\n\\n\\n /// Compiles a [`FilterAst`] into a [`Filter`].\\n\\n pub fn compile(self) -> Filter<'s> {\\n\\n Filter::new(self.op.compile(), self.scheme)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"engine/src/ast/mod.rs\",\n \"rank\": 58,\n \"score\": 15.307466324799751\n },\n {\n \"content\": \"mod combined_expr;\\n\\nmod field_expr;\\n\\nmod simple_expr;\\n\\n\\n\\nuse self::combined_expr::CombinedExpr;\\n\\nuse filter::{CompiledExpr, Filter};\\n\\nuse lex::{LexResult, LexWith};\\n\\nuse scheme::{Field, Scheme, UnknownFieldError};\\n\\nuse serde::Serialize;\\n\\nuse std::fmt::{self, Debug};\\n\\n\\n\",\n \"file_path\": \"engine/src/ast/mod.rs\",\n \"rank\": 59,\n \"score\": 15.055890668444004\n },\n {\n \"content\": \"use cidr::{Cidr, IpCidr, Ipv4Cidr, Ipv6Cidr, NetworkParseError};\\n\\nuse lex::{take_while, Lex, LexError, LexErrorKind, LexResult};\\n\\nuse serde::Serialize;\\n\\nuse std::{\\n\\n cmp::Ordering,\\n\\n net::{IpAddr, Ipv4Addr, Ipv6Addr},\\n\\n ops::RangeInclusive,\\n\\n str::FromStr,\\n\\n};\\n\\nuse strict_partial_ord::StrictPartialOrd;\\n\\n\\n\",\n \"file_path\": \"engine/src/rhs_types/ip.rs\",\n \"rank\": 60,\n \"score\": 15.049710684039098\n },\n {\n \"content\": \" _ => {\\n\\n return Err((\\n\\n LexErrorKind::InvalidCharacterEscape,\\n\\n &input[..c.len_utf8()],\\n\\n ));\\n\\n }\\n\\n });\\n\\n }\\n\\n '\\\"' => return Ok((res.into(), iter.as_str())),\\n\\n c => res.push(c),\\n\\n };\\n\\n }\\n\\n } else {\\n\\n let mut res = Vec::new();\\n\\n loop {\\n\\n let (b, rest) = hex_byte(input)?;\\n\\n res.push(b);\\n\\n input = rest;\\n\\n if let Ok((_, rest)) = ByteSeparator::lex(input) {\\n\\n input = rest;\\n\",\n \"file_path\": \"engine/src/rhs_types/bytes.rs\",\n \"rank\": 61,\n \"score\": 14.519254634798783\n },\n {\n \"content\": \"\\n\\nimpl<'s> CombinedExpr<'s> {\\n\\n fn lex_combining_op(input: &str) -> (Option<CombiningOp>, &str) {\\n\\n match CombiningOp::lex(skip_space(input)) {\\n\\n Ok((op, input)) => (Some(op), skip_space(input)),\\n\\n Err(_) => (None, input),\\n\\n }\\n\\n }\\n\\n\\n\\n fn lex_more_with_precedence<'i>(\\n\\n self,\\n\\n scheme: &'s Scheme,\\n\\n min_prec: Option<CombiningOp>,\\n\\n mut lookahead: (Option<CombiningOp>, &'i str),\\n\\n ) -> LexResult<'i, Self> {\\n\\n let mut lhs = self;\\n\\n\\n\\n while let Some(op) = lookahead.0 {\\n\\n let mut rhs = SimpleExpr::lex_with(lookahead.1, scheme)\\n\\n .map(|(op, input)| (CombinedExpr::Simple(op), input))?;\\n\",\n \"file_path\": \"engine/src/ast/combined_expr.rs\",\n \"rank\": 62,\n \"score\": 13.985088915080864\n },\n {\n \"content\": \"use lex::{Lex, LexResult};\\n\\nuse serde::Serialize;\\n\\nuse std::{borrow::Borrow, cmp::Ordering};\\n\\nuse strict_partial_ord::StrictPartialOrd;\\n\\n\\n\\n/// [Uninhabited / empty type](https://doc.rust-lang.org/nomicon/exotic-sizes.html#empty-types)\\n\\n/// for `bool` with traits we need for RHS values.\\n\\n#[derive(Debug, PartialEq, Eq, Clone, Hash, Serialize)]\\n\\npub enum UninhabitedBool {}\\n\\n\\n\\nimpl Borrow<bool> for UninhabitedBool {\\n\\n fn borrow(&self) -> &bool {\\n\\n match *self {}\\n\\n }\\n\\n}\\n\\n\\n\\nimpl PartialEq<UninhabitedBool> for bool {\\n\\n fn eq(&self, other: &UninhabitedBool) -> bool {\\n\\n match *other {}\\n\\n }\\n\",\n \"file_path\": \"engine/src/rhs_types/bool.rs\",\n \"rank\": 63,\n \"score\": 13.022325675209263\n },\n {\n \"content\": \"use super::{simple_expr::SimpleExpr, CompiledExpr, Expr};\\n\\nuse lex::{skip_space, Lex, LexResult, LexWith};\\n\\nuse scheme::{Field, Scheme};\\n\\nuse serde::Serialize;\\n\\n\\n\\nlex_enum!(#[derive(PartialOrd, Ord)] CombiningOp {\\n\\n \\\"or\\\" | \\\"||\\\" => Or,\\n\\n \\\"xor\\\" | \\\"^^\\\" => Xor,\\n\\n \\\"and\\\" | \\\"&&\\\" => And,\\n\\n});\\n\\n\\n\\n#[derive(Debug, PartialEq, Eq, Clone, Serialize)]\\n\\n#[serde(untagged)]\\n\\npub enum CombinedExpr<'s> {\\n\\n Simple(SimpleExpr<'s>),\\n\\n Combining {\\n\\n op: CombiningOp,\\n\\n items: Vec<CombinedExpr<'s>>,\\n\\n },\\n\\n}\\n\",\n \"file_path\": \"engine/src/ast/combined_expr.rs\",\n \"rank\": 64,\n \"score\": 12.290207064979448\n },\n {\n \"content\": \"use super::{combined_expr::CombinedExpr, field_expr::FieldExpr, CompiledExpr, Expr};\\n\\nuse lex::{expect, skip_space, Lex, LexResult, LexWith};\\n\\nuse scheme::{Field, Scheme};\\n\\nuse serde::Serialize;\\n\\n\\n\\nlex_enum!(UnaryOp {\\n\\n \\\"not\\\" | \\\"!\\\" => Not,\\n\\n});\\n\\n\\n\\n#[derive(Debug, PartialEq, Eq, Clone, Serialize)]\\n\\n#[serde(untagged)]\\n\\npub enum SimpleExpr<'s> {\\n\\n Field(FieldExpr<'s>),\\n\\n Parenthesized(Box<CombinedExpr<'s>>),\\n\\n Unary {\\n\\n op: UnaryOp,\\n\\n arg: Box<SimpleExpr<'s>>,\\n\\n },\\n\\n}\\n\\n\\n\",\n \"file_path\": \"engine/src/ast/simple_expr.rs\",\n \"rank\": 65,\n \"score\": 12.10417228831787\n },\n {\n \"content\": \"use super::{CompiledExpr, Expr};\\n\\nuse fnv::FnvBuildHasher;\\n\\nuse heap_searcher::HeapSearcher;\\n\\nuse indexmap::IndexSet;\\n\\nuse lex::{skip_space, span, Lex, LexErrorKind, LexResult, LexWith};\\n\\nuse memmem::Searcher;\\n\\nuse range_set::RangeSet;\\n\\nuse rhs_types::{Bytes, ExplicitIpRange, Regex};\\n\\nuse scheme::{Field, Scheme};\\n\\nuse serde::{Serialize, Serializer};\\n\\nuse std::{cmp::Ordering, net::IpAddr};\\n\\nuse strict_partial_ord::StrictPartialOrd;\\n\\nuse types::{GetType, LhsValue, RhsValue, RhsValues, Type};\\n\\n\\n\\nconst LESS: u8 = 0b001;\\n\\nconst GREATER: u8 = 0b010;\\n\\nconst EQUAL: u8 = 0b100;\\n\\n\\n\\nlex_enum!(#[repr(u8)] OrderingOp {\\n\\n \\\"eq\\\" | \\\"==\\\" => Equal = EQUAL,\\n\",\n \"file_path\": \"engine/src/ast/field_expr.rs\",\n \"rank\": 66,\n \"score\": 11.580996182936047\n },\n {\n \"content\": \" V6(RangeInclusive<Ipv6Addr>),\\n\\n}\\n\\n\\n\\n#[derive(PartialEq, Eq, Clone, Serialize, Debug)]\\n\\n#[serde(untagged)]\\n\\npub enum IpRange {\\n\\n Explicit(ExplicitIpRange),\\n\\n Cidr(IpCidr),\\n\\n}\\n\\n\\n\\nimpl<'i> Lex<'i> for IpRange {\\n\\n fn lex(input: &str) -> LexResult<'_, Self> {\\n\\n let (chunk, rest) = match_addr_or_cidr(input)?;\\n\\n\\n\\n // check for \\\"..\\\" before trying to lex an address\\n\\n let range = if let Some(split_pos) = chunk.find(\\\"..\\\") {\\n\\n let first = parse_addr(&chunk[..split_pos])?;\\n\\n let last = parse_addr(&chunk[split_pos + \\\"..\\\".len()..])?;\\n\\n\\n\\n IpRange::Explicit(match (first, last) {\\n\",\n \"file_path\": \"engine/src/rhs_types/ip.rs\",\n \"rank\": 67,\n \"score\": 11.51351987349307\n },\n {\n \"content\": \" ']' if in_char_class => {\\n\\n in_char_class = false;\\n\\n regex_buf.push(']');\\n\\n }\\n\\n c => {\\n\\n regex_buf.push(c);\\n\\n }\\n\\n };\\n\\n }\\n\\n };\\n\\n match Regex::from_str(®ex_buf) {\\n\\n Ok(regex) => Ok((regex, input)),\\n\\n Err(err) => Err((LexErrorKind::ParseRegex(err), regex_str)),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Serialize for Regex {\\n\\n fn serialize<S: Serializer>(&self, ser: S) -> Result<S::Ok, S::Error> {\\n\\n self.as_str().serialize(ser)\\n\\n }\\n\\n}\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"engine/src/rhs_types/regex/mod.rs\",\n \"rank\": 68,\n \"score\": 11.45761371861143\n },\n {\n \"content\": \"\\n\\nimpl<'i> Error for ParseError<'i> {}\\n\\n\\n\\nimpl<'i> ParseError<'i> {\\n\\n pub(crate) fn new(mut input: &'i str, (kind, span): (LexErrorKind, &'i str)) -> Self {\\n\\n let mut span_start = span.as_ptr() as usize - input.as_ptr() as usize;\\n\\n\\n\\n let (line_number, line_start) = input[..span_start]\\n\\n .match_indices('\\\\n')\\n\\n .map(|(pos, _)| pos + 1)\\n\\n .scan(0, |line_number, line_start| {\\n\\n *line_number += 1;\\n\\n Some((*line_number, line_start))\\n\\n })\\n\\n .last()\\n\\n .unwrap_or_default();\\n\\n\\n\\n input = &input[line_start..];\\n\\n\\n\\n span_start -= line_start;\\n\",\n \"file_path\": \"engine/src/scheme.rs\",\n \"rank\": 70,\n \"score\": 11.028459724049627\n },\n {\n \"content\": \"use lex::{expect, span, take_while, Lex, LexErrorKind, LexResult};\\n\\nuse std::ops::RangeInclusive;\\n\\nuse strict_partial_ord::StrictPartialOrd;\\n\\n\\n\",\n \"file_path\": \"engine/src/rhs_types/int.rs\",\n \"rank\": 71,\n \"score\": 10.895283045597253\n },\n {\n \"content\": \"use std::alloc::System;\\n\\n\\n\\n// Most of our usage will be via FFI as a dynamic library, so we're interested\\n\\n// in performance with system allocator and not jemalloc.\\n\\n#[global_allocator]\\n\\nstatic A: System = System;\\n\\n\\n\\nextern crate criterion;\\n\\nextern crate wirefilter;\\n\\n\\n\\nuse criterion::{\\n\\n criterion_group, criterion_main, Bencher, Benchmark, Criterion, ParameterizedBenchmark,\\n\\n};\\n\\nuse std::{fmt::Debug, net::IpAddr};\\n\\nuse wirefilter::{ExecutionContext, GetType, LhsValue, Scheme};\\n\\n\\n\",\n \"file_path\": \"engine/benches/bench.rs\",\n \"rank\": 72,\n \"score\": 10.849952569494253\n },\n {\n \"content\": \"\\n\\nimpl From<Bytes> for Box<[u8]> {\\n\\n fn from(bytes: Bytes) -> Self {\\n\\n match bytes {\\n\\n Bytes::Str(s) => s.into_boxed_bytes(),\\n\\n Bytes::Raw(b) => b,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Debug for Bytes {\\n\\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\\n\\n match self {\\n\\n Bytes::Str(s) => s.fmt(f),\\n\\n Bytes::Raw(b) => {\\n\\n for (i, b) in b.iter().cloned().enumerate() {\\n\\n if i != 0 {\\n\\n write!(f, \\\":\\\")?;\\n\\n }\\n\\n write!(f, \\\"{:02X}\\\", b)?;\\n\",\n \"file_path\": \"engine/src/rhs_types/bytes.rs\",\n \"rank\": 73,\n \"score\": 10.695678643866891\n },\n {\n \"content\": \" let (_, rest) = lex_digits(without_neg)?;\\n\\n\\n\\n parse_number((span(input, rest), rest), 10)\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'i> Lex<'i> for RangeInclusive<i32> {\\n\\n fn lex(input: &str) -> LexResult<'_, Self> {\\n\\n let initial_input = input;\\n\\n let (first, input) = i32::lex(input)?;\\n\\n let (last, input) = if let Ok(input) = expect(input, \\\"..\\\") {\\n\\n i32::lex(input)?\\n\\n } else {\\n\\n (first, input)\\n\\n };\\n\\n if last < first {\\n\\n return Err((\\n\\n LexErrorKind::IncompatibleRangeBounds,\\n\\n span(initial_input, input),\\n\\n ));\\n\\n }\\n\\n Ok((first..=last, input))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl StrictPartialOrd for i32 {}\\n\\n\\n\",\n \"file_path\": \"engine/src/rhs_types/int.rs\",\n \"rank\": 74,\n \"score\": 10.331178518624867\n },\n {\n \"content\": \" drop(s);\\n\\n}\\n\\n\\n\\n#[no_mangle]\\n\\npub extern \\\"C\\\" fn wirefilter_parse_filter<'s, 'i>(\\n\\n scheme: &'s Scheme,\\n\\n input: ExternallyAllocatedStr<'i>,\\n\\n) -> ParsingResult<'s> {\\n\\n match scheme.parse(input.into_ref()) {\\n\\n Ok(filter) => ParsingResult::from(filter),\\n\\n Err(err) => ParsingResult::from(err),\\n\\n }\\n\\n}\\n\\n\\n\\n/// Wrapper for Hasher that allows using Write API (e.g. with serializer).\\n\\n#[derive(Default)]\\n\",\n \"file_path\": \"ffi/src/lib.rs\",\n \"rank\": 75,\n \"score\": 10.168287781577332\n },\n {\n \"content\": \"impl<'i, 's> LexWith<'i, &'s Scheme> for SimpleExpr<'s> {\\n\\n fn lex_with(input: &'i str, scheme: &'s Scheme) -> LexResult<'i, Self> {\\n\\n Ok(if let Ok(input) = expect(input, \\\"(\\\") {\\n\\n let input = skip_space(input);\\n\\n let (op, input) = CombinedExpr::lex_with(input, scheme)?;\\n\\n let input = skip_space(input);\\n\\n let input = expect(input, \\\")\\\")?;\\n\\n (SimpleExpr::Parenthesized(Box::new(op)), input)\\n\\n } else if let Ok((op, input)) = UnaryOp::lex(input) {\\n\\n let input = skip_space(input);\\n\\n let (arg, input) = SimpleExpr::lex_with(input, scheme)?;\\n\\n (\\n\\n SimpleExpr::Unary {\\n\\n op,\\n\\n arg: Box::new(arg),\\n\\n },\\n\\n input,\\n\\n )\\n\\n } else {\\n\\n let (op, input) = FieldExpr::lex_with(input, scheme)?;\\n\",\n \"file_path\": \"engine/src/ast/simple_expr.rs\",\n \"rank\": 76,\n \"score\": 10.1127520911776\n },\n {\n \"content\": \" {\\n\\n '\\\\\\\\' => {\\n\\n let input = iter.as_str();\\n\\n\\n\\n let c = iter\\n\\n .next()\\n\\n .ok_or_else(|| (LexErrorKind::MissingEndingQuote, full_input))?;\\n\\n\\n\\n res.push(match c {\\n\\n '\\\"' | '\\\\\\\\' => c,\\n\\n 'x' => {\\n\\n let (b, input) = hex_byte(iter.as_str())?;\\n\\n iter = input.chars();\\n\\n b as char\\n\\n }\\n\\n '0'..='7' => {\\n\\n let (b, input) = oct_byte(input)?;\\n\\n iter = input.chars();\\n\\n b as char\\n\\n }\\n\",\n \"file_path\": \"engine/src/rhs_types/bytes.rs\",\n \"rank\": 77,\n \"score\": 10.013854440348531\n },\n {\n \"content\": \" ExternallyAllocatedStr::from(\\\"num1\\\"),\\n\\n 42,\\n\\n );\\n\\n\\n\\n wirefilter_add_int_value_to_execution_context(\\n\\n &mut exec_context,\\n\\n ExternallyAllocatedStr::from(\\\"num2\\\"),\\n\\n 1337,\\n\\n );\\n\\n\\n\\n exec_context\\n\\n }\\n\\n\\n\\n fn parse_filter<'s>(scheme: &'s Scheme, input: &'static str) -> ParsingResult<'s> {\\n\\n wirefilter_parse_filter(scheme, ExternallyAllocatedStr::from(input))\\n\\n }\\n\\n\\n\\n fn match_filter(\\n\\n input: &'static str,\\n\\n scheme: &Scheme,\\n\",\n \"file_path\": \"ffi/src/lib.rs\",\n \"rank\": 78,\n \"score\": 9.814869563253833\n },\n {\n \"content\": \" op,\\n\\n items: vec![lhs, rhs.0],\\n\\n };\\n\\n }\\n\\n }\\n\\n\\n\\n if lookahead.0 < min_prec {\\n\\n // pretend we haven't seen an operator if its precedence is\\n\\n // outside of our limits\\n\\n lookahead = (None, rhs.1);\\n\\n }\\n\\n }\\n\\n\\n\\n Ok((lhs, lookahead.1))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'i, 's> LexWith<'i, &'s Scheme> for CombinedExpr<'s> {\\n\\n fn lex_with(input: &'i str, scheme: &'s Scheme) -> LexResult<'i, Self> {\\n\\n let (lhs, input) = SimpleExpr::lex_with(input, scheme)?;\\n\",\n \"file_path\": \"engine/src/ast/combined_expr.rs\",\n \"rank\": 79,\n \"score\": 9.634532941251187\n },\n {\n \"content\": \"#[derive(Debug, PartialEq, Fail)]\\n\\n#[fail(display = \\\"unknown field\\\")]\\n\\npub struct UnknownFieldError;\\n\\n\\n\\n/// An error that occurs when previously defined field gets redefined.\\n\\n#[derive(Debug, PartialEq, Fail)]\\n\\n#[fail(display = \\\"attempt to redefine field {}\\\", _0)]\\n\\npub struct FieldRedefinitionError(String);\\n\\n\\n\\n/// An opaque filter parsing error associated with the original input.\\n\\n///\\n\\n/// For now, you can just print it in a debug or a human-readable fashion.\\n\\n#[derive(Debug, PartialEq)]\\n\\npub struct ParseError<'i> {\\n\\n kind: LexErrorKind,\\n\\n input: &'i str,\\n\\n line_number: usize,\\n\\n span_start: usize,\\n\\n span_len: usize,\\n\\n}\\n\",\n \"file_path\": \"engine/src/scheme.rs\",\n \"rank\": 80,\n \"score\": 9.548293588677325\n },\n {\n \"content\": \"use std::str::FromStr;\\n\\n\\n\\npub use regex::Error;\\n\\n\\n\\n#[derive(Clone)]\\n\\npub struct Regex(regex::bytes::Regex);\\n\\n\\n\\nimpl FromStr for Regex {\\n\\n type Err = Error;\\n\\n\\n\\n fn from_str(s: &str) -> Result<Self, Error> {\\n\\n ::regex::bytes::RegexBuilder::new(s)\\n\\n .unicode(false)\\n\\n .build()\\n\\n .map(Regex)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Regex {\\n\\n pub fn is_match(&self, text: &[u8]) -> bool {\\n\\n self.0.is_match(text)\\n\\n }\\n\\n\\n\\n pub fn as_str(&self) -> &str {\\n\\n self.0.as_str()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"engine/src/rhs_types/regex/imp_real.rs\",\n \"rank\": 81,\n \"score\": 9.432224044801089\n },\n {\n \"content\": \" let mut span_len = span.len();\\n\\n\\n\\n if let Some(line_end) = input.find('\\\\n') {\\n\\n input = &input[..line_end];\\n\\n span_len = min(span_len, line_end - span_start);\\n\\n }\\n\\n\\n\\n ParseError {\\n\\n kind,\\n\\n input,\\n\\n line_number,\\n\\n span_start,\\n\\n span_len,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'i> Display for ParseError<'i> {\\n\\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\\n\\n writeln!(\\n\",\n \"file_path\": \"engine/src/scheme.rs\",\n \"rank\": 82,\n \"score\": 9.397730586761272\n },\n {\n \"content\": \" use rhs_types::IpRange;\\n\\n use std::net::IpAddr;\\n\\n\\n\\n lazy_static! {\\n\\n static ref SCHEME: Scheme = Scheme! {\\n\\n http.host: Bytes,\\n\\n ip.addr: Ip,\\n\\n ssl: Bool,\\n\\n tcp.port: Int,\\n\\n };\\n\\n }\\n\\n\\n\\n fn field(name: &'static str) -> Field<'static> {\\n\\n SCHEME.get_field_index(name).unwrap()\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_is_true() {\\n\\n let expr = assert_ok!(\\n\\n FieldExpr::lex_with(\\\"ssl\\\", &SCHEME),\\n\",\n \"file_path\": \"engine/src/ast/field_expr.rs\",\n \"rank\": 83,\n \"score\": 9.106336360456845\n },\n {\n \"content\": \" .1;\\n\\n\\n\\n match expect(input, \\\".\\\") {\\n\\n Ok(rest) => input = rest,\\n\\n Err(_) => break,\\n\\n };\\n\\n }\\n\\n\\n\\n let name = span(initial_input, input);\\n\\n\\n\\n let field = scheme\\n\\n .get_field_index(name)\\n\\n .map_err(|err| (LexErrorKind::UnknownField(err), name))?;\\n\\n\\n\\n Ok((field, input))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'s> Field<'s> {\\n\\n pub fn name(&self) -> &'s str {\\n\",\n \"file_path\": \"engine/src/scheme.rs\",\n \"rank\": 85,\n \"score\": 8.75607097275675\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl PartialOrd<UninhabitedBool> for bool {\\n\\n fn partial_cmp(&self, other: &UninhabitedBool) -> Option<Ordering> {\\n\\n match *other {}\\n\\n }\\n\\n}\\n\\n\\n\\nimpl StrictPartialOrd<UninhabitedBool> for bool {}\\n\\n\\n\\nimpl<'i> Lex<'i> for UninhabitedBool {\\n\\n fn lex(_input: &str) -> LexResult<'_, Self> {\\n\\n unreachable!()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"engine/src/rhs_types/bool.rs\",\n \"rank\": 86,\n \"score\": 8.733453755354713\n },\n {\n \"content\": \"\\n\\n assert!(re.is_match(version.into_ref()));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn filter_uses() {\\n\\n let scheme = create_scheme();\\n\\n\\n\\n {\\n\\n let filter = parse_filter(\\n\\n &scheme,\\n\\n r#\\\"num1 > 41 && num2 == 1337 && ip1 != 192.168.0.1 && str2 ~ \\\"yo\\\\d+\\\"\\\"#,\\n\\n )\\n\\n .unwrap();\\n\\n\\n\\n assert!(wirefilter_filter_uses(\\n\\n &filter,\\n\\n ExternallyAllocatedStr::from(\\\"num1\\\")\\n\\n ));\\n\\n\\n\",\n \"file_path\": \"ffi/src/lib.rs\",\n \"rank\": 87,\n \"score\": 8.621461123201446\n },\n {\n \"content\": \" let before_char = iter.as_str();\\n\\n match iter\\n\\n .next()\\n\\n .ok_or_else(|| (LexErrorKind::MissingEndingQuote, input))?\\n\\n {\\n\\n '\\\\\\\\' => {\\n\\n if let Some(c) = iter.next() {\\n\\n if in_char_class || c != '\\\"' {\\n\\n regex_buf.push('\\\\\\\\');\\n\\n }\\n\\n regex_buf.push(c);\\n\\n }\\n\\n }\\n\\n '\\\"' if !in_char_class => {\\n\\n break (span(input, before_char), iter.as_str());\\n\\n }\\n\\n '[' if !in_char_class => {\\n\\n in_char_class = true;\\n\\n regex_buf.push('[');\\n\\n }\\n\",\n \"file_path\": \"engine/src/rhs_types/regex/mod.rs\",\n \"rank\": 88,\n \"score\": 8.483060275868079\n },\n {\n \"content\": \"}\\n\\n\\n\\n#[no_mangle]\\n\\npub extern \\\"C\\\" fn wirefilter_get_version() -> StaticRustAllocatedString {\\n\\n StaticRustAllocatedString::from(VERSION)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod ffi_test {\\n\\n use super::*;\\n\\n use regex::Regex;\\n\\n\\n\\n fn create_scheme() -> RustBox<Scheme> {\\n\\n let mut scheme = wirefilter_create_scheme();\\n\\n\\n\\n wirefilter_add_type_field_to_scheme(\\n\\n &mut scheme,\\n\\n ExternallyAllocatedStr::from(\\\"ip1\\\"),\\n\\n Type::Ip,\\n\\n );\\n\",\n \"file_path\": \"ffi/src/lib.rs\",\n \"rank\": 89,\n \"score\": 8.01632862130547\n },\n {\n \"content\": \" Some(ordering) => self.matches(ordering),\\n\\n // only `!=` should be true for incomparable types\\n\\n None => self == OrderingOp::NotEqual,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nlex_enum!(IntOp {\\n\\n \\\"&\\\" | \\\"bitwise_and\\\" => BitwiseAnd,\\n\\n});\\n\\n\\n\\nlex_enum!(BytesOp {\\n\\n \\\"contains\\\" => Contains,\\n\\n \\\"~\\\" | \\\"matches\\\" => Matches,\\n\\n});\\n\\n\\n\\nlex_enum!(ComparisonOp {\\n\\n \\\"in\\\" => In,\\n\\n OrderingOp => Ordering,\\n\\n IntOp => Int,\\n\\n BytesOp => Bytes,\\n\\n});\\n\\n\\n\\n#[derive(Debug, PartialEq, Eq, Clone, Serialize)]\\n\\n#[serde(untagged)]\\n\",\n \"file_path\": \"engine/src/ast/field_expr.rs\",\n \"rank\": 90,\n \"score\": 7.936023558075213\n },\n {\n \"content\": \"\\n\\n loop {\\n\\n lookahead = Self::lex_combining_op(rhs.1);\\n\\n if lookahead.0 <= Some(op) {\\n\\n break;\\n\\n }\\n\\n rhs = rhs\\n\\n .0\\n\\n .lex_more_with_precedence(scheme, lookahead.0, lookahead)?;\\n\\n }\\n\\n\\n\\n match lhs {\\n\\n CombinedExpr::Combining {\\n\\n op: lhs_op,\\n\\n ref mut items,\\n\\n } if lhs_op == op => {\\n\\n items.push(rhs.0);\\n\\n }\\n\\n _ => {\\n\\n lhs = CombinedExpr::Combining {\\n\",\n \"file_path\": \"engine/src/ast/combined_expr.rs\",\n \"rank\": 91,\n \"score\": 7.918928105872222\n },\n {\n \"content\": \" (FieldOp::IsTrue, input)\\n\\n } else {\\n\\n let (op, input) = ComparisonOp::lex(skip_space(input))?;\\n\\n\\n\\n let input_after_op = input;\\n\\n\\n\\n let input = skip_space(input);\\n\\n\\n\\n match (field_type, op) {\\n\\n (_, ComparisonOp::In) => {\\n\\n let (rhs, input) = RhsValues::lex_with(input, field_type)?;\\n\\n (FieldOp::OneOf(rhs), input)\\n\\n }\\n\\n (_, ComparisonOp::Ordering(op)) => {\\n\\n let (rhs, input) = RhsValue::lex_with(input, field_type)?;\\n\\n (FieldOp::Ordering { op, rhs }, input)\\n\\n }\\n\\n (Type::Int, ComparisonOp::Int(op)) => {\\n\\n let (rhs, input) = i32::lex(input)?;\\n\\n (FieldOp::Int { op, rhs }, input)\\n\",\n \"file_path\": \"engine/src/ast/field_expr.rs\",\n \"rank\": 92,\n \"score\": 7.870027807350461\n },\n {\n \"content\": \"use super::ExternPtrRepr;\\n\\nuse libc::size_t;\\n\\nuse std::slice;\\n\\n\\n\\n/// This structure provides FFI-safe representation for Rust slice pointers\\n\\n/// by splitting them into data and length parts.\\n\\n///\\n\\n/// Example C definition for `ExternSliceRepr<u8>`:\\n\\n/// ```\\n\\n/// struct ByteSlice {\\n\\n/// const uint8_t *data;\\n\\n/// size_t length;\\n\\n/// };\\n\\n/// ```\\n\\n#[repr(C)]\\n\\npub struct ExternSliceRepr<T> {\\n\\n data: *mut T,\\n\\n length: size_t,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"ffi/src/transfer_types/raw_ptr_repr/slice.rs\",\n \"rank\": 93,\n \"score\": 7.785183624151369\n },\n {\n \"content\": \" }\\n\\n (Type::Bytes, ComparisonOp::Bytes(op)) => match op {\\n\\n BytesOp::Contains => {\\n\\n let (bytes, input) = Bytes::lex(input)?;\\n\\n (FieldOp::Contains(bytes), input)\\n\\n }\\n\\n BytesOp::Matches => {\\n\\n let (regex, input) = Regex::lex(input)?;\\n\\n (FieldOp::Matches(regex), input)\\n\\n }\\n\\n },\\n\\n _ => {\\n\\n return Err((\\n\\n LexErrorKind::UnsupportedOp { field_type },\\n\\n span(initial_input, input_after_op),\\n\\n ));\\n\\n }\\n\\n }\\n\\n };\\n\\n\\n\",\n \"file_path\": \"engine/src/ast/field_expr.rs\",\n \"rank\": 94,\n \"score\": 7.755722414656348\n },\n {\n \"content\": \" let lookahead = Self::lex_combining_op(input);\\n\\n CombinedExpr::Simple(lhs).lex_more_with_precedence(scheme, None, lookahead)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'s> Expr<'s> for CombinedExpr<'s> {\\n\\n fn uses(&self, field: Field<'s>) -> bool {\\n\\n match self {\\n\\n CombinedExpr::Simple(op) => op.uses(field),\\n\\n CombinedExpr::Combining { items, .. } => items.iter().any(|op| op.uses(field)),\\n\\n }\\n\\n }\\n\\n\\n\\n fn compile(self) -> CompiledExpr<'s> {\\n\\n match self {\\n\\n CombinedExpr::Simple(op) => op.compile(),\\n\\n CombinedExpr::Combining { op, items } => {\\n\\n let items = items\\n\\n .into_iter()\\n\\n .map(|item| item.compile())\\n\",\n \"file_path\": \"engine/src/ast/combined_expr.rs\",\n \"rank\": 95,\n \"score\": 7.7391618269210625\n },\n {\n \"content\": \" assert!(wirefilter_filter_uses(\\n\\n &filter,\\n\\n ExternallyAllocatedStr::from(\\\"ip1\\\")\\n\\n ));\\n\\n\\n\\n assert!(wirefilter_filter_uses(\\n\\n &filter,\\n\\n ExternallyAllocatedStr::from(\\\"str2\\\")\\n\\n ));\\n\\n\\n\\n assert!(!wirefilter_filter_uses(\\n\\n &filter,\\n\\n ExternallyAllocatedStr::from(\\\"str1\\\")\\n\\n ));\\n\\n\\n\\n assert!(!wirefilter_filter_uses(\\n\\n &filter,\\n\\n ExternallyAllocatedStr::from(\\\"ip2\\\")\\n\\n ));\\n\\n\\n\\n wirefilter_free_parsed_filter(filter);\\n\\n }\\n\\n\\n\\n wirefilter_free_scheme(scheme);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"ffi/src/lib.rs\",\n \"rank\": 96,\n \"score\": 7.548741501634594\n },\n {\n \"content\": \" Some((index, ..)) => Ok(Field {\\n\\n scheme: self,\\n\\n index,\\n\\n }),\\n\\n None => Err(UnknownFieldError),\\n\\n }\\n\\n }\\n\\n\\n\\n pub(crate) fn get_field_count(&self) -> usize {\\n\\n self.fields.len()\\n\\n }\\n\\n\\n\\n /// Parses a filter into an AST form.\\n\\n pub fn parse<'i>(&'s self, input: &'i str) -> Result<FilterAst<'s>, ParseError<'i>> {\\n\\n complete(FilterAst::lex_with(input.trim(), self)).map_err(|err| ParseError::new(input, err))\\n\\n }\\n\\n}\\n\\n\\n\\n/// A convenience macro for constructing a [`Scheme`](struct@Scheme) with static\\n\\n/// contents.\\n\",\n \"file_path\": \"engine/src/scheme.rs\",\n \"rank\": 97,\n \"score\": 7.504822190122187\n },\n {\n \"content\": \"extern crate wirefilter;\\n\\n\\n\\nuse std::env::args;\\n\\nuse wirefilter::Scheme;\\n\\n\\n\",\n \"file_path\": \"engine/examples/cli.rs\",\n \"rank\": 98,\n \"score\": 7.423652439772343\n },\n {\n \"content\": \" Bytes::lex(r#\\\"\\\"\\\\01😢\\\"\\\"#),\\n\\n LexErrorKind::ParseInt {\\n\\n err: u8::from_str_radix(\\\"01😢\\\", 8).unwrap_err(),\\n\\n radix: 8,\\n\\n },\\n\\n \\\"01😢\\\"\\n\\n );\\n\\n\\n\\n assert_err!(\\n\\n Bytes::lex(r#\\\"\\\"\\\\x3😢\\\"\\\"#),\\n\\n LexErrorKind::ParseInt {\\n\\n err: u8::from_str_radix(\\\"3😢\\\", 16).unwrap_err(),\\n\\n radix: 16,\\n\\n },\\n\\n \\\"3😢\\\"\\n\\n );\\n\\n\\n\\n assert_err!(\\n\\n Bytes::lex(\\\"12:3😢\\\"),\\n\\n LexErrorKind::ParseInt {\\n\\n err: u8::from_str_radix(\\\"3😢\\\", 16).unwrap_err(),\\n\\n radix: 16,\\n\\n },\\n\\n \\\"3😢\\\"\\n\\n );\\n\\n}\\n\",\n \"file_path\": \"engine/src/rhs_types/bytes.rs\",\n \"rank\": 99,\n \"score\": 7.406381839017225\n }\n]","isConversational":false}}},{"rowIdx":1399,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/main.rs"},"repo_name":{"kind":"string","value":"jmccrae/simple-rust-web"},"commit":{"kind":"string","value":"88ac2fc0c0d5ca91c05d8b3543a9cc00a0e43bcd"},"file_code":{"kind":"string","value":"extern crate clap;\nextern crate iron;\nextern crate handlebars;\nextern crate params;\nextern crate percent_encoding;\n#[macro_use]\nextern crate serde_derive;\nextern crate serde;\nextern crate serde_json;\n\nmod renderer;\nmod templates;\n\nuse clap::{Arg, App};\nuse handlebars::Handlebars;\nuse iron::middleware::Handler;\nuse iron::prelude::*;\nuse params::Params;\nuse percent_encoding::percent_decode;\nuse renderer::*;\nuse serde::Serialize;\nuse templates::*;\nuse std::collections::HashMap;\nuse std::str::from_utf8;\n\nstruct Server {\n hbars : Handlebars,\n renderers : Vec<(&'static str, Box<Renderer>)>\n}\n\nimpl Server {\n \n fn new() -> Server {\n let mut hb = Handlebars::new();\n \n hb.register_template_string(\"layout\", \n from_utf8(LAYOUT).expect(\"Layout is not valid utf-8\")).\n expect(\"Layout is not valid template\");\n\n for &(name, template) in TEMPLATES.iter() {\n hb.register_template_string(name,\n from_utf8(template).expect(\n &format!(\"{} is not valid UTF-8\", name))).\n expect(&format!(\"{} is not a valid template\", name));\n }\n\n Server {\n hbars : hb,\n renderers : Vec::new()\n }\n }\n\n #[allow(dead_code)]\n \n \n fn add_static(&mut self, path : &'static str, name : &str, content : &'static [u8]) {\n self.renderers.push((path, Box::new(StaticRenderer::new(name.to_string(), content))))\n }\n\n #[allow(dead_code)]\n \n fn add_renderer(&mut self, path: &'static str, renderer : Box<Renderer>) {\n self.renderers.push((path, renderer));\n }\n\n #[allow(dead_code)]\n \n \n fn add_translator<A>(&mut self, path: &'static str, name: &str, template : &'static str,\n translator : Box<Translator<A>>) where A : Serialize + 'static {\n self.renderers.push((path, Box::new(TranslatorRenderer(name.to_string(), template.to_string(), translator))))\n }\n}\n\nimpl Handler for Server {\n fn handle(&self, req : &mut Request) -> IronResult<Response> {\n for &(ref path, ref renderer) in self.renderers.iter() {\n match match_path(path, &req.url.path()) {\n Some(args) => {\n let depth = req.url.path().len();\n let params = req.get_ref::<Params>().unwrap();\n\n return renderer.render(args, params, &self.hbars, depth);\n },\n None => {}\n }\n\n }\n return render_error(&self.hbars, from_utf8(templates::NOT_FOUND).\n expect(\"Invalid UTF-8 in 404\").to_string(),\n iron::status::NotFound);\n\n }\n}\n\nfn match_path(pattern : &str, path : &Vec<&str>) -> Option<HashMap<String,String>> {\n let mut captures = HashMap::new();\n let p : Vec<&str> = pattern.split(\"/\").collect();\n if p.len() != path.len() {\n None\n } else {\n for (p1,p2) in p.iter().zip(path.iter()) {\n if p1.starts_with(\":\") {\n captures.insert(p1[1..].to_string(), urldecode(p2));\n } else if p1 != p2 {\n return None;\n }\n }\n Some(captures)\n }\n}\n\nfn urldecode(s : &str) -> String {\n percent_decode(s.as_bytes()).decode_utf8().unwrap().into_owned()\n}\n\nfn main() {\n let matches = App::new(APP_TITLE).\n version(VERSION).\n author(AUTHOR).\n about(ABOUT).\n arg(Arg::with_name(\"port\")\n .short(\"p\")\n .long(\"port\")\n .value_name(\"PORT\")\n .help(\"The port to run the server on\")\n .takes_value(true)).\n get_matches();\n\n let port : u16 = matches.value_of(\"port\").and_then(|pstr| { pstr.parse::<u16>().ok() }).unwrap_or(3000);\n\n let mut server = Server::new();\n init(&mut server);\n let iron = Iron::new(server);\n iron.http((\"localhost\",port)).unwrap();\n}\n\nstatic APP_TITLE : &'static str = \"My App\";\nstatic VERSION : &'static str = \"0.1\";\nstatic AUTHOR : &'static str = \"John McCrae <john@mccr.ae>\";\nstatic ABOUT : &'static str = \"Simple framework for making Rust Webapps\";\n\nstruct TestTranslator;\n\nimpl Translator<String> for TestTranslator {\n fn convert(&self, v : HashMap<String, String>) -> Result<String,TranslatorError> { Ok(v[\"test\"].clone()) }\n}\n\nfn init(server : &mut Server) {\n server.add_static(\"\", \"Index\", INDEX);\n server.add_translator(\"foo\", \"bar\", \"template\", Box::new(TestTranslator));\n}\n\n"},"prefix":{"kind":"string","value":"extern crate clap;\nextern crate iron;\nextern crate handlebars;\nextern crate params;\nextern crate percent_encoding;\n#[macro_use]\nextern crate serde_derive;\nextern crate serde;\nextern crate serde_json;\n\nmod renderer;\nmod templates;\n\nuse clap::{Arg, App};\nuse handlebars::Handlebars;\nuse iron::middleware::Handler;\nuse iron::prelude::*;\nuse params::Params;\nuse percent_encoding::percent_decode;\nuse renderer::*;\nuse serde::Serialize;\nuse templates::*;\nuse std::collections::HashMap;\nuse std::str::from_utf8;\n\nstruct Server {\n hbars : Handlebars,\n renderers : Vec<(&'static str, Box<Renderer>)>\n}\n\nimpl Server {\n \n fn new() -> Server {\n let mut hb = Handlebars::new();\n \n hb.register_template_string(\"layout\", \n from_utf8(LAYOUT).expect(\"Layout is not valid utf-8\")).\n expect(\"Layout is not valid template\");\n\n for &(name, template) in TEMPLATES.iter() {\n hb.register_template_string(name,\n from_utf8(template).expect(\n &format!(\"{} is not valid UTF-8\", name))).\n expect(&format!(\"{} is not a valid template\", name));\n }\n\n Server {\n hbars : hb,\n renderers : Vec::new()\n }\n }\n\n #[allow(dead_code)]\n \n \n fn add_static(&mut self, path : &'static str, name : &str, content : &'static [u8]) {\n self.renderers.push((path, Box::new(StaticRenderer::new(name.to_string(), content))))\n }\n\n #[allow(dead_code)]\n \n fn add_renderer(&mut self, path: &'static str, renderer : Box<Renderer>) {\n self.renderers.push((path, renderer));\n }\n\n #[allow(dead_code)]\n \n \n fn add_translator<A>(&mut self, path: &'static str, name: &str, template : &'static str,\n translator : Box<Translator<A>>) where A : Serialize + 'static {\n self.renderers.push((path, Box::new(TranslatorRenderer(name.to_string(), template.to_string(), translator))))\n }\n}\n\nimpl Handler for Server {\n fn handle(&self, req : &mut Request) -> IronResult<Response> {\n for &(ref path, ref renderer) in self.renderers.iter() {\n match match_path(path, &req.url.path()) {\n Some(args) => {\n let depth = req.url.path().len();\n let params = req.get_ref::<Params>().unwrap();\n\n return renderer.render(args, params, &self.hbars, depth);\n },\n None => {}\n }\n\n }\n return render_error(&self.hbars, from_utf8(templates::NOT_FOUND).\n expect(\"Invalid UTF-8 in 404\").to_string(),\n iron::status::NotFound);\n\n }\n}\n\nfn match_path(pattern : &str, path : &Vec<&str>) -> Option<HashMap<String,String>> {\n let mut captures = HashMap::new();\n let p : Vec<&str> = pattern.split(\"/\").collect();\n if p.len() != path.len() {\n None\n } else {\n for (p1,p2) in p.iter().zip(path.iter()) {\n if p1.starts_with(\":\") {\n captures.insert(p1[1..].to_string(), urldecode(p2));\n } else if p1 != p2 {\n return None;\n }\n }\n Some(captures)\n }\n}\n\nfn urldecode(s : &str) -> String {\n percent_decode(s.as_bytes()).decode_utf8().unwrap().into_owned()\n}\n\nfn main() {\n let matches = App::new(APP_TITLE).\n version(VERSION).\n author(AUTHOR).\n about(ABOUT).\n arg(Arg::with_name(\"port\")\n .short(\"p\")\n .long(\"port\")\n .value_name(\"PORT\")\n .help(\"The port to run the server on\")\n .takes_value(true)).\n get_matches();\n\n let port : u16 = matches.value_of(\"port\").and_then(|pstr| { pstr.parse::<u16>().ok() }).unwrap_or(3000);\n\n "},"suffix":{"kind":"string","value":"\n\nstatic APP_TITLE : &'static str = \"My App\";\nstatic VERSION : &'static str = \"0.1\";\nstatic AUTHOR : &'static str = \"John McCrae <john@mccr.ae>\";\nstatic ABOUT : &'static str = \"Simple framework for making Rust Webapps\";\n\nstruct TestTranslator;\n\nimpl Translator<String> for TestTranslator {\n fn convert(&self, v : HashMap<String, String>) -> Result<String,TranslatorError> { Ok(v[\"test\"].clone()) }\n}\n\nfn init(server : &mut Server) {\n server.add_static(\"\", \"Index\", INDEX);\n server.add_translator(\"foo\", \"bar\", \"template\", Box::new(TestTranslator));\n}\n\n"},"middle":{"kind":"string","value":"let mut server = Server::new();\n init(&mut server);\n let iron = Iron::new(server);\n iron.http((\"localhost\",port)).unwrap();\n}"},"strategy":{"kind":"string","value":"function_block-function_prefix_line"},"context_items":{"kind":"list like","value":[{"content":"/// Render using `layout.hbs`\n\npub fn render_ok(hbars : &Handlebars, title : String, body : String) -> IronResult<Response> {\n\n Ok(Response::with(\n\n (iron::status::Ok,\n\n Header(ContentType::html()),\n\n hbars.render(\"layout\", &LayoutPage {\n\n title : title,\n\n body : body\n\n }).expect(\"Could not render layout\"))))\n\n}\n\n\n","file_path":"src/renderer.rs","rank":3,"score":86208.43512414781},{"content":"/// Render an error using `layout.hbs`\n\npub fn render_error(hbars : &Handlebars, body : String, error : iron::status::Status) -> IronResult<Response> {\n\n Ok(Response::with(\n\n (error,\n\n Header(ContentType::html()),\n\n hbars.render(\"layout\", &LayoutPage {\n\n title : ::APP_TITLE.to_string(),\n\n body : body\n\n }).expect(\"Could not render error page\"))))\n\n}\n\n\n\n\n","file_path":"src/renderer.rs","rank":4,"score":84540.1277485104},{"content":"#[derive(Debug,Clone,Serialize)]\n\nstruct LayoutPage {\n\n title : String,\n\n body : String\n\n}\n\n\n","file_path":"src/renderer.rs","rank":8,"score":44289.78406231613},{"content":"/// A translator that can convert query arguments into a serializable object\n\npub trait Translator<A : Serialize> : Sync + Send {\n\n fn convert(&self, HashMap<String, String>) -> Result<A,TranslatorError>;\n\n}\n\n\n\nimpl<A : Serialize> Renderer for Box<Translator<A>> {\n\n fn render(&self, args : HashMap<String, String>, _ : &Map, _ : &Handlebars, _:usize) -> IronResult<Response> {\n\n match self.convert(args) {\n\n Ok(data) => {\n\n match serde_json::to_string(&data) {\n\n Ok(s) => {\n\n Ok(Response::with((\n\n iron::status::Ok,\n\n Header(ContentType::json()), s)))\n\n },\n\n Err(e) => {\n\n Ok(Response::with((\n\n iron::status::InternalServerError,\n\n Header(ContentType::plaintext()), e.description())))\n\n }\n\n }\n","file_path":"src/renderer.rs","rank":9,"score":38670.734461183565},{"content":"#[allow(dead_code)]\n\ntype TranslatorResult<A> = Result<A, TranslatorError>;\n\n\n","file_path":"src/renderer.rs","rank":10,"score":30081.172341311998},{"content":"pub static LAYOUT : &'static [u8] = include_bytes!(\"layout.hbs\");\n\npub static NOT_FOUND : &'static [u8] = include_bytes!(\"not_found.html\");\n\npub static INDEX : &'static [u8] = include_bytes!(\"index.html\");\n\n\n\npub static TEMPLATES : [(&'static str, &'static [u8]);0] = [];\n","file_path":"src/templates.rs","rank":11,"score":17980.061969639264},{"content":"/// A renderer that can create a particular page\n\npub trait Renderer : Send + Sync {\n\n fn render(&self, HashMap<String, String>, &Map, &Handlebars, usize) -> IronResult<Response>;\n\n}\n\n\n\n/// The renderer for showing a static page\n\npub struct StaticRenderer(String, String);\n\n\n\nimpl StaticRenderer {\n\n pub fn new(name: String, data : &'static [u8]) -> StaticRenderer {\n\n StaticRenderer(name, from_utf8(data).expect(\"Invalid UTF-8\").to_string())\n\n }\n\n}\n\n\n\nimpl Renderer for StaticRenderer {\n\n fn render(&self, _: HashMap<String, String>, _ : &Map, hb : &Handlebars, _ : usize) -> IronResult<Response> {\n\n let title = format!(\"{} - {}\", ::APP_TITLE, self.0);\n\n render_ok(hb, title, self.1.clone())\n\n }\n\n}\n\n\n\n/// Errors from the translation\n\n#[allow(dead_code)]\n\npub enum TranslatorError {\n\n ParameterError(String),\n\n TranslationError(String)\n\n}\n\n\n","file_path":"src/renderer.rs","rank":12,"score":16748.26720214054},{"content":" },\n\n Err(TranslatorError::ParameterError(msg)) => {\n\n Ok(Response::with((\n\n iron::status::BadRequest,\n\n Header(ContentType::plaintext()), msg)))\n\n },\n\n Err(TranslatorError::TranslationError(msg)) =>{\n\n Ok(Response::with((\n\n iron::status::InternalServerError,\n\n Header(ContentType::plaintext()), msg)))\n\n }\n\n }\n\n }\n\n}\n\n\n\n/// A renderer that uses a template to produce HTML for a translated object\n\npub struct TranslatorRenderer<A : Serialize>(pub String, pub String, pub Box<Translator<A>>);\n\n\n\nimpl<A: Serialize> Renderer for TranslatorRenderer<A> {\n\n fn render(&self, args : HashMap<String, String>, _ : &Map, hb : &Handlebars, _:usize) -> IronResult<Response> {\n","file_path":"src/renderer.rs","rank":13,"score":15305.191982333588},{"content":"use handlebars::Handlebars;\n\nuse iron::headers::ContentType;\n\nuse iron::modifiers::Header;\n\nuse iron::prelude::*;\n\nuse iron;\n\nuse params::Map;\n\nuse serde::Serialize;\n\nuse serde_json;\n\nuse std::collections::HashMap;\n\nuse std::error::Error;\n\nuse std::result::Result;\n\nuse std::str::from_utf8;\n\n\n\n\n\n#[derive(Debug,Clone,Serialize)]\n","file_path":"src/renderer.rs","rank":14,"score":15303.839199080965},{"content":" let title = format!(\"{} - {}\", ::APP_TITLE, self.0);\n\n match self.2.convert(args) {\n\n Ok(body) => {\n\n render_ok(hb, title.to_string(), hb.render(&self.1, &body).\n\n expect(&format!(\"Could not use template {}\", self.1)))\n\n },\n\n Err(TranslatorError::ParameterError(msg)) => {\n\n Ok(Response::with((\n\n iron::status::BadRequest,\n\n Header(ContentType::plaintext()), msg)))\n\n },\n\n Err(TranslatorError::TranslationError(msg)) =>{\n\n Ok(Response::with((\n\n iron::status::InternalServerError,\n\n Header(ContentType::plaintext()), msg)))\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"src/renderer.rs","rank":15,"score":15303.755489036424},{"content":"# Simple Rust Web Framework\n\n\n\nA very simple framework for building web applications in Rust. This is intended \n\nto be used as a template to build a web application.\n","file_path":"README.md","rank":20,"score":2.5277100669264567}],"string":"[\n {\n \"content\": \"/// Render using `layout.hbs`\\n\\npub fn render_ok(hbars : &Handlebars, title : String, body : String) -> IronResult<Response> {\\n\\n Ok(Response::with(\\n\\n (iron::status::Ok,\\n\\n Header(ContentType::html()),\\n\\n hbars.render(\\\"layout\\\", &LayoutPage {\\n\\n title : title,\\n\\n body : body\\n\\n }).expect(\\\"Could not render layout\\\"))))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/renderer.rs\",\n \"rank\": 3,\n \"score\": 86208.43512414781\n },\n {\n \"content\": \"/// Render an error using `layout.hbs`\\n\\npub fn render_error(hbars : &Handlebars, body : String, error : iron::status::Status) -> IronResult<Response> {\\n\\n Ok(Response::with(\\n\\n (error,\\n\\n Header(ContentType::html()),\\n\\n hbars.render(\\\"layout\\\", &LayoutPage {\\n\\n title : ::APP_TITLE.to_string(),\\n\\n body : body\\n\\n }).expect(\\\"Could not render error page\\\"))))\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"src/renderer.rs\",\n \"rank\": 4,\n \"score\": 84540.1277485104\n },\n {\n \"content\": \"#[derive(Debug,Clone,Serialize)]\\n\\nstruct LayoutPage {\\n\\n title : String,\\n\\n body : String\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/renderer.rs\",\n \"rank\": 8,\n \"score\": 44289.78406231613\n },\n {\n \"content\": \"/// A translator that can convert query arguments into a serializable object\\n\\npub trait Translator<A : Serialize> : Sync + Send {\\n\\n fn convert(&self, HashMap<String, String>) -> Result<A,TranslatorError>;\\n\\n}\\n\\n\\n\\nimpl<A : Serialize> Renderer for Box<Translator<A>> {\\n\\n fn render(&self, args : HashMap<String, String>, _ : &Map, _ : &Handlebars, _:usize) -> IronResult<Response> {\\n\\n match self.convert(args) {\\n\\n Ok(data) => {\\n\\n match serde_json::to_string(&data) {\\n\\n Ok(s) => {\\n\\n Ok(Response::with((\\n\\n iron::status::Ok,\\n\\n Header(ContentType::json()), s)))\\n\\n },\\n\\n Err(e) => {\\n\\n Ok(Response::with((\\n\\n iron::status::InternalServerError,\\n\\n Header(ContentType::plaintext()), e.description())))\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/renderer.rs\",\n \"rank\": 9,\n \"score\": 38670.734461183565\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\ntype TranslatorResult<A> = Result<A, TranslatorError>;\\n\\n\\n\",\n \"file_path\": \"src/renderer.rs\",\n \"rank\": 10,\n \"score\": 30081.172341311998\n },\n {\n \"content\": \"pub static LAYOUT : &'static [u8] = include_bytes!(\\\"layout.hbs\\\");\\n\\npub static NOT_FOUND : &'static [u8] = include_bytes!(\\\"not_found.html\\\");\\n\\npub static INDEX : &'static [u8] = include_bytes!(\\\"index.html\\\");\\n\\n\\n\\npub static TEMPLATES : [(&'static str, &'static [u8]);0] = [];\\n\",\n \"file_path\": \"src/templates.rs\",\n \"rank\": 11,\n \"score\": 17980.061969639264\n },\n {\n \"content\": \"/// A renderer that can create a particular page\\n\\npub trait Renderer : Send + Sync {\\n\\n fn render(&self, HashMap<String, String>, &Map, &Handlebars, usize) -> IronResult<Response>;\\n\\n}\\n\\n\\n\\n/// The renderer for showing a static page\\n\\npub struct StaticRenderer(String, String);\\n\\n\\n\\nimpl StaticRenderer {\\n\\n pub fn new(name: String, data : &'static [u8]) -> StaticRenderer {\\n\\n StaticRenderer(name, from_utf8(data).expect(\\\"Invalid UTF-8\\\").to_string())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Renderer for StaticRenderer {\\n\\n fn render(&self, _: HashMap<String, String>, _ : &Map, hb : &Handlebars, _ : usize) -> IronResult<Response> {\\n\\n let title = format!(\\\"{} - {}\\\", ::APP_TITLE, self.0);\\n\\n render_ok(hb, title, self.1.clone())\\n\\n }\\n\\n}\\n\\n\\n\\n/// Errors from the translation\\n\\n#[allow(dead_code)]\\n\\npub enum TranslatorError {\\n\\n ParameterError(String),\\n\\n TranslationError(String)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/renderer.rs\",\n \"rank\": 12,\n \"score\": 16748.26720214054\n },\n {\n \"content\": \" },\\n\\n Err(TranslatorError::ParameterError(msg)) => {\\n\\n Ok(Response::with((\\n\\n iron::status::BadRequest,\\n\\n Header(ContentType::plaintext()), msg)))\\n\\n },\\n\\n Err(TranslatorError::TranslationError(msg)) =>{\\n\\n Ok(Response::with((\\n\\n iron::status::InternalServerError,\\n\\n Header(ContentType::plaintext()), msg)))\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// A renderer that uses a template to produce HTML for a translated object\\n\\npub struct TranslatorRenderer<A : Serialize>(pub String, pub String, pub Box<Translator<A>>);\\n\\n\\n\\nimpl<A: Serialize> Renderer for TranslatorRenderer<A> {\\n\\n fn render(&self, args : HashMap<String, String>, _ : &Map, hb : &Handlebars, _:usize) -> IronResult<Response> {\\n\",\n \"file_path\": \"src/renderer.rs\",\n \"rank\": 13,\n \"score\": 15305.191982333588\n },\n {\n \"content\": \"use handlebars::Handlebars;\\n\\nuse iron::headers::ContentType;\\n\\nuse iron::modifiers::Header;\\n\\nuse iron::prelude::*;\\n\\nuse iron;\\n\\nuse params::Map;\\n\\nuse serde::Serialize;\\n\\nuse serde_json;\\n\\nuse std::collections::HashMap;\\n\\nuse std::error::Error;\\n\\nuse std::result::Result;\\n\\nuse std::str::from_utf8;\\n\\n\\n\\n\\n\\n#[derive(Debug,Clone,Serialize)]\\n\",\n \"file_path\": \"src/renderer.rs\",\n \"rank\": 14,\n \"score\": 15303.839199080965\n },\n {\n \"content\": \" let title = format!(\\\"{} - {}\\\", ::APP_TITLE, self.0);\\n\\n match self.2.convert(args) {\\n\\n Ok(body) => {\\n\\n render_ok(hb, title.to_string(), hb.render(&self.1, &body).\\n\\n expect(&format!(\\\"Could not use template {}\\\", self.1)))\\n\\n },\\n\\n Err(TranslatorError::ParameterError(msg)) => {\\n\\n Ok(Response::with((\\n\\n iron::status::BadRequest,\\n\\n Header(ContentType::plaintext()), msg)))\\n\\n },\\n\\n Err(TranslatorError::TranslationError(msg)) =>{\\n\\n Ok(Response::with((\\n\\n iron::status::InternalServerError,\\n\\n Header(ContentType::plaintext()), msg)))\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/renderer.rs\",\n \"rank\": 15,\n \"score\": 15303.755489036424\n },\n {\n \"content\": \"# Simple Rust Web Framework\\n\\n\\n\\nA very simple framework for building web applications in Rust. This is intended \\n\\nto be used as a template to build a web application.\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 20,\n \"score\": 2.5277100669264567\n }\n]","isConversational":false}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":13,"numItemsPerPage":100,"numTotalItems":13489,"offset":1300,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3OTY1NDYyNywic3ViIjoiL2RhdGFzZXRzL3NvdXJjZWdyYXBoL2NvbnRleHQtYXdhcmUtZmltLWNvZGUtY29tcGxldGlvbnMiLCJleHAiOjE3Nzk2NTgyMjcsImlzcyI6Imh0dHBzOi8vaHVnZ2luZ2ZhY2UuY28ifQ.8BuPr90OS-uhehrWNxHYh8jlXLrvGcuemOdPtLn0Ze0hvpOjvADNqIdC3M0Q9O7hFlt-PpysZcoHXB9Jza7vCg","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":13489,"numBytesParquet":605686331}]},"discussionsStats":{"closed":0,"open":1,"total":1},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
lang stringclasses 3
values | file_path stringlengths 5 150 | repo_name stringlengths 6 110 | commit stringlengths 40 40 | file_code stringlengths 1.52k 18.9k | prefix stringlengths 82 16.5k | suffix stringlengths 0 15.1k | middle stringlengths 121 8.18k | strategy stringclasses 8
values | context_items listlengths 0 100 |
|---|---|---|---|---|---|---|---|---|---|
Rust | contracts/tests/sim/test_storage.rs | alexkeating/moloch | bf11f8e03de63a000706bb1c711cec16410dbe09 | use crate::utils::init_moloch;
use near_sdk_sim::{call, to_yocto};
use std::convert::TryInto;
#[test]
fn simulate_storage_deposit_exact() {
let (_, moloch, _fdai, _alice, bob, _deposit_amount) = init_moloch();
let start_amount = bob.account().unwrap().amount;
let min_deposit = to_yocto("7");
println!(... | use crate::utils::init_moloch;
use near_sdk_sim::{call, to_yocto};
use std::convert::TryInto;
#[test]
fn simulate_storage_deposit_exact() {
let (_, moloch, _fdai, _alice, bob, _deposit_amount) = init_moloch();
let start_amount = bob.account().unwrap().amount;
let min_deposit = to_yocto("7");
println!(... |
#[test]
fn simulate_storage_deposit_already_registered() {
let (_, moloch, _, _, bob, _) = init_moloch();
let deposit = to_yocto("9");
call!(
bob,
moloch.storage_deposit(
Some(bob.account_id.to_string().try_into().unwrap()),
Some(false)
),
deposit,
... | fn simulate_storage_deposit_transfer_back() {
let (_, moloch, _fdai, _alice, bob, _deposit_amount) = init_moloch();
let start_amount = &bob.account().unwrap().amount;
let deposit = 828593677552200000000;
println!("Here {:?} 23", start_amount);
call!(
bob,
moloch.storage_deposit(
... | function_block-full_function | [
{
"content": "#[test]\n\nfn simulate_submit_proposal() {\n\n let (_root, moloch, fdai, alice, bob, deposit_amount) = init_moloch();\n\n register_user_moloch(&alice, &moloch);\n\n register_user_moloch(&bob, &moloch);\n\n call!(\n\n bob,\n\n fdai.ft_transfer_call(\n\n moloch.u... |
Rust | src/uucore/src/lib/macros.rs | E3uka/coreutils | c7f7a222b9a2e86a68b204b417fbe23e7df01e3f |
use std::sync::atomic::AtomicBool;
pub static UTILITY_IS_SECOND_ARG: AtomicBool = AtomicBool::new(false);
#[macro_export]
macro_rules! show(
($err:expr) => ({
let e = $err;
$crate::error::set_exit_code(e.code());
eprintln!("{}: {}", $crate::util_name(), e);
})
);
#[macro_export]
mac... |
use std::sync::atomic::AtomicBool;
pub static UTILITY_IS_SECOND_ARG: AtomicBool = AtomicBool::new(false);
#[macro_export]
macro_rules! show(
($err:expr) => ({
let e = $err;
$crate::error::set_exit_code(e.code());
eprintln!("{}: {}", $crate::util_name(), e);
})
);
#[macro_export]
mac... | expr, $short_flag:expr) => {
$crate::msg_invalid_opt_use!(
format!("only usable if {}", $clause),
$long_flag,
$short_flag
)
};
}
#[macro_export]
macro_rules! msg_opt_invalid_should_be {
($expects:expr, $received:expr, $flag:expr) => {
$crate::msg_inva... | (m) => m,
Err(f) => {
$crate::show_error!("{}", f);
return $exit_code;
}
}
)
);
#[macro_export]
macro_rules! safe_writeln(
($fd:expr, $($args:tt)+) => (
match writeln!($fd, $($args)+) {
Ok(_) => {}
Err(f) => panic!(... | random | [
{
"content": "pub fn uu_app() -> App<'static, 'static> {\n\n App::new(uucore::util_name())\n\n .about(\"A file perusal filter for CRT viewing.\")\n\n .version(crate_version!())\n\n .arg(\n\n Arg::with_name(options::SILENT)\n\n .short(\"d\")\n\n .l... |
Rust | src/io.rs | finalfusion/finalfusion-utils | d37a5d7f17515bcd0d6ba56a2e4dcec5914bf07a | use std::convert::TryFrom;
use std::fmt;
use std::fs::File;
use std::io::{BufReader, BufWriter};
use anyhow::{anyhow, bail, Context, Error, Result};
use finalfusion::compat::floret::ReadFloretText;
use finalfusion::compat::text::{WriteText, WriteTextDims};
use finalfusion::compat::word2vec::WriteWord2Vec;
use finalfu... | use std::convert::TryFrom;
use std::fmt;
use std::fs::File;
use std::io::{BufReader, BufWriter};
use anyhow::{anyhow, bail, Context, Error, Result};
use finalfusion::compat::floret::ReadFloretText;
use finalfusion::compat::text::{WriteText, WriteTextDims};
use finalfusion::compat::word2vec::WriteWord2Vec;
use finalfu... |
}
impl fmt::Display for EmbeddingFormat {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
use EmbeddingFormat::*;
let s = match self {
FastText => "fasttext",
FinalFusion => "finalfusion",
FinalFusionMmap => "finalfusion_mmap",
Floret => "... | format {
"fasttext" => Ok(FastText),
"finalfusion" => Ok(FinalFusion),
"finalfusion_mmap" => Ok(FinalFusionMmap),
"floret" => Ok(Floret),
"word2vec" => Ok(Word2Vec),
"text" => Ok(Text),
"textdims" => Ok(TextDims),
unknown =>... | function_block-function_prefixed | [
{
"content": "fn read_metadata(filename: impl AsRef<str>) -> Result<Value> {\n\n let f = File::open(filename.as_ref())\n\n .context(format!(\"Cannot open metadata file: {}\", filename.as_ref()))?;\n\n let mut reader = BufReader::new(f);\n\n let mut buf = String::new();\n\n reader\n\n .... |
Rust | src/agent/coverage/src/cobertura.rs | tonybaloney/onefuzz | e0f2e9ed5aae006e0054387de7a0ff8c83c8f722 | use crate::source::SourceCoverage;
use crate::source::SourceCoverageLocation;
use crate::source::SourceFileCoverage;
use anyhow::Context;
use anyhow::Error;
use anyhow::Result;
use std::time::{SystemTime, UNIX_EPOCH};
use xml::writer::{EmitterConfig, XmlEvent};
pub fn cobertura(source_coverage: SourceCoverage) -> Resu... | use crate::source::SourceCoverage;
use crate::source::SourceCoverageLocation;
use crate::source::SourceFileCoverage;
use anyhow::Context;
use anyhow::Error;
use anyhow::Result;
use std::time::{SystemTime, UNIX_EPOCH};
use xml::writer::{EmitterConfig, XmlEvent};
|
#[cfg(test)]
mod tests {
use super::*;
use anyhow::Result;
#[test]
fn test_source_to_cobertura() -> Result<()> {
let mut coverage_locations_vec1: Vec<SourceCoverageLocation> = Vec::new();
coverage_locations_vec1.push(SourceCoverageLocation {
line: 5,
column: N... | pub fn cobertura(source_coverage: SourceCoverage) -> Result<String, Error> {
let mut backing: Vec<u8> = Vec::new();
let mut emitter = EmitterConfig::new()
.perform_indent(true)
.create_writer(&mut backing);
let unixtime = SystemTime::now()
.duration_since(UNIX_EPOCH)
.contex... | function_block-full_function | [
{
"content": " def is_used(self) -> bool:\n\n if len(self.get_forwards()) == 0:\n\n logging.info(PROXY_LOG_PREFIX + \"no forwards: %s\", self.region)\n\n return False\n",
"file_path": "src/api-service/__app__/onefuzzlib/proxy.py",
"rank": 0,
"score": 51893.43127703405... |
Rust | gui/src/app/root_stack/oc_page/stats_grid.rs | ashleysmithgpu/LACT | 0bfc6c5acdd800d33ce92527328a9477c215b180 | use daemon::gpu_controller::GpuStats;
use gtk::*;
#[derive(Clone)]
pub struct StatsGrid {
pub container: Grid,
vram_usage_bar: LevelBar,
vram_usage_label: Label,
gpu_clock_label: Label,
vram_clock_label: Label,
gpu_voltage_label: Label,
power_usage_label: Label,
gpu_temperature_label: L... | use daemon::gpu_controller::GpuStats;
use gtk::*;
#[derive(Clone)]
pub struct StatsGrid {
pub container: Grid,
vram_usage_bar: LevelBar,
vram_usage_label: Label,
gpu_clock_label: Label,
vram_clock_label: Label,
gpu_voltage_label: Label,
power_usage_label: Label,
gpu_temperature_label: L... |
}
| stats.power_cap.unwrap_or_else(|| 0)
));
self.gpu_temperature_label
.set_markup(&format!("<b>{}°C</b>", stats.gpu_temp.unwrap_or_default()));
self.gpu_usage_label
.set_markup(&format!("<b>{}%</b>", stats.gpu_usage.unwrap_or_default()));
} | function_block-function_prefix_line | [
{
"content": "fn print_stats(d: &DaemonConnection, gpu_id: u32) {\n\n let gpu_stats = d.get_gpu_stats(gpu_id).unwrap();\n\n println!(\n\n \"{} {}/{}{}\",\n\n \"VRAM Usage:\".green(),\n\n gpu_stats.mem_used.unwrap_or_default().to_string().bold(),\n\n gpu_stats.mem_total.unwrap_o... |
Rust | src/lib.rs | aldanor/pod-typeinfo | 9118046ce2a8e9b4e6cc523d18d7eace8fdaf0f1 | #![cfg_attr(feature = "unstable", feature(plugin))]
#![cfg_attr(feature = "unstable", plugin(clippy))]
#[derive(Clone, PartialEq, Debug)]
pub enum Type {
Int8,
Int16,
Int32,
Int64,
UInt8,
UInt16,
UInt32,
UInt64,
Float32,
Float64,... | #![cfg_attr(feature = "unstable", feature(plugin))]
#![cfg_attr(feature = "unstable", plugin(clippy))]
#[derive(Clone, PartialEq, Debug)]
pub enum Type {
Int8,
Int16,
Int32,
Int64,
UInt8,
UInt16,
UInt32,
UInt64,
Float32,
Float64,... |
}
pub trait TypeInfo: Copy {
fn type_info() -> Type;
}
macro_rules! impl_scalar {
($t:ty, $i:ident) => (
impl $crate::TypeInfo for $t {
#[inline(always)]
fn type_info() -> $crate::Type {
$crate::Type::$i
}
}
)
}
impl_scalar!(i8, In... | pub fn new<S: Into<String>>(ty: &Type, name: S, offset: usize) -> Field {
Field {
ty: ty.clone(),
name: name.into(),
offset: offset
}
} | function_block-full_function | [
{
"content": "#[test]\n\n#[allow(unused_variables, unused_imports)]\n\nfn test_pub_structs_fields() {\n\n use module::{A, B};\n\n use module::multiple::{E, F, G, H};\n\n let b = B { x: 1, y: 2 };\n\n}\n",
"file_path": "tests/test.rs",
"rank": 0,
"score": 65230.86850490266
},
{
"cont... |
Rust | src/main.rs | sonald/redis-cli-rs | 5de760421f4d052d4a28001d1274ab90688d0fd3 | use structopt::StructOpt;
use tokio::prelude::*;
use tokio::net::TcpStream;
use rustyline::{Editor, error::ReadlineError};
use std::error::Error;
use log::*;
use std::io::Write;
mod redis;
use self::redis::*;
#[derive(Debug, StructOpt)]
struct Opt {
#[structopt(short, long)]
pub debug: bool,
#[structopt(... | use structopt::StructOpt;
use tokio::prelude::*;
use tokio::net::TcpStream;
use rustyline::{Editor, error::ReadlineError};
use std::error::Error;
use log::*;
use std::io::Write;
mod redis;
use self::redis::*;
#[derive(Debug, StructOpt)]
struct Opt {
#[structopt(short, long)]
pub debug: bool,
#[structopt(... | _ => {
let res = read_redis_output(cli).await?;
print!("{}", RedisValue::deserialize(&res).expect("").0);
}
}
},
Err(ReadlineError::Interrupted) => {
info!("CTRL-C");
break
... | "monitor" | "subscribe" => loop {
consume_all_output(cli).await?
},
| function_block-random_span | [
{
"content": "# cedis\n\n\n\na simple redis-cli replacement written in pure rust\n",
"file_path": "README.md",
"rank": 2,
"score": 13893.999718397194
},
{
"content": "use std::fmt;\n\nuse std::error::Error;\n\nuse bytes::Bytes;\n\n\n\n#[derive(Debug)]\n\npub enum RedisValue {\n\n Str(Stri... |
Rust | runtime_v4/src/runtime.rs | MatchaChoco010/game_loop_async_runtime | 4ccd2e4c642cdf793f83c8764d8b408fbfe17b05 | use std::cell::RefCell;
use std::collections::HashMap;
use std::fmt::Debug;
use std::future::Future;
use std::hash::Hash;
use std::pin::Pin;
use std::rc::Rc;
use std::sync::{Arc, Mutex};
use std::task::{Context, Poll, Waker};
use futures::task::ArcWake;
struct Task {
future: Pin<Box<dyn Future<Output = ()> + 'sta... | use std::cell::RefCell;
use std::collections::HashMap;
use std::fmt::Debug;
use std::future::Future;
use std::hash::Hash;
use std::pin::Pin;
use std::rc::Rc;
use std::sync::{Arc, Mutex};
use std::task::{Context, Poll, Waker};
use futures::task::ArcWake;
struct Task {
future: Pin<Box<dyn Future<Output = ()> + 'sta... | c<RefCell<HashMap<T, Vec<Task>>>>,
activated_phase: Rc<RefCell<HashMap<u16, T>>>,
}
impl<T: Eq + Hash + Clone + Debug> Runtime<T> {
pub fn new() -> Self {
Self {
frame_counter: 0,
tasks: Rc::new(RefCell::new(HashMap::new())),
wait_tasks: Rc::new(RefCell::new(Hash... |
NotDone,
}
#[derive(Clone)]
pub struct Runtime<T: Eq + Hash + Clone + Debug> {
frame_counter: u64,
tasks: Rc<RefCell<HashMap<T, Vec<Task>>>>,
wait_tasks: R | random | [
{
"content": "#[derive(Clone)]\n\nstruct WakeFlagWaker {\n\n flag: WakeFlag,\n\n}\n\nimpl WakeFlagWaker {\n\n fn waker(flag: WakeFlag) -> Waker {\n\n futures::task::waker(Arc::new(Self { flag }))\n\n }\n\n}\n\nimpl ArcWake for WakeFlagWaker {\n\n fn wake_by_ref(arc_self: &Arc<Self>) {\n\n ... |
Rust | src/prng/chacha.rs | TheIronBorn/rand | e1b60350d0936e6f17c7fd017ed18f3151006f43 |
use core::fmt;
use rand_core::{BlockRngCore, CryptoRng, RngCore, SeedableRng, Error, le};
use rand_core::impls::BlockRng;
const SEED_WORDS: usize = 8;
const STATE_WORDS: usize = 16;
#[derive(Clone, Debug)]
pub struct ChaChaRng(BlockRng<ChaChaCore>);
impl RngCore for ChaChaRng {
#[inline]
fn next_u32(&mut ... |
use core::fmt;
use rand_core::{BlockRngCore, CryptoRng, RngCore, SeedableRng, Error, le};
use rand_core::impls::BlockRng;
const SEED_WORDS: usize = 8;
const STATE_WORDS: usize = 16;
#[derive(Clone, Debug)]
pub struct ChaChaRng(BlockRng<ChaChaCore>);
impl RngCore for ChaChaRng {
#[inline]
fn next_u32(&mut ... |
#[test]
fn test_chacha_set_counter() {
let seed = [0u8; 32];
let mut rng = ChaChaRng::from_seed(seed);
rng.set_counter(0, 2u64 << 56);
let mut results = [0u32; 16];
for i in results.iter_mut() { *i = rng.next_u32(); }
let exp... | fn test_chacha_true_bytes() {
let seed = [0u8; 32];
let mut rng = ChaChaRng::from_seed(seed);
let mut results = [0u8; 32];
rng.fill_bytes(&mut results);
let expected = [118, 184, 224, 173, 160, 241, 61, 144,
64, 93, 106, 229, 83, 134, 189, 40,
... | function_block-full_function | [
{
"content": "/// Implement `fill_bytes` via `next_u64`, little-endian order.\n\npub fn fill_bytes_via_u64<R: RngCore + ?Sized>(rng: &mut R, dest: &mut [u8]) {\n\n fill_bytes_via!(rng, next_u64, 8, dest)\n\n}\n\n\n\nmacro_rules! impl_uint_from_fill {\n\n ($rng:expr, $ty:ty, $N:expr) => ({\n\n debug... |
Rust | src/main.rs | harksin/noria-mysql | 7ece4f4107d453c922b452cbf0d824be7625a8e4 | #![feature(box_syntax, box_patterns)]
#![feature(nll)]
#![feature(try_from)]
extern crate arccstr;
extern crate chrono;
#[macro_use]
extern crate clap;
extern crate noria;
extern crate msql_srv;
extern crate nom_sql;
#[macro_use]
extern crate lazy_static;
#[macro_use]
extern crate slog;
extern crate slog_term;
exter... | #![feature(box_syntax, box_patterns)]
#![feature(nll)]
#![feature(try_from)]
extern crate arccstr;
extern crate chrono;
#[macro_use]
extern crate clap;
extern crate noria;
extern crate msql_srv;
extern crate nom_sql;
#[macro_use]
extern crate lazy_static;
#[macro_use]
extern crate slog;
extern crate slog_term;
exter... | e");
let static_responses = !matches.is_present("no-static-responses");
let listener = net::TcpListener::bind(format!("127.0.0.1:{}", port)).unwrap();
let log = logger_pls();
info!(log, "listening on port {}", port);
let query_counter = Arc::new(AtomicUsize::new(0));
let schemas: Arc<RwLock<... | function_block-function_prefixed | [
{
"content": "fn collapse_where_in_recursive(\n\n leftmost_param_index: &mut usize,\n\n expr: &mut ConditionExpression,\n\n rewrite_literals: bool,\n\n) -> Option<(usize, Vec<Literal>)> {\n\n match *expr {\n\n ConditionExpression::Base(ConditionBase::Literal(Literal::Placeholder)) => {\n\n ... | |
Rust | crates/tako/benches/benchmarks/worker.rs | User3574/hyperqueue | d4dea5a805925cb624eb81da65840d5a8226d4a9 | use std::time::Duration;
use criterion::measurement::WallTime;
use criterion::{BatchSize, BenchmarkGroup, BenchmarkId, Criterion};
use tako::common::index::{AsIdVec, ItemId};
use tako::common::resources::descriptor::GenericResourceKindIndices;
use tako::common::resources::map::ResourceMap;
use tako::common::resources:... | use std::time::Duration;
use criterion::measurement::WallTime;
use criterion::{BatchSize, BenchmarkGroup, BenchmarkId, Criterion};
use tako::common::index::{AsIdVec, ItemId};
use tako::common::resources::descriptor::GenericResourceKindIndices;
use tako::common::resources::map::ResourceMap;
use tako::common::resources:... | },
&ResourceMap::from_vec(vec!["GPU".to_string()]),
)
}
fn bench_resource_queue_add_task(c: &mut BenchmarkGroup<WallTime>) {
c.bench_function("add task to resource queue", |b| {
b.iter_batched_ref(
|| (create_resource_queue(64), create_worker_task(0)),
|(queue, t... | }
let task = create_worker_task(task_count);
let duration = measure_time!({
state.add_task(task);
});
total += duration;
}
total
... | random | [
{
"content": "pub fn task_transfer_cost(taskmap: &TaskMap, task: &Task, worker_id: WorkerId) -> u64 {\n\n // TODO: For large number of inputs, only sample inputs\n\n task.inputs\n\n .iter()\n\n .take(512)\n\n .map(|ti| {\n\n let t = taskmap.get_task(ti.task());\n\n ... |
Rust | src/ops/list.rs | wellinthatcase/fast-redis | b8b806989290d7c658884379975f59bfecaa84a5 |
use crate::*;
#[pymethods]
impl RedisClient {
#[args(elements="*", no_overwrite="**")]
#[text_signature = "($self, key, elements, *, no_overwrite)"]
pub fn rpush(&mu... |
use crate::*;
#[pymethods]
impl RedisClient {
#[args(elements="*", no_overwrite="**")]
#[text_signature = "($self, key, elements, *, no_overwrite)"]
pub fn rpush(&mu... |
#[text_signature = "($self, key, index, /)"]
pub fn lindex(&mut self, key: &str, index: isize) -> PyResult<String> {
let ind = index.to_string();
Ok(route_command(self, "LINDEX", Some(... | X", no_overwrite);
let mut args = construct_vector(elements.len() + 1, Cow::from(&elements))?;
args.insert(0, key);
Ok(route_command(self, &command, Some(args))?)
} | function_block-function_prefixed | [
{
"content": "#[inline]\n\nfn route_command<Args, ReturnType>(inst: &mut RedisClient, cmd: &str, args: Option<Args>) -> PyResult<ReturnType>\n\nwhere \n\n Args: ToRedisArgs,\n\n ReturnType: FromRedisValue\n\n{\n\n let mut call = redis::cmd(cmd);\n\n call.arg(args);\n\n\n\n match call.query(&mut i... |
Rust | actions/balance-notification-registration/src/lib.rs | HugoByte/aurras | fcc03684f4ed56ce949c5a1db8764508e0feb3f9 | extern crate serde_json;
use actions_common::Context;
use chesterfield::sync::{Client, Database};
use serde_derive::{Deserialize, Serialize};
use serde_json::{Error, Value};
mod types;
use std::collections::HashMap;
use types::{Address, Response, Topic};
#[cfg(test)]
use actions_common::Config;
#[derive(Debug, Clone,... | extern crate serde_json;
use actions_common::Context;
use chesterfield::sync::{Client, Database};
use serde_derive::{Deserialize, Serialize};
use serde_json::{Error, Value};
mod types;
use std::collections::HashMap;
use types::{Address, Response, Topic};
#[cfg(test)]
use actions_common::Config;
#[derive(Debug, Clone,... |
#[cfg(test)]
mod tests {
use super::*;
use actions_common::mock_containers::CouchDB;
use tokio;
use tokio::time::{sleep, Duration};
#[derive(Debug, Clone, PartialEq, Serialize, Deserialize)]
pub struct Source {
name: String,
trigger: String,
}
impl Source {
pub ... | ue) -> Result<Value, Error> {
let input = serde_json::from_value::<Input>(args)?;
let mut action = Action::new(input);
#[cfg(not(test))]
action.init();
match action.method().as_ref() {
"post" => {
let id = action.add_address(
&action.params.token,
... | function_block-function_prefixed | [
{
"content": "pub fn main(args: Value) -> Result<Value, Error> {\n\n let input = serde_json::from_value::<Input>(args)?;\n\n let mut action = Action::new(input);\n\n\n\n // TODO: Fix\n\n #[cfg(not(test))]\n\n action.init();\n\n\n\n let filtered_topics = action.filter_topics();\n\n let filte... |
Rust | src/async/bufwriter.rs | kimhyunkang/rssh | 046275ccdee7962230d5598b175e8f9815db605c | use super::buf::AsyncBuf;
use super::DEFAULT_BUFSIZE;
use std::{cmp, io};
use std::io::Write;
use futures::{Async, Poll};
#[derive(Debug)]
pub struct AsyncBufWriter<W: Write> {
inner: Option<W>,
buf: AsyncBuf,
panicked: bool
}
#[derive(Debug)]
pub struct IntoInnerError<W>(W, io::Error);
impl <W: Write>... | use super::buf::AsyncBuf;
use super::DEFAULT_BUFSIZE;
use std::{cmp, io};
use std::io::Write;
use futures::{Async, Poll};
#[derive(Debug)]
pub struct AsyncBufWriter<W: Write> {
inner: Option<W>,
buf: AsyncBuf,
panicked: bool
}
#[derive(Debug)]
pub struct IntoInnerError<W>(W, io::Error);
impl <W: Write>... |
#[test]
fn nb_write_exact_larger_than_buf() {
let writer = {
let buf = vec![0u8; 16];
let writer = Cursor::new(buf);
let mut bufwriter = AsyncBufWriter::with_capacity(4, writer);
assert_eq!(Async::Ready(()), bufwriter.nb_write_exact(b"Hello, ").expect("... | writer = AsyncBufWriter::with_capacity(4, writer);
assert_eq!(Async::Ready(()), bufwriter.nb_write_exact(b"Hell").expect("error!"));
assert_eq!(Async::Ready(()), bufwriter.nb_write_exact(b"o, ").expect("error!"));
assert_eq!(Async::Ready(()), bufwriter.nb_write_exact(b"wor").expect(... | function_block-function_prefixed | [
{
"content": "pub fn ntoh(buf: &[u8]) -> u32 {\n\n ((buf[0] as u32) << 24) + ((buf[1] as u32) << 16) + ((buf[2] as u32) << 8) + (buf[3] as u32)\n\n}\n\n\n",
"file_path": "src/transport.rs",
"rank": 0,
"score": 151752.52172682478
},
{
"content": "pub fn compute_pad_len<R: Rng>(payload_len:... |
Rust | src/tokenizer.rs | crowlKats/rust-urlpattern | 1dc0054b693ec652c8e4702a0edffc243ef5cd2c |
use derive_more::Display;
use crate::error::TokenizerError;
use crate::Error;
#[derive(Debug, Display, Clone, Eq, PartialEq)]
pub enum TokenType {
Open,
Close,
Regexp,
Name,
Char,
EscapedChar,
OtherModifier,
Asterisk,
End,
InvalidChar,
}
#[derive(Debug, Clone)]
pub struct Token {
pub kind: To... |
use derive_more::Display;
use crate::error::TokenizerError;
use crate::Error;
#[derive(Debug, Display, Clone, Eq, PartialEq)]
pub enum TokenType {
Open,
Close,
Regexp,
Name,
Char,
EscapedChar,
OtherModifier,
Asterisk,
End,
InvalidChar,
}
#[derive(Debug, Clone)]
pub struct Token {
pub kind: To... |
fn process_tokenizing_error(
&mut self,
next_pos: usize,
value_pos: usize,
error: TokenizerError,
) -> Result<(), Error> {
if self.policy == TokenizePolicy::Strict {
Err(Error::Tokenizer(error, value_pos))
} else {
self.add_token_with_default_len(
TokenType::InvalidC... | fn add_token(
&mut self,
kind: TokenType,
next_pos: usize,
value_pos: usize,
value_len: usize,
) {
let range = value_pos..(value_pos + value_len);
let value = self.input[range].iter().collect::<String>();
self.token_list.push(Token {
kind,
index: self.index,
value,
... | function_block-full_function | [
{
"content": "// Ref: https://wicg.github.io/urlpattern/#escape-a-pattern-string\n\nfn escape_pattern_string(input: &str) -> String {\n\n assert!(input.is_ascii());\n\n let mut result = String::new();\n\n for char in input.chars() {\n\n if matches!(char, '+' | '*' | '?' | ':' | '{' | '}' | '(' | ')' | '\\... |
Rust | src/main.rs | Cxarli/minecrab | ddff0ab35c234c4413b2638c2615a2767c37c9ff | mod aabb;
mod camera;
mod geometry;
mod geometry_buffers;
mod hud;
mod player;
mod render_context;
mod state;
mod text_renderer;
mod texture;
mod time;
mod utils;
mod vertex;
mod view;
mod world;
use std::time::{Duration, Instant};
use winit::{
dpi::{PhysicalSize, Size},
event::{ElementState, Event, KeyboardIn... | mod aabb;
mod camera;
mod geometry;
mod geometry_buffers;
mod hud;
mod player;
mod render_context;
mod state;
mod text_renderer;
mod texture;
mod time;
mod utils;
mod vertex;
mod view;
mod world;
use std::time::{Duration, Instant};
use winit::{
dpi::{PhysicalSize, Size},
event::{ElementState, Event, KeyboardIn... | print!(
"fps avg={:>5} min={:>5} max={:>5} | ",
fps, fps_min, fps_max
);
println!(
"{:>8} tris | {:>5} chunks",
triangle_count,
state.world.chunks.len()
... | function_block-function_prefix_line | [
{
"content": "use wgpu::{CommandEncoder, RenderPipeline};\n\n\n\nuse crate::{\n\n render_context::RenderContext,\n\n vertex::{HudVertex, Vertex},\n\n world::block::BlockType,\n\n};\n\n\n\nuse self::{debug_hud::DebugHud, hotbar_hud::HotbarHud, widgets_hud::WidgetsHud};\n\n\n\nuse std::borrow::Cow;\n\n\n... | |
Rust | src/serial.rs | IamfromSpace/stm32f3xx-hal | c68c36c03e0e33699b3b0c9acc3f8d80f5a25cd4 |
use crate::{
gpio::{gpioa, gpiob, gpioc, AF7},
hal::{blocking, serial},
pac::{USART1, USART2, USART3},
rcc::{Clocks, APB1, APB2},
time::Bps,
};
use cfg_if::cfg_if;
use core::{convert::Infallible, marker::PhantomData, ptr};
cfg_if! {
if #[cfg(any(feature = "stm32f302", feature = "stm32f303"))]... |
use crate::{
gpio::{gpioa, gpiob, gpioc, AF7},
hal::{blocking, serial},
pac::{USART1, USART2, USART3},
rcc::{Clocks, APB1, APB2},
time::Bps,
};
use cfg_if::cfg_if;
use core::{convert::Infallible, marker::PhantomData, ptr};
cfg_if! {
if #[cfg(any(feature = "stm32f302", feature = "stm32f303"))]... | self.usart.cr1.modify(|_, w| w.rxneie().set_bit())
},
Event::Txe => {
self.usart.cr1.modify(|_, w| w.txeie().set_bit())
},
}
}
... | }
pub fn listen(&mut self, event: Event) {
match event {
Event::Rxne => {
| random | [
{
"content": "fn unlock(apb1: &mut APB1, pwr: &mut PWR) {\n\n apb1.enr().modify(|_, w| {\n\n w\n\n // Enable the backup interface by setting PWREN\n\n .pwren()\n\n .set_bit()\n\n });\n\n pwr.cr.modify(|_, w| {\n\n w\n\n // Enable access to the b... |
Rust | src/processor/mod.rs | gluwa/Sawtooth-SDK-Rust | 8a3d99fa2c82eb3131148931a819ffca46d78c66 | /*
* Copyright 2017 Bitwise IO, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agree... | /*
* Copyright 2017 Bitwise IO, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agree... |
fn unregister(&mut self, sender: &ZmqMessageSender) {
let request = TpUnregisterRequest::new();
info!("sending TpUnregisterRequest");
let serialized = match request.write_to_bytes() {
Ok(serialized) => serialized,
Err(err) => {
error!("Serialization ... | fn register(&mut self, sender: &ZmqMessageSender, unregister: &Arc<AtomicBool>) -> bool {
for handler in &self.handlers {
for version in handler.family_versions() {
let mut request = TpRegisterRequest::new();
request.set_family(handler.family_name().clone());
... | function_block-full_function | [
{
"content": "pub fn create_context(algorithm_name: &str) -> Result<Box<dyn Context>, Error> {\n\n match algorithm_name {\n\n \"secp256k1\" => Ok(Box::new(secp256k1::Secp256k1Context::new())),\n\n _ => Err(Error::NoSuchAlgorithm(format!(\n\n \"no such algorithm: {}\",\n\n ... |
Rust | client/telemetry/src/transport.rs | cruz101-hub/substrate | 6e45ffaa4d2a2aa62405194890477985b94747cd |
use futures::{
executor::block_on,
prelude::*,
ready,
task::{Context, Poll},
};
use libp2p::{
core::transport::{timeout::TransportTimeout, OptionalTransport},
wasm_ext, Transport,
};
use std::io;
use std::pin::Pin;
use std::time::Duration;
const CONNECT_TIMEOUT: Duration = Duration::from_secs(20);
pub(crate) ... |
use futures::{
executor::block_on,
prelude::*,
ready,
task::{Context, Poll},
};
use libp2p::{
core::transport::{timeout::TransportTimeout, OptionalTransport},
wasm_ext, Transport,
};
use std::io;
use std::pin::Pin;
use std::time::Duration;
const CONNECT_TIMEOUT: Duration = Duration::from_secs(20);
pub(crate) ... |
}
pub(crate) trait StreamAndSink<I>: Stream + Sink<I> {}
impl<T: ?Sized + Stream + Sink<I>, I> StreamAndSink<I> for T {}
pub(crate) type WsTrans = libp2p::core::transport::Boxed<
Pin<
Box<
dyn StreamAndSink<Vec<u8>, Item = Result<Vec<u8>, io::Error>, Error = io::Error> + Send,
>,
>,
>;
#[pin_project::pin_p... | Ok(TransportTimeout::new(
transport.map(|out, _| {
let out = out
.map_err(|err| io::Error::new(io::ErrorKind::Other, err))
.sink_map_err(|err| io::Error::new(io::ErrorKind::Other, err));
Box::pin(out) as Pin<Box<_>>
}),
CONNECT_TIMEOUT,
)
.boxed()) | call_expression | [
{
"content": "fn decl_runtime_version_impl_inner(item: ItemConst) -> Result<TokenStream> {\n\n\tlet runtime_version = ParseRuntimeVersion::parse_expr(&*item.expr)?.build(item.expr.span())?;\n\n\tlet link_section =\n\n\t\tgenerate_emit_link_section_decl(&runtime_version.encode(), \"runtime_version\");\n\n\n\n\tO... |
Rust | tests/baking_mod/macros_baking/macro_choice.rs | julien-lange/mpst_rust_github | ca10d860f06d3bc4b6d1a9df290d2812235b456f | use either::Either;
use mpstthree::binary::struct_trait::{end::End, recv::Recv, send::Send, session::Session};
use mpstthree::role::end::RoleEnd;
use mpstthree::role::Role;
use std::error::Error;
use rand::{thread_rng, Rng};
use mpstthree::bundle_impl;
bundle_impl!(MeshedChannels, A, B, C);
type OfferMpst<S0, S1, S... | use either::Either;
use mpstthree::binary::struct_trait::{end::End, recv::Recv, send::Send, session::Session};
use mpstthree::role::end::RoleEnd;
use mpstthree::role::Role;
use std::error::Error;
use rand::{thread_rng, Rng};
use mpstthree::bundle_impl;
bundle_impl!(MeshedChannels, A, B, C);
type OfferMpst<S0, S1, S... | tackAEnd, RoleA<RoleEnd>>;
type OfferA<N> = OfferMpst<
AtoBVideo<N>,
AtoCVideo<N>,
AtoBClose,
AtoCClose,
StackAVideo,
StackAEnd,
RoleA<RoleEnd>,
>;
type InitA<N> = Recv<N, Send<N, OfferA<N>>>;
type EndpointAFull<N> = MeshedChannels<End, InitA<N>, StackAFull, RoleA<RoleEnd>>;
type EndpointB... | ype StackAVideo = RoleC<RoleB<RoleB<RoleC<RoleEnd>>>>;
type StackAVideoDual = <StackAVideo as Role>::Dual;
type StackAFull = RoleC<RoleC<RoleAlltoC<RoleEnd, RoleEnd>>>;
type StackBEnd = RoleEnd;
type StackBVideo = RoleA<RoleA<RoleEnd>>;
type StackBVideoDual = <StackBVideo as Role>::Dual;
type StackBFull = RoleAlltoC<R... | random | [
{
"content": "type ChooseMpstThree<S0, S1, S2, S3, R0, R1, N0> = Send<\n\n Either<\n\n MeshedChannels<\n\n <S0 as Session>::Dual,\n\n <S1 as Session>::Dual,\n\n <R0 as Role>::Dual,\n\n <N0 as Role>::Dual,\n\n >,\n\n MeshedChannels<\n\n ... |
Rust | src/managers/memory.rs | aajtodd/riam | 2b72f7d2eb5bac184631c2926f41629a44de6fd5 | use crate::{Policy, PolicyManager, Result, RiamError};
use std::collections::HashMap;
use std::collections::HashSet;
use uuid::Uuid;
pub struct MemoryManager {
by_principal: HashMap<String, HashSet<Uuid>>,
by_id: HashMap<Uuid, Policy>,
}
impl MemoryManager {
pub fn new() -> Self {
... | use crate::{Policy, PolicyManager, Result, RiamError};
use std::collections::HashMap;
use std::collections::HashSet;
use uuid::Uuid;
pub struct MemoryManager {
by_principal: HashMap<String, HashSet<Uuid>>,
by_id: HashMap<Uuid, Policy>,
}
impl MemoryManager {
pub fn new() -> Self {
... |
fn list(&self) -> Result<Vec<Policy>> {
Ok(Vec::new())
}
fn get_policies_for_principal(&self, principal: &str) -> Result<Option<Vec<Policy>>> {
if let Some(policy_ids) = self.by_principal.get(principal) {
let mut policies: Vec<Policy> = Vec::with_capacity(policy_ids.... | ove(&id) {
self.by_principal.retain(|_principal, pset| {
pset.remove(&id);
return pset.len() > 0;
})
} else {
return Err(RiamError::UnknownPolicy);
}
Ok(())
} | function_block-function_prefixed | [
{
"content": "// custom serialize for Vec<String> for policy statements. If the vec length is\n\n// 1 the output will be flattened to just that single string. Otherwise it will\n\n// serialize normally to a sequence\n\n// e.g.\n\n// vec![\"actions:list\"] -> \"actions:list\"\n\n// vec![\"actions:list\", \"actio... |
Rust | src/hir/constructor2enum.rs | KeenS/webml | 60f4d899d623d5872c325412054bd0d77e37c4aa | use crate::config::Config;
use crate::hir::util::Transform;
use crate::hir::*;
use crate::pass::Pass;
use std::collections::{HashMap, HashSet};
pub struct ConstructorToEnumPass {
enum_likes: HashSet<Symbol>,
symbol_table: SymbolTable,
}
fn rewrite_ty(enum_likes: &HashSet<Symbol>, ty: HTy) -> HTy {
use HTy... | use crate::config::Config;
use crate::hir::util::Transform;
use crate::hir::*;
use crate::pass::Pass;
use std::collections::{HashMap, HashSet};
pub struct ConstructorToEnumPass {
enum_likes: HashSet<Symbol>,
symbol_table: SymbolTable,
}
fn rewrite_ty(enum_likes: &HashSet<Symbol>, ty: HTy) -> HTy {
use HTy... | ,
Var { name, ty } => Var {
name,
ty: self.rewrite_ty(ty),
},
};
(pat, expr)
})
.collect();
Expr::Case {
ty,
expr: Box::new(self.transform_expr(... | match ty {
HTy::Datatype(name) if self.is_enum_like(&name) => Constant {
ty: HTy::Int,
value: descriminant as i64,
},
ty => Constructor {
descriminant,
... | if_condition | [
{
"content": "fn take_binds(expr: Expr) -> (Expr, Vec<Val>) {\n\n use crate::hir::Expr::*;\n\n match expr {\n\n Let { bind, ret, .. } => {\n\n let (expr, mut binds) = take_binds(*ret);\n\n binds.insert(0, *bind);\n\n (expr, binds)\n\n }\n\n BuiltinCall... |
Rust | tests/delete_component.rs | colelawrence/shipyard | bd535706a4ec53f5162e4aae6b8c9480e5f8bc75 | use core::any::type_name;
use shipyard::error;
use shipyard::internal::iterators;
use shipyard::prelude::*;
#[test]
fn no_pack() {
let world = World::new();
let (mut entities, mut usizes, mut u32s) =
world.borrow::<(EntitiesMut, &mut usize, &mut u32)>();
let entity1 = entities.add_entity((&mut usi... | use core::any::type_name;
use shipyard::error;
use shipyard::internal::iterators;
use shipyard::prelude::*;
#[test]
fn no_pack() {
let world = World::new();
let (mut entities, mut usizes, mut u32s) =
world.borrow::<(EntitiesMut, &mut usize, &mut u32)>();
let entity1 = entities.add_entity((&mut usi... |
#[test]
fn loose() {
let world = World::new();
let (mut entities, mut usizes, mut u32s) =
world.borrow::<(EntitiesMut, &mut usize, &mut u32)>();
(&mut usizes, &mut u32s).loose_pack();
let entity1 = entities.add_entity((&mut usizes, &mut u32s), (0usize, 1u32));
let entity2 = entities.add_e... | assert_eq!(
(&mut usizes).get(entity1),
Err(error::MissingComponent {
id: entity1,
name: type_name::<usize>(),
})
);
assert_eq!((&mut u32s).get(entity1), Ok(&mut 1));
assert_eq!(usizes.get(entity2), Ok(&2));
assert_eq!(u32s.get(entity2), Ok(&3));
let i... | function_block-function_prefix_line | [
{
"content": "#[system(Test3)]\n\nfn run(_: &mut Entities, _: &mut u32) {}\n\n\n",
"file_path": "tests/derive/good.rs",
"rank": 0,
"score": 274503.01059633156
},
{
"content": "#[system(Test1)]\n\nfn run(_: &usize, _: &mut i32, _: &Entities, _: Unique<&u32>, _: Entities) {}\n\n\n",
"file_... |
Rust | solo-machine/src/server/ibc.rs | devashishdxt/ibc-solo-machine | 76cb11d81e4777e96d4babbfb81381e50a48d57e | tonic::include_proto!("ibc");
use std::time::SystemTime;
use k256::ecdsa::VerifyingKey;
use solo_machine_core::{
cosmos::crypto::{PublicKey, PublicKeyAlgo},
ibc::core::ics24_host::identifier::ChainId,
service::IbcService as CoreIbcService,
DbPool, Event, Signer,
};
use tokio::sync::mpsc::UnboundedSend... | tonic::include_proto!("ibc");
use std::time::SystemTime;
use k256::ecdsa::VerifyingKey;
use solo_machine_core::{
cosmos::crypto::{PublicKey, PublicKeyAlgo},
ibc::core::ics24_host::identifier::ChainId,
service::IbcService as CoreIbcService,
DbPool, Event, Signer,
};
use tokio::sync::mpsc::UnboundedSend... |
async fn mint(&self, request: Request<MintRequest>) -> Result<Response<MintResponse>, Status> {
let request = request.into_inner();
let chain_id = request
.chain_id
.parse()
.map_err(|err: anyhow::Error| Status::invalid_argument(err.to_string()))?;
let ... | let request_id = request.request_id;
let force = request.force;
self.core_service
.connect(&self.signer, chain_id, request_id, memo, force)
.await
.map_err(|err| {
log::error!("{}", err);
Status::internal(err.to_string())
}... | function_block-function_prefix_line | [
{
"content": "#[async_trait]\n\npub trait Signer: ToPublicKey + Send + Sync {\n\n /// Signs the given message\n\n async fn sign(&self, request_id: Option<&str>, message: Message<'_>) -> Result<Vec<u8>>;\n\n}\n\n\n\n#[async_trait]\n\nimpl<T: Signer> Signer for &T {\n\n async fn sign(&self, request_id: O... |
Rust | src/kernel/src/syscall/sync.rs | ariadiamond/twizzler-Rust | 5f5d01bac9127ca1d64bb8aa472a04f6634fc3a9 | use core::time::Duration;
use alloc::{collections::BTreeMap, vec::Vec};
use twizzler_abi::syscall::{
ThreadSync, ThreadSyncError, ThreadSyncReference, ThreadSyncSleep, ThreadSyncWake,
};
use x86_64::VirtAddr;
use crate::{
obj::{LookupFlags, ObjectRef},
once::Once,
spinlock::Spinlock,
thread::{curr... | use core::time::Duration;
use alloc::{collections::BTreeMap, vec::Vec};
use twizzler_abi::syscall::{
ThreadSync, ThreadSyncError, ThreadSyncReference, ThreadSyncSleep, ThreadSyncWake,
};
use x86_64::VirtAddr;
use crate::{
obj::{LookupFlags, ObjectRef},
once::Once,
spinlock::Spinlock,
thread::{curr... |
fn undo_sleep(sleep: SleepEvent) {
sleep.obj.remove_from_sleep_word(sleep.offset);
}
fn wakeup(wake: &ThreadSyncWake) -> Result<usize, ThreadSyncError> {
let (obj, offset) = get_obj(wake.reference)?;
Ok(obj.wakeup_word(offset, wake.count))
}
fn thread_sync_cb_timeout(thread: ThreadRef) {
if thread.r... | e)?;
/*
logln!(
"{} sleep {} {:x}",
current_thread_ref().unwrap().id(),
obj.id(),
offset
);
if let ThreadSyncReference::Virtual(p) = &sleep.reference {
logln!(" => {:p} {}", *p, unsafe {
(**p).load(core::sync::atomic::Ordering::SeqCst)
});
... | function_block-function_prefixed | [] |
Rust | src/render.rs | JorgenPo/rust-text-rpg | 5e8f489741628062503ff1814535384b1692929f | use termion::terminal_size;
use termion::{color, cursor, clear, style};
use std::io::{Error, Write, Stdout, StdoutLock};
use termion::raw::{IntoRawMode, RawTerminal};
use std::cmp::max;
#[doc(hidden)]
pub fn _print(args: ::core::fmt::Arguments) {
use core::fmt::Write;
std::io::stdout().write_fmt(args).expect(... | use termion::terminal_size;
use termion::{color, cursor, clear, style};
use std::io::{Error, Write, Stdout, StdoutLock};
use termion::raw::{IntoRawMode, RawTerminal};
use std::cmp::max;
#[doc(hidden)]
pub fn _print(args: ::core::fmt::Arguments) {
use core::fmt::Write;
std::io::stdout().write_fmt(args).expect(... |
pub fn draw_raw(&mut self, string: &str) {
render!("{}", string);
}
pub fn flash(&self) {
std::io::stdout().flush().unwrap();
}
}
impl Drop for Render {
fn drop(&mut self) {
print!("{}{}{}{}", clear::All, style::Reset, cursor::Show, cursor::Goto(1, 1));
}
}
| pub fn draw<T: Drawable>(&mut self, drawable: &T) {
let position = drawable.get_position();
let x = match position.x {
Coordinate::Absolute(x) => max(x, 1),
Coordinate::Centered => self.get_middle_x(drawable),
Coordinate::Percent(percent) => max(self.term_size.width,... | function_block-full_function | [
{
"content": "pub trait Logger {\n\n fn info(&mut self, message: &str);\n\n fn warn(&mut self, message: &str);\n\n}",
"file_path": "src/game/loggers.rs",
"rank": 2,
"score": 61792.36740350007
},
{
"content": "fn lerp_color(start: color::Rgb, end: color::Rgb, k: f32) -> color::Rgb {\n\n... |
Rust | scheduler/crates/api/src/calendar/update_calendar.rs | omid/nettu-scheduler | 27a2728882842222085ee4e17c952ec215fd683e | use crate::shared::{
auth::{
account_can_modify_calendar, account_can_modify_user, protect_account_route, Permission,
},
usecase::{execute, execute_with_policy, PermissionBoundary, UseCase},
};
use crate::{error::NettuError, shared::auth::protect_route};
use actix_web::{web, HttpResponse};
use nettu... | use crate::shared::{
auth::{
account_can_modify_calendar, account_can_modify_user, protect_account_route, Permission,
},
usecase::{execute, execute_with_policy, PermissionBoundary, UseCase},
};
use crate::{error::NettuError, shared::auth::protect_route};
use actix_web::{web, HttpResponse};
use nettu... | ;
}
}
if let Some(metadata) = &self.metadata {
calendar.metadata = metadata.clone();
}
ctx.repos
.calendars
.save(&calendar)
.await
.map(|_| calendar)
.map_err(|_| UseCaseError::StorageError)
}
}
i... | Err(UseCaseError::InvalidSettings(format!(
"Invalid timezone: {}, must be a valid IANA Timezone string",
timezone
))) | call_expression | [] |
Rust | tower-balance/src/p2c/service.rs | JeanMertz/tower | 7e55b7fa0b2db4ff36fd90f3700bd628c89951b6 | use crate::error;
use futures::{future, Async, Future, Poll};
use rand::{rngs::SmallRng, SeedableRng};
use tower_discover::{Change, Discover};
use tower_load::Load;
use tower_ready_cache::{error::Failed, ReadyCache};
use tower_service::Service;
use tracing::{debug, trace};
#[derive(Debug)]
pub struct Balance<D: Discov... | use crate::error;
use futures::{future, Async, Future, Poll};
use rand::{rngs::SmallRng, SeedableRng};
use tower_discover::{Change, Discover};
use tower_load::Load;
use tower_ready_cache::{error::Failed, ReadyCache};
use tower_service::Service;
use tracing::{debug, trace};
#[derive(Debug)]
pub struct Balance<D: Discov... | }
}
self.ready_index = self.p2c_ready_index();
if self.ready_index.is_none() {
debug_assert_eq!(self.services.ready_len(), 0);
return Ok(Async::NotReady);
}
}
}
... |
self.ready_index = Some(index);
return Ok(Async::Ready(()));
}
Ok(false) => {
trace!("ready service became unavailable");
}
Err(Failed(... | function_block-random_span | [
{
"content": "fn new_service<P: Policy<Req, Res, Error> + Clone>(\n\n policy: P,\n\n) -> (tower_retry::Retry<P, Mock>, Handle) {\n\n let (service, handle) = mock::pair();\n\n let service = tower_retry::Retry::new(policy, service);\n\n (service, handle)\n\n}\n\n\n",
"file_path": "tower-retry/test... |
Rust | src/views/krate_publish.rs | vignesh-sankaran/crates.io | 387ae4f2e9f6e653804bb063ae30cadd8c3382be |
use std::collections::HashMap;
use semver;
use serde::{de, Deserialize, Deserializer, Serialize, Serializer};
use models::krate::MAX_NAME_LENGTH;
use models::Crate;
use models::DependencyKind;
use models::Keyword as CrateKeyword;
#[derive(Deserialize, Serialize, Debug)]
pub struct EncodableCrateUpload {
pub n... |
use std::collections::HashMap;
use semver;
use serde::{de, Deserialize, Deserializer, Serialize, Serializer};
use models::krate::MAX_NAME_LENGTH;
use models::Crate;
use models::DependencyKind;
use models::Keyword as CrateKeyword;
#[derive(Deserialize, Serialize, Debug)]
pub struct EncodableCrateUpload {
pub n... |
}
impl<'de> Deserialize<'de> for EncodableFeature {
fn deserialize<D: Deserializer<'de>>(d: D) -> Result<EncodableFeature, D::Error> {
let s = String::deserialize(d)?;
if !Crate::valid_feature(&s) {
let value = de::Unexpected::Str(&s);
let expected = "a valid feature name";... | let expected = "a valid feature name containing only letters, \
numbers, hyphens, or underscores";
Err(de::Error::invalid_value(value, &expected))
} else {
Ok(EncodableFeatureName(s))
}
} | function_block-function_prefix_line | [] |
Rust | programs/vote/src/vote_processor.rs | Flawm/solana | 551c24da5792f4452c3c555e562809e8c9e742e5 |
use {
crate::{id, vote_instruction::VoteInstruction, vote_state},
log::*,
solana_metrics::inc_new_counter_info,
solana_program_runtime::{
invoke_context::InvokeContext, sysvar_cache::get_sysvar_with_account_check,
},
solana_sdk::{
feature_set,
instruction::InstructionEr... |
use {
crate::{id, vote_instruction::VoteInstruction, vote_state},
log::*,
solana_metrics::inc_new_counter_info,
solana_program_runtime::{
invoke_context::InvokeContext, sysvar_cache::get_sysvar_with_account_check,
},
solana_sdk::{
feature_set,
instruction::InstructionEr... |
#[test]
fn test_spoofed_vote() {
process_instruction_as_one_arg(
&vote(
&invalid_vote_state_pubkey(),
&Pubkey::new_unique(),
Vote::default(),
),
Err(InstructionError::InvalidAccountOwner),
);
process_in... | fn test_vote_process_instruction_decode_bail() {
process_instruction(
&[],
Vec::new(),
Vec::new(),
Err(InstructionError::NotEnoughAccountKeys),
);
} | function_block-full_function | [
{
"content": "pub fn read_pubkey(current: &mut usize, data: &[u8]) -> Result<Pubkey, SanitizeError> {\n\n let len = std::mem::size_of::<Pubkey>();\n\n if data.len() < *current + len {\n\n return Err(SanitizeError::IndexOutOfBounds);\n\n }\n\n let e = Pubkey::new(&data[*current..*current + len... |
Rust | src/widgets/image_widget.rs | alexislozano/rust-pushrod | 57f4129861a2e22608cbc9cb0aa151b5fb424c62 |
use crate::render::callbacks::CallbackRegistry;
use crate::render::widget::*;
use crate::render::widget_cache::WidgetContainer;
use crate::render::widget_config::{
CompassPosition, Config, WidgetConfig, CONFIG_COLOR_BASE, CONFIG_IMAGE_POSITION, CONFIG_SIZE,
};
use crate::render::Points;
use sdl2::image::LoadText... |
use crate::render::callbacks::CallbackRegistry;
use crate::render::widget::*;
use crate::render::widget_cache::WidgetContainer;
use crate::render::widget_config::{
CompassPosition, Config, WidgetConfig, CONFIG_COLOR_BASE, CONFIG_IMAGE_POSITION, CONFIG_SIZE,
};
use crate::render::Points;
use sdl2::image::LoadText... | ;
let texture_y = match self.get_compass(CONFIG_IMAGE_POSITION) {
CompassPosition::NW | CompassPosition::N | CompassPosition::NE => {
self.get_config().to_y(0)
}
CompassPosition::W | CompassPosition::Center | CompassPosition::E => {
self.get_... | match self.get_compass(CONFIG_IMAGE_POSITION) {
CompassPosition::NW | CompassPosition::W | CompassPosition::SW => {
self.get_config().to_x(0)
}
CompassPosition::N | CompassPosition::Center | CompassPosition::S => {
self.get_config().to_x((widget_w - w... | if_condition | [
{
"content": "pub fn widget_id_for_name(widgets: &[WidgetContainer], name: String) -> usize {\n\n match widgets.iter().find(|x| x.get_widget_name() == name.clone()) {\n\n Some(x) => x.get_widget_id() as usize,\n\n None => 0 as usize,\n\n }\n\n}\n",
"file_path": "src/render/callbacks.rs",... |
Rust | src/nfa.rs | MarioJim/finite-automata-tui | c22e9c0de28a199efbdfcabda7e8184fecaf1a20 | use multimap::MultiMap;
use std::collections::{HashMap, HashSet};
use std::convert::TryFrom;
use std::fmt;
#[derive(Debug)]
pub struct NFA {
pub alphabet: HashSet<String>,
initial_state: String,
states: HashMap<String, NFAState>,
}
#[derive(Debug)]
struct NFAState {
is_final: bool,
transitions: Mu... | use multimap::MultiMap;
use std::collections::{HashMap, HashSet};
use std::convert::TryFrom;
use std::fmt;
#[derive(Debug)]
pub struct NFA {
pub alphabet: HashSet<String>,
initial_state: String,
states: HashMap<String, NFAState>,
}
#[derive(Debug)]
struct NFAState {
is_final: bool,
transitions: Mu... | ;
let from_state = match from_symbol.get(0) {
Some(&s) => match states.contains_key(s) {
true => s,
false => {
return Err("Couldn't find a transition's starting state in defined states")
}
},
... | match line_iter.next() {
Some(s) => s.split(',').collect(),
None => return Err("Transition line is empty"),
} | if_condition | [
{
"content": "pub fn show_tui(automata_struct: nfa::NFA) {\n\n let instructions = \"Write the symbols separated by a space, press Esc or Ctrl+C to quit\";\n\n let mut input_f = input_field::InputField::new();\n\n let term = Term::with_height(TermHeight::Fixed(4)).unwrap();\n\n while let Ok(ev) = ter... |
Rust | src/middle/builder.rs | reitermarkus/libffi-rs | 693182bf1fb16da2c00ace0cc13920a98845c9a3 | use std::any::Any;
use super::types::Type;
#[derive(Clone, Debug)]
pub struct Builder {
args: Vec<Type>,
res: Type,
abi: super::FfiAbi,
}
impl Default for Builder {
fn default() -> Self {
Builder::new()
}
}
impl Builder {
pub fn new() -> Self {
Builder {
args... | use std::any::Any;
use super::types::Type;
#[derive(Clone, Debug)]
pub struct Builder {
args: Vec<Type>,
res: Type,
abi: super::FfiAbi,
}
impl Default for Builder {
fn default() -> Self {
Builder::new()
}
}
impl Builder {
pub fn new() -> Self {
Builder {
args... |
pub fn res(mut self, type_: Type) -> Self {
self.res = type_;
self
}
pub fn abi(mut self, abi: super::FfiAbi) -> Self {
self.abi = abi;
self
}
pub fn into_cif(self) -> super::Cif {
let mut result = super::Cif::new(self.args, self.res);
... | pub fn args<I>(mut self, types: I) -> Self
where I: IntoIterator<Item=Type>
{
self.args.extend(types.into_iter());
self
} | function_block-full_function | [
{
"content": "/// Constructs an [`Arg`](struct.Arg.html) for passing to\n\n/// [`call`](fn.call.html).\n\npub fn arg<T: super::CType>(arg: &T) -> Arg {\n\n Arg::new(arg)\n\n}\n\n\n\n/// Performs a dynamic call to a C function.\n\n///\n\n/// To reduce boilerplate, see [`ffi_call!`](../../macro.ffi_call!.html)... |
Rust | baustelle/src/containerfile.rs | akhramov/knast | 8c9f5f481a467a22c7cc47f11a28fe52536f9950 | use std::{convert::TryFrom, fs, io::Read, path::PathBuf};
use anyhow::{Context, Error};
use dockerfile_parser::{
Dockerfile as Containerfile, FromInstruction,
Instruction::{self, *},
};
use futures::{
channel::mpsc::{unbounded, SendError, UnboundedSender},
future::{self, Future},
stream::Stream,
... | use std::{convert::TryFrom, fs, io::Read, path::PathBuf};
use anyhow::{Context, Error};
use dockerfile_parser::{
Dockerfile as Containerfile, FromInstruction,
Instruction::{self, *},
};
use futures::{
channel::mpsc::{unbounded, SendError, UnboundedSender},
future::{self, Future},
stream::Stream,
... |
#[fehler::throws]
async fn execute_from_instruction(
&self,
instruction: FromInstruction,
sender: UnboundedSender<EvaluationUpdate>,
) {
let image = &instruction.image_parsed;
let sender = sender.with(|val| {
future::ok::<_, SendError>(EvaluationUpdate:... | nder: UnboundedSender<EvaluationUpdate>,
) {
match instruction {
From(instruction) => {
self.execute_from_instruction(instruction, sender).await?;
}
_ => {
log::warn!(
"Unhandled containerfile instruction {:?}",
... | function_block-function_prefixed | [
{
"content": "#[fehler::throws]\n\npub fn teardown(storage: &Storage<impl StorageEngine>, key: impl AsRef<str>) {\n\n let cache: ContainerAddressStorage = storage\n\n .get(NETWORK_STATE_STORAGE_KEY, CONTAINER_ADDRESS_STORAGE_KEY)?\n\n .ok_or_else(|| anyhow::anyhow!(\"Failed to read network stat... |
Rust | src/room.rs | neosam/sprite-game | 5d261eb538824ebb133833a4f4fe4f162aa3445c | use rand::Rng;
#[derive(Copy, Clone)]
pub enum DestRoom {
Relative(isize, isize, i32, i32,),
Absolute(isize, isize, i32, i32,),
}
impl DestRoom {
pub fn to_absolute_coordinates(&self, (x, y): (i32, i32)) -> (i32, i32) {
match self {
DestRoom::Relative(rel_x, rel_y, _, _) => (x + *rel_x... | use rand::Rng;
#[derive(Copy, Clone)]
pub enum DestRoom {
Relative(isize, isize, i32, i32,),
Absolute(isize, isize, i32, i32,),
}
impl DestRoom {
pub fn to_absolute_coordinates(&self, (x, y): (i32, i32)) -> (i32, i32) {
match self {
DestRoom::Relative(rel_x, rel_y, _, _) => (x + *rel_x... |
if self.exit_west {
room.set_field(0, self.height / 2,
RoomField::Exit(DestRoom::Relative(-1, 0, self.width as i32 - 2, self.height as i32 / 2)));
}
/* Draw 5-7 random stones */
for _ in 0..rng.gen_range(5, 8) {
let x = rng.gen_range(2, self.widt... | if self.exit_east {
room.set_field(self.width - 1, self.height / 2,
RoomField::Exit(DestRoom::Relative(1, 0, 1, self.height as i32 / 2)));
} | if_condition | [
{
"content": "fn generate_corridor(map: &mut Map<RoomGeneration>, rng: &mut impl Rng, width: usize, height: usize, corridor_length: u32, mut coordinate: (i32, i32)) -> Vec<(i32,i32)> {\n\n let mut coordinate_stack = Vec::new();\n\n for _ in 0..corridor_length {\n\n let choice = {\n\n let... |
Rust | part_8/src/render.rs | CroPo/roguelike-tutorial-2018 | 6ceceb445087ef42ed988574ef5ac04e341d9889 | use tcod::console::{Console, Root, blit, Offscreen};
use map_objects::map::GameMap;
use tcod::Map;
use ecs::Ecs;
use ecs::component::Position;
use ecs::component::Render;
use ecs::id::EntityId;
use tcod::Color;
use tcod::colors;
use tcod::BackgroundFlag;
use tcod::TextAlignment;
use ecs::component::Actor;
use message:... | use tcod::console::{Console, Root, blit, Offscreen};
use map_objects::map::GameMap;
use tcod::Map;
use ecs::Ecs;
use ecs::component::Position;
use ecs::component::Render;
use ecs::id::EntityId;
use tcod::Color;
use tcod::colors;
use tcod::BackgroundFlag;
use tcod::TextAlignment;
use ecs::component::Actor;
use message:... |
pub fn inventory_menu(console: &mut Root, ecs: &Ecs, title: &str, width: i32, screen_width: i32, screen_height: i32) {
if let Some(inventory) = ecs.get_component::<Inventory>(ecs.player_entity_id) {
let items = if inventory.items.len() == 0 {
vec!["Inventory is empty".to_string()]
} ... | t!("({}) {}", letter_index as char, option);
menu_panel.print_ex(0, y, BackgroundFlag::None, TextAlignment::Left, text);
y+=1;
letter_index+=1;
}
let x = screen_width / 2 - width / 2;
let y = screen_height / 2 - height / 2;
blit(&menu_panel, (0, 0),
(width, height),
... | function_block-function_prefixed | [
{
"content": "/// Display a selection menu of various options\n\npub fn selection_menu(console: &mut Root, title: &str, options: Vec<String>, width: i32, screen_width: i32, screen_height: i32) {\n\n let header_height = console.get_height_rect(0, 0, width, screen_height, title);\n\n let height = header_hei... |
Rust | clinkv2/src/kzg10/prover.rs | sunhuachuang/ckb-zkp | 4031a458a301a87cfdea9f6c662cc8a837d6ae51 | use ark_ec::PairingEngine;
use ark_ff::{Field, One, ToBytes, UniformRand, Zero};
use ark_poly::polynomial::univariate::DensePolynomial;
use ark_poly::{EvaluationDomain, GeneralEvaluationDomain, Polynomial, UVPolynomial};
use ark_std::{cfg_iter, cfg_iter_mut};
use merlin::Transcript;
use rand::Rng;
#[cfg(feature = "par... | use ark_ec::PairingEngine;
use ark_ff::{Field, One, ToBytes, UniformRand, Zero};
use ark_poly::polynomial::univariate::DensePolynomial;
use ark_poly::{EvaluationDomain, GeneralEvaluationDomain, Polynomial, UVPolynomial};
use ark_std::{cfg_iter, cfg_iter_mut};
use merlin::Transcript;
use rand::Rng;
#[cfg(feature = "par... | pub fn create_random_proof<E: PairingEngine, R: Rng>(
circuit: &ProveAssignment<E>,
kzg10_ck: &ProveKey<'_, E>,
rng: &mut R,
) -> Result<Proof<E>, SynthesisError> {
let m_io = circuit.input_assignment.len();
let m_mid = circuit.aux_assignment.len();
let n = circuit.input... | function_block-full_function | [
{
"content": "type Kzg10Proof<E> = kzg10::Proof<E>;\n",
"file_path": "clinkv2/src/kzg10/mod.rs",
"rank": 0,
"score": 123476.63471316447
},
{
"content": "fn skip_leading_zeros_and_convert_to_bigints<F: PrimeField>(\n\n p: &DensePolynomial<F>,\n\n) -> (usize, Vec<F::BigInt>) {\n\n let mu... | |
Rust | examples/simple/main.rs | Vollkornaffe/VRV | 8e71b9c728dbe91d41d563e32bcbf432952fe828 | use std::{
collections::HashSet,
sync::{
atomic::{AtomicBool, Ordering},
Arc,
},
time::Instant,
};
use ash::vk::{DynamicState, Extent2D};
use cgmath::{perspective, Deg, EuclideanSpace, Matrix4, Point3, SquareMatrix, Vector3};
use openxr::{EventDataBuffer, SessionState, ViewConfiguration... | use std::{
collections::HashSet,
sync::{
atomic::{AtomicBool, Ordering},
Arc,
},
time::Instant,
};
use ash::vk::{DynamicState, Extent2D};
use cgmath::{perspective, Deg, EuclideanSpace, Matrix4, Point3, SquareMatrix, Vector3};
use openxr::{EventDataBuffer, SessionState, ViewConfiguration... | use openxr::Event::*;
match event {
SessionStateChanged(e) => {
log::warn!("entered state {:?}", e.state());
xr_focused = false;
match e.state() {
... | function_block-function_prefixed | [
{
"content": "// there are 4 angles to consider instead of one\n\npub fn fov_to_projection(fov: Fovf) -> Matrix4<f32> {\n\n let tan_left = fov.angle_left.tan();\n\n let tan_right = fov.angle_right.tan();\n\n let tan_down = fov.angle_down.tan();\n\n let tan_up = fov.angle_up.tan();\n\n let near = ... | |
Rust | crates/nu-parser/src/hir.rs | jkatzmewing/nushell | 7061af712e3eec7e2bb68bf7ca31e67d6b8b3ae8 | pub(crate) mod baseline_parse;
pub(crate) mod binary;
pub(crate) mod expand_external_tokens;
pub(crate) mod external_command;
pub(crate) mod named;
pub(crate) mod path;
pub(crate) mod range;
pub mod syntax_shape;
pub(crate) mod tokens_iterator;
use crate::hir::syntax_shape::Member;
use crate::parse::operator::CompareO... | pub(crate) mod baseline_parse;
pub(crate) mod binary;
pub(crate) mod expand_external_tokens;
pub(crate) mod external_command;
pub(crate) mod named;
pub(crate) mod path;
pub(crate) mod range;
pub mod syntax_shape;
pub(crate) mod tokens_iterator;
use crate::hir::syntax_shape::Member;
use crate::parse::operator::CompareO... |
fn pretty_debug(&self, source: &str) -> DebugDocBuilder {
b::typed(
"call",
self.refined_pretty_debug(PrettyDebugRefineKind::WithContext, source),
)
}
}
#[derive(Debug, Clone, Eq, PartialEq, Ord, PartialOrd, Hash, Serialize, Deserialize)]
pub enum Expression {
Lite... | e(),
)
}),
)
+ b::preceded_option(
Some(b::space()),
self.named.as_ref().map(|named| {
named.refined_pretty_debug(PrettyDebugRefineKind::WithContext, so... | function_block-function_prefixed | [
{
"content": "pub fn files_exist_at(files: Vec<impl AsRef<Path>>, path: impl AsRef<Path>) -> bool {\n\n files.iter().all(|f| {\n\n let mut loc = PathBuf::from(path.as_ref());\n\n loc.push(f);\n\n loc.exists()\n\n })\n\n}\n\n\n",
"file_path": "crates/nu-test-support/src/fs.rs",
... |
Rust | src/token.rs | illumination-k/rs9cc | 6c2570e5d250435267a331b0a4d66ca052cb477d | use std::iter::Peekable;
use std::collections::HashSet;
#[derive(Debug, Clone)]
struct OpWords {
op_words: HashSet<String>,
max_length: usize,
}
impl OpWords {
fn new(op_words: Vec<&str>) -> Self {
let max_length = op_words.iter().map(|x| x.len()).max().unwrap();
Self {
op_word... | use std::iter::Peekable;
use std::collections::HashSet;
#[derive(Debug, Clone)]
struct OpWords {
op_words: HashSet<String>,
max_length: usize,
}
impl OpWords {
fn new(op_words: Vec<&str>) -> Self {
let max_length = op_words.iter().map(|x| x.len()).max().unwrap();
Self {
op_word... | &v in val[now_length..].iter().rev() {
bytes.push_front(v)
}
val = val[..now_length].to_vec();
break;
}
}
now_length -= 1;
... | if bytes[0].is_ascii_digit() {
TokenKind::TkNum
} else {
TokenKind::TkReserved
};
match token_kind {
TokenKind::TkNum => {
while let Some(byte) = bytes.pop_front() {
if byte.is_ascii_digit() {
val.p... | function_block-random_span | [
{
"content": "pub fn primary(tokenizer: &mut Peekable<TokenIter>) -> Box<Node> {\n\n if consume(\"(\", tokenizer) {\n\n let node = expr(tokenizer);\n\n let _expect = consume(\")\", tokenizer);\n\n return node \n\n }\n\n\n\n match tokenizer.peek() {\n\n Some(t) => {\n\n ... |
Rust | beacon_node/store/src/block_at_slot.rs | JustinDrake/lighthouse | 0694d1d0ec488d2d9f448a2bf5c6f742e1c5a5ed | use super::*;
use ssz::{Decode, DecodeError};
fn get_block_bytes<T: Store<E>, E: EthSpec>(
store: &T,
root: Hash256,
) -> Result<Option<Vec<u8>>, Error> {
store.get_bytes(BeaconBlock::<E>::db_column().into(), &root[..])
}
fn read_slot_from_block_bytes(bytes: &[u8]) -> Result<Slot, DecodeError> {
let e... | use super::*;
use ssz::{Decode, DecodeError};
fn get_block_bytes<T: Store<E>, E: EthSpec>(
store: &T,
root: Hash256,
) -> Result<Option<Vec<u8>>, Error> {
store.get_bytes(BeaconBlock::<E>::db_column().into(), &root[..])
}
fn read_slot_from_block_bytes(bytes: &[u8]) -> Result<Slot, DecodeError> {
let e... |
pub fn get_block_at_preceeding_slot<T: Store<E>, E: EthSpec>(
store: &T,
slot: Slot,
start_root: Hash256,
) -> Result<Option<(Hash256, BeaconBlock<E>)>, Error> {
Ok(
match get_at_preceeding_slot::<_, E>(store, slot, start_root)? {
Some((hash, bytes)) => Some((hash, BeaconBlock::<E>... | s(bytes: &[u8]) -> Result<Hash256, DecodeError> {
let previous_bytes = Slot::ssz_fixed_len();
let slice = bytes
.get(previous_bytes..previous_bytes + Hash256::ssz_fixed_len())
.ok_or_else(|| DecodeError::BytesInvalid("Not enough bytes.".to_string()))?;
Hash256::from_ssz_bytes(slice)
} | function_block-function_prefixed | [
{
"content": "/// Fetch the next state to use whilst backtracking in `*RootsIterator`.\n\nfn next_historical_root_backtrack_state<E: EthSpec, S: Store<E>>(\n\n store: &S,\n\n current_state: &BeaconState<E>,\n\n) -> Option<BeaconState<E>> {\n\n // For compatibility with the freezer database's restore po... |
Rust | src/protocol/spdm/get_caps.rs | capoferro/manticore | 64a4fb3089133d1543849bfdc44ccb8855ba0b7e |
use core::mem;
use core::time::Duration;
use enumflags2::bitflags;
use enumflags2::BitFlags;
use crate::io::ReadInt as _;
use crate::protocol::spdm;
use crate::protocol::spdm::CommandType;
protocol_struct! {
type GetCaps;
const TYPE: CommandType = GetCaps;
#![fuzz_derives_if = any()]
... |
use core::mem;
use core::time::Duration;
use enumflags2::bitflags;
use enumflags2::BitFlags;
use crate::io::ReadInt as _;
use crate::protocol::spdm;
use crate::protocol::spdm::CommandType;
protocol_struct! {
type GetCaps;
const TYPE: CommandType = GetCaps;
#![fuzz_derives_if = any()]
... |
(size, Some(size))
}
}
#[cfg(feature = "arbitrary-derive")]
impl Arbitrary for GetCapsResponse {
fn arbitrary(u: &mut Unstructured) -> arbitrary::Result<Self> {
Ok(Self {
crypto_timeout: u.arbitrary()?,
caps: arbitrary_bitflags(u)?,
max_packet_size: u.arbitr... | let size = mem::size_of::<Duration>()
+ mem::size_of::<BitFlags<Caps>>()
+ mem::size_of::<u32>() * 2; | assignment_statement | [
{
"content": "/// No-std helper for using as a `write!()` target.\n\nstruct ArrayBuf<const N: usize>([u8; N], usize);\n\n\n\nimpl<const N: usize> AsRef<str> for ArrayBuf<N> {\n\n fn as_ref(&self) -> &str {\n\n core::str::from_utf8(&self.0[..self.1]).unwrap()\n\n }\n\n}\n\n\n\nimpl<const N: usize> D... |
Rust | kernel/src/allocator/tests.rs | rrybarczyk/osy | 3328c26343d47c31e615df080d4769821567df15 | mod align_util {
use allocator::util::{align_up, align_down};
#[test]
fn test_align_down() {
assert_eq!(align_down(0, 2), 0);
assert_eq!(align_down(0, 8), 0);
assert_eq!(align_down(0, 1 << 5), 0);
assert_eq!(align_down(1 << 10, 1 << 10), 1 << 10);
assert_eq!(align_d... | mod align_util {
use allocator::util::{align_up, align_down};
#[test]
fn test_align_down() {
a | 12), 0xAF000);
assert_eq!(align_down(0xAFFFF, 1 << 16), 0xA0000);
}
#[test]
fn test_align_up() {
assert_eq!(align_up(0, 2), 0);
assert_eq!(align_up(0, 8), 0);
assert_eq!(align_up(0, 1 << 5), 0);
assert_eq!(align_up(1 << 10, 1 << 10), 1 << 10);
assert_eq!(al... | ssert_eq!(align_down(0, 2), 0);
assert_eq!(align_down(0, 8), 0);
assert_eq!(align_down(0, 1 << 5), 0);
assert_eq!(align_down(1 << 10, 1 << 10), 1 << 10);
assert_eq!(align_down(1 << 20, 1 << 10), 1 << 20);
assert_eq!(align_down(1 << 23, 1 << 4), 1 << 23);
assert_eq!(alig... | function_block-random_span | [
{
"content": "pub fn next_test_ip4() -> SocketAddr {\n\n let port = PORT.fetch_add(1, Ordering::SeqCst) as u16 + base_port();\n\n SocketAddr::V4(SocketAddrV4::new(Ipv4Addr::new(127, 0, 0, 1), port))\n\n}\n\n\n",
"file_path": "std/src/net/test.rs",
"rank": 0,
"score": 132764.1280292329
},
{... |
Rust | src/types/fetch_attributes.rs | FelixPodint/imap-codec | 48019304520dcaade13fc94a5f359d0a450b7a79 | use std::num::NonZeroU32;
#[cfg(feature = "arbitrary")]
use arbitrary::Arbitrary;
#[cfg(feature = "serdex")]
use serde::{Deserialize, Serialize};
use crate::types::{
body::BodyStructure, core::NString, datetime::MyDateTime, envelope::Envelope, flag::Flag,
section::Section,
};
#[cfg_attr(feature = "arbitrary"... | use std::num::NonZeroU32;
#[cfg(feature = "arbitrary")]
use arbitrary::Arbitrary;
#[cfg(feature = "serdex")]
use serde::{Deserialize, Serialize};
use crate::types::{
body::BodyStructure, core::NString, datetime::MyDateTime, envelope::Envelope, flag::Flag,
section::Section,
};
#[cfg_attr(feature = "arbitrary"... |
}
#[cfg_attr(feature = "arbitrary", derive(Arbitrary))]
#[cfg_attr(feature = "serdex", derive(Serialize, Deserialize))]
#[derive(Debug, Clone, PartialEq, Eq, Hash)]
pub enum MacroOrFetchAttributes {
Macro(Macro),
FetchAttributes(Vec<FetchAttribute>),
}
impl From<Macro> for MacroOrFetchAttributes {
fn fro... | e::*;
match self {
Self::All => vec![Flags, InternalDate, Rfc822Size, Envelope],
Self::Fast => vec![Flags, InternalDate, Rfc822Size],
Self::Full => vec![Flags, InternalDate, Rfc822Size, Envelope, Body],
}
} | function_block-function_prefixed | [
{
"content": "/// body = \"(\" (body-type-1part / body-type-mpart) \")\"\n\n///\n\n/// Note: This parser is recursively defined. Thus, in order to not overflow the stack,\n\n/// it is needed to limit how may recursions are allowed. (8 should suffice).\n\npub fn body(remaining_recursions: usize) -> impl Fn(&[u8]... |
Rust | rsocket/src/frame/setup.rs | sofkyle/rsocket-rust | 136fbc70c006c53ee3e3839aa16e97eb7cf845da | use super::{Body, Frame, PayloadSupport, Version, FLAG_METADATA, FLAG_RESUME};
use crate::utils::{RSocketResult, Writeable, DEFAULT_MIME_TYPE};
use bytes::{Buf, BufMut, Bytes, BytesMut};
use std::time::Duration;
#[derive(Debug, PartialEq)]
pub struct Setup {
version: Version,
keepalive: u32,
lifetime: u32,... | use super::{Body, Frame, PayloadSupport, Version, FLAG_METADATA, FLAG_RESUME};
use crate::utils::{RSocketResult, Writeable, DEFAULT_MIME_TYPE};
use bytes::{Buf, BufMut, Bytes, BytesMut};
use std::time::Duration;
#[derive(Debug, PartialEq)]
pub struct Setup {
version: Version,
keepalive: u32,
lifetime: u32,... |
}
pub fn builder(stream_id: u32, flag: u16) -> SetupBuilder {
SetupBuilder::new(stream_id, flag)
}
pub fn get_version(&self) -> Version {
self.version
}
pub fn get_keepalive(&self) -> Duration {
Duration::from_millis(u64::from(self.keepalive))
}
pub fn get_li... | Ok(Setup {
version: Version::new(major, minor),
keepalive,
lifetime,
token,
mime_metadata: String::from_utf8(mime_metadata.to_vec()).unwrap(),
mime_data: String::from_utf8(mime_data.to_vec()).unwrap(),
metadata,
data,
... | call_expression | [
{
"content": "#[inline]\n\nfn to_frame_type(body: &Body) -> u16 {\n\n match body {\n\n Body::Setup(_) => TYPE_SETUP,\n\n Body::Lease(_) => TYPE_LEASE,\n\n Body::Keepalive(_) => TYPE_KEEPALIVE,\n\n Body::RequestResponse(_) => TYPE_REQUEST_RESPONSE,\n\n Body::RequestFNF(_) =>... |
Rust | src/pka/compare.rs | jeandudey/cc13x2-rs | 215918099301ec75e9dfad531f5cf46e13077a39 | #[doc = "Reader of register COMPARE"]
pub type R = crate::R<u32, super::COMPARE>;
#[doc = "Writer for register COMPARE"]
pub type W = crate::W<u32, super::COMPARE>;
#[doc = "Register COMPARE `reset()`'s with value 0x01"]
impl crate::ResetValue for super::COMPARE {
type Type = u32;
#[inline(always)]
fn reset... | #[doc = "Reader of register COMPARE"]
pub type R = crate::R<u32, super::COMPARE>;
#[doc = "Writer for register COMPARE"]
pub type W = crate::W<u32, super::COMPARE>;
#[doc = "Register COMPARE `reset()`'s with value 0x01"]
impl crate::ResetValue for super::COMPARE {
type Type = u32;
#[inline(always)]
fn reset... | ls_b(&mut self) -> A_EQUALS_B_W {
A_EQUALS_B_W { w: self }
}
}
| mut W {
self.w.bits = (self.w.bits & !0x01) | ((value as u32) & 0x01);
self.w
}
}
impl R {
#[doc = "Bits 3:31 - 31:3\\]
Ignore on read"]
#[inline(always)]
pub fn reserved3(&self) -> RESERVED3_R {
RESERVED3_R::new(((self.bits >> 3) & 0x1fff_ffff) as u32)
}
#[doc = "Bit 2 -... | random | [
{
"content": "#[doc = \"Reset value of the register\"]\n\n#[doc = \"\"]\n\n#[doc = \"This value is initial value for `write` method.\"]\n\n#[doc = \"It can be also directly writed to register by `reset` method.\"]\n\npub trait ResetValue {\n\n #[doc = \"Register size\"]\n\n type Type;\n\n #[doc = \"Res... |
Rust | src/p2p/session.rs | placefortea/teatree | 7a56755a428fe63ee753df67a7c71d8f668e17ec | use bytes::{BufMut, BytesMut};
use futures::stream::SplitSink;
use futures::Sink;
use std::collections::HashMap;
use std::net::SocketAddr;
use tokio::codec::BytesCodec;
use tokio::net::UdpFramed;
use crate::actor::prelude::*;
use crate::primitives::functions::{try_resend_times, DEFAULT_TIMES};
use crate::traits::actor... | use bytes::{BufMut, BytesMut};
use futures::stream::SplitSink;
use futures::Sink;
use std::collections::HashMap;
use std::net::SocketAddr;
use tokio::codec::BytesCodec;
use tokio::net::UdpFramed;
use crate::actor::prelude::*;
use crate::primitives::functions::{try_resend_times, DEFAULT_TIMES};
use crate::traits::actor... |
}
Err(_) => panic!("DEBUG: NETWORK HAVE ERROR"),
}
actor_ok(())
})
.wait(ctx);
Some(())
});
}
}
impl<A: P2PBridgeActor> Actor for P2PSessionActor<A> {
type Context = Con... | if !next.is_empty() {
act.send_udp(next, self_sign, next_sign, socket, ctx);
} | if_condition | [
{
"content": "pub fn parse_http_body_json(bytes: &mut BytesMut) -> Result<Value, ()> {\n\n let mut vec: Vec<u8> = Vec::new();\n\n\n\n for (i, v) in (&bytes).iter().enumerate() {\n\n if v == &13 || v == &10 {\n\n vec.push(v.clone())\n\n } else {\n\n if vec == [13, 10, 13... |
Rust | src/connector/mysql/conversion.rs | kyle-mccarthy/quaint | 12b6d22014f4e1218e32760a91b7985205e02453 | use crate::{
ast::Value,
connector::{queryable::TakeRow, TypeIdentifier},
error::{Error, ErrorKind},
};
#[cfg(feature = "chrono")]
use chrono::{DateTime, Datelike, NaiveDate, NaiveDateTime, NaiveTime, Timelike, Utc};
use mysql_async::{
self as my,
consts::{ColumnFlags, ColumnType},
};
use std::conve... | use crate::{
ast::Value,
connector::{queryable::TakeRow, TypeIdentifier},
error::{Error, ErrorKind},
};
#[cfg(feature = "chrono")]
use chrono::{DateTime, Datelike, NaiveDate, NaiveDateTime, NaiveTime, Timelike, Utc};
use mysql_async::{
self as my,
consts::{ColumnFlags, ColumnType},
};
use std::conve... |
let mut row = Vec::with_capacity(self.len());
for i in 0..self.len() {
row.push(convert(self, i)?);
}
Ok(row)
}
}
| fn convert(row: &mut my::Row, i: usize) -> crate::Result<Value<'static>> {
let value = row.take(i).ok_or_else(|| {
let msg = "Index out of bounds";
let kind = ErrorKind::conversion(msg);
Error::builder(kind).build()
})?;
let column = ... | function_block-full_function | [
{
"content": "#[tracing::instrument(skip(params))]\n\npub fn conv_params<'a>(params: &'a [Value<'a>]) -> crate::Result<Vec<&'a dyn ToSql>> {\n\n let mut converted = Vec::with_capacity(params.len());\n\n\n\n for param in params.iter() {\n\n converted.push(param as &dyn ToSql)\n\n }\n\n\n\n Ok(... |
Rust | src/services/filler/processor.rs | Emulator000/pdfiller | 89df98bbdb95147269ba9161f619ae59a30a43ce | use std::collections::BTreeMap;
use std::str;
use async_std::sync::Arc;
use log::error;
use lopdf::{Dictionary, Document as PdfDocument, Object, ObjectId};
use crate::file::FileProvider;
use crate::mongo::models::document::Document;
const PDF_VERSION: &str = "1.5";
pub struct DocumentObjects {
pub objects: BTre... | use std::collections::BTreeMap;
use std::str;
use async_std::sync::Arc;
use log::error;
use lopdf::{Dictionary, Document as PdfDocument, Object, ObjectId};
use crate::file::FileProvider;
use crate::mongo::models::document::Document;
const PDF_VERSION: &str = "1.5";
pub struct DocumentObjects {
pub objects: BTre... | ;
}
"Pages" => {
if let Some(dictionary) =
upsert_dictionary(&object, pages_object.as_ref().map(|(_, object)| object))
{
pages_object = Some((
if let Some((id, _)) = pages_object {
... | Some((
if let Some((id, _)) = catalog_object {
id
} else {
*object_id
},
object.clone(),
)) | call_expression | [
{
"content": "fn get_document_buffer(document: &mut PdfDocument) -> ExportCompilerResult<Vec<u8>> {\n\n let buf = Vec::<u8>::new();\n\n let mut cursor = Cursor::new(buf);\n\n\n\n match document.save_to(&mut cursor) {\n\n Ok(_) => {\n\n let _ = cursor.seek(SeekFrom::Start(0));\n\n\n\n ... |
Rust | openethereum/rpc/src/v1/helpers/subscribers.rs | snuspl/fluffy | d17e1fb3cda259d6f2c244ef67ee3a4bdf83261b |
use std::{ops, str};
use std::collections::HashMap;
use jsonrpc_pubsub::{typed::{Subscriber, Sink}, SubscriptionId};
use ethereum_types::H64;
#[derive(Debug, Clone, Hash, Eq, PartialEq)]
pub struct Id(H64);
impl str::FromStr for Id {
type Err = String;
fn from_str(s: &str) -> Result<Self, Self::Err> {
if s.sta... |
use std::{ops, str};
use std::collections::HashMap;
use jsonrpc_pubsub::{typed::{Subscriber, Sink}, SubscriptionId};
use ethereum_types::H64;
#[derive(Debug, Clone, Hash, Eq, PartialEq)]
pub struct Id(H64);
impl str::FromStr for Id {
type Err = String;
fn from_str(s: &str) -> Result<Self, Self::Err> {
if s.sta... |
}
impl<T> Subscribers<Sink<T>> {
pub fn push(&mut self, sub: Subscriber<T>) {
let id = self.next_id();
if let Ok(sink) = sub.assign_id(SubscriptionId::String(id.as_string())) {
debug!(target: "pubsub", "Adding subscription id={:?}", id);
self.subscriptions.insert(id, sink);
}
}
}
impl<T, V> Subscribe... | pub fn remove(&mut self, id: &SubscriptionId) -> Option<T> {
trace!(target: "pubsub", "Removing subscription id={:?}", id);
match *id {
SubscriptionId::String(ref id) => match id.parse() {
Ok(id) => self.subscriptions.remove(&id),
Err(_) => None,
},
_ => None,
}
} | function_block-full_function | [
{
"content": "#[allow(dead_code)]\n\npub fn json_chain_test<H: FnMut(&str, HookType)>(path: &Path, json_data: &[u8], start_stop_hook: &mut H) -> Vec<String> {\n\n\tlet _ = ::env_logger::try_init();\n\n\tlet tests = ethjson::test_helpers::state::Test::load(json_data)\n\n\t\t.expect(&format!(\"Could not parse JSO... |
Rust | src/refmanager.rs | WilsonGramer/ref_thread_local.rs | 52cd3d9641d1b776ebd1586bdc914dd889a9f9de |
extern crate std;
use super::RefThreadLocal;
use std::cell::Cell;
use std::fmt::{Debug, Display, Formatter};
use std::ops::{Deref, DerefMut};
use std::ptr::{null, null_mut};
use std::thread::LocalKey;
struct RefManagerInnerData<T> {
borrow_count: Cell<isize>,
value: T,
}
pub struct RefManagerPeekData<T> {
... |
extern crate std;
use super::RefThreadLocal;
use std::cell::Cell;
use std::fmt::{Debug, Display, Formatter};
use std::ops::{Deref, DerefMut};
use std::ptr::{null, null_mut};
use std::thread::LocalKey;
struct RefManagerInnerData<T> {
borrow_count: Cell<isize>,
value: T,
}
pub struct RefManagerPeekData<T> {
... |
}
impl<'a, T: Debug> Debug for Ref<'a, T> {
fn fmt(&self, f: &mut Formatter) -> std::fmt::Result {
Debug::fmt(&**self, f)
}
}
impl<'a, T: Display> Display for Ref<'a, T> {
fn fmt(&self, f: &mut Formatter) -> std::fmt::Result {
self.value.fmt(f)
}
}
impl<'a, T: ?Sized> Drop for RefMut... | pub fn map_split<U: ?Sized, V: ?Sized, F>(orig: Ref<'a, T>, f: F) -> (Ref<'a, U>, Ref<'a, V>)
where
F: FnOnce(&T) -> (&U, &V),
{
let borrow_count = orig.borrow_count;
let value = orig.value;
std::mem::forget(orig);
let (a, b) = f(value);
borrow_count.set(borrow_co... | function_block-full_function | [
{
"content": "fn __static_ref_initialize() -> X {\n\n X\n\n}\n",
"file_path": "tests/test.rs",
"rank": 0,
"score": 76498.62253932712
},
{
"content": "#[test]\n\nfn test_borrow_mut_after_borrow() {\n\n let _a = NUMBER.try_borrow();\n\n let _b = NUMBER.try_borrow_mut();\n\n _a.expe... |
Rust | src/parser/combinators.rs | ireina7/abyss.rs | 2c374996d68a6940a6100ff41e1912d3daca9db9 | use super::core::*;
#[allow(dead_code)]
pub fn wrap<P: Parser>(p: P) -> Wrapper<P> {
Wrapper::new(p)
}
#[allow(dead_code)]
pub fn pure<A: Clone>(x: A) -> Pure<A> {
Pure::new(x)
}
#[allow(dead_code)]
pub fn satisfy<F>(f: F) -> Satisfy<F> where
F: Fn(&char) -> bool {
Satisfy::new(f)
}
#[allow(dead_co... | use super::core::*;
#[allow(dead_code)]
pub fn wrap<P: Parser>(p: P) -> Wrapper<P> {
Wrapper::new(p)
}
#[allow(dead_code)]
pub fn pure<A: Clone>(x: A) -> Pure<A> {
Pure::new(x)
}
#[allow(dead_code)]
pub fn satisfy<F>(f: F) -> Satisfy<F> where
F: Fn(&char) -> bool {
Satisfy::new(f)
}
#[allow(dead_co... | .parse(&mut src), Ok('c'));
}*/
#[test]
fn test_parser_many() {
let mut src = ParseState::new("aa0bcdefghijklmn");
let parser = many(char('a'));
assert_eq!(parser.parse(&mut src), Ok(vec!['a', 'a']));
}
#[test]
fn test_parser_many1() {
let mut src = ParseState::... | .info(&format!("Parsing char of one of {}", cs))
}
#[allow(dead_code)]
pub fn except(cs: &str) -> Wrapper<impl Parser<Output=char> + Clone> {
let ss = cs.to_string();
satisfy(move |&c| !ss.chars().any(|x| x == c))
.info(&format!("Parsing char except one of {}", cs))
}
#[allow(dead_code)]
pub fn i... | random | [
{
"content": "/// Check if variable is atom (normal form)\n\nfn is_atom(s: &str) -> bool {\n\n let atoms = [\"True\", \"False\"];\n\n atoms.iter().any(|&x| x == s)\n\n}\n\n\n",
"file_path": "src/abyss/eval/strict.rs",
"rank": 18,
"score": 143964.6489613122
},
{
"content": "/// Test if ... |
Rust | src/entities.rs | JoshMcguigan/amethyst-2d-platformer-demo | fa4c53621e4af22e6e7f0657e83bfa13f50bf341 | use amethyst::{
assets::{AssetStorage, Loader},
core::{Transform},
ecs::{Entity},
prelude::*,
renderer::{
Camera, PngFormat, Projection, Sprite, SpriteRender, SpriteSheet,
SpriteSheetHandle, Texture, TextureMetadata, SpriteSheetFormat, Transparent
},
};
use crate::{
DISPLAY_W... | use amethyst::{
assets::{AssetStorage, Loader},
core::{Transform},
ecs::{Entity},
prelude::*,
renderer::{
Camera, PngFormat, Projection, Sprite, SpriteRender, SpriteSheet,
SpriteSheetHandle, Texture, TextureMetadata, SpriteSheetFormat, Transparent
},
};
use crate::{
DISPLAY_W... |
fn init_crate_sprite(world: &mut World, sprite_sheet: &SpriteSheetHandle, left: f32, bottom: f32) -> Entity {
let mut transform = Transform::default();
transform.set_z(-9.);
let sprite = SpriteRender {
sprite_sheet: sprite_sheet.clone(),
sprite_number: 0,
};
let mut two_dim_object... | world.create_entity()
.with(transform)
.with(two_dim_object)
.with(sprite)
.with(Transparent)
.build()
} | function_block-function_prefix_line | [
{
"content": "fn main() -> amethyst::Result<()> {\n\n amethyst::start_logger(Default::default());\n\n let config = DisplayConfig::load(\"./resources/display_config.ron\");\n\n let pipe = Pipeline::build().with_stage(\n\n Stage::with_backbuffer()\n\n .clear_target([0.1, 0.1, 0.2, 1.0],... |
Rust | src/lib.rs | psFried/pgen | 008a4c680cd3651da5442780076523df1e8df86e | #[macro_use]
extern crate failure;
#[macro_use]
extern crate lazy_static;
extern crate byteorder;
extern crate encoding;
extern crate itertools;
extern crate lalrpop_util;
extern crate rand;
extern crate regex;
extern crate rustyline;
extern crate string_cache;
mod arguments;
pub(crate) mod builtins;
mod context;
pub... | #[macro_use]
extern crate failure;
#[macro_use]
extern crate lazy_static;
extern crate byteorder;
extern crate encoding;
extern crate itertools;
extern crate lalrpop_util;
extern crate rand;
extern crate regex;
extern crate rustyline;
extern crate string_cache;
mod arguments;
pub(crate) mod builtins;
mod context;
pub... |
pub fn write_value(
&self,
context: &mut ProgramContext,
output: &mut DataGenOutput,
) -> Result<(), Error> {
match *self {
AnyFunction::String(ref fun) => fun.write_value(context, output),
AnyFunction::Uint(ref fun) => fun.write_value(context, output),
... | pub fn get_type(&self) -> GenType {
match *self {
AnyFunction::String(_) => GenType::String,
AnyFunction::Uint(_) => GenType::Uint,
AnyFunction::Int(_) => GenType::Int,
AnyFunction::Decimal(_) => GenType::Decimal,
AnyFunction::Boolean(_) => GenType::Bo... | function_block-full_function | [
{
"content": "fn execute_fn(function: AnyFunction, context: &mut ProgramContext) -> Result<(), Error> {\n\n let out = io::stdout();\n\n let mut lock = out.lock();\n\n\n\n let result = {\n\n let mut dgen_out = DataGenOutput::new(&mut lock);\n\n function.write_value(context, &mut dgen_out).... |
Rust | src/resolution/constraint/contact_equation.rs | BenBergman/nphysics | 11ca4d6f967c35e7f51e65295174c5b0395cbd93 | use na::Bounded;
use na;
use num::Float;
use ncollide::geometry::Contact;
use volumetric::InertiaTensor;
use resolution::constraint::velocity_constraint::VelocityConstraint;
use object::RigidBody;
use math::{Scalar, Point, Vect, Orientation};
pub enum CorrectionMode {
Velocity(Scalar),
VelocityAndPos... | use na::Bounded;
use na;
use num::Float;
use ncollide::geometry::Contact;
use volumetric::InertiaTensor;
use resolution::constraint::velocity_constraint::VelocityConstraint;
use object::RigidBody;
use math::{Scalar, Point, Vect, Orientation};
pub enum CorrectionMode {
Velocity(Scalar),
VelocityAndPos... | e::VelocityAndPositionThresold(_, ref p, _) => p.clone(),
CorrectionMode::Velocity(_) => na::zero()
}
}
#[inline]
pub fn min_depth_for_pos_corr(&self) -> Scalar {
match *self {
CorrectionMode::VelocityAndPosition(_, _, ref t) ... | orr_factor(&self) -> Scalar {
match *self {
CorrectionMode::VelocityAndPosition(_, ref p, _) => p.clone(),
CorrectionMod | function_block-random_span | [] |
Rust | src/hs_types.rs | a-mackay/raystack | 26837f3c148f0e21ba529f40925828e3f291c333 |
use chrono::{NaiveDate, NaiveTime};
use chrono_tz::Tz;
use raystack_core::{FromHaysonError, Hayson};
use serde_json::{json, Value};
use std::convert::From;
const KIND: &str = "_kind";
#[derive(Clone, Debug, Eq, PartialEq)]
pub struct Date(NaiveDate);
impl Date {
pub fn new(naive_date: NaiveDate) -> Self {
... |
use chrono::{NaiveDate, NaiveTime};
use chrono_tz::Tz;
use raystack_core::{FromHaysonError, Hayson};
use serde_json::{json, Value};
use std::convert::From;
const KIND: &str = "_kind";
#[derive(Clone, Debug, Eq, PartialEq)]
pub struct Date(NaiveDate);
impl Date {
pub fn new(naive_date: NaiveDate) -> Self {
... |
let tz_value = obj.get("tz");
let mut tz_str = default_tz.to_owned();
if let Some(value) = tz_value {
match value {
Value::Null => {
tz_str = default_tz.to_owned();
}
... | if let Some(kind_err) = hayson_check_kind("dateTime", value) {
return Err(kind_err);
} | if_condition | [
{
"content": "/// Convert a `DateTime` into a string which can be used in ZINC files.\n\nfn to_zinc_encoded_string(date_time: &DateTime) -> String {\n\n let time_zone_name = date_time.short_time_zone();\n\n format!(\n\n \"{} {}\",\n\n date_time\n\n .date_time()\n\n .to_... |
Rust | src/timestamp.rs | Cognoscan/fog_pack | 7b3af246faa851bfc2aa09cc186ff2332124e791 | use std::cmp;
use std::convert::TryFrom;
use std::fmt;
use std::ops;
use std::time;
use byteorder::{LittleEndian, ReadBytesExt};
use fog_crypto::serde::{
CryptoEnum, FOG_TYPE_ENUM, FOG_TYPE_ENUM_TIME_INDEX, FOG_TYPE_ENUM_TIME_NAME,
};
use serde::{
de::{Deserialize, Deserializer, EnumAccess, Error, Unexpected... | use std::cmp;
use std::convert::TryFrom;
use std::fmt;
use std::ops;
use std::time;
use byteorder::{LittleEndian, ReadBytesExt};
use fog_crypto::serde::{
CryptoEnum, FOG_TYPE_ENUM, FOG_TYPE_ENUM_TIME_INDEX, FOG_TYPE_ENUM_TIME_NAME,
};
use serde::{
de::{Deserialize, Deserializer, EnumAccess, Error, Unexpected... |
pub fn size(&self) -> usize {
if self.nano != 0 {
1 + 8 + 4
} else if (self.sec <= u32::MAX as i64) && (self.sec >= 0) {
1 + 4
} else {
1 + 8
}
}
pub fn now() -> Option<Timestamp> {
match time::SystemTime::now().du... | vec.push(self.standard);
vec.extend_from_slice(&self.sec.to_le_bytes());
vec.extend_from_slice(&self.nano.to_le_bytes());
} else if (self.sec <= u32::MAX as i64) && (self.sec >= 0) {
vec.reserve(1 + 4);
vec.push(self.standard);
vec.extend_from_slice(&(... | function_block-function_prefix_line | [
{
"content": "/// Serialize an element onto a byte vector. Doesn't check if Array & Map structures make\n\n/// sense, just writes elements out.\n\npub fn serialize_elem(buf: &mut Vec<u8>, elem: Element) {\n\n use self::Element::*;\n\n match elem {\n\n Null => buf.push(Marker::Null.into()),\n\n ... |
Rust | src/main.rs | thehamsterjam/better_aws_sso | 4a2fbee508c549dbba65fe17e7557fdb844581d3 | use clap::{App, Arg};
use ini::Ini;
use serde::Deserialize;
use std::{thread, time};
use ureq::Response;
use webbrowser;
extern crate dirs;
use std::time::{SystemTime, UNIX_EPOCH};
const GRANT_TYPE: &str = "urn:ietf:params:oauth:grant-type:device_code";
#[derive(Debug)]
#[allow(non_snake_case)]
struct SsoProfile {
... | use clap::{App, Arg};
use ini::Ini;
use serde::Deserialize;
use std::{thread, time};
use ureq::Response;
use webbrowser;
extern crate dirs;
use std::time::{SystemTime, UNIX_EPOCH};
const GRANT_TYPE: &str = "urn:ietf:params:oauth:grant-type:device_code";
#[derive(Debug)]
#[allow(non_snake_case)]
struct SsoProfile {
... |
fn _list_accounts(sso_url: String, access_token: String) -> Response {
ureq::get(format!("{}{}", sso_url, "/assignment/accounts").as_str())
.query("max_result", "100")
.set(
"x-amz-sso_bearer_token",
format!("{}", access_token).as_str(),
)
.call()
}
| f save_as_profile_name {
format!("{}_", profile)
} else {
format!("{}_{}", sso_account_id, sso_role_name)
};
let mut aws_creds =
Ini::load_from_file(format!("{}{}", home_dir, "/.aws/credentials")).unwrap();
if verbose {
println!("Section name : {}", section_name);
}... | function_block-function_prefixed | [
{
"content": "fn get_latest_version() -> String {\n\n let api_url = \"https://api.github.com/repos/thehamsterjam/better_aws_sso/releases/latest\";\n\n let resp = ureq::get(api_url)\n\n .call()\n\n .into_json()\n\n .unwrap();\n\n resp[\"tag_name\"].to_string()\n\n}",
"file_path"... |
Rust | src/sol.rs | Aehmlo/sudoku | d2cb746ff47d427128f53f593efc555212cf32b5 |
use crate::sudoku::Grid;
use crate::Element;
use crate::Point;
use crate::Sudoku;
use crate::DIMENSIONS;
use std::ops::{Index, IndexMut};
#[derive(Clone, Copy, Debug, PartialEq, PartialOrd)]
pub enum Difficulty {
#[doc(hidden)]
Unplayable,
Beginner,
Easy,
Intermediate,
... |
use crate::sudoku::Grid;
use crate::Element;
use crate::Point;
use crate::Sudoku;
use crate::DIMENSIONS;
use std::ops::{Index, IndexMut};
#[derive(Clone, Copy, Debug, PartialEq, PartialOrd)]
pub enum Difficulty {
#[doc(hidden)]
Unplayable,
Beginner,
Easy,
Intermediate,
... |
pub fn eliminate(&mut self, index: Point, value: usize) {
self[index] = self[index].and_then(|e| e.eliminate(value));
}
pub fn next(&self) -> (Option<Point>, Option<PossibilitySet>) {
let mut best = None;
let mut best_index = None;
let mut best_sco... | f {
Self {
possibilities: vec![
Some(PossibilitySet::new(order));
(order as usize).pow(2 + DIMENSIONS as u32)
],
order,
parent: None,
}
} | function_block-function_prefixed | [
{
"content": "/// Trait to generate a puzzle.\n\n///\n\n/// Requires that the puzzle be solvable (to ensure the desired difficulty is\n\n/// attained).\n\npub trait Generate: Score + Sized {\n\n /// Generates a puzzle of the desired order and difficulty.\n\n fn generate(order: u8, difficulty: Difficulty) ... |
Rust | flow-rs/src/channel/storage.rs | ysh329/MegFlow | 778a4361a88af43f499528f4509f6523515ce0ee | /**
* \file flow-rs/src/channel/storage.rs
* MegFlow is Licensed under the Apache License, Version 2.0 (the "License")
*
* Copyright (c) 2019-2021 Megvii Inc. All rights reserved.
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS I... | /**
* \file flow-rs/src/channel/storage.rs
* MegFlow is Licensed under the Apache License, Version 2.0 (the "License")
*
* Copyright (c) 2019-2021 Megvii Inc. All rights reserved.
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS I... | > ChannelStorage {
ChannelStorage {
storage: inner::bounded(cap),
receiver_epoch: Arc::new(AtomicUsize::new(0)),
sender_epoch: Arc::new(AtomicUsize::new(0)),
sender_record: Arc::new(Mutex::new(HashMap::new())),
rx_counter: Arc::new(AtomicUsize::new(0))... | queue.is_closed()
}
fn is_none(&self) -> bool {
false
}
}
impl ChannelStorage {
pub fn bound(cap: usize) - | random | [
{
"content": "pub fn ident(lit: impl AsRef<str>) -> Ident {\n\n Ident::new(lit.as_ref(), Span::call_site())\n\n}\n",
"file_path": "flow-derive/src/lit.rs",
"rank": 0,
"score": 153767.02012632263
},
{
"content": "pub fn match_last_ty(ty: &syn::Type, wrapper: &str) -> bool {\n\n match ty... |
Rust | src/external_service/spread_sheet/token_manager.rs | tacogips/api-everywhere | 02224c875afee72dc0ad82707e1ef1a0d7eff51a | use arc_swap::ArcSwap;
use chrono::{Duration, Local};
use hyper;
use log;
use once_cell::sync::OnceCell;
use std::path::PathBuf;
use std::sync::Arc;
use thiserror::Error;
use tokio::sync::broadcast;
use tokio::task::{JoinError, JoinHandle};
use tokio::time::timeout;
use yup_oauth2::{
self as oauth,
authenticato... | use arc_swap::ArcSwap;
use chrono::{Duration, Local};
use hyper;
use log;
use once_cell::sync::OnceCell;
use std::path::PathBuf;
use std::sync::Arc;
use thiserror::Error;
use tokio::sync::broadcast;
use tokio::task::{JoinError, JoinHandle};
use tokio::time::timeout;
use yup_oauth2::{
self as oauth,
authenticato... | })?;
let authenticator = oauth::ServiceAccountAuthenticator::builder(sa_key)
.build()
.await
.map_err(|e| {
GoogleTokenManagerError::InvalidServiceAccountFileError(service_account_cred_file, e)
})?;
TokenManager::start(
authenticator,
scopes,
... | nt_token,
token_refreshing_loop_jh,
};
Ok(result)
}
async fn periodically_refreshing_token(
authenticator: Arc<Authenticator<HttpConnector>>,
shared_token: Arc<ArcSwap<AccessToken>>,
scopes: &'static [&'static str],
mut stop_refreshing_notifyer_rx: br... | random | [
{
"content": "/// \"A\" -> 0\n\n/// \"Z\" -> 25\n\n/// \"AA\"-> 26\n\npub fn col_alphabet_to_num(n: &str) -> Result<usize> {\n\n let chars: Vec<char> = n.chars().into_iter().collect();\n\n let mut digit = chars.len();\n\n let mut result = 0usize;\n\n for each in chars {\n\n let num_at_digi... |
Rust | 2d-games/match-three/src/mgfw/ecs/entity.rs | Syn-Nine/rust-mini-games | b80fa60d524c8fb6749731cbc078a1a2526861ed | use super::*;
use crate::mgfw::log;
pub const ENTITY_SZ: usize = 256;
#[derive(Copy, Clone)]
pub struct EntityIdSpan {
pub first: usize,
pub last: usize,
}
struct Entity {
components: u32,
}
pub struct EntityRegistry {
data: *mut Entity,
cursor: usize,
span: EntityIdSpan,
}
#[allow(d... | use super::*;
use crate::mgfw::log;
pub const ENTITY_SZ: usize = 256;
#[derive(Copy, Clone)]
pub struct EntityIdSpan {
pub first: usize,
pub last: usize,
}
struct Entity {
components: u32,
}
pub struct EntityRegistry {
data: *mut Entity,
cursor: usize,
span: EntityIdSpan,
}
#[allow(d... |
}
}
fn get_data_ref_mut(&self, idx: usize) -> &mut Entity {
assert!(idx < ENTITY_SZ);
unsafe { &mut *(self.data.offset(idx as isize)) }
}
fn get_data_ref(&self, idx: usize) -> &Entity {
assert!(idx < ENTITY_SZ);
unsafe { &*(self.data.offset(idx as isize)) }
... | if self.has_component(idx, COMPONENT_ACTIVE) {
if idx < self.span.first {
self.span.first = idx;
}
if idx > self.span.last {
self.span.last = idx;
}
} | if_condition | [
{
"content": "// update the entities for the cursor\n\npub fn update_cursor_entities(cache: &mut GameData, world: &mut mgfw::ecs::World) {\n\n let mut j: usize = 0;\n\n let loc = get_cursor_location(cache);\n\n let cx: f32 = loc.0 as f32 * 16.0 + 8.0;\n\n let cy: f32 = loc.1 as f32 * 16.0 + 56.0;\n\... |
Rust | src/window/glutin.rs | jutuon/space-boss-battles | 407d3fa1f057ea0ce9b05b6f695349be1f3a141f |
use std::os::raw::c_void;
use glutin::{EventsLoop, GlContext, WindowBuilder, ContextBuilder, GlWindow, GlRequest, Api, VirtualKeyCode};
use input::{InputManager, Key, Input};
use renderer::{Renderer, DEFAULT_SCREEN_HEIGHT, DEFAULT_SCREEN_WIDTH};
use settings::Settings;
use gui::GUI;
use logic::Logic;
use utils::{Ti... |
use std::os::raw::c_void;
use glutin::{EventsLoop, GlContext, WindowBuilder, ContextBuilder, GlWindow, GlRequest, Api, VirtualKeyCode};
use input::{InputManager, Key, Input};
use renderer::{Renderer, DEFAULT_SCREEN_HEIGHT, DEFAULT_SCREEN_WIDTH};
use settings::Settings;
use gui::GUI;
use logic::Logic;
use utils::{Ti... |
}
WindowEvent::KeyboardInput {
input: KeyboardInput {
state: ElementState::Released,
virtual_keycode: Some(keycode),
..
... | if let Some(key) = virtual_keycode_to_key(keycode) {
input_manager.update_key_down(key, time_manager.current_time());
} | if_condition | [
{
"content": "/// Returns the value of boolean reference and sets\n\n/// references value to false.\n\nfn return_and_reset(value: &mut bool) -> bool {\n\n let original_value: bool = *value;\n\n *value = false;\n\n original_value\n\n}\n\n\n\nimpl Input for InputManager {\n\n fn up(&self) -> bool {... |
Rust | crates/fluvio-test/src/tests/longevity/mod.rs | bohlmannc/fluvio | b5a3105600b6886c55d76707d369fa59f5d9673b | pub mod producer;
pub mod consumer;
use core::panic;
use std::any::Any;
use std::num::ParseIntError;
use std::time::Duration;
use structopt::StructOpt;
use fluvio_test_derive::fluvio_test;
use fluvio_test_util::test_meta::environment::EnvironmentSetup;
use fluvio_test_util::test_meta::{TestOption, TestCase};
use fluv... | pub mod producer;
pub mod consumer;
use core::panic;
use std::any::Any;
use std::num::ParseIntError;
use std::time::Duration;
use structopt::StructOpt;
use fluvio_test_derive::fluvio_test;
use fluvio_test_util::test_meta::environment::EnvironmentSetup;
use fluvio_test_util::test_meta::{TestOption, TestCase};
use fluv... |
}
#[derive(Debug, Clone, StructOpt, Default, PartialEq)]
#[structopt(name = "Fluvio Longevity Test")]
pub struct LongevityTestOption {
#[structopt(long, parse(try_from_str = parse_seconds), default_value = "3600")]
runtime_seconds: Duration,
#[structopt(long, default_value = "1000")]... | e
.option
.as_any()
.downcast_ref::<LongevityTestOption>()
.expect("LongevityTestOption")
.to_owned();
LongevityTestCase {
environment: test_case.environment,
option: longevity_option,
}
} | function_block-function_prefixed | [
{
"content": "fn cluster_cleanup(option: EnvironmentSetup) {\n\n if option.cluster_delete() {\n\n let mut setup = TestCluster::new(option);\n\n\n\n let cluster_cleanup_wait = async_process!(async {\n\n setup.remove_cluster().await;\n\n });\n\n let _ = cluster_cleanup_wa... |
Rust | src/octez/node.rs | tzConnectBerlin/que-pasa | c79769fbe7aa8d0ef3e1d104bb45f68bf63a7c7d | use crate::octez::block::{Block, LevelMeta};
use anyhow::{anyhow, Context, Result};
use backoff::{retry, Error, ExponentialBackoff};
use chrono::{DateTime, Utc};
use curl::easy::Easy;
use serde::Deserialize;
use std::str::FromStr;
use std::time::Duration;
#[derive(Clone)]
pub struct NodeClient {
node_url: String,
... | use crate::octez::block::{Block, LevelMeta};
use anyhow::{anyhow, Context, Result};
use backoff::{retry, Error, ExponentialBackoff};
use chrono::{DateTime, Utc};
use curl::easy::Easy;
use serde::Deserialize;
use std::str::FromStr;
use std::time::Duration;
#[derive(Clone)]
pub struct NodeClient {
node_url: String,
... |
pub(crate) fn get_contract_storage_definition(
&self,
contract_id: &str,
level: Option<u32>,
) -> Result<serde_json::Value> {
let level = match level {
Some(x) => format!("{}", x),
None => "head".to_string(),
};
let (_, json) = self... | fn level_json_internal(&self, level: &str) -> Result<(LevelMeta, Block)> {
let (body, _) = self
.load_retry_on_nonjson(&format!("blocks/{}", level))
.with_context(|| {
format!("failed to get level_json for level={}", level)
})?;
let mut deserializer =... | function_block-full_function | [
{
"content": "fn is_implicit_active(level: u32, contract_address: &str) -> bool {\n\n // liquidity baking has 2 implicit contract creation events in the block prior to Granada's activation block\n\n level == LIQUIDITY_BAKING_LEVEL\n\n && (contract_address == LIQUIDITY_BAKING\n\n || contr... |
Rust | benches/custom_benches.rs | IzumiRaine/libdeflater | 3a90be5798fc9949e9a416efeaba4663ac7d4e25 | extern crate flate2;
extern crate libdeflater;
use std::io::prelude::*;
use std::fs;
use std::fs::{File};
use std::path::Path;
use criterion::{Criterion, black_box};
use flate2::{Compression, Compress, Decompress, FlushCompress, FlushDecompress};
use libdeflater::{Compressor, CompressionLvl, Decompressor};
struct F... | extern crate flate2;
extern crate libdeflater;
use std::io::prelude::*;
use std::fs;
use std::fs::{File};
use std::path::Path;
use crit | inish();
}
}
| erion::{Criterion, black_box};
use flate2::{Compression, Compress, Decompress, FlushCompress, FlushDecompress};
use libdeflater::{Compressor, CompressionLvl, Decompressor};
struct Flate2Encoder {
compress: Compress,
}
impl Flate2Encoder {
fn new() -> Flate2Encoder {
Flate2Encoder{ compress: Compress:... | random | [
{
"content": "#[test]\n\nfn test_use_crc32_convenience_method_returns_same_crc32_as_flate2() {\n\n // This assumes that flate2's crc32 implementation returns a\n\n // correct value, which is a pretty safe assumption.\n\n\n\n let input_data = read_fixture_content();\n\n\n\n let flate2_crc32 = {\n\n ... |
Rust | aoc13/src/main.rs | jadeaffenjaeger/rust_aoc19 | 4f3f4160377cbfdb76207ab942afc8306b201b2d | use intcomputer::*;
use display::*;
use std::env;
use std::fs;
use num_enum::TryFromPrimitive;
use std::convert::TryFrom;
const WIDTH: usize = 44;
const HEIGHT: usize = 20;
const SCALE: usize = 25;
#[derive(Debug, Clone, Copy, PartialEq, TryFromPrimitive)]
#[repr(i64)]
enum Tile {
Empty = 0,
Wall = 1,
B... | use intcomputer::*;
use display::*;
use std::env;
use std::fs;
use num_enum::TryFromPrimitive;
use std::convert::TryFrom;
const WIDTH: usize = 44;
const HEIGHT: usize = 20;
const SCALE: usize = 25;
#[derive(Debug, Clone, Copy, PartialEq, TryFromPrimitive)]
#[repr(i64)]
enum Tile {
Empty = 0,
Wall = 1,
B... |
pub fn left(&mut self) {
self.computer.input.push_back(-1);
}
pub fn right(&mut self) {
self.computer.input.push_back(1);
}
pub fn neutral(&mut self) {
self.computer.input.push_back(0);
}
pub fn consume_output(&mut self) {
while self.computer.output.len()... | p {
self.computer.run();
match self.computer.state {
ProgramState::Finished => break,
ProgramState::Running => continue,
ProgramState::WaitingForInput => {
self.consume_output();
break;
}
... | function_block-function_prefixed | [
{
"content": "fn combine_layers(layer: &[u32], image: &mut [u32]) {\n\n let combine_pixels = |top, bottom| match top {\n\n 2 => bottom,\n\n _ => top,\n\n };\n\n\n\n for (p1, p2) in image.iter_mut().zip(layer.iter()) {\n\n *p1 = combine_pixels(*p1, *p2);\n\n }\n\n}\n\n\n",
"f... |
Rust | textures/src/imagemap.rs | hackmad/pbr_rust | b7ae75564bf71c4dfea8b20f49d05ac1b89e6734 |
use super::*;
use core::geometry::*;
use core::interaction::*;
use core::mipmap::*;
use core::pbrt::*;
use core::spectrum::*;
use std::ops::{Add, AddAssign, Div, DivAssign, Mul, MulAssign};
#[derive(Clone)]
pub struct ImageTexture<Tmemory>
where
Tmemory: Copy
+ Default
+ Mul<Float, Output = Tmemo... |
use super::*;
use core::geometry::*;
use core::interaction::*;
use core::mipmap::*;
use core::pbrt::*;
use core::spectrum::*;
use std::ops::{Add, AddAssign, Div, DivAssign, Mul, MulAssign};
#[derive(Clone)]
pub struct ImageTexture<Tmemory>
where
Tmemory: Copy
+ Default
+ Mul<Float, Output = Tmemo... |
let mem = self.mipmap.lookup(&st, &dstdx, &dstdy);
let rgb = mem.to_rgb();
Spectrum::from_rgb(&rgb, None)
}
}
impl Texture<Float> for ImageTexture<Float> {
fn evaluate(&self, hit: &Hit, uv: &Point2f, der: &Derivatives) -> Float {
let... | let TextureMap2DResult {
p: st,
dstdx,
dstdy,
} = self.mapping.map(hit, uv, der); | assignment_statement | [] |
Rust | imxrt1062-pac/imxrt1062-ocotp/src/crc_addr.rs | Shock-1/teensy4-rs | effc3b290f1be3c7aef62a78e82dbfbc27aa6370 | #[doc = "Reader of register CRC_ADDR"]
pub type R = crate::R<u32, super::CRC_ADDR>;
#[doc = "Writer for register CRC_ADDR"]
pub type W = crate::W<u32, super::CRC_ADDR>;
#[doc = "Register CRC_ADDR `reset()`'s with value 0"]
impl crate::ResetValue for super::CRC_ADDR {
type Type = u32;
#[inline(always)]
fn re... | #[doc = "Reader of register CRC_ADDR"]
pub type R = crate::R<u32, super::CRC_ADDR>;
#[doc = "Writer for register CRC_ADDR"]
pub type W = crate::W<u32, super::CRC_ADDR>;
#[doc = "Register CRC_ADDR `reset()`'s with value 0"]
impl crate::ResetValue for super::CRC_ADDR {
type Type = u32;
#[inline(always)]
fn re... | {
OTPMK_CRC_R::new(((self.bits >> 24) & 0x01) != 0)
}
#[doc = "Bits 25:31 - RSVD0"]
#[inline(always)]
pub fn rsvd0(&self) -> RSVD0_R {
RSVD0_R::new(((self.bits >> 25) & 0x7f) as u8)
}
}
impl W {
#[doc = "Bits 0:7 - DATA_START_ADDR"]
#[inline(always)]
pub fn data_start_add... | field `CRC_ADDR`"]
pub type CRC_ADDR_R = crate::R<u8, u8>;
#[doc = "Write proxy for field `CRC_ADDR`"]
pub struct CRC_ADDR_W<'a> {
w: &'a mut W,
}
impl<'a> CRC_ADDR_W<'a> {
#[doc = r"Writes raw bits to the field"]
#[inline(always)]
pub unsafe fn bits(self, value: u8) -> &'a mut W {
self.w.bits =... | random | [] |
Rust | src/transaction.rs | tiagolobocastro/heath | 4faedf8f37acba0ac183273cfc0cd00286526ded | use crate::{
client::ClientId,
csv::transaction::{TransactionId, TransactionLogCsv, TransactionType},
transactions::TransactionInfo,
};
use serde::{Deserialize, Serialize};
impl TransactionInfo for TransactionLog {
fn transaction_type(&self) -> TransactionType {
match self {
Self::D... | use crate::{
client::ClientId,
csv::transaction::{TransactionId, TransactionLogCsv, TransactionType},
transactions::TransactionInfo,
};
use serde::{Deserialize, Serialize};
impl TransactionInfo for TransactionLog {
fn transaction_type(&self) -> TransactionType {
match self {
Self::D... |
match tx.transaction_type() {
TransactionType::Deposit => Self::Deposit {
common,
amount: tx.amount().expect("Deposit should contain the amount"),
},
TransactionType::Withdrawal => Self::Withdrawal {
common,
amo... | let common = TransactionLogCommon {
client_id: tx.client_id(),
tx_id: tx.transaction_id(),
}; | assignment_statement | [
{
"content": " account: BankAccount,\n\n disputed_tx: Option<TransactionLog>,\n\n}\n\nimpl Dispute {\n\n pub(crate) fn new(account: BankAccount, disputed_tx: Option<TransactionLog>) -> Self {\n\n Self {\n\n account,\n\n disputed_tx,\n\n }\n\n }\n\n}\n\nimpl Transa... |
Rust | src/terminal/winapi_terminal.rs | Rukenshia/crossterm | caa7579ef6102f966a7436f55c2dfda2e30efb5a |
use {Construct};
use cursor::cursor;
use super::{ClearType, ITerminal};
use winapi::um::wincon::{SMALL_RECT, COORD, CONSOLE_SCREEN_BUFFER_INFO,};
use kernel::windows_kernel::{kernel, terminal};
pub struct WinApiTerminal;
impl Construct for WinApiTerminal {
fn new() -> Box<WinApiTerminal> {
Box::from(Win... |
use {Construct};
use cursor::cursor;
use super::{ClearType, ITerminal};
use winapi::um::wincon::{SMALL_RECT, COORD, CONSOLE_SCREEN_BUFFER_INFO,};
use kernel::windows_kernel::{kernel, terminal};
pub struct WinApiTerminal;
impl Construct for WinApiTerminal {
fn new() -> Box<WinApiTerminal> {
Box::from(Win... |
pub fn clear_entire_screen(csbi: CONSOLE_SCREEN_BUFFER_INFO) {
let x = 0;
let y = 0;
let start_location = COORD { X: x as i16, Y: y as i16};
let cells_to_write = csbi.dwSize.X as u32 * csbi.dwSize.Y as u32;
clear( start_location, cells_to_write);
cursor().goto(0,... | pub fn clear_before_cursor(pos: (u16,u16), csbi: CONSOLE_SCREEN_BUFFER_INFO) {
let (xpos,ypos) = pos;
let x = 0;
let y = 0;
let start_location = COORD { X: x as i16, Y: y as i16};
let cells_to_write = (csbi.dwSize.X as u32 * ypos as u32) + (xpos as u32 + 1);
clear(start... | function_block-full_function | [
{
"content": "pub fn set_console_screen_buffer_size( size: COORD) -> bool\n\n{\n\n let output_handle = get_output_handle();\n\n\n\n unsafe\n\n {\n\n let success = SetConsoleScreenBufferSize(output_handle, size);\n\n is_true(success)\n\n }\n\n}\n\n\n",
"file_path": ... |
Rust | src/skelly.rs | lain-dono/skelly | f161e4d3641c22fb764936bf441dac8434c3f9d1 | use na::{Isometry3, Point3, RealField, Scalar, Translation3, UnitQuaternion};
pub struct Skelly<T: Scalar, D = ()> {
bones: Vec<Bone<T, D>>,
}
struct Bone<T: Scalar, D> {
isometry: Isometry3<T>,
parent: Option<usize>,
userdata: D,
}
impl<T> Skelly<T>
where
T: Scalar,
{
pub fn add_ro... | use na::{Isometry3, Point3, RealField, Scalar, Translation3, UnitQuaternion};
pub struct Skelly<T: Scalar, D = ()> {
bones: Vec<Bone<T, D>>,
}
struct Bone<T: Scalar, D> {
isometry: Isometry3<T>,
parent: Option<usize>,
userdata: D,
}
impl<T> Skelly<T>
where
T: Scalar,
{
pub fn add_ro... | mut self, bone: usize) -> &mut D {
&mut self.bones[bone].userdata
}
pub fn get_parent(&self, bone: usize) -> Option<usize> {
self.bones[bone].parent
}
pub fn len(&self) -> usize {
self.bones.len()
}
pub fn write_globals(&self, globals: &mut [Isometry3<T>... | ttach(&mut self, relative_position: Point3<T>, parent: usize) -> usize
where
T: RealField,
{
self.attach_with(relative_position, parent, ())
}
}
impl<T, D> Skelly<T, D>
where
T: Scalar,
{
pub fn new() -> Self {
Skelly { bones: Vec::new() }
}
pub fn ad... | random | [
{
"content": "fn enque<T>(queue: &mut Vec<QueueItem<T>>, bone: usize, tip: Point3<T>, goal: Point3<T>)\n\nwhere\n\n T: Scalar,\n\n{\n\n let index = queue\n\n .binary_search_by(|item| item.bone.cmp(&bone))\n\n .unwrap_or_else(|x| x);\n\n\n\n queue.insert(index, QueueItem { bone, tip, goal ... |
Rust | benches/spmc_mt_read_write_bench.rs | tower120/lockless_event_queue | aa55039161736c88b103a520f83ce8f8ab66288f | use rc_event_queue::spmc::{EventQueue, EventReader, Settings};
use criterion::{Criterion, black_box, criterion_main, criterion_group, BenchmarkId};
use std::time::{Duration, Instant};
use std::thread;
use std::sync::Arc;
use std::sync::atomic::{AtomicBool, Ordering};
use std::pin::Pin;
use rc_event_queue::{CleanupMode,... | use rc_event_queue::spmc::{EventQueue, EventReader, Settings};
use criterion::{Criterion, black_box, criterion_main, criterion_group, BenchmarkId};
use std::time::{Duration, Instant};
use std::thread;
use std::sync::Arc;
use std::sync::atomic::{AtomicBool, Ordering};
use std::pin::Pin;
use rc_event_queue::{CleanupMode,... | let thread = Box::new(thread::spawn(move || {
let mut local_sum0: usize = 0;
loop{
let stop = readers_stop.load(Ordering::Acquire);
let mut iter = reader.iter();
while let Some(i) = iter.next()... | + Send + 'static + Clone
{
let mut total = Duration::ZERO;
let readers_thread_count = 4;
for _ in 0..iters {
let mut event = Event::new();
let mut readers = Vec::new();
for _ in 0..readers_thread_count{
readers.push(EventReader::new(&mut event));
}
... | function_block-random_span | [
{
"content": "/// We test high-contention read-write case.\n\nfn bench_event_read_write<F>(iters: u64, writer_fn: F) -> Duration\n\n where F: Fn(&ArcEvent, usize, usize) -> () + Send + 'static + Clone\n\n{\n\n let mut total = Duration::ZERO;\n\n\n\n let writers_thread_count = 2;\n\n let readers_thre... |
Rust | eval/src/values/mod.rs | slowli/arithmetic-parser | 3e01a6069ddea36740126c40386deea0b6dfaee7 |
use hashbrown::HashMap;
use core::{
any::{type_name, Any},
fmt,
};
use crate::{
alloc::{vec, Rc, String, Vec},
fns,
};
use arithmetic_parser::{MaybeSpanned, StripCode};
mod env;
mod function;
mod ops;
mod variable_map;
pub use self::{
env::Environment,
function::{CallContext, Function, Int... |
use hashbrown::HashMap;
use core::{
any::{type_name, Any},
fmt,
};
use crate::{
alloc::{vec, Rc, String, Vec},
fns,
};
use arithmetic_parser::{MaybeSpanned, StripCode};
mod env;
mod function;
mod ops;
mod variable_map;
pub use self::{
env::Environment,
function::{CallContext, Function, Int... | his == other,
_ => false,
}
}
}
impl<T: fmt::Display> fmt::Display for Value<'_, T> {
fn fmt(&self, formatter: &mut fmt::Formatter<'_>) -> fmt::Result {
match self {
Self::Prim(value) => fmt::Display::fmt(value, formatter),
Self::Bool(true) => formatter.write... | other,
(Self::Tuple(this), Self::Tuple(other)) => this == other,
(Self::Object(this), Self::Object(other)) => this == other,
(Self::Function(this), Self::Function(other)) => this.is_same_function(other),
(Self::Ref(this), Self::Ref(other)) => t | function_block-random_span | [
{
"content": "/// Default implementation of [`VisitMut::visit_function_mut()`].\n\npub fn visit_function_mut<Prim, V>(visitor: &mut V, function: &mut Function<Prim>)\n\nwhere\n\n Prim: PrimitiveType,\n\n V: VisitMut<Prim> + ?Sized,\n\n{\n\n visitor.visit_tuple_mut(&mut function.args);\n\n visitor.vi... |
Rust | starlark/src/syntax/validate.rs | creativemindplus/starlark-rust | 4fc26687df9a975eeb26f6b3d6f995d188fd00ba | /*
* Copyright 2018 The Starlark in Rust Authors.
* Copyright (c) Facebook, Inc. and its affiliates.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* https://www.apache.org/lic... | /*
* Copyright 2018 The Starlark in Rust Authors.
* Copyright (c) Facebook, Inc. and its affiliates.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* https://www.apache.org/lic... |
pub fn check_assign(codemap: &CodeMap, x: AstExpr) -> anyhow::Result<AstAssign> {
Ok(Spanned {
span: x.span,
node: match x.node {
Expr::Tuple(xs) | Expr::List(xs) => {
Assign::Tuple(xs.into_try_map(|x| Self::check_assign(codemap, x))?)
... | pub fn check_def(
name: AstString,
parameters: Vec<AstParameter>,
return_type: Option<Box<AstExpr>>,
stmts: AstStmt,
codemap: &CodeMap,
) -> anyhow::Result<Stmt> {
check_parameters(¶meters, codemap)?;
let name = name.into_map(|s| AssignIdentP(s, ()));
... | function_block-full_function | [
{
"content": "fn require_return_expression(ret_type: &Option<Box<AstExpr>>) -> Option<Span> {\n\n match ret_type {\n\n None => None,\n\n Some(x) => match &***x {\n\n Expr::Identifier(x, _) if x.node == \"None\" => None,\n\n _ => Some(x.span),\n\n },\n\n }\n\n}\n\... |
Rust | src/utils.rs | rustbunker/youki | 2f3d8062ec006057e04b13c6697ebabf7cd5f9bd |
use std::env;
use std::ffi::CString;
use std::fs;
use std::ops::Deref;
use std::path::{Path, PathBuf};
use std::time::Duration;
use anyhow::Context;
use anyhow::{bail, Result};
use nix::unistd;
pub trait PathBufExt {
fn as_in_container(&self) -> Result<PathBuf>;
fn join_absolute_path(&self, p: &Path) -> Res... |
use std::env;
use std::ffi::CString;
use std::fs;
use std::ops::Deref;
use std::path::{Path, PathBuf};
use std::time::Duration;
use anyhow::Context;
use anyhow::{bail, Result};
use nix::unistd;
pub trait PathBufExt {
fn as_in_container(&self) -> Result<PathBuf>;
fn join_absolute_path(&self, p: &Path) -> Res... |
.unwrap(),
PathBuf::from("sample/a/b")
);
}
#[test]
fn test_join_absolute_path_error() {
assert_eq!(
PathBuf::from("sample/a/")
.join_absolute_path(&PathBuf::from("b/c"))
.is_err(),
true
);
}
... | iner(&self) -> Result<PathBuf> {
if self.is_relative() {
bail!("Relative path cannot be converted to the path in the container.")
} else {
let path_string = self.to_string_lossy().into_owned();
Ok(PathBuf::from(path_string[1..].to_string()))
}
}
fn jo... | random | [
{
"content": "#[inline]\n\npub fn write_cgroup_file_str<P: AsRef<Path>>(path: P, data: &str) -> Result<()> {\n\n fs::OpenOptions::new()\n\n .create(false)\n\n .write(true)\n\n .truncate(false)\n\n .open(path.as_ref())\n\n .with_context(|| format!(\"failed to open {:?}\", pa... |
Rust | cli/src/command/export/export.rs | bennyboer/worklog | bce3c3954c3a14cca7c029caf2641ec1f5af4478 | use crate::command::command::Command;
use crate::command::list;
use cmd_args::{arg, option, Group};
use persistence::calc::event::EventType;
use persistence::calc::WorkItem;
use std::collections::HashMap;
use std::fs;
pub struct ExportCommand {}
impl Command for ExportCommand {
fn build(&self) -> Group {
... | use crate::command::command::Command;
use crate::command::list;
use cmd_args::{arg, option, Group};
use persistence::calc::event::EventType;
use persistence::calc::WorkItem;
use std::collections::HashMap;
use std::fs;
pub struct ExportCommand {}
impl Command for ExportCommand {
fn build(&self) -> Group {
... | ::time::format_duration((total_work_time_ms / 1000) as u32)
};
let start_time =
shared::time::get_local_date_time(find_earliest_work_item(&items).created_timestamp())
.format("%H:%M")
.to_string();
let end_time =
shared::time::get_local_date_time(find_latest_work_item... | ) -> Option<Vec<&str>> {
None
}
fn name(&self) -> &str {
"export"
}
}
fn execute(args: &Vec<arg::Value>, options: &HashMap<&str, option::Value>) {
let export_type = args[0].str().unwrap();
if export_type.trim().to_lowercase() == "markdown" {
export_to_markdown(
... | random | [
{
"content": "/// Execute the log command.\n\nfn execute(args: &Vec<arg::Value>, _options: &HashMap<&str, option::Value>) {\n\n let description = args[0].str().unwrap();\n\n let tags_str = args[1].str().unwrap();\n\n let time_taken_str = args[2].str().unwrap();\n\n\n\n let tags: Vec<String> = tags_s... |
Rust | src/client/general.rs | stuck-overflow/obws | 6b71ed39bfacb66bbb3050b300e97ac2be2efa44 | use serde::Serialize;
use super::Client;
use crate::requests::{KeyModifier, Projector, ProjectorInternal, QtGeometry, RequestType};
use crate::responses;
use crate::{Error, Result};
pub struct General<'a> {
pub(super) client: &'a Client,
}
impl<'a> General<'a> {
pub async fn get_version(&self) -> Result... | use serde::Serialize;
use super::Client;
use crate::requests::{KeyModifier, Projector, ProjectorInternal, QtGeometry, RequestType};
use crate::responses;
use crate::{Error, Result};
pub struct General<'a> {
pub(super) client: &'a Client,
}
impl<'a> General<'a> {
pub async fn get_version(&self) -> Result... |
pub async fn broadcast_custom_message<T>(&self, realm: &str, data: &T) -> Result<()>
where
T: Serialize,
{
self.client
.send_message(RequestType::BroadcastCustomMessage {
realm,
data: &serde_json::to_value(data).map_err(Error:... | pub async fn get_stats(&self) -> Result<responses::ObsStats> {
self.client
.send_message::<responses::Stats>(RequestType::GetStats)
.await
.map(|s| s.stats)
} | function_block-full_function | [
{
"content": "pub fn duration_millis<'de, D>(deserializer: D) -> Result<Duration, D::Error>\n\nwhere\n\n D: Deserializer<'de>,\n\n{\n\n deserializer.deserialize_i64(DurationMillisVisitor)\n\n}\n\n\n",
"file_path": "src/de.rs",
"rank": 0,
"score": 109560.20084211772
},
{
"content": "pub... |
Rust | src/liboak/back/context.rs | ptal/oak | 667c625096540600b6c6ac0943126ca092a9f80e |
pub use back::continuation::*;
use back::name_factory::*;
use back::compiler::ExprCompilerFn;
use back::compiler::rtype::*;
use back::compiler::{recognizer_compiler, parser_compiler};
use back::compiler::value::*;
use quote::quote;
use syn::parse_quote;
pub struct Context<'a>
{
grammar: &'a TGrammar,
closures: ... |
pub use back::continuation::*;
use back::name_factory::*;
use back::compiler::ExprCompilerFn;
use back::compiler::rtype::*;
use back::compiler::{recognizer_compiler, parser_compiler};
use back::compiler::value::*;
use quote::quote;
use syn::parse_quote;
pub struct Context<'a>
{
grammar: &'a TGrammar,
closures: ... |
pub fn do_not_duplicate_success(&self) -> bool {
self.num_combinators_compiled > 0
}
pub fn success_as_closure(&mut self, continuation: Continuation) -> Continuation {
if self.do_not_duplicate_success() {
self.num_combinators_compiled = 0;
let closure_name = self.name_factory.next_closure_n... | self.push_mut_ref_fv(result_var.clone(), value_ty);
let result_value = tuple_value(self.free_variables());
let body =
Continuation::new(
value_constructor(result_var.clone(), result_value),
parse_quote!(state.failure())
)
.compile_success(self, parser_compiler, expr_idx)
... | function_block-function_prefix_line | [
{
"content": "pub fn recognizer_compiler(grammar: &TGrammar, idx: usize) -> Box<dyn CompileExpr> {\n\n match grammar.expr_by_index(idx) {\n\n StrLiteral(lit) => Box::new(StrLiteralCompiler::recognizer(lit)),\n\n CharacterClass(classes) => Box::new(CharacterClassCompiler::recognizer(classes)),\n\n AnyS... |
Rust | dpx/src/dpx_dpxconf.rs | mulimoen/tectonic | bea4516e2c7b253bc92dbd0b744a233635db7b0b | /* This is dvipdfmx, an eXtended version of dvipdfm by Mark A. Wicks.
Copyright (C) 2002-2016 by Jin-Hwan Cho and Shunsaku Hirata,
the dvipdfmx project team.
Copyright (C) 1998, 1999 by Mark A. Wicks <mwicks@kettering.edu>
This program is free software; you can redistribute it and/or modify
it un... | /* This is dvipdfmx, an eXtended version of dvipdfm by Mark A. Wicks.
Copyright (C) 2002-2016 by Jin-Hwan Cho and Shunsaku Hirata,
the dvipdfmx project team.
Copyright (C) 1998, 1999 by Mark A. Wicks <mwicks@kettering.edu>
This program is free software; you can redistribute it and/or modify
it un... | .is_null()
{
if streq_ptr(ppformat, (*ppinfo).name) {
break;
}
ppinfo = if !ppinfo.offset(1).is_null() && !(*ppinfo.offset(1)).name.is_null() {
ppinfo.offset(1)
} else {
0 as *const paper
}
}
return if !ppinfo.is_null()
... | *const i8,
pswidth: 595.276f64,
psheight: 841.890f64,
};
init
},
{
let mut init = paper {
name: b"a3\x00" as *const u8 as *const i8,
pswidth: 841.890f64,
psheight: 1190.550f64,
};
init
},
{
let mu... | random | [
{
"content": "pub fn hex_to_bytes(text: &str, dest: &mut [u8]) -> Result<()> {\n\n let n = dest.len();\n\n let text_len = text.len();\n\n\n\n if text_len != 2 * n {\n\n return Err(ErrorKind::BadLength(2 * n, text_len).into());\n\n }\n\n\n\n for i in 0..n {\n\n dest[i] = u8::from_str... |
Rust | src/nal/sei/buffering_period.rs | fkaa/h264-reader | 24bc61f62599ee3d3fe4df7f725a00002ac8d484 | use super::SeiCompletePayloadReader;
use std::marker;
use crate::nal::{sps, pps};
use crate::rbsp::RbspBitReader;
use crate::Context;
use crate::nal::sei::HeaderType;
use crate::rbsp::RbspBitReaderError;
use log::*;
#[derive(Debug)]
enum BufferingPeriodError {
ReaderError(RbspBitReaderError),
UndefinedSeqParam... | use super::SeiCompletePayloadReader;
use std::marker;
use crate::nal::{sps, pps};
use crate::rbsp::RbspBitReader;
use crate::Context;
use crate::nal::sei::HeaderType;
use crate::rbsp::RbspBitReaderError;
use log::*;
#[derive(Debug)]
enum BufferingPeriodError {
ReaderError(RbspBitReaderError),
UndefinedSeqParam... |
}
}
#[cfg(test)]
mod test {
use hex_literal::hex;
use super::*;
#[test]
fn parse() {
let mut ctx = Context::default();
let sps_rbsp = hex!("
4d 60 15 8d 8d 28 58 9d 08 00 00 0f a0 00 07 53
07 00 00 00 92 7c 00 00 12 4f 80 fb dc 18 00 00
... | match BufferingPeriod::read(ctx, buf) {
Err(e) => error!("Failure reading buffering_period: {:?}", e),
Ok(buffering_period) => {
info!("TODO: expose buffering_period {:#?}", buffering_period);
}
} | if_condition | [
{
"content": "fn count_zero_bits<R: BitRead>(r: &mut R, name: &'static str) -> Result<u8, RbspBitReaderError> {\n\n let mut count = 0;\n\n while !r.read_bit()? {\n\n count += 1;\n\n if count > 31 {\n\n return Err(RbspBitReaderError::ExpGolombTooLarge(name));\n\n }\n\n }\... |
Rust | src/main.rs | gfarrell/netctl-tray | 58b7ad1684bc9f949839fb2dd08cd9ef2ad0bc74 | #![feature(exclusive_range_pattern)]
mod state;
use notify_rust::{Notification, Timeout};
use qt_gui::QIcon;
use qt_widgets::cpp_utils::{CppBox, MutPtr};
use qt_widgets::qt_core::{QString, QTimer, Slot};
use qt_widgets::{QActionGroup, QApplication, QMenu, QSystemTrayIcon, SlotOfActivationReason};
use state::{inotify_... | #![feature(exclusive_range_pattern)]
mod state;
use notify_rust::{Notification, Timeout};
use qt_gui::QIcon;
use qt_widgets::cpp_utils::{CppBox, MutPtr};
use qt_widgets::qt_core::{QString, QTimer, Slot};
use qt_widgets::{QActionGroup, QApplication, QMenu, QSystemTrayIcon, SlotOfActivationReason};
use state::{inotify_... |
fn profile_notification(
state: &mut State,
old_active_profile: Option<String>,
) -> Result<(), notify_rust::error::Error> {
let text = match (&old_active_profile, &state.active_profile) {
(None, Some(new)) => {
format!("Profile <b>{}</b> started.", new)
}
... | unsafe fn gen_profile_submenu(
state_ptr: *mut State,
mut profiles_submenu: MutPtr<QMenu>,
profile_actions_group: &mut CppBox<QActionGroup>,
click: &Slot,
) {
profiles_submenu.clear();
for profile in &(*(*state_ptr).all_profiles.lock().unwrap()) {
let mut item =
profiles_subm... | function_block-full_function | [
{
"content": "// Updates the netctl-tray state: ping, quality and current active profile\n\npub fn update_state(state: &mut State, args: &Opt) -> Result<(), std::io::Error> {\n\n // get the current active profile\n\n #[cfg(not(feature = \"auto\"))]\n\n let raw_profiles = Command::new(\"netctl\").arg(\"... |
Rust | examples/rpg_engine/src/character.rs | arn-the-long-beard/ntnu_rust_lecture | 1c7d6aba84e9e5ea99f18a5e46a11a674a08aa34 | use crate::dice::SkillDice;
use crate::item::Weapon;
use crate::item::*;
use crate::stuff::{Stuff, StuffConfig};
use colored::*;
#[derive(Clone)]
pub struct Character {
name: String,
health: f32,
max_health: f32,
stuff: Stuff,
}
#[allow(unused)]
impl Character {
pub fn name(&self) -> &str {
... | use crate::dice::SkillDice;
use crate::item::Weapon;
use crate::item::*;
use crate::stuff::{Stuff, StuffConfig};
use colored::*;
#[derive(Clone)]
pub struct Character {
name: String,
health: f32,
max_health: f32,
stuff: Stuff,
}
#[allow(unused)]
impl Character {
pub fn name(&self) -> &str {
... |
fn update_health_from_taken_damage(&mut self, damages: &RawDamages) {
self.health -= *damages;
if self.health < 0.0 {
self.health = 0.0
}
}
#[deprecated]
pub fn get_attacked_by(&mut self, damages: RawDamages, attack_dice: u8, def_dice: Option<u8>) {
... | elf, raw_damages: RawDamages) -> RawDamages {
let mut damage_taken = raw_damages - self.get_armor();
if damage_taken < 0.0 {
damage_taken = raw_damages * 0.1;
}
self.update_health_from_taken_damage(&damage_taken);
damage_taken
} | function_block-function_prefixed | [
{
"content": "pub fn roll_dice(actor: &str, dices: &str, action: &str) -> i64 {\n\n let result = Roller::new(&format!(\"{} : {} \", dices, action))\n\n .unwrap()\n\n .roll()\n\n .unwrap();\n\n println!(\n\n \"{} rolls {} for {} \",\n\n actor.bold(),\n\n dices.unde... |
Rust | src/bin/roughenough-kms.rs | lachesis/roughenough | a5e29a47646cc57bdd8e3603818cc9bd46f81bfc |
#[macro_use]
extern crate log;
use clap::{App, Arg};
use data_encoding::{Encoding, HEXLOWER_PERMISSIVE};
use log::LevelFilter;
use simple_logger::SimpleLogger;
#[allow(unused_imports)]
use roughenough::kms::{EnvelopeEncryption, KmsProvider};
use roughenough::roughenough_version;
const HEX: Encoding = HEXLOWER_PERM... |
#[macro_use]
extern crate log;
use clap::{App, Arg};
use data_encoding::{Encoding, HEXLOWER_PERMISSIVE};
use log::LevelFilter;
use simple_logger::SimpleLogger;
#[allow(unused_imports)]
use roughenough::kms::{EnvelopeEncryption, KmsProvider};
use roughenough::roughenough_version;
const HEX: Encoding = HEXLOWER_PERM... |
let kms_key = matches.value_of("KEY_ID").expect("Invalid KMS key id");
if matches.is_present("SEED") {
let hex_seed = matches.value_of("SEED").expect("Invalid seed value");
encrypt_seed(kms_key, hex_seed);
} else if matches.is_present("DECRYPT") {
let hex_blob = matches.value_of("... | let matches = App::new("roughenough-kms")
.version(roughenough_version().as_ref())
.long_about("Encrypt and decrypt Roughenough long-term server seeds using a KMS")
.arg(
Arg::with_name("KEY_ID")
.short("k")
.long("kms-key")
.takes_valu... | assignment_statement | [
{
"content": "/// Factory function to create a `ServerConfig` _trait object_ based on the value\n\n/// of the provided `arg`.\n\n///\n\n/// * `ENV` will return an [`EnvironmentConfig`](struct.EnvironmentConfig.html)\n\n/// * any other value returns a [`FileConfig`](struct.FileConfig.html)\n\n///\n\npub fn m... |
Rust | src/read/elf/hash.rs | sunfishcode/object | aaf312e51fc6e4511e19a32c05d4b2ddf248b5b6 | use core::mem;
use crate::elf;
use crate::read::{ReadError, ReadRef, Result};
use crate::{U32, U64};
use super::{FileHeader, Sym, SymbolTable, Version, VersionTable};
#[derive(Debug)]
pub struct HashTable<'data, Elf: FileHeader> {
buckets: &'data [U32<Elf::Endian>],
chains: &'data [U32<Elf::Endian>],
}
impl... | use core::mem;
use crate::elf;
use crate::read::{ReadError, ReadRef, Result};
use crate::{U32, U64};
use super::{FileHeader, Sym, SymbolTable, Version, VersionTable};
#[derive(Debug)]
pub struct HashTable<'data, Elf: FileHeader> {
buckets: &'data [U32<Elf::Endian>],
chains: &'data [U32<Elf::Endian>],
}
impl... | l);
}
}
None
}
pub fn find<R: ReadRef<'data>>(
&self,
endian: Elf::Endian,
name: &[u8],
hash: u32,
version: Option<&Version>,
symbols: &SymbolTable<'data, Elf, R>,
versions: &VersionTable<'data, Elf>,
) -> Option<(usi... | bucket {
max_symbol = bucket;
}
}
for value in self
.values
.get(max_symbol.checked_sub(self.symbol_base)? as usize..)?
{
max_symbol += 1;
if value.get(endian) & 1 != 0 {
return Some(max_symbo | function_block-random_span | [
{
"content": "/// Calculate the GNU hash for a symbol name.\n\n///\n\n/// Used for `SHT_GNU_HASH`.\n\npub fn gnu_hash(name: &[u8]) -> u32 {\n\n let mut hash = 5381u32;\n\n for byte in name {\n\n hash = hash.wrapping_mul(33).wrapping_add(u32::from(*byte));\n\n }\n\n hash\n\n}\n\n\n\n// Motorol... |
Rust | gstreamer/src/buffer_pool.rs | heftig/gstreamer-rs | 03c3580c224a10c86e89b34380215a551e1f7bff |
use BufferPool;
use Structure;
use glib;
use glib::translate::{from_glib, from_glib_full, from_glib_none, ToGlib, ToGlibPtr, ToGlibPtrMut};
use glib::IsA;
use ffi;
use std::mem;
use std::ops;
use std::ptr;
#[derive(Debug, PartialEq, Eq)]
pub struct BufferPoolConfig(Structure);
impl ops::Deref for BufferPoolConfi... |
use BufferPool;
use Structure;
use glib;
use glib::translate::{from_glib, from_glib_full, from_glib_none, ToGlib, ToGlibPtr, ToGlibPtrMut};
use glib::IsA;
use ffi;
use std::mem;
use std::ops;
use std::ptr;
#[derive(Debug, PartialEq, Eq)]
pub struct BufferPoolConfig(Structure);
impl ops::Deref for BufferPoolConfi... |
fn release_buffer(&self, buffer: ::Buffer) {
unsafe {
ffi::gst_buffer_pool_release_buffer(self.to_glib_none().0, buffer.into_ptr());
}
}
}
#[cfg(test)]
mod tests {
use super::*;
use prelude::*;
#[test]
fn test_pool() {
::init().unwrap();
let pool ... | fn acquire_buffer<'a, P: Into<Option<&'a BufferPoolAcquireParams>>>(
&self,
params: P,
) -> Result<::Buffer, ::FlowReturn> {
let params = params.into();
let params_ptr = match params {
Some(params) => ¶ms.0 as *const _ as *mut _,
None => ptr::null_mut(),
... | function_block-full_function | [
{
"content": "pub fn type_find_helper<P: IsA<gst::Pad>>(src: &P, size: u64) -> Option<gst::Caps> {\n\n assert_initialized_main_thread!();\n\n unsafe {\n\n from_glib_full(ffi::gst_type_find_helper(src.to_glib_none().0, size))\n\n }\n\n}\n\n\n",
"file_path": "gstreamer-base/src/auto/functions.... |
Rust | src/io/obj.rs | cpheinrich/web-geo-viewer | e835b0667e57697e0b8005c08c9dcd36222811ee | /*
Copyright 2020 Martin Buck
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation the
rights to use, copy, modify, merge, publish, distribute, sublice... | /*
Copyright 2020 Martin Buck
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation the
rights to use, copy, modify, merge, publish, distribute, sublice... | }
}
}
}
Ok(())
}
pub fn load_obj_points<IP, P, R>(read: &mut R, ip: &mut IP) -> ObjResult<()>
where
IP: IsPushable<P>,
P: IsBuildable3D,
R: BufRead,
{
let mut line_buffer = Vec::new();
let mut i_line = 0;
while let Ok(line) = fetch_line(read, &mut line_buffer) ... |
if let Some(d) = maybe_d {
let face = Face3 {
a: VId { val: a - 1 },
b: VId { val: c - 1 },
c: VId { val: d - 1 },
};
materi... | random | [
{
"content": "/// Loads an IsMesh3D from the off file format\n\npub fn load_off_mesh<EM, P, R>(read: &mut R, mesh: &mut EM) -> OffResult<()>\n\nwhere\n\n EM: IsFaceEditableMesh<P, Face3> + IsVertexEditableMesh<P, Face3>,\n\n P: IsBuildable3D + Clone,\n\n R: BufRead,\n\n{\n\n let mut line_buffer = Ve... |
Rust | step09/src/virtio.rs | 13696652781/RSCV | f07db4aad2a5758ceae92fd41cd6e8520d117ace |
use crate::bus::*;
use crate::cpu::*;
use crate::trap::*;
pub const VIRTIO_IRQ: u64 = 1;
const VRING_DESC_SIZE: u64 = 16;
const DESC_NUM: u64 = 8;
pub const VIRTIO_MAGIC: u64 = VIRTIO_BASE + 0x000;
pub const VIRTIO_VERSION: u64 = VIRTIO_BASE + 0x004;
pub const VIRTIO_DEVICE_ID: u64 = VIRTIO_BASE + 0x008;
pub c... |
use crate::bus::*;
use crate::cpu::*;
use crate::trap::*;
pub const VIRTIO_IRQ: u64 = 1;
const VRING_DESC_SIZE: u64 = 16;
const DESC_NUM: u64 = 8;
pub const VIRTIO_MAGIC: u64 = VIRTIO_BASE + 0x000;
pub const VIRTIO_VERSION: u64 = VIRTIO_BASE + 0x004;
pub const VIRTIO_DEVICE_ID: u64 = VIRTIO_BASE + 0x008;
pub c... |
}
}
impl Virtio {
pub fn new(disk_image: Vec<u8>) -> Self {
let mut disk = Vec::new();
disk.extend(disk_image.iter().cloned());
Self {
id: 0,
driver_features: 0,
page_size: 0,
queue_sel: 0,
queue_num: 0,
queu... | match size {
32 => Ok(self.store32(addr, value)),
_ => Err(Exception::StoreAMOAccessFault),
} | if_condition | [
{
"content": "fn main() -> io::Result<()> {\n\n let args: Vec<String> = env::args().collect();\n\n\n\n if args.len() != 2 {\n\n panic!(\"Usage: rvemu-for-book <filename>\");\n\n }\n\n let mut file = File::open(&args[1])?;\n\n let mut binary = Vec::new();\n\n file.read_to_end(&mut binary... |
Rust | descriptor/src/ranges.rs | Moxinilian/rendy | c521b6d97d8154042bcc2215c7d7906cc70d7282 | use std::{
cmp::Ordering,
ops::{Add, AddAssign, Mul, MulAssign, Sub, SubAssign},
};
pub use gfx_hal::pso::{DescriptorRangeDesc, DescriptorSetLayoutBinding, DescriptorType};
const DESCPTOR_TYPES_COUNT: usize = 11;
const DESCRIPTOR_TYPES: [DescriptorType; DESCPTOR_TYPES_COUNT] = [
DescriptorType::Sampler,
... | use std::{
cmp::Ordering,
ops::{Add, AddAssign, Mul, MulAssign, Sub, SubAssign},
};
pub use gfx_hal::pso::{DescriptorRangeDesc, DescriptorSetLayoutBinding, DescriptorType};
const DESCPTOR_TYPES_COUNT: usize = 11;
const DESCRIPTOR_TYPES: [DescriptorType; DESCPTOR_TYPES_COUNT] = [
DescriptorType::Sampler,
... | ;
}
}
}
}
}
| Some(DescriptorRangeDesc {
count: self.counts[index] as usize,
ty: DESCRIPTOR_TYPES[index],
}) | call_expression | [
{
"content": "/// Trait for vertex attributes to implement\n\npub trait AsAttribute: Debug + PartialEq + PartialOrd + Copy + Send + Sync + 'static {\n\n /// Name of the attribute\n\n const NAME: &'static str;\n\n /// Attribute format.\n\n const FORMAT: Format;\n\n}\n\n\n\n/// A unique identifier for... |
Rust | src/rust/storage/seg/src/ttl_buckets/ttl_bucket.rs | wandaitzuchen/pelikan | 7421cdedbd5cf5c9814d244ae02eef5ec05904bf |
use super::{SEGMENT_CLEAR, SEGMENT_EXPIRE};
use crate::*;
use core::num::NonZeroU32;
pub struct TtlBucket {
head: Option<NonZeroU32>,
tail: Option<NonZeroU32>,
ttl: i32,
nseg: i32,
next_to_merge: Option<NonZeroU32>,
_pad: [u8; 44],
}
impl TtlBucket {
pub(super) fn new(ttl: i32) -> S... |
use super::{SEGMENT_CLEAR, SEGMENT_EXPIRE};
use crate::*;
use core::num::NonZeroU32;
pub struct TtlBucket {
head: Option<NonZeroU32>,
tail: Option<NonZeroU32>,
ttl: i32,
nseg: i32,
next_to_merge: Option<NonZeroU32>,
_pad: [u8; 44],
}
impl TtlBucket {
pub(super) fn new(ttl: i32) -> S... | ired += 1;
} else {
return expired;
}
} else {
return expired;
}
}
}
pub(super) fn clear(&mut self, hashtable: &mut HashTable, segments: &mut Segments) -> usize {
if self.head.is_none() {
... | self.head = None;
self.tail = None;
}
let _ = segment.clear(hashtable, true);
segments.push_free(seg_id);
SEGMENT_EXPIRE.increment();
exp | random | [
{
"content": "#[inline]\n\nfn copy_slice(dst: &mut [u8], src: &[u8]) -> usize {\n\n let n = cmp::min(dst.len(), src.len());\n\n dst[0..n].copy_from_slice(&src[0..n]);\n\n n\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use tempfile::NamedTempFile;\n\n\n\n fn kvs() -> Vec<(Strin... |
Rust | oxide-7/src/video/mod.rs | coopersimon/oxide-7 | 538a2946fc32eef922749dcfe86490c1f09ca12e |
mod ram;
mod render;
use std::sync::{
Arc,
Mutex
};
use bitflags::bitflags;
use crate::{
common::Interrupt,
constants::{
timing,
screen
},
};
use ram::VideoMem;
pub use render::RenderTarget;
type VRamRef = Arc<Mutex<VideoMem>>;
bitflags! {
#[derive(Default)]
struct In... |
mod ram;
mod render;
use std::sync::{
Arc,
Mutex
};
use bitflags::bitflags;
use crate::{
common::Interrupt,
constants::{
timing,
screen
},
};
use ram::VideoMem;
pub use render::RenderTarget;
type VRamRef = Arc<Mutex<VideoMem>>;
bitflags! {
#[derive(Default)]
struct In... | = PPUState::VBlank;
self.trigger_nmi()
},
}
}
fn check_y_irq(&self) -> bool {
let enabled = (self.int_enable & IntEnable::all_irq()) == IntEnable::ENABLE_IRQ_Y;
enabled && (self.scanline == (self.v_timer as usize))
}
fn chec... | ex::new(VideoMem::new()));
PPU {
state: PPUState::VBlank,
mem: mem.clone(),
cycle_count: 0,
scanline: 0,
int_enable: IntEnable::default(),
status: PPUStatus::default(),
nmi_flag: ... | random | [
{
"content": "type CartMappingFn = fn(u8, u16) -> CartDevice;\n\n\n",
"file_path": "oxide-7/src/mem/rom/mod.rs",
"rank": 1,
"score": 252137.86479187425
},
{
"content": "fn map_hirom_bank(in_bank: u8, mapping: u8, lo_rom: bool, bank_addr: u16) -> u8 {\n\n let mapped_bank = map_bank(in_bank... |
Rust | src/limit.rs | phip1611/spectrum-analyzer | 8f8eb2cd91768222a7ede072c2c5353788238256 | /*
MIT License
Copyright (c) 2021 Philipp Schuster
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publis... | /*
MIT License
Copyright (c) 2021 Philipp Schuster
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publis... |
}
#[derive(Debug)]
pub enum FrequencyLimitError {
ValueBelowMinimum(f32),
ValueAboveNyquist(f32),
InvalidRange(f32, f32),
}
#[cfg(test)]
mod tests {
use crate::FrequencyLimit;
#[test]
fn test_panic_min_below_minimum() {
let _ = FrequencyLimit::Min(-1.0).verif... | Err(FrequencyLimitError::ValueBelowMinimum(*x))
} else if *x > max_detectable_frequency {
Err(FrequencyLimitError::ValueAboveNyquist(*x))
} else {
Ok(())
}
}
FrequencyLimit::Range(min, max) => {
... | function_block-function_prefix_line | [
{
"content": "/// Creates a sine (sinus) wave function for a given frequency.\n\n/// Don't forget to scale up the value to the audio resolution.\n\n/// So far, amplitude is in interval `[-1; 1]`. The parameter\n\n/// of the returned function is the point in time in seconds.\n\n///\n\n/// * `frequency` is in Her... |
Rust | predict/src/bin/build_driving_model.rs | ehsanul/brick | 291c0783f3b062cf73887cb3581dd92342891165 | extern crate bincode;
extern crate flate2;
extern crate predict;
extern crate state;
use bincode::serialize_into;
use flate2::write::GzEncoder;
use flate2::Compression;
use predict::driving_model::{DrivingModel, PlayerTransformation, TransformationMap};
use predict::sample;
use state::*;
use std::collections::hash_map... | extern crate bincode;
extern crate flate2;
extern crate predict;
extern crate state;
use bincode::serialize_into;
use flate2::write::GzEncoder;
use flate2::Compression;
use predict::driving_model::{DrivingModel, PlayerTransformation, TransformationMap};
use predict::sample;
use state::*;
use std::collections::hash_map... |
let existing_delta = (existing_delta_x.powf(2.0) + existing_delta_y.powf(2.0)).sqrt();
let new_lv = sample[j].local_velocity();
let new_delta_x = (new_lv.x - sample::GROUND_SPEED_GRID_FACTOR * e.key().local_vx as f32).abs();
... | let existing_delta_y = (existing_transformation.start_local_vy as f32
- sample::GROUND_SPEED_GRID_FACTOR * e.key().local_vy as f32)
.abs(); | assignment_statement | [
{
"content": "fn percentile_value(numbers: &mut Vec<f32>, percentile: f32) -> f32 {\n\n numbers.sort_by(|a, b| a.partial_cmp(b).unwrap_or(Ordering::Less));\n\n let i = (percentile * numbers.len() as f32) as usize / 100;\n\n numbers[i]\n\n}\n\n\n",
"file_path": "predict/tests/compare_with_sample_fil... |
Rust | utoipa-gen/src/openapi.rs | juhaku/utoipa | 070b00c13b41040e9605c62a0d7c3b5fcf04899c | use proc_macro2::Ident;
use proc_macro_error::ResultExt;
use syn::{
parenthesized,
parse::{Parse, ParseStream},
punctuated::Punctuated,
token::{And, Comma},
Attribute, Error, ExprPath, GenericParam, Generics, Token,
};
use proc_macro2::TokenStream;
use quote::{format_ident, quote, quote_spanned, To... | use proc_macro2::Ident;
use proc_macro_error::ResultExt;
use syn::{
parenthesized,
parse::{Parse, ParseStream},
punctuated::Punctuated,
token::{And, Comma},
Attribute, Error, ExprPath, GenericParam, Generics, Token,
};
use proc_macro2::TokenStream;
use quote::{format_ident, quote, quote_spanned, To... |
}
impl Parse for Component {
fn parse(input: ParseStream) -> syn::Result<Self> {
Ok(Component {
ty: input.parse()?,
generics: input.parse()?,
})
}
}
#[cfg_attr(feature = "debug", derive(Debug))]
struct Modifier {
and: And,
ident: Ident,
}
impl ToTokens for Mod... | fn has_lifetime_generics(&self) -> bool {
self.generics
.params
.iter()
.any(|generic| matches!(generic, GenericParam::Lifetime(_)))
} | function_block-full_function | [] |
Rust | src/main.rs | Drarig29/crypto-balance | b9f57923b4eb0c145ff7908c6d82425093225413 | #[macro_use]
extern crate rocket;
extern crate chrono;
extern crate dotenv;
extern crate hex;
extern crate hmac;
extern crate mongodb;
extern crate reqwest;
extern crate serde;
extern crate serde_json;
extern crate sha2;
mod aggregate;
mod database;
mod model;
mod requests;
mod utils;
use chrono::{DateTime, Utc};
use... | #[macro_use]
extern crate rocket;
extern crate chrono;
extern crate dotenv;
extern crate hex;
extern crate hmac;
extern crate mongodb;
extern crate reqwest;
extern crate serde;
extern crate serde_json;
extern crate sha2;
mod aggregate;
mod database;
mod model;
mod requests;
mod utils;
use chrono::{DateTime, Utc};
use... |
}
#[get("/")]
async fn index() -> Option<NamedFile> {
NamedFile::open("static/index.html").await.ok()
}
#[get("/<file..>")]
async fn files(file: PathBuf) -> Option<NamedFile> {
NamedFile::open(Path::new("static/").join(file)).await.ok()
}
impl<'r> Responder<'r, 'r> for ApiResponse {
fn respond_to(self, ... | Ok(Environment {
app_password,
binance_key,
binance_secret,
nomics_key,
mongodb_host,
mongodb_port,
mongodb_username,
mongodb_password,
}) | call_expression | [
{
"content": "pub fn make_aggregate_query(start: DateTime<Utc>, end: DateTime<Utc>) -> Vec<bson::Document> {\n\n vec![\n\n doc! {\n\n \"$match\": {\n\n \"time\": {\n\n \"$gte\": start,\n\n \"$lte\": end\n\n }\n\n }\n\n },\n\n ... |
Rust | src/tests/unit.rs | asomers/async-weighted-semaphore | 2085026ab5f4a5b9b6bc8a724e7cdca75a212c32 |
use std::sync::{Arc, Barrier, Mutex};
use rand::{thread_rng, Rng, SeedableRng};
use std::sync::atomic::{AtomicIsize, AtomicBool};
use std::sync::atomic::Ordering::Relaxed;
use std::task::{Context, Waker, Poll};
use std::future::Future;
use std::{mem, thread, fmt};
use futures_test::task::{AwokenCount, new_count_wak... |
use std::sync::{Arc, Barrier, Mutex};
use rand::{thread_rng, Rng, SeedableRng};
use std::sync::atomic::{AtomicIsize, AtomicBool};
use std::sync::atomic::Ordering::Relaxed;
use std::task::{Context, Waker, Poll};
use std::future::Future;
use std::{mem, thread, fmt};
use futures_test::task::{AwokenCount, new_count_wak... |
#[test]
fn test_parallel() {
for i in 0..1000 {
println!("iteration {:?}", i);
test_parallel_impl();
}
}
fn test_parallel_impl() {
let threads = 10;
let semaphore = Arc::new(Semaphore::new(0));
let resource = Arc::new(AtomicIsize::new(0));
let barrier = Arc::new(Barrier::new(t... | ze, TestFuture>::new();
let mut rng = XorShiftRng::seed_from_u64(954360855);
for _ in 0..100000 {
if rng.gen_bool(0.1) && futures.len() < 5 {
let amount = rng.gen_range(0, 10);
let mut fut = TestFuture::new(&semaphore, amo... | function_block-function_prefixed | [
{
"content": "struct SemMutex(Semaphore, UnsafeCell<usize>);\n\n\n\nunsafe impl Send for SemMutex {}\n\n\n\nunsafe impl Sync for SemMutex {}\n\n\n\nimpl Default for SemMutex {\n\n fn default() -> Self {\n\n SemMutex(Semaphore::new(1), UnsafeCell::new(0))\n\n }\n\n}\n\n\n\nimpl AtomicCounter for Sem... |
Rust | src/indexer/mod.rs | sinhrks/brassfibre | 86028eaf7271b2cd560ef064969ef1cbf47396d4 | use std::cell::RefCell;
use std::collections::HashMap;
use std::collections::hash_map::Entry;
use std::hash::Hash;
use std::iter::FromIterator;
use std::slice;
use std::vec;
use nullvec::prelude::dev::algos::Indexing;
use traits::{Slicer, IndexerIndex, Append};
mod convert;
mod formatting;
mod indexing;
mod ops;
mod ... | use std::cell::RefCell;
use std::collections::HashMap;
use std::collections::hash_map::Entry;
use std::hash::Hash;
use std::iter::FromIterator;
use std::slice;
use std::vec;
use nullvec::prelude::dev::algos::Indexing;
use traits::{Slicer, IndexerIndex, Append};
mod convert;
mod formatting;
mod indexing;
mod ops;
mod ... |
}
| fn from_iter<T>(iter: T) -> Self
where
T: IntoIterator<Item = U>,
{
let values: Vec<U> = iter.into_iter().collect();
Indexer::new(values)
} | function_block-full_function | [
{
"content": "/// Indexing methods for Indexer\n\npub trait IndexerIndex: Slicer {\n\n type Key;\n\n\n\n fn contains(&self, label: &Self::Key) -> bool;\n\n fn push(&mut self, label: Self::Key);\n\n fn get_loc(&self, label: &Self::Key) -> usize;\n\n fn get_locs(&self, labels: &[Self::Key]) -> Vec<... |
Rust | src/overlay.rs | penumbra-zone/jellyfish-merkle | 0f216e2dcd3219c58f1bc4a584c373416cbef5cd | use std::collections::HashMap;
use anyhow::Result;
use tracing::instrument;
use crate::{
storage::{TreeReader, TreeWriter},
JellyfishMerkleTree, KeyHash, MissingRootError, OwnedValue, RootHash, Version,
};
pub struct WriteOverlay<R> {
reader: R,
overlay: HashMap<KeyHash, OwnedValue>,
version: Ver... | use std::collections::HashMap;
use anyhow::Result;
use tracing::instrument;
use crate::{
storage::{TreeReader, TreeWriter},
JellyfishMerkleTree, KeyHash, MissingRootError, OwnedValue, RootHash, Version,
};
pub struct WriteOverlay<R> {
reader: R,
overlay: HashMap<KeyHash, OwnedValue>,
version: Ver... |
}
}
#[instrument(name = "WriteOverlay::get_with_proof", skip(self, key))]
pub async fn get_with_proof(
&self,
key: Vec<u8>,
) -> Result<(OwnedValue, ics23::ExistenceProof)> {
if self.overlay.contains_key(&key.clone().into()) {
return... | match self.tree().get(key, self.version).await {
Ok(Some(value)) => {
tracing::trace!(version = ?self.version, ?key, value = ?hex::encode(&value), "read from tree");
Ok(Some(value))
}
Ok(None) => {
tracing::trace... | if_condition | [
{
"content": "/// Computes the key immediately after `key`.\n\npub fn plus_one(key: KeyHash) -> KeyHash {\n\n assert_ne!(key, KeyHash([0xff; 32]));\n\n\n\n let mut buf = key.0;\n\n for i in (0..32).rev() {\n\n if buf[i] == 255 {\n\n buf[i] = 0;\n\n } else {\n\n buf[i... |
Rust | engine/src/types.rs | ivankabestwill/wirefilter | 294292f53db18a5a3261118e93fad30bd9498b09 | use lex::{expect, skip_space, Lex, LexResult, LexWith};
use rhs_types::{Bytes, IpRange, UninhabitedBool};
use serde::{Deserialize, Serialize};
use std::{
cmp::Ordering,
fmt::{self, Debug, Formatter},
net::IpAddr,
ops::RangeInclusive,
};
use strict_partial_ord::StrictPartialOrd;
fn lex_rhs_values<'i, T:... | use lex::{expect, skip_space, Lex, LexResult, LexWith};
use rhs_types::{Bytes, IpRange, UninhabitedBool};
use serde::{Deserialize, Serialize};
use std::{
cmp::Ordering,
fmt::{self, Debug, Formatter},
net::IpAddr,
ops::RangeInclusive,
};
use strict_partial_ord::StrictPartialOrd;
fn lex_rhs_values<'i, T:... |
}
}
macro_rules! declare_types {
($(# $attrs:tt)* enum $name:ident $(<$lt:tt>)* { $($(# $vattrs:tt)* $variant:ident ( $ty:ty ) , )* }) => {
$(# $attrs)*
#[repr(u8)]
pub enum $name $(<$lt>)* {
$($(# $vattrs)* $variant($ty),)*
}
impl $(<$lt>)* GetType for $na... | if let Ok(rest) = expect(input, "}") {
input = rest;
return Ok((res, input));
} else {
let (item, rest) = T::lex(input)?;
res.push(item);
input = rest;
} | if_condition | [
{
"content": "fn lex_digits(input: &str) -> LexResult<'_, &str> {\n\n // Lex any supported digits (up to radix 16) for better error locations.\n\n take_while(input, \"digit\", |c| c.is_digit(16))\n\n}\n\n\n",
"file_path": "engine/src/rhs_types/int.rs",
"rank": 0,
"score": 184976.2941145299
}... |
Rust | src/main.rs | jmccrae/simple-rust-web | 88ac2fc0c0d5ca91c05d8b3543a9cc00a0e43bcd | extern crate clap;
extern crate iron;
extern crate handlebars;
extern crate params;
extern crate percent_encoding;
#[macro_use]
extern crate serde_derive;
extern crate serde;
extern crate serde_json;
mod renderer;
mod templates;
use clap::{Arg, App};
use handlebars::Handlebars;
use iron::middleware::Handler;
use iron... | extern crate clap;
extern crate iron;
extern crate handlebars;
extern crate params;
extern crate percent_encoding;
#[macro_use]
extern crate serde_derive;
extern crate serde;
extern crate serde_json;
mod renderer;
mod templates;
use clap::{Arg, App};
use handlebars::Handlebars;
use iron::middleware::Handler;
use iron... |
static APP_TITLE : &'static str = "My App";
static VERSION : &'static str = "0.1";
static AUTHOR : &'static str = "John McCrae <john@mccr.ae>";
static ABOUT : &'static str = "Simple framework for making Rust Webapps";
struct TestTranslator;
impl Translator<String> for TestTranslator {
fn convert(&self,... | let mut server = Server::new();
init(&mut server);
let iron = Iron::new(server);
iron.http(("localhost",port)).unwrap();
} | function_block-function_prefix_line | [
{
"content": "/// Render using `layout.hbs`\n\npub fn render_ok(hbars : &Handlebars, title : String, body : String) -> IronResult<Response> {\n\n Ok(Response::with(\n\n (iron::status::Ok,\n\n Header(ContentType::html()),\n\n hbars.render(\"layout\", &LayoutPage {\n\n ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.